Syllabus

The following is the tentative list of topics by date. Suggested reading is in parantheses.

DSaPS is the primary text, "Data Structures & Problem Solving in Java.

Week 1 (4/2-4/6)

recursion (DSaPS 3.1)

factorial, binomial, Pascal's triangle, binary search, towers of hanoi (DSaPS 3)

Week 2 (4/9-4/13)

Quiz1 Tuesday 4/10

ADTs (DSaPS 4.1, 4.2)

An array implementation of the List ADT: IntegerList.java

Chapter 4 review questions due before class Thursday.

Week 3 (4/16-4/20)

Linked Lists (DSaPS 5.1-5.3)

Chapter 5 review questions due before class Tuesday

pre/post/assert (DSaPS 2.1)

Section 2.1 review questions due before class on Thursday

Quiz 2 Thursday 4/19

Week 4 (4/23-4/27)

Stacks (DSaPS 7)

Chapter 7 review questions due before class on Tuesday

unit testing with JUnit

Week 5 (4/30-5/4)

Queue implemented with an array (DSaPS 8.1-8.4)

Chapter 8 review questions due before class on Tuesday

Quiz 3 Thurday 5/3

Week 6 (5/7-5/11)

efficiency: best/worst/average (DSaPS 10.1)

sorting (DSaPS 10.2)

Chapter 10 review questions due before class on Thursday

Week 7 (5/14-5/18)

stack vs heap allocation

Quiz 4 Thursday 5/17

Week 8 (5/21-5/25)

Binary search tree (DSaPS 11.1-11.3)

hash table (DSaPS 13.2), dictionary 

Week 9 (5/28-6/1)

(Monday is a Holiday)

Hashing, load factor (DSaPS 13.2)

Quiz 5 Thursday 5/31

Week 10 (6/4-6/8)

dictionary, hashing

Final exam: 6/13 12-3pm