Data Structures and Algorithms with Object-Oriented Design Patterns in C++ / Edition 1

Data Structures and Algorithms with Object-Oriented Design Patterns in C++ / Edition 1

by Bruno R. Preiss
ISBN-10:
0471241342
ISBN-13:
9780471241348
Pub. Date:
09/16/1998
Publisher:
Wiley
ISBN-10:
0471241342
ISBN-13:
9780471241348
Pub. Date:
09/16/1998
Publisher:
Wiley
Data Structures and Algorithms with Object-Oriented Design Patterns in C++ / Edition 1

Data Structures and Algorithms with Object-Oriented Design Patterns in C++ / Edition 1

by Bruno R. Preiss

Hardcover

$228.75
Current price is , Original price is $228.75. You
$228.75 
  • SHIP THIS ITEM
    In stock. Ships in 1-2 days.
  • PICK UP IN STORE

    Your local store may have stock of this item.

  • SHIP THIS ITEM

    Temporarily Out of Stock Online

    Please check back later for updated availability.


Overview

Students will learn data structures and algorithms from a modern, object-oriented perspective with this new text. It uses a single class hierarchy as a framework to present all of the data structures. This framework clearly shows the relationships between data structures and illustrates how polymorphism and inheritance can be used effectively.


Product Details

ISBN-13: 9780471241348
Publisher: Wiley
Publication date: 09/16/1998
Series: Computer Science Series
Pages: 678
Product dimensions: 7.76(w) x 9.39(h) x 1.26(d)

About the Author

About the Author Bruno R. Preiss is an Associate Professor in the Department of Electrical and Computer Engineering at the University of Waterloo, Canada. He is a member of the Parallel and Distributed Systems Group, the Computer Communications Networks Group, and the VLSI Research Group. Professor Preiss received an M.A.Sc. and Ph.D. in Electrical Engineering from the University of Toronto, Canada.

Table of Contents

Algorithm Analysis.

Asymptotic Notation.

Foundational Data Structures.

Data Types and Abstraction.

Stacks, Queues and Deques.

Ordered Lists and Sorted Lists.

Hashing, Hash Tables and Scatter Tables.

Trees.

Search Trees.

Heaps and Priority Queues.

Sets, Multisets and Partitions.

Dynamic Storage Allocation.

Algorithmic Patterns and Problem Solvers.

Sorting Algorithms and Sorters.

Graphs and Graph Algorithms.

Appendices.

Index.
From the B&N Reads Blog

Customer Reviews