Syllabus for Summer 2023
- Lists of Lists; Stack ADT
- Queue, Priority Queue, and Graph ADTs
- Graph Traversal: BFS, DFS
- Dictionary, Set, and Multiset ADTs
- Sorting
- Efficiency and Asymptotics: Big-O, Big-Omega, Big-Theta
- Recursion, Searching
- List Implementation: Array-Based, Linked-Based
- Stack Implementation: Array-Based, Linked-Based
- Queue Implementation: Array-Based, Linked-Based
- General Trees and Binary Trees: Structures and Traversals (pre-order, in-order, post-order)
- Heap ADT & implementations
- Priority Queue implementations
- Binary Search Tree ADT
- BST-based implementation of Set and Dictionary; Hashing for Dictionaries
- Balanced BSTs
- Graph Implementations