CS502 : Fundamentals of Algorithms

I like this Course

Course Info

Course Category

Computer Science/Information Technology

Course Level

Undergraduate

Credit Hours

3

Pre-requisites

CS301

Instructor

Dr. Sohail Aslam
Ph.D Computer Science
University of Illinois at Urbana-Champaign

Course Contents

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.