CSSE221 – Fundamentals of Software Development Honors

Fall 2010-2011

Schedule Overview

Schedule last updated Mon Nov 1.

Week	Session	HW Due	Reading Due	Topics	Summary	Slides	Homework	Projects
0	1 Thu Sep 2 Details	Homework 0	Syllabus	Version control: a fun warm-up exercise Eclipse exercise: HelloWorld Eclipse exercise: JavaEyes		Slides	Homework 1	JavaEyes
1	2 Mon Sep 6 Details	Homework 1	Skim Ch. 1, 2, 3, skipping graphics for now. Focus on 2.8, 2.10. (If you have no Java experience, you'll need to read carefully.)	Using APIs: Sun's and user-defined ones Implementing interfaces: a tool to writing to a specification		Slides	Homework 2	BigRational
1	3 Tue Sep 7 Details		Skim ch. 4-6. Focus on 4.1 and 5.2.	Unit testing using JUnit Introduction to analysis: big-Oh analysis		Slides	Homework 2	BigRational
1	4 Thu Sep 9 Details	Big-Oh	11.3-6	Phase 1 capsule deliverables: Rubric. Throwing exceptions	Summary	Slides	Homework 2	BigRational
2	5 Mon Sep 13 Details	Homework 2	Ch. 8	UML as a communication tool Writing methods you don't call This		Slides	Homework 3	BallWorlds
2	6 Tue Sep 14 Details		Ch. 9.1-4, ch. 10	Inheritance and abstract classes (capsule) Polymorphism and dynamic binding (capsule)	Inheritance (sec1): Krasich, Lusk, Dutta Inheritance (sec2): Adam, Lien, McAnany Polymorphism (sec1): Reid, Kamper, Purviance Polymorphism (sec2): Nam, Savage, Stone	Slides	Homework 3	BallWorlds
2	7 Thu Sep 16 Details		Ch. 7	More polymorphism: Dynamic binding and static overloading (exercise) 1D and 2D Arrays and ArrayLists (capsule) Array exercise	Arrays (sec1): Cavanaugh, Hoorn, Hill Arrays (sec2): Almajed, Kamjorn, MacAslan	Slides	Homework 3	BallWorlds
3	8 Mon Sep 20 Details	Homework 3	Ch. 2.11-13	GUI design using Swing (capsule) Exercise: SwingDemo, parts 1-6	Summary (sec1): Lee, Moss, Ong Summary (sec2): Bell, Block, Gerhardt	Slides	Homework 4	Fifteen
3	9 Tue Sep 21 Details		Ch. 9.5,9.7-11 (listeners), 3.9 (shape classes)	Phase 2 capsule deliverables: Rubric. Event-driven programming using listeners (capsule) Shape classes (capsule)	Listeners (sec1): McClintock, Fendricks, Plungis ShapeClasses (sec1): Baumbaugh, Halpin, Mathieu Listeners (sec2): D'Avello, Kahl, Mercer, Samore ShapeClasses (sec2): Cox, Lundholm, Vernon	Slides	Homework 4	Fifteen
3	10 Thu Sep 23 Details		None	Exam 1			Homework 4	Fifteen
4	11 Mon Sep 27 Details	Homework 4	Ch. 12	VectorGraphics project time		Slides	Homework 5	VectorGraphics
4	12 Tue Sep 28 Details		Ch. 15.1-3	Lists and Iterators (capsule) Revisit big-Oh	Cavanaugh, Krasich, and Hoorn (sec 1) ShapeClasses (sec2): Cox, Lien, and Kahl (sec 2)	Slides	Homework 5	VectorGraphics
4	13 Thu Sep 30 Details		20.1-3	Multithreading (capsule) VectorGraphics project time	Lee, Mathieu, and Purviance (sec 1) Block, Lundholm, and Savage (sec 2)	Slides	Homework 5	VectorGraphics
5	14 Mon Oct 4 Details	Homework 5	15.4 (stacks and queues) 16.1-2 (sets and maps)	Stacks and queues (capsule) Sets and maps (capsule)	Stacks: Fendricks, Hill, and Moss (sec 1) Stacks: Bell, Stone, and Vernon (sec 2) Sets: Baumbaugh, Halpin, and Kamper (sec 1) Sets: D'Avello, MacAslan, and Samore (sec 2)	Slides	Homework 6	Markov
5	15 Tue Oct 5 Details		11.1-2	Choosing data structures based on efficiency Intro Markov File I/O (capsule)	Lusk, Ong, and Plungis (sec 1) Gerhardt, Kamjorn, and Mercer (sec 2)	Slides (Markov) Slides (Files)	Homework 6	Markov
5	16 Thu Oct 7 Details		13.1-5	Recursion (capsule) Recursion exercise	Dutta, Reid, and McClintock (sec 1) Adam, Almajed, McAnany, and Nam (sec 2)	Slides	Homework 6	Markov
6	17 Mon Oct 11 Details	Homework 6	None	Phase 3 capsule deliverables: Rubric. Simulation Project time		Slides	Homework 7	SimulationProject
6	18 Tue Oct 12 Details		None	Exam 2			Homework 7	SimulationProject
7	19 Mon Oct 18 Details	Homework 7	None	Simulation project time		Slides	Homework 8	SimulationProject
7	20 Tue Oct 19 Details		Ch. 14.1-3 (sorting) Ch. 18 (GUIs)	Intro to sorting algorithms: selection and insertion (capsule) Advanced GUIs (capsule)	Sort: Cavanaugh, Dutta, Hoorn (sec 1)	Sort: Cavanaugh, Dutta, Hoorn (sec 1) Sort slides: Almajed, Lien, Savage (sec 2) GUIs: Fendricks, Moss, Ong (sec 1) GUIs: Block, D'Avello, Kahl (sec 2)	Homework 8	SimulationProject
7	21 Thu Oct 21 Details		Ch. 14.4-5 (mergesort) Ch. 20.6 (animation)	Mergesort (capsule) Animation (Capsule)		Merge: Baumbaugh, Plungis, Purviance (sec 1) Merge: Adam, Kamjorn, Nam (sec 2) Animation: Krasich, Lee, Mathieu (sec 1) Animation: Bell, Cox, Gerhardt (sec 2)	Homework 8	SimulationProject
8	22 Mon Oct 25 Details	Homework 8	Ch. 14.6-7 (searching)	Convocation schedule Intro to searching algorithms and their efficiency (capsule) Efficiency of sorting algorithms	Search (sec 2)	Search: Halpin, Hill, Kamper (sec 1) Search: MacAslan, Samore, Vernon (sec 2) Sorting recap and analysis	Homework 9	SimulationProject
8	23 Tue Oct 26 Details		Ch. 14.8 (comparators)	Function objects and comparators for sorting (capsule) Project time		Comparators: Lusk, McClintock, Reid (sec 1) Comparators: McAnany, Mercer, Stone (sec 2)	Homework 9	SimulationProject
8	24 Thu Oct 28 Details		None	Exam 3			Homework 9	SimulationProject
9	25 Mon Nov 1 Details	Homework 9	Take-home Quiz ( 5:24) Configuring C Workspace [local] [slides] (10:50) Worked example: First C Program [local] [slides] ( 3:40) Why C? [local] [slides] ( 3:56) Strings and Printf [local] [slides] ( 2:49) Scanf [local] [slides] ( 7:24) Structs [local] [slides] ( 6:33) Worked example: Point [local] [slides] ( 3:49) Optional worked example: Get Point [local] [slides]	C control, I/O, structs, arrays			Homework 10	C Projects
9	26 Tue Nov 2 Details		Take-home Quiz ( 4:38) Pointer Syntax [local] [slides] ( 4:59) Worked example: Pointers In the Debugger [local] [slides] ( 8:25) Worked example: Pointers as Parameters [local] [slides] (12:02) Worked example: Pointers Practice and Pitfalls [local] [slides] ( 5:55) More Box and Pointers [local] [slides]	Pointers and memory allocation Dynamically-sized arrays: malloc and free			Homework 10	C Projects
9	27 Thu Nov 4 Details		Take-home Quiz ( 5:39) Worked example: Read Scores [local] [slides] (10:20) Arrays and Pointers [local] [slides] ( 5:44) Char Concepts [local] [slides] ( 7:42) Worked example: Counting Chars [local] [slides] (14:27) String Concepts [local] [slides] ( 6:17) Worked example: String Length [local] [slides] (14:58) Optional worked example: First Word [local] [slides] (10:34) Optional worked example: Camel Case [local] [slides]	Strings and string functions			Homework 10	C Projects
10	28 Mon Nov 8 Details	Homework 10	Take-home Quiz ( 5:12) File Concepts [local] [slides] ( 7:30) Worked example: OutAndInAgain [local] [slides] (20:00) Optional worked example: OrcsAndElves [local] [slides] (12:52) Calculate Average [local] [slides] (14:58) Worked example: Separate Compilation [local] [slides (through 8:15 only)]	File I/O Dynamic Memory Allocation Linked lists			Homework 11	Linked Lists
10	29 Tue Nov 9 Details		Begin review for final exam	Implementation of linked lists			Homework 11	Linked Lists
10	30 Thu Nov 11 Details	Homework 11 (due Friday at 5:00 pm)	Review for exam	More linked lists Time to review for exam Course evaluations			Homework 11	Linked Lists
11	31 Mon Nov 15 Details	Homework 12 (optional)	Review for exam	Final Exam: Monday 6-10 pm in Olin 167 (sec1) and 169 (sec 2)