Welcome to ITK 179: Introduction to Data Structures

Spring, 2007

Syllabus

Grades on WebCT (login required)

Model-View-Controller Example

Week	Date	Reading Assignment for this class	Assignments due	Topic
1	1/17	None	None	Introduction
	1/19	Chapter 1, sections 1-4	None	Program Design
2	1/22	Finish chapter 1	Email Questionnaire	Program Design cont.
	1/24	Chapter 2, sections 1-5	Page 20, Self-check exercise 3 and Programming exercises 1-2	Exception Handling
	1/26	Finish chapter 2 http://junit.sourceforge.net/doc/testinfected/testing.htm http://junit.sourceforge.net/doc/cookbook/cookbook.htm	Program 1	JUnit Testing Class in OU 213D
3	1/29	Chapter 3, sections 1-3	Page 78, Programming exercise 1	Efficiency
	1/31	Chapter 3, sections 4-6	Page 118, Self-check exercises  1(a&b) and 2 (postponed to Friday)	Efficiency Inheritance Polymorphism
	2/2	Finish chapter 3	Page 118, Self-check exercises  1(a&b) and 2 Program 2	Abstract classes Important Object methods
4	2/5	Appendix C	None	Event driven programming
	2/7	Handout/Becker, ch. 13	None	MVC
	2/9	Chapter 4, sections1-3	Program 3 Employee classes and JUnit tests	MVC, cont. List ADT ArrayList
5	2/12	Chapter 4, section 4	WebCT Quiz 5	List ADT ArrayList Linked Lists
	2/14	None	None	Class canceled
	2/16	None	Program 3 (Inheritance and Polymorphism)	Linked Lists, cont
6	2/19	None	None	Exam 1, chs. 1-3
	2/21	Finish reading chapter 4	Prog 4 design work	Linked Lists, cont.
	2/23	Read 5.1-5.3	Page 221, programming exercises 1-2	Linked Lists, cont.
7	2/26	Finish reading chapter 5	None	Go over exam 1
	2/28	None	Page 221, programming exercises 1-2 REDO Prog 4 (GUI/event driven programming)	OO design exercise (worth programming points)
	3/2	None	None	Class in OU213D JUnit exercise (worth programming points)
8	3/5	None	Part 1 of JUnit exercise	Class in OU213D JUnit exercise part 2 (worth programming points)
	3/7	None	Part 2 of JUnit exercise	Stacks
	3/9	None	Program 3 redo	Stack applications
		SPRING BREAK	NO SCHOOL
9	3/19	Read chapter 6	–Page 269, programming exercise 1 –Page 296, Self-check exercise 1	Stack applications Queues
	3/21	None	Program 5 partial	Queues Command Line Parameters
	3/23	None	None	Prog 6 design exercise Intro to Recursion
10	3/26	None	Program 5 (linked lists)	Class in OU 213D UNIX introduction
	3/28	Read 7.1-7.3	UNIX exercise	Recursion
	3/30	Read 7.4-.6	None	Recursion, cont.
11	4/2	None	Page 355, Programming exercise 1	Recursion, cont. Backtracking
	4/4	None	Stack program	Review
	4/6	None	None	Exam 2 (through stacks)
12	4/9	Read 8.1-8.3	None	Binary Trees
	4/11	None	Page 405, Self Check exercise 1	Linked List Review
	4/13	None	Queue program	Linked List Review
13	4/16	Read 8.4	None	Traversals
	4/18	9.1-9.2	Page 408, Self Check exercises 1-3	Binary Search Trees
	4/20	None	Recursion program	Binary Search Trees, cont.
14	4/23	Chapter 10, sections 1-3	Pages 433-434, Self check exs. 1-2	Sorting
	4/25	None	None	Exam 3 (through recursion)
	4/27	Chapter 10, sections 4-5	Page 434, Self check exs. 3-4	Sorting, cont.
15	4/30	http://www.acm.org/serving/se/code.htm	Page 521, Self check exs 1-2 Page 525, Self check exs 1-2	Insertion sort Ethics
	5/2	None	Page 529, Self check ex 1
	5/4	None	Binary tree program