Update: 26Nov07

lectures

Final Exam Review [05Dec07] Our final is 1-3pm Wed 12Dec07
Summary Chapters 25-29 [26Nov07]
Ch 29 Balanced Search Trees [03Dec07] Red Black Tree Live Demo Code Samples
Ch 28 A Heap Implementation [26Nov07 summary] Code Samples
Ch 27 Binary Tree Implementation [26Nov07] Code Samples
Ch 26 Implementation of Trees [26Nov07] Code Samples
Ch 25 Trees Code Samples Binary Tree Live Demo [21Nov07]

Ch 24 Queues, Deques and Priority Queues Implementations [19Nov07] Code Samples
Ch 23 Queues, Deques and Priority Queues [14Nov07] Code Samples Queue Live Demo Priority Queue Live Demo
Code Samples

Second Programing Assignment Using Stacks and a GUI; FYI a Solution for binary Radix Sort Sort.java ** updated2 **
MazeSolver (some thoughts 26Nov07)
email update of required replacement MazeGrid.java file.

R-U-OK? Ch 21 Stacks [05Nov07] Live Demo of LIFO Stack Code Samples
Table Infix and Postfix Expressions [a Computer Scientists should become adept with this notation]
HP25 Scientific Calculator, my first calculator [1975] used RPN (reverse polish notation).
Ch 22 Stack Implementations Code Samples
Ch 19 Introducing Hashing [22 Oct07] Ch 20 Hashing as a Dictioniary Implementation Code Samples
Ch 16 Searching [15 Oct07] Code Samples Ch17 Dictionaries [17Oct07] Ch18 Dictionary Implementation. Code Samples
** Cancel** First Java Code - Implement Radix Sort - specifications soon Code was due 14Nov07
Ch 13 Sorted Lists Code Samples [08Oct07, background for Ch 16]
First Midterm - Oct 3 Sorting Techniques and Efficiency
Ch 12 Faster Sorting Methods [24Sept07, thoroughly} Code Samples
Ch 11 Introduction to Sorting [19Sept07, thoroughly] Code Samples
Ch 10 Recursion [19Sept07, briefly] Code Samples
Ch 9 The Efficiency of Algorithms [17Sept07] Code Samples
Growth Rates: O(1) < O (log log2n) < O (log2n) < O(log2n) < O(n) < O (n log2n) < O(n2) < O(n3) < O (2n) < O(n!)
In words, O(1) is constant growth, O(n) is linear growth, O(n2) is quadratic growth, O(2n) is exponential growth
Ch 8 Iterators Code Samples
Ch 7 Completing the Linked Implementation of a List Code Samples
Ch 6 A List Implementation that Links Data Code Samples
Ch 5 List Implementations that use Arrays Code Samples

NOTE: We meet Monday 10Sept07 in GMCS 425 GMCS 425 Lab 1
third Lecture [our first data structure] (05sept07) Chapter 4 slides
Ch4: Code Samples the list as an abstract data type
Applets showing Lists as Arrays
Chapter 3 slides Ch3: CodeSamples object-oriented design, Java interfaces, int ro to CRC card and UML
Chapter 2 slides Ch2: CodeSamples Composition, inheritance, polymorphism revie w; introduces Generic Types
second Lecture - Did everyone successfully log onto Rohan? in LL220? or whe re?
first Lecture - Java Classes 5 Chapter 1 sli des Ch1: CodeSamples [demo linking between slides and code]