Algoma University College
Computer Science 2007
Data Structures II
Winter 1995/96
(Tuesday, Thursday: 5:30 - 6:45 pm )

Instructor: Dr. Pawan J. Lingras

Description:
This course is the second part of two part introduction to data strctures and associated algorithms. The data sturctures that will be discussed in this course include tables, trees, binary trees, search trees, expression trees, heaps, and general trees. T he study will focus on various applications of these data structures and associated algorithms. The students will be introduced to hashing, sorting, recursion, elimination of recursion, evaluation of expressions. The course will use C++ as the primary pro gramming language.

Brief Class Outline:
1. Recursion.
2. Sorting.
3. Trees.
4. Tables.
5. Hashing.
6. Graphs.
7. Evaluation of expressions.
Text:
Collins, W.J.. Data Structures: An Object-Oriented Approach, Unpublished new edition, the notes will be distributed electronically.
References:
Borland C++ 4.5 reference manual. 

Tentative Marking Scheme

Assignments 25


Test -1 (Feb. 15, 1996) 15


Test - 2 (Mar. 26, 1996) 15


Quizzes (in class) 10


Final 35


________________________


Total 100