Computer Science @ Colgate University

Home | Courses | Faculty & Staff | Information | News & Events | Resources

COSC 460-Analysis of Algorithms

This course provides a conceptual framework within which both theoretical and concrete analyses of computer algorithms may be developed. Topics to be covered include abstract models of computation; the efficient design of algorithms using data structures such as trees, networks, lists, queues, heaps, and stacks; sorting; searching; graph algorithms; dynamic programming; and intractable problems. In the weekly two-hour laboratory, students will code and analyze some of the algorithms discussed in class. Format: Lecture and two-hour laboratory. Prerequisites: COSC 304 or permission of the instructor Offered: Spring semester in alternating years COSC Course Offerings for Spring 2008