Performance and Test, Spring 2007

This schedule is preliminary and will be updated during the course period. Click on the date of the episode to see details (only for episodes that are public now).

Week	Wednesday			Friday
	Date	Expected Reading	Lecture (13:30-15:30) Exercises (15:30-16:30)	Date	Expected Reading	Lecture (10:00-12:00) Exercises (13:00-16:00)

1	Jan 31	RS 1.0—1.1, 2.0—2.4, 2.7 [30pp, 3h]	[AW] Lecture: Measuring performance (complexity)	Feb 2		[SS] Exercises 10:00-12:00 (!): Measuring performance (in the lecture slot)
			Exercises cancelled			Afternoon session cancelled

2	Feb 7	RS 2.6, 6.0—6.1, 6.3—6.4, 8.0—8.1, 8.3, 8.6 [30pp, 3h30min]	[AW] Lecture: Array searching & Merge-Sort (linear search, binary search, merge sort, estimating expected running time)	Feb 9	RS 6.6, 6.10 7.1—7.4, 10.0—10.3, 10.6 [45pp, 5h]	[AW] Lecture: Performance Characteristics of sorting.
			[AW] Exercises: Measuring performance			[SS] Exercises: searching and Merge-Sort

3	Feb 14	RS 12.6—12.7, p. 543, pp. 548—549, Program 12.22 p. 551, 13.0, 13.3, 13.6 [27pp, 3h30]	[AW] Lecture: Binary search trees and 2-3-4 trees.	Feb 16	RS 14.0—2,14.5. P entirely (pp. 1—6, see below), PR pp. 1—5 (see below) [30pp, 4h]	[AW] Lecture: Hashing
			[AW] Exercises: Characterization of sorting			[SS] Exercises: search trees

4	Feb 21	RS 17.0, 17.2 (until p.20), 17.3—17.4, p.40, 18.0—18.3, 18.5, 18.7 [50pp, 5h]	[AW] Lecture: Graphs and graph Traversals: DFS, BFS.	23 Feb	no new reading	[AW,PT] Programming Contest
			[AW] Exercises: Hashing			No exercises. Work on your contest submission instead.

5	Feb 28	RS 21.0—2 + handout from RN [35pp, 4h]	[SS] Lecture: Shortest Paths	Mar 2	MS Preface, Ch. 1-3 (up to and including p.73) [~75pp,~5h]	[HRA] Lecture [test 1]: What is testing? Testing approaches. Types of testing
			[AW,PT] Exercises: hashing continued + contest results.			[SS] Exercises: graphs and graph traversals (2 hours only)

6	Mar 7	MS Ch. 3(from p.78), 4 [~70pp,~5h]	[HRA] Lecture [test 2]: Use cases, JUnit	Mar 9	MS Ch. 5,6 [~84pp,~8h]	[HRA] Lecture [test 3]: Interaction and system testing, coverage, performance testing
			[PT,HRA] Lab: Eclipse & JUnit			[PT,HRA] Lab Exercises: Testing

7	Mar 14	Notes	[HRA] Lecture [test 4]:Tools for versioning, profiling and building software systems	Mar 16		Self Study in groups.
			[PT,HRA]			Self Study in groups.

8	Mar 21	no new reading	[AW,SS] Lecture:Course overview. Exam preparation. (2 hours)	Mar 23		[PT,HRA] Project Kick-off
						[PT,HRA]Lab Exercises: Unit testing with JUnit

9	Mar 28		Groups meet with supervisor (stay close to 2A14 or send mail about where you are)	Mar 30


—	Easter vacation

10	Apr 11		Groups meet with supervisor	Apr 13


11	Apr 18			Apr 20		Project Increment 1 deadline
						[SS] Exercises: Dijkstra and A* (2 hours)

12	Apr 25		GUEST LECTURE on Test in Practice by Jakob Jensen, KMD	Apr 27


13	May 2		Groups meet with supervisor	May 4	Store Bededag


14	May 9			May 11


15	May 16		Groups meet with supervisor	May 18


16	May 23	Project hand-in at exam office, deadline 15:00

—	Oral exams: June 15, 18, 19

References

[RS] Robert Segdewick. Algorithms in Java. Addison-Wesley 2003.

[MS] McGregor and Sykes. A Practical Guide to Testing Object-Oriented Software. Addison Wesley 2001.

[GT] Michael T. Goodrich. Roberto Tamassia. Data Structures & Algorithms in Java. 4th Edition. Wiley 2006.

[RN] Stuart Russell and Peter Norvig. Artificial Intelligence. A Modern Approach. Second Edition, Prentice Hall, 2003.

[P] R. Pagh, Cuckoo Hashing for Undergraduates.

[PR] "Pagh and Rodler: Cuckoo hashing"

Mandatory assignments can be written on paper and placed in the course pigeonhole on first floor, outside the study administration office. Manuscripts are permitted (and well received).

Performance and Test, Spring 2007: Schedule

References