COURSE TITLE: EECS 311 Data Structures and Data Management

CATALOG DESCRIPTION: The design, implementation, and analysis of abstract data types, data structures and their algorithms. Topics include: data and procedural abstraction, linked lists, stacks, queues, binary trees, searching, and sorting. Required for computer science majors.

REQUIRED TEXTBOOK : Mark Allen Weiss , Data Structures and Algorithms Analysis in C++, Pearson/ Addison Wesley, 3 rd edition (2006)

RECOMMENDED REFERENCE:

1) Deitel & Deitel ,C++: How to Program , Pearson/Prentice Hall, 5th edition

2) Bjarne Stroustrup , The C++ Programming Language, Pearson/Addison-Wesley, 3rd edition

COURSE COORDINATOR: Peter Scheuermann

COURSE GOALS:

PREREQUISITES: EE CS 211 or EECS 231

DETAILED COURSE TOPICS:

Lists

Queues, stacks

Algorithm analysis

Skip lists

Binary search trees

Balanced trees

Priority queues

Huffman encoding

Self-adjusting structures

Splay trees

Tries

B-trees

Hash tables

Disjoint sets

Graphs

Sorting

HOMEWORK ASSIGNMENTS: Five

GRADES:

Assignments –40%

Exams : 60%

COURSE OBJECTIVES: