2011-2012 University Catalog 
  
  Catalog Home
  About George Mason University
  Admission
  Tuition, Expenses, and Financial Aid
  School of Law
  Academic Policies
  Student Rights and Responsibilities
  General Policies
  Schedule of Classes
  University Academic Programs and Resources
  Transcript Key
  University General Education
  School for Conflict Analysis and Resolution
  College of Education and Human Development
  College of Health and Human Services
  College of Humanities and Social Sciences
  Krasnow Institute for Advanced Study
  School of Management
  School of Public Policy
  College of Science
  College of Visual and Performing Arts
  Volgenau School of Engineering
  Programs of Study
  Programs by Department
  Bachelor's/Accelerated Master's Programs
  Courses
  Administration and Faculty
HELP
2011-2012 University Catalog

CS 583 - Analysis of Algorithms

Credits: 3 (NR)
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.

Prerequisite(s): CS 310 and 330, and MATH 125.

Hours of Lecture or Seminar per week: 3
Hours of Lab or Studio per week: 0