George Mason University
George Mason University Mason
George Mason University

CS 583: Analysis of Algorithms I

Course Information from University Catalog

Not Repeatable


Topics include analyzing sequential and parallel algorithmic strategies such as greedy methods, divide and conquer strategies, dynamic programming, search and traversal techniques, and approximation algorithms; and analyzing specific algorithms falling into these classes, NP-Hard and NP-Complete problems.

Hours of Lecture or Seminar per week: 3

Credits: 3

Prerequisites:

CS 310 and CS 330 and MATH 125.

1 Course Sections Scheduled for Fall 2017

2 Course Sections Scheduled for Spring 2018

1 Course Sections Scheduled for Fall 2016

2 Course Sections Scheduled for Spring 2017

Expertise