CPSC 311H - Analysis of Algorithms (Honors)

Syllabus

Notes and Announcements

Final Grades are available HERE

Assignments

Schedule

Future dates should be considered tenative for all information on class topics, chapters covered, and homework not yet assigned.
Day Topics Reading Covered or Assigned Homework Assigned Homework Due
1 Tue Aug. 31 Introduction Chapters 1,2
2 Thu Sep. 2 Asymptotic Analysis and Recursion Chapters 3,4
3 Tue Sep. 7 Heapsort Chapter 6 HW 1
4 Thu Sep. 9 Quicksort Chapter 7
5 Tue Sep. 14 Linear Sorts, Order Statistics Chapters 8, 9
6 Thu Sep. 16 Basic Data Structures, Hashing Chapters 10, 11 HW 2 HW 1
7 Tue Sep. 21 Hashing and Binary Search Trees Chapter 12
8 Thu Sep. 23 Red-black trees Chapter 13
9 Tue Sep. 28 B-trees Chapter 18 HW 3 HW 2
10 Thu Sep. 30 Dynamic Programming Chapter 15
11 Tue Oct. 5 Exam 1 - through class 9
12 Thu Oct. 7 Dynamic Programming, continued
Greedy Algorithms
Chapter 16
13 Tue Oct. 12 Greedy Algorithms (continued) HW 4
14 Thu Oct. 14 Guest Lecturer
Guangtong Cao
Distributed Algorithms
HW 3
15 Tue Oct. 19 Disjoint Sets Chapter 21
16 Thu Oct. 21 Basic Graph Algorithms Chapter 22 HW 5
17 Tue Oct. 26 Minimum Spanning Trees Chapter 23 HW 4
18 Thu Oct. 28 Single-Source Shortest Paths Chapter 24
19 Tue Nov. 2 All Pairs Shortest Paths Chapter 25 HW 6 HW 5
20 Thu Nov. 4 NP-completeness Chapter 34 through 34.1
21 Tue Nov. 9 Exam 2 - Classes 10-19
22 Thu Nov. 11 NP-completeness (continued) Sections 34.2 through 34.4
23 Tue Nov. 16 Proving Problems NP Complete Section 34.5 First 3 Culture Assignments Due
24 Thu Nov. 18 Class Cancelled - Bonfire Memorial Dedication
25 Tue Nov. 23 NP Completeness Examples HW 7 HW 6
26 Tue Nov. 30 Approximation Algorithms Chapter 35
27 Thu Dec. 2 Guest Lecturer
Ilya Hicks, TAMU Department of Industrial Engineering
28 Tue Dec. 7 Computational Geometry Overview HW 7
All Culture Assignments Due
Wed Dec. 15 Final Exam Time, 1:00-3:00