Pages in Text, additional writeups and .ppt files

]Pages in Text, additional writeups and .ppt files

Recitation links

Where to read in the text

Date	Pages in text & class programs
1/23	pp2-5 math-intro, 16-18 (autoboxing) Jan 23 class programs
1/28	pp82-84 (The Stack ADT) Jan 28 class programs Stack ppt, to slide 10
1/30	pp84-86 (Evaluating postfix expressions) Jan 30 class programs
2/4	pp86-89 (infix to postfix, generics) Feb 4 class programs Big Oh notation (upto slide 26)
2/6	pp59-60 (Linked Lists) Feb 6 class programs Linked List ppt
2/11	Chapter 3 (Linked Lists implentation of stacks and queu) Feb 11 class programs Queues ppt
2/13	Chapter 3 (Collections and Iterators) Feb 13 class programs
2/18	President's Day; No classes
2/20	Chapter 3 (Generics, Collections and Iterators, adding and removing nodes (Dictionaries)) Feb 20 class programs
2/25	Chapter 3 pp75-79 (double linked list, GUIs) Feb 25 class programs GUI ppt
2/27	Prep for exam, bounded generic types Feb 27 class programs bounded generics types
3/3	Prep for exam, Huffman class mar3 class programs bounded generics types
3/5	Exam
3/10	Huffman coding (pp.389-395), trees (pp.107-112) More on Big oh mar10 class programs Huffman coding Tree recursion applet
3/12	Expression trees (p.109), priority queue (pp.201-202) Trees mar12 class programs Writing recursive tree methods
3/24	Binary Search Trees (Dictionary) (p.112-113), Anonymous class mar24 class programs BinarySearchTrees Time analysis for trees
3/26	Breadth First Search, Sorting Huffman records using a BST mar26 class programs Heaps and other data structures
3/31	Heaps (pp. 254-258) mar31 class programs Heaps
4/2	More on Heaps (pp. 254-258) Apr 2 class programs Big Oh notation (slide 38 to 41 )
4/7	Prep for 2nd midterm Apr 7 class programs
4/9	Prep for 2nd midterm continued Apr 9 class programs
4/14	2nd midterm
4/16	Quick Sort (pp264-274) Hashing (pp169-172) Merge Sort (pp. 258-264) Apr 16 class programs Big Oh notation (slides 27 to 37)) MergeSort More on assymptotics
4/21	Huffman Heap Apr 21 class programs
4/23	Exam Solutions, 2-3 Trees Apr 23 class programs 2-3 Trees 2-3 Trees (London School of Economics Java version)
4/28	Solving recurrence relations, HashMap and HashTree. Apr 28 class programs Hash Tables
4/30	Preparation for the exam. Apr 30 class programs
5/5	Linear Probing Hashing. Sorting Review May 5 class programs Bubble Sort Oh(N^2) Selection sort Oh(N^2) Insertion sort Oh(N^2) BST sort ( Nlog(N) for bushy tree) Heap Sort ( Nlog(N) ) Quick Sort (Theta( Nlog(N)) average case ) Merge Sort ( Nlog(N) )