Georgetown University home page Search: Full text search Site Index: Find a web site by name or keyword Site Map: Overview of main pages Directory: Find a person; contact us About this site: Copyright, disclaimer, policies, terms of use Georgetown University home page Home page for prospective students Home page for current students Home page for alumni and alumnae Home page for family and friends Home page for faculty and staff Georgetown University Search: Full text search Site Index: Find a web site by name or keyword Site Map: Overview of main pages Directory: Find a person; contact us About this site: Copyright, disclaimer, policies, terms of use
Navigation bar Navigation bar
spacer spacer spacer spacer
border
spacer spacer spacer
border
spacer spacer

COSC-504 Efficient Computing Methods

COSC-504 Efficient Computing Methods
Fall only
Faculty:
  • Kalyanasundaram, Bala
    • 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: COSC 503
    Other academic years
    There is information about this course number in other academic years:
    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.
    		spacer spacer
    Navigation bar Navigation bar