This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Introduction to Algorithms , 2 nd Ed., MIT Press, 2001 Lecture Notes: MS PowerPoint Files at CS300 Homepage Prerequisite: Data Structures and some familiarity with C and Pascal languages Topics: 1. Algorithms Analysis (4w) 2. Algorithm Design (2w) 3. Sorting (2w) 4. Selection & Adversary Arguments ( .5w) 5. Graphs and Digraphs (1.5w) 6. String Matching (1w) (7. Polynomials and Matrices (1.5w) ) * 8. NP-Complete Problems (2w) 9. Parallel Algorithms (1w) * may be skipped. Grading Policy: Mid-Term Exam: 20% Final Exam: 40% Homework (10 or more Assignments): 20% Projects (3 Assignments): 10% Class Participation: 10%...
View Full Document
This note was uploaded on 02/04/2010 for the course COMPUTER S cs300 taught by Professor Unkown during the Spring '08 term at Korea Advanced Institute of Science and Technology.
- Spring '08