Computer Science 295

CSII: Data Structures

Spring 1997

Syllabus

Instructor:

Brian L. Stuart

Office:

Math 419

Office Phone:

843-3725

Office Hours:

8:00-10:00 Monday; 8:00-10:00 and 1:30-3:30 Wednesday; 8:00-9:30 Thursday; 8:00-9:00 Friday, You are free to drop in any time to discuss the class (or anything else for that matter).

Class Meetings:

Due to conflicts many of you have with the scheduled time, we'll be meeting on an unusual schedule. Unless otherwise, announced, we'll meet during L hour (8:00 am) on Tuesdays and B hour (9:10 am) on Fridays.

To help both those who are in class and those who can't make one of the class days, I'm going to be making a rotating assignment of notetaker who will take notes and then post them to the mailing list.

Text:

Foundations of Computer Science by A. V. Aho & J. D. Ullman.

Objectives:

In this class you will learn the theory behind and how to apply a number of methods for representing data. Among these are lists, trees, sets and graphs. We'll also discuss the relational data models used in most database systems. You will demonstrate your mastery of these topics through examinations and programming assignments.

Approximate Schedule of Topics:

Below is a list of topics to be covered during this course.

• Abstract Data Types
• Basic Programming Technique
• Algorithm Analysis and Design
• Trees
• Lists
• Sets
• Relational Databases
• Graphs
• Memory Management
• External Data Storage
• Object-Oriented Programming (if time permits)

Grading:

There will be approximately 6 programming assignment comprising 60% of your grade, the e-mail submissions accounting for 15% and two exams comprising 25%. The exact breakdown is as follows:

Mid-Term Exam       10%
Final Exam          15%
Project 1           10%
Project 2           10%
Project 3           10%
Project 4           10%
Project 5           10%
Project 6           10%
Assigned Writings   15%

All work will be conducted according to Rhodes' Honor Code.