Department of Computer Science

CS 200	SPRING
Algorithms and Data Structures	2013

-Home

-Syllabus

-Schedule

-Assignments

-Grading Policy

-Course Policy

-Code of Conduct

-RamCT

Schedule

Weeks:

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

Finals Week

Week #	Lectures	Readings	Recitations	Assignments
Week 1 1/23, 1/25	Course introduction [Download 3 slides per page] [Download 6 slides per page] Stacks [Download 3 slides per page] [Download 6 slides per page] [Slides] Overview of the Programming Assignment 1 [Download]	Chapters 7, 8 in Prichard	First recitation: 1/22 session 002 Tour of CS200 RamCT, Checkin system, Programming Assignment 0 (submit anything) Useful math formula Instruction[Download] Remote Access [Download]
Week 2 1/28, 1/30, 2/1	Queue [Download 3 slides per page] [Download 6 slides per page] [Slides] Recursion, Mathematical Induction, Grammer [Download 3 slides per page] [Download 6 slides per page] [Slides] Reference Examples of Arithemetic Expressions [Download]	Chapter 6 in PrichardChapter 5 in Rosen (Section 1,3,4, and 5)	Help Session for PA1 [Download]	PA(Programming Assignment) 0 due on 1/29 by noon
Week 3 2/4, 2/6, 2/8	Mathematical Induction and Recursion [Download 3 slides per page] [Download 6 slides per page] [Slides] Advanced Object Oriented programming concept(inheritance, polymorphism, abstract classes) [Download 3 slides per page] [Download 6 slides per page] [Slides] Computational Complexity Section 1. Time Complexity, Big O Analysis) [Download 3 slides per page] [Download 6 slides per page] [Slides]	Chapter 3 in Rosen (Section 2 and 3)	Mathematical Induction 2/5, 2/6, 2/7, and 2/11 [Download Instruction] [Download worksheet]	WA1 Due on 2/8 at the beginning of class [Download]
Week 4 2/11, 2/13, 2/15	Computational Complexity cont'd Section 2. Search and Advanced sorting) [Download 3 slides per page] [Download 6 slides per page] [Slides]	Chapter 3 in Rosen (Section 1)	Big-O Notation and Proofs [Download Instruction] [Download worksheet]	PA1Due on 2/12 by 5:00PM [Link]
Week 5 2/18, 2/20, 2/22	Section 3. Recurrence Relations and Divide & Conquer [Download 3 slides per page] [Download 6 slides per page] [Slides]	Chapter 8 in Rosen (Section 1, 2 and 3)	Recurrence Relations & Master Theorem [Download Instruction] [Download Worksheet]	WA 2 Due on 2/22 at the beginning of class[Download]
Week 6 2/25, 2/27, 3/1	Review for the Midterm 1 Midterm Exam -1 (3/1 in class) Exam Preparation Guide [Download] Worksheet [Download] Worksheet Answers [Download] Quizzes [Download] Summation Formulae [Download] Sorting algorithm examples [Link]		Implementing Quicksort [Download Instruction] [Download Java Files]
Week 7 3/4, 3/6, 3/8	Midterm 1: Q&A session Binary Tree, Binary Search Tree [Download 3 slides per page] [Download 6 slides per page] [Slides] PA2 overview [Download]	Chapter 11 in Rosen (Section 1, 2, 3, and 4) Chapter 11 in Prichard	Binary Search Tree [Download Instruction] [Download Java Files]
Week 8 3/11, 3/13, 3/15	Tree continued	Chapter Section 13 in Prichard(Section 1)	Huffman Coding [Download Instruction] [Download Worksheet]	PA 2 Due on 3/12 by 5:00PM [Link]
Week 9 3/18, 3/20, 3/22	Spring Break: No class		No class
Week 10 3/25, 3/27, 3/29	Balanced Search Tree (2-3 trees, 2-3-4 trees, Red-black trees, AVL trees) [Download 3 slides per page] [Download 6 slides per page] [Slides] PA3 overview [Download]	Chapter 12 in Prechard	Heaps [Download Instruction] [Download Java Files]	WA3 Due on 3/29 at the beginnng of class [Download]
Week 11 4/1, 4/3, 4/5	BTree, [Download 3 slides per page] [Download 6 slides per page] [Slides] Priority Queue, Heaps and Heapsort [Download 3 slides per page] [Download 6 slides per page] [Slides] Midterm Exam -2 (4/10 in class) Exam Preparation Guide [Download] Worksheet for Trees [Download] Worksheet for proofs [Download] Quizzes [Download]		Midterm -2 Review [Download Instruction]	PA 3 Due on 4/2 by 5:00PM [Link]
Week 12 4/8, 4/10, 4/12	Review for the Midterm 2 Midterm Exam -2 (4/10 in class) Midterm 2: Q&A session	Chapter 13 in Prichard (Section 2)	Relations [Download Instruction] [Download Worksheet]
Week 13 4/15, 4/17, 4/19	Hashing [Download 3 slides per page] [Download 6 slides per page] [Slides]	Chap 9 in Rosen (Section 1-4)	Hash Tables [Download Instruction] [Download Skeleton files]
Week 14 4/22, 4/24, 4/26	Relations [Download 3 slides per page] [Download 6 slides per page] Graphs (Topological sorting, Spanning trees, Minimum Spanning Trees, Shortest Paths, Circuits ) Part 10-1 [Download 3 slides per page] [Download 6 slides per page] [Slides]	Chapter 10 in Rosen (Section 1-8) Chapter 14 in Prichard	Graphs [Download Instruction] [Download Skeleton files]	PA 4 Due on 4/23 by 5:00PM [Link] WA 4 Due on 4/26 at the beginning of class [Download]
Week 15 4/29, 5/1, 5/3	Graphs cont. Part 10-2 [Download 3 slides per page] [Download 6 slides per page] [Slides]	Chapter 10 in Rosen (Section 1-8) Chapter 14 in Prichard	TBA
Week 16 5/6, 5/8, 5/10	Graphs cont. Part 10-3 [Download 3 slides per page] [Download 6 slides per page] [Slides] Reviews for the final exam Exam preparation guide[download] Worksheet for the Final exam [download] Quiz 7,8 and 9 with answers [download] Midterm 1 problems [download] Midterm 2 problems [download]		Reviews for the final exam	WA 5 Due on 5/6 at the beginning of class [Download] --> Extended to 5/8 PA 5 Due on 5/7 by 5:00PM [Link]
Final Week	Final Exam Time: 9:40 ~ 11:40AM May 15 Location: ENG120 CSU Spring 2013 Final exam schedule