CS361/561N
Data Structures
Summer 2002

Instructor:
William Austad
Convo 174
austad@ohiou.edu
597-1952

Objectives:
In this course, we will study basic data structures and their associated algorithms. We will implement programs that use these data structures and we shall analyze the running time of various operations on these data structures.

Prereq:
CS300, CS240C

Required Text:
Fundamentals of Data Structures in C++, by Ellis Horowitz, Sartaj Sahni and Dinesh Mehta, W. H. Freeman and Co., New York, ISBN 0-7167-8292-8.

Course Outline:
Basic concepts of data
Linear lists, strings, and arrays
Representation of trees and graphs
Storage systems and structures and storage allocation and collection
Multilinked structures
Symbol tables and searching techniques
Formal specification of data structures data structures in programming languages, and generalized data management systems

Exams:
There will be a midterm and a final exam. Pop quizzes may be given on any given day when no other exams are scheduled. If, because of some exceptional circumstance, you cannot attend a test, contact your instructor BEFORE the fact, not after, to discuss your options. Tests will be closed book, closed note. The final will be comprehensive, although it will emphasize the material in the latter part of the course.

Class directory:
All lectures and assignments will be posted in text form in the class directory on prime:
	~wkatest/class/361
Grading policy:
Your grade will be based on a composite score computed according to the following approximate breakdown:
Graduate Students:
Note that students enrolled in CS561N will be required to complete some additional work above and beyond that required by students enrolled in CS361.

Attendance policy:
Students are strongly encouraged to attend all classes, but attendance is not required. Class attendance will not be used in the final determination of grades. Students miss classes at their own risk. There will be no make-up quizzes, students missing class on the day of a quiz will be given a zero. For excused absences the average of the student's other quizzes will be substituted. Students are required to attend class during the midterm and final exam unless prior arrangements have been made. If, because of some exceptional circumstance, you cannot attend a test, contact your instructor before the fact, not after, to discuss your options.

Academic dishonesty:
Students are expected to turn in only their own work with proper documentation. Anything else may result in an F for the exam, project or program, an F for the course, or even dismissal from the University.

Homework:
Homework is due by the time specified, late homework will lose 20% of its value per day late. Homework is to be an individual exercise, discussing general concepts with other students is encouraged. However, comparing answers, or working in groups is not allowed. You may consult books, journals, and notes in order to do your homework, but you must credit any source you use. You will not lose credit if you credit the source, but you may if you do not! As a general rule, be clear and rigorous in all of your work. Solutions that are unclear or difficult to read will lose points. For full credit your programs must follow the style guide, which can be found at the following URL:

Style guide

An example of how to document classes can be found in the following directories:

        ~wkatest/classes/361/complex_class 
        ~wkatest/classes/361/complex_template
Tests will be closed book, closed note. The final will be comprehensive, although it will emphasize the material in the latter part of the course.

Last modified: 1/17/04, WKA