Prerequisites: A minimum grade of “B-” in both CS 503 and MATH 505, or permission of the
instructor. (Either semester/3 credits)
A study of abstract data types and data structures such as stacks, queues, linked lists, trees,
graphs and their implementations. Topics also include algorithms for hashing, sorting,
searching and analysis of algorithm efficiency. Students will be required to use a high-level
programming language at an advanced level in programming assignments.