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.

• 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.

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.

• 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.

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.

• 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.