Data Structures and Algorithms with Object-Oriented Design Patterns in C#
next up previous contents index

Data Structures

Chapter gif covers stacks, queues, and deques. Ordered lists and sorted lists are presented in Chapter gif. The concept of hashing is introduced in Chapter gif. This chapter also covers the design of hash functions for a number of different object types. Finally, hash tables and scatter tables are presented.

Trees and search trees are presented in Chapters gif and gif. Trees are one of the most important non-linear data structures. Chapter gif also covers the various tree traversals, including depth-first traversal and breadth-first traversal. Chapter gif presents priority queues and Chapter gif covers sets, multisets, and partitions.

An essential element of the C# run-time system is the pool of dynamically allocated storage. Chapter gif presents a number of different approaches for implementing garbage collection, in the process illustrating the actual costs associated with dynamic storage allocation.


next up previous contents index

Bruno Copyright © 2001 by Bruno R. Preiss, P.Eng. All rights reserved.