CSE 101
Design and Analysis of Algorithms
UCSD Spring 2008
- Class
Meetings
- Lecture:
TuTh 3:30pm -- 4:50pm, Peterson 102
- Discussion: F 2:00pm -- 2:50pm in Peterson 103
- Instructor:
Prof. Walter Burkhard, burkhard@cs.ucsd.edu
- Office:
EBU3B Room 3236
- Office
Hours: W 2:30pm -- 4:00pm and by appointment
- TAs
- Textbook
- Required:
Algorithms by S. Dasgupta, C. Papadimitriou and U. Vazirani,
McGraw-Hill, ©2008. (link)
- Useful:
Algorithms texts by Cormen et al. and Manber.
- Syllabus
- Graph
algorithms: strongly connected components, shortest paths, minimum
spanning trees
- Divide-and-conquer
- Dynamic
programming
- Linear
programming and network flows
- NP-completeness
and coping with intractability
- Grading
- Homeworks:
20% (grading will be done by random sampling)
- Two
Midterms: 20% each
- Final:
40%
- Homework Policy
- Collaboration. Collaboration is permitted in small groups (maximum 3). Anything you turn in must be in your own words, and must explicitly acknowledge all collaborative discussants.
- Lateness. Homeworks are due during the first five minutes of class on the due date. No late homeworks will be accepted. Your lowest homework score will be dropped.
- Rigor and Conciseness. When you are asked to devise an algorithm, you must always establish its correctness and running time. All answers should be as concise as possible.