IT212 Data Structures

This course emphasized the importance of information hiding and how to use abstraction in good program design. Students will be able to estimate algorithms growth rates and describe it using big O notation. Various Sorting and searching techniques including Hashing will be studied and their performances compared. Similarly, various data structures their representations, traversal, and application will be studied and compared. These data structures include at least: lists, stacks, queues, trees, and graphs. For trees: binary trees, search trees, height-balanced trees, and Heaps will be discussed; For graphs: Depth-First Traversal, Breadth-First Traversal, and Shortest/Cheapest path algorithms will be covered.

Course Materials