Go to Main Content

Georgetown University

HELP | EXIT

Detailed Course Information

 

Spring 2018
Sep 16, 2019
Transparent Image
Information Select the desired Level or Schedule Type to find available classes for the course.

COSC 540 - Algorithms
This introductory graduate course explores the design and analysis of efficient algorithms. Topics covered include divide-and-conquer, greedy algorithms, and dynamic programming as well as more advanced topics like amortization, randomization, linear programming, memory-efficient algorithms, online algorithms, and approximation algorithms.  Specific problem domains are subject to change but may include string algorithms, computational geometry, graph algorithms, combinatorial optimization, number theory, and computational sciences.  Although there is some limited overlap of material, this course is not a replacement for an undergraduate algorithms course and hence assumes some basic understanding of algorithm analysis and discrete mathematics.

3.000 Credit hours
3.000 Lecture hours

Levels: MN or MC Graduate, Undergraduate
Schedule Types: Lecture

Computer Science Department

Restrictions:
Must be enrolled in one of the following Levels:     
      MN or MC Graduate
Must be enrolled in one of the following Majors:     
      Computer Science

Return to Previous New Search
Transparent Image
Skip to top of page
Release: 8.7.2.4