Algoma University College
Computer Science 2006
Data Structures II
Fall 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 first part of two part introduction to data structures
and associated algorithms. The abstract data types that will be discussed
in this course include sets, lists, stacks and queues. Students will use
contiguous and linked implementations of these data types using an
object-oriented approach. The study will focus on various applications of
these data types and associated algorithms. The course will also introduce
the analysis of space and time requirements for a lgorithms. Finally, we
will study a variety of searching and sorting algorithms and compare their
time and space requirements.
Brief Class Outline:
0. Classes and templates in C++
1. Introduction to data structures.
2. Analysis of algorithms.
3. Sets, lists, stacks, queues.
4. Contiguous and linked implementation.
5. Applications.
6. Search and Sort
- Text:
-
Headington, M.R. and Riley, D.D. 1994.
Data Abstraction and Structures Using C++,
D.C. Heath and Company, Toronto.
- References:
-
Borland C++ 4.5 reference manual.