Analysis Of Algorithms I

Host University

George Mason University

Semester

Fall 2024

Course Number

CS 583 005

Credits

3

Discipline

Computer Science

Instructor

Li, Fei (fli4@gmu.edu)

Times and Days

Asynchronous

Course Information

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. Offered by Computer Science. May not be repeated for credit.

Prerequisites

CS 310 and CS 330 and MATH 125.