Basic data structures. Static and dynamic data structures. Abstraction and Abstract Data Types (ADT’s). Time and space requirements of various implementations of ADTs. Space/Time trade-Offs. Queues, stacks, trees and graphs.  Implementations of tree and graph traversals.  Height balanced trees.  Heaps.  Storage management.  Hashing techniques.