CS 101 (Spring 1999)
Lecture Highlights

Lecture Notes		Reading
1.	A Generation of Computation	Chapter 1
2.	Objects, Outside and In	Chapters 1 and 2
3.	Simple Methods	Chapter 2 Section 5.3

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

6.	Abstract Data Types and Objects	Chapters 5-6
7.	More ADTs and Objects	Chapters 5-6
8.	Inside the Black Box	Chapters 5-6

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

12.	Recursion
13.	Recursion
14.	Iteration

15.	Verifying Object Behavior Iteration	Chapter 7 Chapters 8-9
16.	Iteration	Chapters 8-9
17.	Debugging Review for MidTerm	Semantec Cafe Notes

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

Spring Break

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
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	Chapter 10 (pages 403-419)

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

36.	Stable Matchings
37.	Lab 10 Rotation Issues QuickSort
38.	QuickSort Lab 11 Design Issues

39.	Interfaces for Abstraction Lab 11 Issues
40.	Class Hierarchies
41.	Class Hierarchies

42.	Review for Final Exam