Department of Computer Science 
CS 200  SPRING 
Algorithms and Data Structures  2012 
Home  Syllabus  Schedule  Assignments  Grading Policy  Course Policy  Code of Conduct  RamCT 
Schedule 
Week #  Lectures  Readings  Recitations  Assignments 
Week 1 
Course introduction, 
Chapters 6 in Prichard 
No Recitation scheduled 

Week 2 
Mathematical Induction Revisit, 
Chapter 7 in Prichard 
Tour of CS200 RamCT, Checkin system, Programming Assignment 0 (submit anything) 
WA (Written Assignment)1 Due on 1/27 at the beginning of class [Download] PA(Programming Assignment) 0 due on 1/26 by 2:00PM 
Week 3 
Queues 
Chapter 8, 9 in Sections 3.2, 3.3 in Rosen 
Mathematical Induction [Handout] 
PA 1 Due on 2/2 by 2:00pm 
Week 4 
Computational Complexity cont'd 


Week 5 
Section 3. Recurssive Relations and Divide & Conquer [Part 5: Computational Complexity(3)]  Chapter 10 in Prichard 
Big O Practice [Handout][Worksheet] 
WA 2 Due on 2/15 at the beginning of class 
Week 6 
Special talk "Successful Team Programming", by Elaine Regelson ,Director of mentoring and retention, CS, CSU, 2/20/2012 (Slides) Midterm 1 Preparation Guide(pdf) 
Section 11.1, 11.2 in Prichard  Review for the Midterm 1 

Week 7 
Midterm 1: review 
Section 11.3, in Prichard  Quicksort [Handout][Files] 

Week 8 
Tree cont'd (Balanced Search Trees) 
Section 13.1 in Prichard  PA 2 due on 3/8 by 5:00 pm: Last modified on March 2.  
Week 9 
No class 
No Recitation  
Week 10 
Balanced Search Trees cont'd (23 trees, 234 trees, Redblack trees, AVL trees, BTree) [Part6:Trees(3)] 
Help session for PA3[Handout]  WA3 Due on 3/21 at the beginnng of class 

Week 11 
Midterm Exam 2 (3/30 in class) 
Section 12.1,2 in Prichard 
Open Help session for PA3 Review for midterm II [Handout] 
PA 3 due on 3/27 by 2:00 pm 
Week 12 
Heaps and Heapsort continued. [Part7:Tables] Hashing [Part8:Hashing]:updated on April 4th Relations 
Section 13.2 in Prichard Section 8.1~3 in Rosen 
Hash Table [Handout] [Files]  
Week 13 
Relations cont.[Part9:Relations] updated on April 13th 
Section 14.1,2 in Prichard  Heaps [Handout][Files]  WA 4 Due on 4/13 at the beginning of class 
Week 14 
Graphs: Topological sorting, Spanning trees, Minimum Spanning Trees, Shortest Paths, Circuits [Part10:Graphs][Part10:Graphs2]  Chap 9 in Rosen Section 14.3 in Prichard 
Relations [Worksheet]  PA4 due on 4/19 by 2:00 PM 
Week 15 
Graph cont.[Part10:Graphs2] [Part10:Graphs3] 

Graphs[Handout][Files]  WA 5 Due on 4/30 at the beginning of class 
Week 16 
Graph cont. Reviews for the final exam 
Review for the Final Exam [Handout] 
PA 5 due on 5/3 by 2:00 PM 

Final Week  Final Exam 
CSU Spring 2012Final exam schedule