List of Topics (By Week, with references to the suggested book): 1. Design Principles (Ch.1, 24pp). Data structures and algorithms. 2. Analysis Tools (Ch.2, 29pp). Asymptotic notation, asymptotic analysis. 3. Stacks, Queues, and Linked Lists (Ch.3, 44pp). Including double-ended queues. 4. Sequences (Ch.4, 26pp). Ranked, positional, and general sequences. 5. Trees (Ch.5, 25pp). Emphasis on binary trees. 6. Trees (Ch.5, 26pp). 7. Priority Queues (Ch.6, 38pp). Implementations using sequences and heaps. 8. Dictionaries (Ch.7, 24pp). Implementations using binary search trees, AVL trees, skip lists, hash tables. 9. Dictionaries (Ch.7, 25pp). 10. Balance Search Trees (Ch.13, 20pp). Multi-way search trees, (2,4) trees, red-black trees, splay trees. 11. Balanced Search Trees (Ch.13, 21pp). 12. Sorting, Sets, and Selection (Ch.8, 36pp). Merge-sort, quick-sort, lower bound on comparison-based sorting, bucket-sort, radix-sort. 13. Graphs (Ch.9, 23pp). Graph traversal, directed graphs. 14. Graphs (Ch.9, 24pp).