The instructor reserves the right to update the notes right up to class time and within two weeks after each corresponding lecture. Check the time and date on the first slide of each set to make sure you have the most up-to-date version.
Algorithm Analysis - part 1 - Reading: chapter 4; section 3.1.2 (selection sort) - Homework: R-4.9 to R-4.13 (R-4.16 to R-4.20 in 5th edition)
Algorithm Analysis - part 2 - Reading: chapter 4 - Homework: R-4.2, R-4.3, R-4.8 (R-4.7, R-4.8, R-4.13 in 5th edition)
Recursion and Logarithms - Reading: chapter 5 - Homework: R-5.1, R-5.5, R-5.8, R-5.10, C-5.17, C-5.18 (R-3.13, R-3.14, C-3.14, R-3.5, C-3.20, C-3.21 in 5th edition) Hint: Write and run Java programs to verify the correctness of your algorithms.
Merge Sort - Reading: section 12.1
Quick Sort - Reading: section 12.2
Reading homework: "Using Arrays", section 3.1
Linked Lists - Reading: sections 3.2 and 3.4
Stacks - Reading: section 6.1
Queues - Reading: section 6.2
Double-ended Queues, Extendable Arrays - Reading: sections 6.3, 7.2.3.
Introduction to Trees - Reading: chapter 8
Binary Trees - Reading: section 8.2 - Homework (for both general and binary trees): R-8.2, R-8.3, R-8.7, R-8.8, C-8.30, C-8.32, C-8.42, C-8.43, C-8.45 (R-7.5, R-7.6, R-7.7, R-7.16, R-7.23, C-7.4, C-7.5, C-7.6, C-7.9 in 5th edition) - Advanced exercises: C-8.28, C-8.29, C-8.55 (C-7.23, C-7.33, C-7.34 in 5th edition)
Binary Search Trees - Reading: section 11.1 - Homework: R-11.1 to R.11-4 (R-10.1 to 10.4 in 5th edition)
Software engineering disasters
AVL Trees - Reading: sections 11.2 and 11.3
Heaps - Reading: sections 9.1 to 9.3
Heap Sort - Reading: section 9.4.2
Hash Tables part 1, part 2 - Reading: section 10.2
Introduction to Graphs - Reading: sections 14.1 and 14.2
Breadth First Search - Reading: section 14.3
BFS Applications - Reading: section 14.3
Depth First Search - Reading: section 14.3
Applications of DFS - Reading: section 14.3
Review: part 1 (same as midterm review)
Review: part 2
References (not on final exam):
Dijkstra's algorithm
Bucket sort