Schedule

1

January 27

Introduction and Java review; a simple collection class

2

February 3

Recursion and backtracking

3

February 10

Sorting and algorithm analysis I

4

February 17

Sorting and algorithm analysis II
Problem Set 1 due

5

February 24

Linked lists

6

March 3

Lists, stacks and queues I
Problem Set 2 due

7

March 10

Lists, stacks and queues II

March 17

No class — spring break

8

March 24

Midterm exam

9

March 31

Binary trees and Huffman encoding
Binary search trees
Problem Set 3 due

10

April 7

Balanced search trees (2-3 and B-trees)
Heaps and priority queues I

11

April 14

Heaps and priority queues II, hash tables

12

April 21

Graphs I
Problem Set 4 due

14

April 28

Graphs II

15

May 5

Review session
Problem Set 5 due

16

May 12

Final exam