COMP 310 Object-Oriented Data Structures - Spring Semester 2001

COMP 310 Object-Oriented Data Structures

Professor Michael Werner - Wentworth Institute of Technology

2001-02 Catalog:This course is an introduction to object oriented data structures using inheritance and template classes. Topics include: Queues, sorted linked lists, binary search trees, B+ trees, balanced trees, timing of sort and search algorithms, hash searching and indexed files, directed graphs and Dijkstra's weighted path algorithm, acyclic graphs, topological sorting and critical path analysis.

Textbooks:C++ An Introduction to Data Structures, Larry Nyhoff, Prentice Hall

Textbook Web Site:

Coordinator:Michael Werner, Ph.D. Associate Professor of Computer Science. Office hours are 12:00 Monday, 9:30 Wednesday, 12:00 Friday, or by appointment. Office in Dobbs 006. Phone: (617) 989-4143. Email:

Course Page:

Goals:The student will master the art of understanding and designing efficient data structures and computer algorithms. He/she will be able to implement them using C++.

Prerequisite:COMP285 Object Oriented Programming

Total Credits:4

Topics

Week / Topic / Readings -Nyhoff
1 / Software engineering practices / Chapter 1
2 / Data types - simple types, arrays, structs, unions / Chapter 2
3 / Abstract data types, C++ classes, The Time class / 3.1, 3.2
4 / Strings / 3.3, 3.4, 3.5
5 / Stacks (ADT & array implementation) / Chapter 4
6 / Queues (ADT & array implementation) / Chapter 5
7 / Templates / 6.1 - 6.3
8 / The standard template library - containers / 6.3 - 6.4
9 / STL vectors, deques, stacks and queues / 6.4 - 6.6
10, 11 / Linked Lists - Dynamic allocation / Chapter 8
12 / Binary Trees / 10.1 - 10.4
13, 14 / Catch-up and review

Assignments: There will be about 10 - 12 laboratory assignments, usually with one week to do them. Grades are 0 – 4, with 4 generally given for good work submitted on time. Late assignments submitted within one week after the due date have a 1-point penalty. Assignments more than one week late will not be graded. If all assignments have been submitted, the lowest grade will be dropped.

Laboratories: Laboratory exercises will involve both pencil and paper analysis and programming problems to be done on the computer. A separate list of lab exercises will be given.

Tests:There will be 3 quizzes and a final exam. If all quizzes have been taken the lowest score will be dropped. There are no quiz makeups, except in extraordinary circumstances such as hospitalization.

Grading: Grades will be determined approximately as follows:

Assignments 35%

Quizzes40%

Final 25%

Attendance:Regular attendance at every class is expected, and anyone who fails to meet this requirement may be requested to withdraw from Wentworth. In addition, students with poor attendance may be withdrawn from the class with a grade of "WA". The attendance policies are more fully explained in the Wentworth Catalogue. You are responsible for all material given in class as well as in assigned readings.

1Revised 10/27/18