Algoma University College
Computer Science 2007
Data Structures II
Winter 1996/97
(Monday 8:30 - 9:45 am, Wednesday: 11:30 am - 12: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. The 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:
Headington, M.R. and Riley, D.D. 1994. Data Abstraction and Structures Using C++, D.C. Heath and Company, Toronto. 

Tentative Marking Scheme

Assignments 25


Test - 1 (Feb. 24, 1997) 15


Test - 2 (Mar. 26, 1997) 15


Quizzes (in class) 10


Final 35


________________________


Total 100