Listed in: Computer Science, as COSC-201
Formerly listed as: COSC-20 | COSC-21
James R. Glenn (Section 01)
Lyle A. McGeoch (Section 02)
This course is the first part of a two-semester sequence examining data structures (ways of organizing data so that it can be used effectively) and algorithms (the methods that can be used to manipulate data). The use of appropriate data structures and algorithms can often dramatically reduce the computational work needed to solve a problem. Topics examined in this course will include proof techniques, run-time analysis, heaps, hash tables, sorting, searching, and divide-and-conquer algorithms. The course will provide advanced programming experience and will emphasize the use of abstraction in program design.
Requisite: COSC 111. Spring semester. Professors L. McGeoch and Glenn. (Section 02 will be limited to 36 students due to room constraints.)