CS 101 (Fall 2002)
Lecture Highlights

Lecture Notes		Other Resources
1.	A Generation of Computation
2.	Objects, Outside and In
3.	Simple Methods

4.	Procedural Abstraction Class Design
5.	Objects as Containers Computing PI by throwing darts

6.	Abstract Data Types and Objects
7.	More ADTs and Objects
8.	Inside the Black Box	JVM Reference and JVM Spec MUCH more detail than you need

9.	ADTs: A Stock Portfolio
10.	Recursion
11.	Recursion

12.	Recursion
13.	Recursion
14.	Iteration

15.	Verifying Object Behavior Iteration
16.	Iteration
17.	Debugging Review for MidTerm	JDE Online Help Notes

18.	Intro to Data Structures
19.	Midterm Exam In Class
20.	Midterm Solution

21.	Link Lists and their Traversals
22.	Memory View of Linked Lists
23.	How much does it cost?

24.	Generalized Lists
25.	Relations	Relation Examples
26.	General Stacks

27.	Stacks and their expense	Subclassing More Subclassing
28.	Queues and their expense
29.	BaseNumber

30.	Sets, their API, and abstract classes	Abstract Classes Set Examples
31.	Sets based on unordered lists
32.	Sets based on ordered lists Arrays

33.	Sets based on trees
34.	Summary of Set Representations Arrays BInary Search
35.	Binary Search

36.	Stable Matchings
37.	QuickSort
38.	QuickSort

39.	Interfaces for Abstraction
40.	Class Hierarchies
41.	Class Hierarchies

42.	Review for Final Exam