The page uses Browser Access Keys to help with keyboard navigation. Click to learn moreSkip to Navigation

Different browsers use different keystrokes to activate accesskey shortcuts. Please reference the following list to use access keys on your system.

Alt and the accesskey, for Internet Explorer on Windows
Shift and Alt and the accesskey, for Firefox on Windows
Shift and Esc and the accesskey, for Windows or Mac
Ctrl and the accesskey, for the following browsers on a Mac: Internet Explorer 5.2, Safari 1.2, Firefox, Mozilla, Netscape 6+.

We use the following access keys on our gateway

n Skip to Navigation
k Accesskeys description
h Help
George Mason University
    George Mason University
   
 
 
 
2016-2017 University Catalog 
  
2016-2017 University Catalog

CS 583 - Analysis of Algorithms

Credits: 3
Not Repeatable for Credit
Offered by Computer Science  
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 CS 330 and MATH 125.
Schedule Type: LEC
Hours of Lecture or Seminar per week: 3
Hours of Lab or Studio per week: 0