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]

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]

Help Session for PA1
[Download]

PA(Programming Assignment) 0 due on 1/29 by noon

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]

Chapter 3 in Rosen (Section 1)

Big-O Notation and Proofs
[Download Instruction]
[Download worksheet]

WA 2 Due on 2/22 at the beginning of class[Download]

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]

Midterm 1: Q&A session
Binary Tree, Binary Search Tree

Balanced Search Tree (2-3 trees, 2-3-4 trees, Red-black trees, AVL trees, BTree)

Spring Break: No class

Priority Queue,
Heaps and Heapsort

WA3 Due on 3/29 at the beginnng of class

PA 3 Due on 3/26 by 5:00PM

Hashing
Relations

PA 4 Due on 4/16 by 5:00PM

WA 4 Due on 4/19 at the beginning of class

Chapter 10 in Rosen (Section 1-8)
Chapter 14 in Prichard