CS211: Section Notes

Section Instructor Notes

Section 1: David Schwartz	Section 2: Peter Flynn	Section 3: A.J. Fink	Section 4: Xiangyang Lan	Section 5: Wojciech Moczydlowski
Section 6: Xiangyang Lan	Section 7: Wojciech Moczydlowski	Section 8: Ben Mathews	Section 9: Walter Mor	Section 10: Joel Chan

Common Notes

Week	Topics	Common Files
13	even more A6 topological sort	ListNode SLL QueueAsList StackAsList SearchStructure SeqStructure Vertex Edge Digraph TestDigraph
12	more A6	no posted notes
11	A6	no posted notes -- but examples posted along with GUI lectures might be helpful
10	heaps array representation	see notes and examples in Lecture 22
9	DFS BFS sequence structures	see examples in Lectures 21 and 22
8	inheritance asympotic complexity	Asymptotic Complexity Number Guessing example
7	Prelim 1 iterators inner classes	InnerClasses Complex (needed for examples) Initializers (not covered in lecture notes) Iterator1 Iterator2 Iterator3 Iterator4 MemberClass1 MemberClass2 MemberClass3 MemberClass4
6	interfaces `Comparable` interface	ComparableTest
5	deleting from a list doubly-linked list trees	DeleteList TestDLL BinaryNode BinaryTree TestBinaryTree
4	Wrapper Classes Arrays and Objects Lists	ListCount see lecture notes for other examples
3	Recursion Tail Recursion Towers of Hanoi	S3quadscs211fa03.pdf IterativeSum.txt RecursiveSum.txt RecursiveSumAlt.txt Towers Of Hanoi ArrayRecursion.pdf ReverseArray.txt
2	CS211In switch statements weak form induction strong form induction when good induction proofs go bad	CS211InPPT.pdf CS211In.java CS211InInterface.java CS211Out.java CS211OutInterface.java CS211SystemIOTest.java CS211FileIOTest.java test1.txt (use for CS211FileIOTest) TestSwitch.java TestSwitch2.java weakinduction.txt stamps.txt stronginduction.txt badinduction.txt
1	overview of section and course `main` method applications command-line environment	Syllabus firstsection summary Applications Mains.java Args.java