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