csu logo green Department of Computer Science
CS 200 FALL
Algorithms and Data Structures 2011
-Home -Syllabus -Schedule -Assignments -Grading Policy -Course Policy -Code of Conduct -RamCT
Schedule
Week # Lectures Readings Recitations Assignments

Week 1
8/23, 8/25

Course introduction,
Recursion, Mathematical Induction, Grammer
[Slides:part 0 and part 1]

 Chapters 6
in Prichard

Tour of CS200 RamCT, Checkin system, Programming Assignment 0 (submit anything)
[Exercises]

 PA(Programming Assignment) 0 due on 8/29 by 5:00PM

Week 2
8/30, 9/1

Advanced Object Oriented programming concept(inheritance, polymorphism, abstract classes)[Slides:part 2]

Introduction to ADT, Stacks
[Slides:part3]

 Chapter 9, 7
in Prichard

Reccurence Relations
[Exercises]

WA (Written Assignment) 1 Due on 9/1 at the beginning of class

Week 3
9/6, 9/8

Queues[Slides:part4] posted on Sept. 6, at 11:00 AM

Computational Complexity

Section 1. Time Complexity, Big O Analysis) [Slides: part5-1]

 Chapter 8 in
Prichard

Implementing Stack and Queue ADT
[Exercises]

 

Week 4
9/13, 9/15

Computational Complexity cont'd

Section 2. Search and Advanced sorting)[Slides: part5-2]

Section 3. Recurssive Relations and Divide & Conquer [Slides: part5-3]

Sections 3.2, 3.3 in Rosen
Section 8.1, 8.2 in Rosen

BigO Analysis
[Exercises] 		PA 1
Due on 9/14 by 5:00pm

Week 5
9/20, 9/22

 Complexity cont’d Chapter 10
in Prichard		 Computational Complexity / Exam review

WA 2 Due on 9/22 at the beginning of class

Week 6
9/27, 9/29

Trees
Midterm I Exam Preparation Guide (here)
Midterm Exam -1 (9/29 in class)

 Section 11.1, 11.2 in Prichard  

 

Week 7
10/4, 10/6

Binary Tree, Binary Search Tree [Slides: part 6-1]

 Section 11.3, in Prichard   PA2 due on 10/5 by 5:00 pm - extended to 10/7 by 5:00 pm

Week 8
10/11, 10/13

Tree cont'd (Balanced Search Trees)

 Section 13.1 in Prichard Binary Search Tree  

Week 9
10/18, 10/20

Balanced Search Trees cont'd (2-3 trees, 2-3-4 trees, Red-black trees, AVL trees, BTree) [Slides: part 6-2:updated(Oct,20)] [Slides: part 6-3]

 Section 12.1,2
in Prichard 		Tree/ Exam review PA3 due on 10/21 by 5:00 pm

Week 10
10/25, 10/27

Priority Queue
Midterm II Preparation Guide(here)
Midterm Exam -2 (10/27 in class)

     

Week 11
11/1, 11/3

11/1: Midterm II review
Heaps and Heapsort [Slides: part 7]

 Section 13.2
in Prichard		    

Week 12
11/8, 11/10

 Hashing [Slides: part 8]
Relations [Slides: part 9]		 Section 8.1~3
in Rosen		   PA4 due on 11/11 by 5:00 PM

Week 13
11/15, 11/17

Relations cont. and Graphs [Slides: part 10-1]

 Section 14.1,2 in Prichard   WA3 due on 11/17 at the beginning of class

Week 14
11/22, 11/24

 Fall Recess (no class)      

Week 15
11/29, 12/1

 Graphs: Topological sorting, Spanning trees, Minimum Spanning Trees, Shortest Paths, Circuits [Slides: part 10-2] [Slides: part 10-3]

Chap 9 in Rosen
Section 14.3
in Prichard

  

PA 5 due on 12/2 by 5:00 PM

Week 16
12/6, 12/8

Reviews for the final exam
Exam Preparation Guide

  Graphs/ Exam review Bonus PA due on 12/9 5:00 PM
Final Week

Final Exam
Time: Dec. 12, 6:20-8:20pm
Location: Clark A202

      

CSU Fall 2011 Final exam schedule