Towers of Hanoi (from textbook website)

CS432: Algorithms Dr. Tom Horton. Phone: 982-2217 Office hours: MW 11am-noon, TR1:30-2:30pm, and by appt. Teaching Assistant: Ben Taitelbaum (btaitelb at virginia.edu) TA Office Hours: Tu 7.00 - 9.45 pm or by appt., Olsson 236 #5 (map) Announcements: 12/7: New things! ° HW6 and HW5 solutions: Posted, see below. ° Final Exam: Info here. ° HW6 deadline changed: now Weds., Dec. 7, 4pm! ° Chap. 10 practice problems: Posted, see that section.

Administration etc. Beginning of course memo: [Word] Course wiki Log of email sent to class Anonymous feedback Textbook's website		Summary of Problems, Homeworks Problem Set 1 (on Chapter 2 material). Solutions for required problems [PDF]. Solutions for non-required problems [PDF, Word]. Solutions for required will be posted soon. Problem Set 2 (on Ch. 5 & 6 material). Due: 5 pm, Tuesday, Sept. 27 at start of class. If you've turned them in, look at solutions. Problem Set 3 (on graph traversals etc.). Due on Tues., 10/25 at end of class. If you've turned them in, look at solutions. Here are "exam 2 review" problems for you to try! Here are solutions to these. Problem Set 4 Due on Tues., 11/1 at end of class. Here are solutions to these. Problem Set 5. Due on Tues., 11/29, at the end of class. Here are solutions to these. Problem Set 6. Due on Weds., Dec. 7, 4 pm. Here are solutions to these.
Unit 1: Introduction and Principles: Slides: (1) Course Intro (8/25, 8/30) [PPT, PDF 6-per-page] (2) Principles (8/30 or so) [PPT, PDF 6-per-page] (3) Principles Order Classes (9/1, 9/6) [PPT, PDF 6-per-page] Here's a "Big-Oh Cheat Sheet" on order-class definitions that the TA prepared. Other: (1) On the Wall of Fame below, read entries for Euclid, Al-Khwarizmi, and Lovelace. (2) Here's the in-class self-assessment quiz from 9/1 with answers. [PDF, Word] Expectations: Think back or review topics listed in the Course Intro slides or on the wiki. Read over Sections 2.1, 2.2, 2.5, and 2.6 in the text and ask about materials that's not review for you or not clear. No lectures on these sections. Read the slides and the associated sections of the book, Sections 2.3 and 2.4. Unit 2: Divide and Conquer, Recurrences Slides: (1) Recurrences, Divide and Conquer (9/8, 9/13) [PPT, PDF 6-per-page] 9/27, slide 27 (2) More Divide and Conquer, Chap. 5 (9/13, 9/15) [PPT, PDF 6-per-page] Expectations: Chapter 5. (All sections.) Look over work through HW 1 problems not required for turn-in. Unit 3: Sorting Slides: (1) Sorting from Chapter 6 (9/15, 9/20, 9/22) [PPT, PDF 6-per-page] (2) Linear Sorting (not in text) (9/22) [PPT, PDF 6-per-page] Expectations: Chapter 6. (All sections.) Study HW2 and self-assessment quiz given on 9/20 [PDF, Word] Other: (1) On the Wall of Fame below, read entries for Hoare. Unit 3a: Heaps and Heapsort (logically part of Unit 3 but will be on Exam 2) Slides: Heaps and heapsort (10/4) [PPT, PDF 6-per-page] Expectations: Read Section 3.5 and these CS216 slides Unit 4: Graph Traverals and Search Slides: (1) Graphs, BFS, DFS, topological sorting (10/6, 10/11, 10/13) [PPT, PDF 6-per-page] (2) Slides on exhaustive and state-space search [PPT, PDF 6-per-page] Expectations: Review Section 2.5 and these CS216 slides Chapter 4 (from 4.2 on) Other: Questions on this material are in the "exam 2 review" problems for you to try! Read the Wall of Fame entry below for Dijkstra. Unit 5: Greedy Algorithms Readings: Textbook: Chapter 7, except 7.5 Slides: Version 0. They may change when given on 10/20 and 10/21 [PPT] [PDF, 6-per-page] Other: Questions on this material are in the "exam 2 review" problems for you to try! Unit 6: Dynamic Programming Readings: Textbook: 8.1, pp. 334-335, 8.3, 8.4, p. 361 Slides: (1) Introduction, principles, LCS (11/3, 11/10) [PPT, PDF 6-per-page] (2) Matrix multiplication (11/10) [PPT, PDF 6-per-page] Other Readings: Handout on 0/1 knapsack (used in HW5, see top of page) Wikipedia articles: Dynamic Programming. Optimal Substructure Property Unit 7: NP-completeness Readings: Textbook: Chapter 9 Slides: Set 1 on P, NP, and NP-complete [PPT] [PDF, 6-per-page] Set 2 on NP-complete and reductions [PPT] [PDF, 6-per-page] Other readings: Read the Wall of Fame entry below for Steven Cooke. NP-complete group discussion questions from Nov. 15 with answers. Without answers for you to try. (Questions with answers.) Wikipedia articles: Computational complexity theory (in general). Classes P and NP. NP-c. Cook's Theorem. (Follow the links to many others. Note how this topic appeared in the Simpsons!) Be sure to get paper handout with two example reductions! Practice questions (28 of them, including those given out in class on Nov. 29) on Chap. 10 material: Without answers for you to try. (Questions with answers.) Unit 8: Algorithms and Intellectual Property Readings: Wikipedia articles: Software patent. Debate on software patents . Article: "Copyright and patent protection for computer software: are they mutually exclusive?" For CS432 and this assignment, focus on the intro, Sections 1 and 2, and the conclusion (about 4 pages total). Here's a nice article from Bryan Pfaffenberger from UVa's STS department: "The Coming Software Patent Crisis: Can Linux Survive?".