Skip to main content

Course Textbook: We will provide lecture notes, which can be found consolidated here.

Supplemental Textbook: CLRS - Introduction to Algorithms, 3rd edition by Cormen, Leiserson, Rivest, and Stein. You can obtain a free copy via the Penn Libraries

Note: The lecture schedule is tentative and subject to change as the term progresses.

Date Topic Required Readings
Thu, Jan 16, 2025 Welcome to CIS 1210
Tue, Jan 21, 2025 Greatest Common Divisor, Insertion Sort, and Running time
Thu, Jan 23, 2025 Asymptotic Notation and Running time
Tue, Jan 28, 2025 Running Time of Code Snippets, Divide and Conquer
Thu, Jan 30, 2025 Binary Search, Insertion Sort, Merge Sort, Counting Inversions
Tue, Feb 4, 2025 More Runtime Recurrence, Simplified Master theorem, Closest Pair
Thu, Feb 6, 2025 Deterministic Quicksort, Randomized Quicksort, Integer Multiplicaiton
Tue, Feb 11, 2025 Deterministic Select, Stacks
Thu, Feb 13, 2025 Stacks & Queues, Heaps
Tue, Feb 18, 2025 Huffman Coding
Thu, Feb 20, 2025 BFS, DFS, Testing Bipartiteness
Tue, Feb 25, 2025 DFS
Tue, Mar 4, 2025 Topological Sort, SCC Introduction
Tue, Mar 4, 2025 Strongly Connected Components
Tue, Mar 18, 2025 Shortest Paths, Minimum Spanning Trees
Thu, Mar 20, 2025 Minimum Spanning Trees, Union Find
Tue, Mar 25, 2025 Shortest Paths in DAGs, Union Find
Thu, Mar 27, 2025 Hashing
Tue, Apr 1, 2025 Hashing and BSTs
Thu, Apr 3, 2025 AVL Trees and Tries