The reading assignments are listed by the date on which they were assigned. The sample program files are listed by the date on which they were used. When you are viewing a source code page, you can use your browser's "File -> Save As..." menu item to save a copy of the code on your computer. It is a good idea for you to "play" with these example programs; compile them, run them, make simple changes to them and compile and run them again.

Monday, December 2. The final exam will be next week on Monday, December 9 at 3:30pm. Here is a collection of review problems for the exam. Here are some interesting web pages about complexity theory. The P versus NP Problem (one of the "Millennium Prize Problems" at the Clay Mathematics Institute) Ian Stewart's article "Million-Dollar Minesweeper" A compendium of NP optimization problems The Complexity Zoo Monday, November 25. See the homework page for your last assignment. For Wednesday, read Sections 6.3, pages 144-147, and 6.8, pages 156-160, from the course textbook. Look at Sections 8.5.3, 8.5.4, and 8.5.5, pages 317-325 (the main thing that you want to get from each of these sections is the definition of each problem). Look at Section 8.7.1, pages 398-400. Wednesday, November 20. For next Monday, read Sections 6.1 and 6.2, pages 140-144, from the course textbook. Here is an interesting web page about the Knapsack problem. The knapsack problem and public key cryptography Wednesday, November 13. See the homework page for your sixth assignment. For next Monday, read Section 8.2.10 Knapsack Problem (pages 228-230) from the course textbook. Read Section 17.2, pages 333-336, from the book "Introduction to Algorithms, 1st edition" which is on reserve in the library. Monday, November 11. For Wednesday, read Section 8.4.1, pages 270-272, Section 8.4.3, pages 275-278, and Section 8.4.4, pages 279-283, from the course textbook. Read Sections 8.4.7 and 8.4.8, pages 291-296. Read Sections 8.4.10 and 8.4.11, pages 301-307. Wednesday, November 6. For next Monday, read Sections 4.5-4.8, pages 92-102, from the course textbook. Wednesday, October 30. Remember that the midterm exam is next Monday. Monday, October 28. Note: The midterm exam will be next week on Monday, November 4. Here is a collection of review problems for the exam. See the homework page for your fifth assignment. Wednesday, October 23. For Monday, read Sections 4.1 and 4.2, pages 81-85, and Section 4.4, pages 88-92, from the course textbook. Monday, October 21. Here is the Morse Mismatches programming problem that I handed out in class and here is the Undecodable Codes programming problem. If you are interested in looking at more coding problems from competitions, here is the The ACM International Collegiate Programming Contest (ICPC) Problem Set Archive and here is the official ACM ICPC Web Site Read Section 7.5 (pages 149-151) on priority queues from the book "Introduction to Algorithms, 1st edition" which is on reserve in the library. We need the idea of a priority queue to finish our discussion of Huffman codes. Read Section 2.1.4 (pages 31-32) and Section 8.1.2 (pages 180-182) on priority queues in the course textbook. Wednesday, October 16. For Monday, read Section 17.3 (pages 337-343) on Huffman codes in the book "Introduction to Algorithms, 1st edition" which is on reserve in the library. Note: The midterm exam will be postponed one week to Wednesday, Oct. 30. Monday, October 14. For Wednesday, read Sections 3.2 (pages 65-66) and 3.6 (pages 75-77) from the course textbook. Also read the beginning of Chapter 17, pages 329-336, from the book "Introduction to Algorithms, 1st edition" which is on reserve in the library. Wednesday, October 9. Here is a Maple worksheet (and a pdf version) that demonstrates ideas about the recursive computation of the Fibonacci numbers. For Monday ,read Sections 3.2.3 and 3.2.4 (pages 60-64) from the course textbook on "approximate string matching" and "longest increasing sequence" algorithms. Monday, October 7. For Wednesday, read the beginning of Chapter 15, pages 323-330, from the book "Introduction to Algorithms, 2nd edition" (notice that's the second edition) which I will hand out in class. Wednesday, October 2. See the homework page for your fourth assignment. For Monday, read the beginning of Chapter 3, pages 53-59, from the course textbook. Monday, September 30. For Wednesday, read Sections 10.1 and 10.2, pages 185-189, in the book "Introduction to Algorithms, 1st edition" which is on reserve in the library. Also read Section 8.3.3, pages 244-245, from the textbook for the course. Wednesday, September 25. On Monday we will finish the analysis of the Heap Sort algorithm. Monday, September 23. See the homework page for your third assignment. For Wednesday, read Sections 7.4 and 7.5 (pages 147-150) in the book "Introduction to Algorithms, 1st edition" which is on reserve in the library. Wednesday, September 18. For next Monday, read Sections 7.1, 7.2, and 7.3 (the sections on heap data structures, pages 140-146) in the book "Introduction to Algorithms, 1st edition" which is on reserve in the library. Monday, September 16. For Wednesday, we will continue to discuss Sections 8.1, 8.2, and 8.3 (pages 153-162) in the book "Introduction to Algorithms, 1st edition" which is on reserve in the library. Wednesday, September 11. See the homework page for your second assignment. For next Monday, read Sections 8.1, 8.2, and 8.3 (pages 153-162) in the book "Introduction to Algorithms, 1st edition" which is on reserve in the library. Monday, September 9. For Wednesday, read Sections 2.3, 2.4, and 2.5 (pages 33-39) and also Section 8.3.1 (pages 236-239) from the textbook. The discussion of sorting in our textbook is kind of sketchy. There is a better discussion in the book "Introduction to Algorithms, 1st edition" which is on reserve in the library. Read Sections 1.1, 1.2, and 1.3 (pages 1-16) in that book. Wednesday, September 4. For next Monday, read Sections 2.1, and 2.2 (pages 27-33) of the textbook. Wednesday, August 28. See the homework page for your first assignment. For next Wednesday, read Sections 1.7, 1.8, and 1.9 (pages 18-24) of the textbook. Monday, August 26. For today, read Sections 1.1, 1.2, and 1.3 (pages 3-13) of the textbook. For Wednesday, read Sections 1.4, 1.5, and 1.6 (pages 13-18) of the textbook.