CSSE221 – Fundamentals of Software Development Honors

Fall 2011-2012

Schedule Overview

The Readings due each day are recommended (not required) readings for those who need to brush up on the topics of the day. Note that the text listed on the syllabus is a recommended text, not a required text.

Remember to use the Late Day Bank survey on ANGEL if you want to spend or deposit a late day.

Schedule last updated Thu Nov 10.

Week	Session	HW Due	Reading Due	Topics	Summary	Slides	Homework	Projects
0	1 Thu Sep 1 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 5 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 6 Details		Skim ch. 4-6. Focus on 4.1 and 5.2.	Unit testing using JUnit Introduction to analysis: big-Oh analysis Phase 1 capsule teams		Slides	Homework 2	BigRational
1	4 Thu Sep 8 Details	Big-Oh	11.3-6	Phase 1 capsule deliverables: Rubric. Throwing exceptions	Summary	Slides	Homework 2	BigRational
2	5 Mon Sep 12 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 13 Details		Ch. 9.1-4, ch. 10	Inheritance and abstract classes (capsule) Polymorphism and dynamic binding (capsule)	Inheritance (sec1): Bismayer, Savkovich, Venezia Inheritance (sec2): Cox, Nuanes, Uphus Polymorphism (sec1): Guilford, Memering, Spry Polymorphism (sec2): Stewart, Rudich, Kulczak	Slides Inheritance (sec2): Cox, Nuanes, Uphus	Homework 3	BallWorlds
2	7 Thu Sep 15 Details		Ch. 7	More polymorphism: Dynamic binding and static overloading (exercise) 1D and 2D Arrays and ArrayLists (capsule) Array exercise	Arrays (sec1): Goldthorpe, McCormack, Piergiovanni Arrays (sec2): Andrews, Burns, Carter	Slides	Homework 3	BallWorlds
3	8 Mon Sep 19 Details	Homework 3	Ch. 2.11-13	GUI design using Swing (capsule) Exercise: SwingDemo, parts 1-6 Phase 2 capsule teams	Swing (sec1): Taylor, Spry, Juneau Swing (sec2): Morrison, Nuanes	Slides	Homework 4	Fifteen
3	9 Tue Sep 20 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): D'Attilio, Katz, Roetker ShapeClasses (sec1): Bismayer, Goldthorpe, Gregory Listeners (sec2): Kulczak, Shah, Singer ShapeClasses (sec2): Alves, Jones, Morrison	Slides	Homework 4	Fifteen
3	10 Thu Sep 22 Details		None	Exam 1, Today. 7:00 to 9:00 pm Section 1 in G315 Section 2 in G317 NO CLASS TODAY			Homework 4	Fifteen
4	11 Mon Sep 26 Details	Homework 4	Ch. 12	VectorGraphics project time		Slides	Homework 5	VectorGraphics
4	12 Tue Sep 27 Details		Ch. 15.1-3	Lists and Iterators (capsule) Revisit big-Oh	Lists & Iterators (sec 1): avkovich, Venezia Lists & Iterators (sec 2): Andrews, Singer, Stewart	Slides	Homework 5	VectorGraphics
4	13 Thu Sep 29 Details		20.1-3	Multithreading (capsule) VectorGraphics project time	Multithreading (sec 1): Piergiovanni, Spry Multithreading (sec 2): Carter, Morrison, Rudich	Slides	Homework 5	VectorGraphics
5	14 Mon Oct 3 Details	Homework 5	15.4 (stacks and queues) 16.1-2 (sets and maps)	Stacks and queues (capsule) Sets and maps (capsule)	Stacks and Queues (sec 1): Goldthorpe, Katz Stacks and Queues (sec 2): Alves, Cox Sets and Maps (sec 1): D'attilio, Taylor Sets and Maps (sec 2): Burns, Jones	Slides	Homework 6	Markov
5	15 Tue Oct 4 Details		11.1-2	Choosing data structures based on efficiency Intro Markov File I/O (capsule)	Files (sec 1): Guilford, Roetker Files (sec 2): Nuanes, Uphus	Slides (Markov) Slides (Files)	Homework 6	Markov
5	16 Thu Oct 6 Details		13.1-5	Recursion (capsule) Recursion exercise Phase 3 capsule teams	Recursion (sec 1): Bismayer, Memering Recursion (sec 2): Kulczak, Shah	Slides	Homework 6	Markov
6	17 Mon Oct 10 Details	Homework 6	None	Phase 3 capsule deliverables: Rubric. Simulation Project time		Slides	Homework 7	SimulationProject
6	18 Tue Oct 11 Details		None	Exam 2, Today. 7:00 to 9:00 pm Section 1 in O267 Section 2 in O269 NO CLASS TODAY			Homework 7	SimulationProject
7	19 Mon Oct 17 Details	Homework 7	None	Simulation project time		Slides	Homework 8	SimulationProject
7	20 Tue Oct 18 Details		Ch. 14.1-3 (sorting) Ch. 18 (GUIs)	Intro to sorting algorithms: selection and insertion (capsule) Advanced GUIs (capsule)		Sorting (sec 1): D'attilio, Guilford sorting (sec 2): Andrews, Kulczak Advanced GUIs (sec 1): Katz, Savkovich Advanced GUIs (sec 2): Alves, Cox, Singer	Homework 8	SimulationProject
7	21 Thu Oct 20 Details		None	Simulation project work time No Class Today Defoe attending SIGITE 2011			Homework 8	SimulationProject
8	22 Mon Oct 24 Details		Ch. 14.4-5 (mergesort) Ch. 20.6 (animation)	Mergesort (capsule) Animation (Capsule)		MergeSort (sec 1): Piergivianni, Spry MergeSort (sec 2): Burns, Jones Animation (sec 1): Bismayer, Goldthorpe Animation (sec 2): Morrison, Rudich, Uphus	Homework 9	SimulationProject
8	23 Tue Oct 25 Details	Homework 8	Ch. 14.6-7 (searching)	Intro to searching algorithms and their efficiency (capsule) Efficiency of sorting algorithms		Searching Algorithm (sec 1): Memering, Roetker Searching Algorithm (sec 2): Carter, Shah Sorting recap and analysis	Homework 9	SimulationProject
8	24 Thu Oct 27 Details		Ch. 14.8 (comparators)	Function objects and comparators for sorting (capsule) Project time Exam 3, OPTIONAL, Today. 7:00 to 9:00 pm in O267		Comparators (sec 1): Taylor, Venezia Comparators (sec 2): Nuanes, Stewart	Homework 9	SimulationProject
9	25 Mon Oct 31 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		Slides	Homework 10	C Projects
9	26 Tue Nov 1 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 Arrays and pointer arithmetic Dynamically-sized arrays: malloc and free Binky Pointer FUn video Simulation Project Presentations Wednesday. 4:20 PM to 6:20 PM Olin Hall, room 269 Presentation Schedule		Slides	Homework 10	C Projects
9	27 Thu Nov 3 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		Slides	Homework 10	C Projects
10	28 Mon Nov 7 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		Slides	Homework 11	Linked Lists
10	29 Tue Nov 8 Details		Begin review for final exam	Implementation of linked lists		Slides	Homework 11	Linked Lists
10	30 Thu Nov 10 Details	Homework 11 (due Friday at 5:00 pm)	Review for exam	More linked lists Time to review for exam Course evaluations		Slides	Homework 11	Linked Lists
11	31 Mon Nov 14 Details	Homework 12 (optional)	None	Final Exam, Monday. 8:00 AM to 12:00 PM Section 1 in O169 Section 2 in O169