CS502 - Fundamentals of Algorithms
Course Page
Q & A
Course Category: Computer Science/Information Technology
Course Level: Imdregraduate
Credit Hours: 3
Pre-requisites: CS401
Analyzing the worst-case running time of an algorithm as a function of input size, solve recurrence relations, Basics of Divide and Conquer strategy, Understand the concepts of Dynamic programming, Understand the concepts of Greedy Algorithm, Understand the concepts of Graph traversing, Understand the concepts of MST and their algorithms, Understand the algorithms for computing shortest path, Basics of Complexity theory.
Course Instructor

Dr. Sohail Aslam
Ph.D, University of Illinois,
at Urbana-Champaign
Introduction to Algorithms by Thomas H.Cormen, Leiserson, Rivest, and Stein