Skip to main content

COSC-504 Efficient Computing Methods
Fall for 2005-2006
Staff
This course covers data structures and algorithms with an emphasis on "paper and pencil" analysis techniques that vastly improve the performance of computers and maximize improved technology. The topics are theoretical but have dramatic impact on practice; wherever possible, we will place the theory in context of its service to applications. The course covers worst-case, average-case, and amortized algorithmic analysis; list, stack, queue, and tree data structures; and the divide-and-conquer algorithm. Self-adjusting data structures and on-line algorithms will also be introduced. Prerequisites: COSC-503 or permission of the instructor.
Credits: 3
Prerequisites: None
More information
Look for this course in the schedule of classes.

The academic department web site for this program may provide other details about this course.

Georgetown University37th and O Streets, N.W., Washington D.C. 20057(202) 687.0100

Connect with us via: