CSCI 136

Data Structures & Advanced Programming

Home | Lectures | Handouts | Links | CS@Williams

Lecture Notes and Examples

Date Lecture Examples Lecture Notes
11 Sept1Hello.java Lecture 1
14 Sept2CardInterface.java Lecture 2
Sum1.java
Sum2.java
16 Sept3CardMain.java Lecture 3
Card.java
Card.java with toString() and equals()
18 Sept4PokerHand.java with shuffle and histogram Lecture 4
21 Sept5Card.java with pre/post and Assert Lecture 5
CDTitles.java
Dictionary.java with array
Dictionary.java with Vector
23 Sept6VectorSpeed.java Lecture 6
WordFreq.java with generics
25 Sept7 Lecture 7
28 Sept8The Towers of Hanoi Lecture 8
The Towers of Hanoi (again)
fact.java
30 Sept9BinarySearch.java Lecture 9
BinSearchAlt.java
LinearSearchComp.java
SortSearchDemo
2 Oct10Merge.java Lecture 10
MergeSort.java
SelectionSort.java
SelectionSort proof
5 Oct11QuickSort.java Lecture 11
Patient.java
SelectionSort.java (with Comparators)
7 Oct12 Lecture 12
9 Oct13 Lecture 13
14 Oct14 Midterm in Lab - No Class
19 Oct15 Lecture 15
21 Oct16Maze.java Lecture 16
RecMaze.java
23 Oct17StackEx.java Lecture 17
26 Oct18 Lecture 18
28 Oct19ReverseIterator.java Lecture 19
30 Oct20TestIterator.java Lecture 20
2 Nov21 BinaryExpressionTree.java Lecture 21
4 Nov22 InfiniteQuestionsTree.java Lecture 22
BinaryTreeView.java
6 Nov23 Lecture 23
9 Nov24 Lecture 24
11 Nov25 Lecture 25
13 Nov26 Lecture 26
16 Nov27 Lecture 27
18 Nov28 Midterm in Lab - No Class
20 Nov29 Lecture 29