91ÊÓƵ

Prerequisite: COMP 152 with a minimum grade of "C-"; and MATH 100 or higher In this course, static, semistatic and dynamic data structures and techniques for the analysis and design of efficient algorithms which act on data structures will be addressed. Course topics will include arrays, records, stacks, queues, deques, linked lists, trees, graphs, sorting and searching algorithms, algorithms for insertion and deletion and the analysis and comparison of algorithms. Offered fall and spring semesters. (Formerly COMP 330)