| Lecture | Date | Topics | Examples/notes | Reading |
|---|---|---|---|---|
| 28 | 05/01 | Course Summary
course evaluations |
L28quadscs211sp03.pdf
L28cs211sp03.pdf |
DS&SD: table of contents
DS&A: table of contents |
| 27 | 04/29 | Graphs
(more SSSP, Dijkstra, minimum-cost spanning trees, Prim, Kruskal) |
L27quadscs211sp03.pdf
L27cs211sp03.pdf L27filescs211sp03.zip Digraph.txt TestDigraph.txt |
DS&SD: Chap 19
DS&A: Chap 16 |
| 26 | 04/24 | Graphs
(more BFS&DFS, SSSP) more examples updated Digraph updated edge updated vertex Queue needed for BFS Stack needed for DFS Linked List for Q and S List nodes needed for LL Sequence Structure interface |
L26quadscs211sp03.pdf
L26cs211so03.pdf TestDigraph.txt Digraph.txt Edge.txt Vertex.txt QueueAsList.txt StackAsList.txt SLL.txt ListNode.txt SeqStructure.txt |
DS&SD: Chap 19
DS&A: Chap 16 |
| 25 | 04/22 | Graphs
(explicit representation) using adjacency list |
L25quadscs211sp03.pdf
L25cs211sp03.pdf Vertex.txt Edge.txt Digraph.txt TestDigraph.txt |
DS&SD: Chap 19
DS&A: Chap 16 |
| 24 | 04/17 | Graphs
(traversals, breadth- and depth-first search) |
L24cs211sp03.doc
L24solcs211sp03.doc |
DS&SD: Chap 19
DS&A: Chap 16 |
| 23 | 04/15 | Graphs
(theory) |
L23quadscs211sp03.pdf
L23cs211sp03.pdf |
DS&SD: Chap 19
DS&A: Chap 16 |
| 22 | 04/10 | Sequence Structures (hierarchical)
(PQs,heaps) element with priority (comparable) PQ using an array PQ using SLL alternative PQ using a list test of PQAsArray and PQAsList heap as tree test of heap as tree; heapsort! binary decoder needed for heap as tree heap as array test of PQ as heap as array |
L22quadscs211sp03.pdf
L22cs211sp03.pdf PQElement.txt PQAsSortedArray.txt PQAsList.txt TestPQAsListAlt.txt TestPQ.txt MaxHeap.txt TestMaxHeap.txt HeapDecoder.txt MaxheapAsArray.txt PQAsMaxheapAsArray.txt |
DS&SD: 17.5, 18.6
DS&A: 11.1-11.3 |
| 21 | 04/08 | Sequence Structures (linear)
(stacks, queues, priority queues) Sequence Structure interface stack as array stack as SLL (see SLL below) demo of SaA and SaL alternative stack implementation with demo queue as array "standard" list node modified list class! queue as list demo of QaA and QaL alternative queue implementation with demo |
L21quadscs211sp03.pdf
L21cs211sp03.pdf SeqStructure.txt StackAsArray.txt StackAsList.txt TestStack.txt TestStackAsListAlt.txt QueueAsArray.txt ListNode.txt SLL.txt QueueAsList.txt TestQueue.txt TestQueueAsListAlt.txt |
DS&SD: Chap 9, Chap 11
DS&A: Chap 6 |
| 20 | 04/03 | Search Structures (hierarchical)
(general search trees, binary search trees) Search Structure interface "Standard" Binary Node class "Standard" Binary Tree class Binary Search Tree demo of BST alternative BST with demo |
L20quadscs211sp03.pdf
L20cs211sp03.pdf SearchStructure.txt BinaryNode BinaryTree BST TestBST TestAltBST |
DS&SD: 13.3.2-13.4
DS&A: 10.1-10.2, 10.3.4, 10.4 |
| 19 | 04/01 | Search Structures (linear)
(sorted arrays, sorted lists, maps, sets, hashing) |
L19quadscs211sp03.pdf
L19cs211sp03.pdf SearchStructure.txt TestSortedArray.txt TestSearchList.txt RemoveDups.txt FindName.txt myHashMapTest.txt APIHashMap.txt CountWords.txt |
DS&SD: 17.1, 17.2, App B
DS&A: Chap 7, 8.1-8.4, 12.1-12.3, App B |
| 18 | 03/27 | Foundational Data Structures revisited (hierarchical)
(general trees, binary trees, traversal) |
L18quadscs211sp03.pdf
L18cs211sp03.pdf BinaryNode.txt BinaryTree.txt TestBinaryTree.txt GeneralNode.txt GeneralTree.txt TestGeneralTree.txt |
DS&SD: Chap 13.1-13.3.2; 13.3.4-13.4
DS&A: Chap 9 |
| 17 | 03/25 | Foundational Data Structures revisited (linear)
(variables, arrays, lists, vectors, strings) default array methods using java.util.Arrays class for list elements direct ways to build a list with ListNode example of a singly-linked list class demo of SLL recursive versions of some list methods using StringTokenizer |
L17quadscs211sp03.pdf
L17cs211sp03.pdf Arrays1.txt Arrays2.txt ListNode.txt SLL.txt TestListNode.txt TestSLL.txt ListRecursion.txt TestTokenizer.txt |
DS&SD: Chap 4, 7, 13.1-13.4
DS&A: Chap 4 |
| 16 | 03/13 | ADTs and overall view of Data Structures
Search/Sequence view of Data Structures More detail on Collections API Search Structures interface Sequence Structures interface Example of an ADT in action! Another ADT Application: ADT to wrap primitive types Example of using API |
L16quadscs211sp03.pdf
overallview.pdf collectionsapi.pdf SearchStructure.txt SequenceStructure.txt TestADT.txt TestMyArray.txt TestPrimitive.txt MyList.txt |
DS&SD: Chap 6, App. B
DS&A: Chap 5 |
| 15 | 03/11 | Sorting
insert sort and select sort just select sort (ascending) more select sort quick sort (complete example) merge sort(complete example) exercise solutions |
L15quadscs211sp03.pdf
BasicSorting.txt SelectSortUp.txt SelectSort.txt QuickSort.txt MergeSort.txt L15esolcs211sp03.txt.txt |
DS&SD: 5.2-5.3, 18.1-18.5
DS&A: Chap 15 |
| 14 | 03/06 | Searching
more complete notes number guessing example searching for integers searching for Comparables |
L14cs211sp03.txt
L14solcs211sp03.txt NumberGuess.txt SearchIntArray.txt SearchComparableArray.txt |
DS&SD: 5.2-5.3, 18.1-18.5
DS&A: Chap 15 |
| 13 | 03/04 | Algorithm Analysis
more complete notes detailed complexity classes quick math review geometric sum from DS&A analysis of method1 analysis of method2 Maple plot MATLAB plot |
L13cs211sp03.txt
L13solcs211sp03.txt complexityclasses.txt mathreview.txt geosum0.txt geosum1.txt geosum2.txt geosum.html geosum.jpg |
DS&SD: 5.1, 10.4
DS&A: Chap 2, Chap 3 |
| 12 | 02/27 | GUIs (dynamics)
example w/o inner classes nested class anonymous class animation (multiple listeners) animation (single listener) |
L12cs211sp03.txt
Counter1.txt Counter2.txt Counter3.txt Example1.txt Example2.txt |
lecture notes, DS&SD: A.14-A.17
Java Tutorial on GUIs |
| 11 | 02/25 | GUIs (statics)
aditionals/L11 solutions condensed examples sample Solaris output simple GUI alternative of simple GUI simple GUI with options some components in GUI more components even more, plus graphics |
L11cs211sp03.txt
guistatics.txt examples.txt examplefigs.pdf Basic.txt Basic2.txt Basic3.txt AddStuff.txt AddStuff2.txt AddStuff3.txt |
lecture notes, DS&SD: A.14-A.17
Java Tutorial on GUIs |
| 10 | 02/20 | Lecture Notes
Additional Notes on Inner Classes initializers member class basics this and scope in member class more this in member class inheritace and member classes getting weird getting weirder Complex number class iterator without inner class iterator with member class iterator with local class iterator with anonymous class |
L10cs211sp03.pdf
InnerClasses.txt Initializers.txt MemberClass1.txt MemberClass2.txt MemberClass3.txt MemberClass4.txt InnerInterfaces1.txt InnerInterfaces2.txt Complex.txt Iterator1.txt Iterator2.txt Iterator3.txt Iterator4.txt |
DS&SD: A.15.2, 8.1, Chap 7
DS&A: Chap5, Chap 7 |
| 9 | 02/18 | Lecture Notes
solutions how you normally see inheritance a brief example on access modifiers using private (less common) unadvised uses of inheritance abstract classes and up/down casting basic interface syntax simulating multiple inheritance static binding of method names at compile time Comparable interface for complex #s |
L9cs211sp03.txt
L9solcs211sp03.txt InheritNormal.txt Modifiers.txt InheritPrivate.txt InheritAbnormal.txt Casting2.txt InterfaceBasics.txt InterfaceFun.txt InterfaceFun2.txt Compare.txt |
DS&SD: See Lecture 8, 5.4, Chap 7
DS&A: Chap 5, Chap 7 |
| 8 | 02/13 | Inheritance
Object, equals, toString, clone abstract classes |
L8cs211sp03.txt
ObjectInfo.txt ObjectExample.txt Clone.txt Equals.txt ToString.txt Casting.txt |
DS&SD: A.4, A.10, A.11, 2.12, Chap 3, 7.4.4
DS&A: pg 611 See also most CS100 books |
| 7 | 02/11 | Trees
Binary Trees post/in/pre-order walks |
L7cs211sp03.txt
BinaryNode.txt BinaryTree.txt BinaryTreeTest.txt |
DS&SD: 13.1-13.4
DS&A: Chap 9 |
| 6 | 02/06 | Recursion: lists, parsing
I/O: CS211In, CS211Out |
L6cs211sp03.txt
L6solcs211sp03.txt MyVector.txt ListAdd.txt AddParser.txt |
DS&SD: 2.12, Chap 3, 13.1-13.4
DS&A: Chap 4 |
| 5 | 02/04 | Induction
Recursion |
L5cs211sp03.txt
L5solcs211sp03.txt power1.txt power2.txt power3.txt |
DS&SD: Chap 7, 10
DS&A: Chap 4.3, Chap 7 |
| 4 | 01/30 | Induction | L4cs211sp03.txt
L4solcs211sp03.txt |
DS&SD: Appendix C, Chap 10 |
| 3 | 01/28 | Introduction to Data Structures
variables, arrays arrays "containing" objects objects "containing" arrays use .equals for String comparison! general String methods ArrayList and Vector lists trees |
L3cs211sp03.txt
aoa3d.txt arrayOfObjects.txt classWithArrays.txt string_equals.txt string_methods.txt ArrayList1.txt List1.txt Tree1.txt |
DS&SD: Chap 4, 7.1
DS&A: Chap 4 |
| 2 | 01/23 | OOP Overview | L2cs211sp03.txt
simulationProblem.txt simulationStubbing.txt Simulation.txt |
DS&SD: Chaps 1, 2 (except 2.11), 3, 12
DS&A: Chap 4 |
| 1 | 01/21 | Course Intro | Syllabus | Syllabus |
| bootcamp | 01/23 | Java Syntax | bootcamp.txt | DS&SD: Chaps 2, 3, 4, App A
DS&A: App A |
