Lecture Dates Book Sections Comments
08-27, 08-29 1.1, 1.3, 1.4
09-03, 09-05 1.5, 1.6, 1.7
09-10, 09-12 1.7, 1.8, 2.1, 2.2 You should read more about set-builder notation [wiki] and sets [wiki] in general. We covered the inclusion/exclusion principle in class in quite a bit more depth than the book. If you're interested in reading more about its many applications, I encourage you to look here [wiki].
09-17, 09-19 2.3, 2.4, 3.1 Wikipedia does a good job detailing the history of the Halting Problem [wiki] and Alan Turing's [wiki] contributions to theoretical computer science.
09-24, 09-26 3.2, 3.3, 5.1 These topics are the starting point for the field of Computational Complexity [wiki], a major topic in computer science.
10-01, 10-03 5.3, 5.4 Exam 1 is scheduled for 10-01.
10-08, 10-10 6.2, 6.3, 6.5
10-17 7.1, 7.2 One of the TAs, Lyndon Meadow, will be leading this class session.
10-22, 10-24 8.1, 8.3, 8.5
10-29, 10-31 8.6, 9.1, 9.2
11-05, 11-07 9.3, 9.4, 9.5, 9.6 You can read more about equivalence relations here [wiki].
11-12, 11-14 9.6, 10.1, 10.2 Exam 2 is scheduled for 11-12. Lattice theory is a very large and rich field. Wikipedia provides a good jumping off point: [wiki] [wiki].
11-19, 11-21 10.3, 10.4, 10.5 Exam 2 will be handed back on 11-19. Please be aware that 11-20 is the last day to drop.
11-16 10.6 You can read more about Dijkstra's algorithm and its history on Wikipedia [wiki].
12-03, 12-05 11.1, 11.2, 11.3
12-10, 12-12 11.4, 11.5 We will go over what material is covered on the final on 12-12, so be sure to attend class that day.
12-20 The final exam is scheduled 13:30 – 16 in our usual room, Eaton 2.