Catalogue 2014 - 2015

CS 202 Data Structures and Algorithms II

Credits

4 cr.

Prerequisite

CS 201.

Course Description

This course continues the coverage of linear and non-linear data structures and related algorithms. Topics include stacks, queues, hash tables, common trees and tree algorithms (e.g., heaps, AV trees, red-black trees, B-trees, and splay trees), graph representations and graph traversals (e.g., depth-first and breadth-first traversals), and common algorithms related to these structures.

Notes

3 hours of lecture and 3 hours of lab per week.

Distribution

MR

Offered

in the spring semester.