The syllabus is broken up into five sections:
- Introduction
- Linked Lists, Stacks, and Queues
- Analysis and Estimation
- Sorting and Searching
- Trees
Note: The phrase “X through Y” means “from the
beginning of X to the end of Y.”
- Section 1 – Introduction, Tuesday, 8 September through Thursday, 17 September.
- Readings
-
Lafore, Chapter 1.
Generics in
the Java Programming Language by Gilad Bracha (optional).
- Class notes
-
Introduction
Types and Polymorphism
Java Generics
Interfaces
- Section 2 – Linked Lists, Stacks, and Queues, Tuesday, 22 September through Thursday, 8 October.
- Readings
-
Lafore, Chapters 4 and 5.
- Class notes
-
Linked lists
List Traversal
Stacks
Queues
Java Collections
Odds and Ends
- Assignment
-
Assignment 1 (last modified on 24 September 2009) available on Tuesday, 22 September; due
on Tuesday, 13 October at 11:30 p.m.
- Quiz
- Thursday, 15 October
-
The answers.
- Section 3 – Analysis and Estimation, Tuesday, 13 October through Thursday, 29 October.
- Mid-term Grades
- due Tuesday, 27 October.
-
- Readings
-
Lafore, Big O Notation, pages 70–72
Lafore, the rest of Chapter 2 (optional)
Handouts
- Class notes
-
Asymptotic Estimates
Asymptotic Estimates in Practice
Performance Measurement
Performance Measurement in Practice
- Assignment
-
Assignment 2 (last modified on 26 October 2009) available on Tuesday, 13 October; due
on Tuesday, 3 November at 11:30 p.m.
- Quiz
- Tuesday, 3 November
-
The answers.
- Section 4 – Sorting and Searching, Tuesday, 3 November through Thursday, 19 November.
- Drop day
- Tuesday, 10 November
-
- Readings
-
Lafore, Chapters 3 and 7.
- Class notes
-
Sorting Basics
Faster Sorting
- Problem presentations
-
5 November, M. Florez, Uncompress.
5 November, E. Accillient, Reverse.
- Assignment
-
Assignment 3 (last modified on 26 October 2009) available on Tuesday, 3 November; due
on Tuesday, 24 November at 11:30 p.m.
- Quiz
- Tuesday, 24 November
-
The answers.
- Section 5 – Trees, Tuesday, 24 November through Thursday, 10 December.
- Thanksgiving resess
- No class Thursday, 27 November
-
- Readings
-
Lafore, Chapter 8
- Class notes
-
Tree Basics
Binary Search Trees
Heaps and Priority Queues
Balanced Trees
- Problem presentations
-
1 December, E. Acillint, Of(f) Course!.
3 December, M. Florez, Integer Inquiry.
- Assignment
-
Assignment 4 (last modified on 3 December 2009) available on Tuesday, 24 November; due
on Tuesday, 15 December at 11:30 p.m.
- Quiz
- Tuesday, 15 December
-
