Prof. Ming-Deh Huang, Sal 314, X04783, huang@cs.usc.edu, Office Hours: M 3:20-4, Th 2:30-3:10
Course Information:
Text: Introduction to algorithms, by T. Coremen, C. Leiserson, R. Rivest, and C. Stein, McGraw-Hill.
Prerequisite: covered in Ch. 1,2,3,4,10,22 and Appendix (VIII) of the textbook.
Course Outline:
The topics covered and the corresponding chapters and sections in the textbook
are as follows:
Introduction
Divide and conquer: 2.3.
Heapsort: 6.1 - 6.5.
Design and analysis techniques
Dynamic programming: Ch. 15.
Greedy algorithms: 16.1, 16,2, 16.3.
Amortized analysis: 17.1 - 17.3.
Advenced Data structures
Disjoint-set data structure: Ch. 21
Graph algorithms:
Minimum spanning trees: 23.1 - 23.2.
Shortest Paths: 24.1 - 24.3, 25.1 - 25.3.
Number Theoretic Algorithms: 31.1 - 31.7
NP-Completeness: 34.1 - 34.5.
Approximation Algorithms: 35.1 - 35.2
Class Structure:
Homework: There will be 10 assignments.
They will be posted under Assignments.
Exams: There will be four in class quizzes on homework
problems. Your homework grade will be based on the scores of these quizzes. There will be an in-class midterm exam and a
final exam. The exams are closed book and closed notes.
Date
Location
Quiz 1
TBD
VKC156
Quiz 2
TBD
VKC156
Midterm
TBD
VKC156
Quiz 3
TBD
VKC156
Quiz 4
TBD
VKC156
Final Exam
Tuesday, May 13, 2:00-4:00 p.m.
VKC156
Grading Policy:
Homeworks
40%
Midterm
30%
Final Exam
30%
Additional policies:
Student Conduct Code of the University will be
strictly enforced. Please review these
policies.
