Data Structures and Algorithms

Catalog description

Credits 4. 3 Lecture Hours. 2 Lab Hours. Specification and implementation of basic abstract data types and their associated algorithms including stacks, queues, lists, sorting and selection, searching, graphs and hashing; performance tradeoffs of different implementations and asymptotic analysis of running time and memory usage. Prerequisites: Grade C or better in CSCE 120 or CSCE 121 ; grade of C or better in CSCE 222/ECEN 222 or ECEN 222/CSCE 222 , or concurrent enrollment.