INFS 590 Course Schedule


Syllabus Schedule Handouts My home page

Program Design and Data Structures
INFS 590 Topics Outline
Fall 1999

Course Topics

Meeting DateTopic ReadingsPrograms
(all from Weiss)
1 9/2 Class Overview, Java Basics Ch 1, 2 P1 assigned
2 9/9 Abstraction, Java Classes Ch 6.1, 3, 4.1-4.2
9/16 CANCELLED P1 due
3 9/23 Java Classes / Algorithm Analysis Ch 3, 4.1-4.2, 5 P2 assigned
4 9/30 Algorithm Analysis / Basic ADTs Ch 5, 6
5 10/7 Basic ADTs and Recursion Ch 7.1-7.3
6 10/12 MAKEUP MEETING -- TUESDAY
Stacks and Queues Ch 15 P2 due, P2-B assigned
7 10/14 Queues and Linked Lists Ch 16 P3 assigned
8 10/21 MIDTERM (Instructor on travel)
9 10/28 Trees (Guest lecturer: Ammann) Ch 17 P2-B due
1011/4 Trees Ch 14 P3 due, P4 assigned
1111/11 Trees and Graphs Ch 14
1211/18 Graphs Ch 18 P5 assigned
11/25 Thanksgiving
1312/2 Binary Search Trees Ch 20 P4 due
1412/9 Priority Queues Ch 4 P5 due
1512/16 Final Exam
(Thur, 4:30pm -- 7:15pm)

The midterm will cover the first half of the course, and the final will cover the last half (the final is not cumulative).


Syllabus Schedule Handouts My home page
© Jeff Offutt, 1999, all rights reserved. This document is made available for use by GMU graduate students of INFS 590. Copying, distribution or other use of this document without express permission of the author is forbidden.

Jeff Offutt
August 10 1999