Algorithms and Data Structures.

Catalog description

This course introduces essential data structures and algorithmic analysis for the design of efficient computer programs using an object oriented programming language. Some of the data structures designed and implemented include linked lists, stacks, queues, trees, heaps, hash tables, and graphs. A mathematical framework for evaluating efficiency of algorithms is covered. The analysis of algorithms for searching, traversing trees, hashing, manipulating priority queues, sorting, and finding shortest paths in graphs is included. Recursive algorithms are used when they can improve efficiency. Spring. Prerequisites: C or higher in CIS 152 , CIS 250 , MAT 180 .