CSci 270: Data Structures

Summer 2005

CSci 270: Data Structures

Class Home Page

Course Description:  This course continues with the concept of abstract data structures and concentrates on building programming tools which can be used to store and manipulate data.  Topics covered include stacks, queues, linked lists, trees, hash tables, recursion, and analysis of algorithm efficiency.

 

Goals:  After completion of this course, you should be able to create and use classes to implement the basic data structures (stacks, queues, linked lists, hash tables, and trees) and to use classes from the Standard Template Library.  You should be able to design and code a program for application areas in which these data structures would be useful.  Given multiple algorithms to solve the same problem, you should be able to estimate which algorithm would be more efficient in terms of time and memory required. 

 

Prerequisite:  CSci 152

 

Text:   ADTs, Data Structures and Problem Solving with C++, 2^ed 

           by Larry Nyhoff

           ISBN:  0-13-140909-3

Syllabus:  (PDF) (HTML) (DOC)