CS 182 outline by week

This semester the outline is being made week by week, while I get to know the students and what was covered in 181.

15 Jan

Course introduction. Java basics: stack, heap, code memory.

21 Jan (week of...)

Java basics: expressions and statements; objects and references; encapsulation and visibility; overloading; static methods and fields; autoboxing.

Read chapters 1-4 of textbook.

28 Jan

Arrays, loops, annotation and invariants.

Here is assignment 1

Read chapt 5 and 6-6.3.

4 Feb

Sorting. (Stan teaches)

Here is assignment 2 and here is the sorting code.

Read the rest of chapt 6.

11 Feb

Loop invariants at work: Heaps and heapsort.

Read chapts 7 and 8.

18 Feb

Monday schedule -- no class tuesday (and snow day friday)

Method call, dynamic dispatch, stack frames. Recursion. Quicksort and partition.

25 Feb

(Review casting.) Object-oriented design. Dynamic binding of calls. Interface types and subtyping. Exception handling.

Read chapts 9 and 10.

Here is assignment 3

3 Mar

Designing abstract datatype (ADT) interfaces. Big-Oh notation and algorithm analysis.

Read chapt 13.

10 Mar

Parametric polymorphism and Java generics. Collections API. Linked list review.

Here is assignment 4

Read chapts 14 and 15.

17 Mar

Spring break - no class this week.

24 Mar

First exam on friday.

Binary search trees. Implementation using pointers, algos for search, insert, delete. Traversals and thread pointers.

Read chapt 16 and 17.1, 17.2.

31 Mar

Balanced search trees. Map interface. Read 17.3 and look at pictures in additional handout.

Here is assignment 5.

7 Apr

Graph representations and algorithms. Priority queues.

14 Apr

More graph algorithms. The disjoint-sets ADT.

Here is assignment 6.

21 Apr

Second exam on friday.

Hash tables.

28 Apr

(last day of class is tuesday)

To be determined.

You must schedule a meeting with me as part of the final, prior to 7 May.

7 May

Final project submission due, at midnight.