DePauw University,
Computer Science Department,
Fall 2006Maintained by Brian Howard (
bhoward@depauw.edu).
Last updated
| Overview | Schedule | Resources | Assignments | Home |
| Week | Topics | Notes |
| 8/23-25 | Course overview; Java review; Debugging and unit testing; Greedy algorithms | Chapter 10 Project 1 |
| 8/28-9/1 | Complexity and run time analysis; Informal Big O notation; Linear and binary search; Selection, bubble, and merge sort (iterative). | Chapter 19 |
| 9/4-8 | Big O notation; Merge sort and recursion; Recurrence relations | Chapters 18 and 19 Project 2 |
| 9/11-15 | Quick sort; Towers of Hanoi; Wrap up Big O | Chapters 18 and 19 |
| 9/18-22 | Introduction to Haskell | |
| 9/25-29 | More Haskell; Abstract data types | Exam 1 No class Friday, September 29 |
| 10/2-6 | Stacks with arrays; Linked lists; Stacks revisited; Backtracking | Chapter 20 |
| 10/9-13 | Queues with arrays and linked lists | Chapter 20 Project 3 |
| 10/16-20 | Fall Break | |
| 10/23-27 | Dynamic memory; C++; Stacks and queues revisited | |
| 10/30-11/3 | More C++; Begin binary trees | Chapter 21 |
| 11/6-10 | Inheritance and Polymorphism | Chapters 11 and 13 Exam 2 (moved to 11/15) |
| 11/13-20 | Binary trees | Chapter 21 |
| 11/27-12/1 | Finish binary trees; Implementing an abstract data type | Project 4 |
| 12/4-8 | Software engineering; Generic classes; Wrap up | Chapter 22 |
| Overview | Schedule | Resources | Assignments | Home |
DePauw University,
Computer Science Department,
Fall 2006
Maintained by Brian Howard
(bhoward@depauw.edu).
Last updated