CS-502 Fundamentals of Algorithms
Q & A
Online Test
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.
 CS502_Fundamentals_of_Algorithms_FAQS  CS502_MID_2004_2005_2006_2007 CS502_Midterm Reference MCQs  CS502_Midterm Solved Mcqs With References by Moaaz CS502_Midterm Solved MCQs CS502_MidTerm Solved Subjective mega file by Saif CS502_Midterm Solved Subjective With References by Moaaz CS502_Midterm Solved Subjective with Refference CS502_Midterm_By Dr Tariq Hanif CS502_Midterm_Subjective CS502_Solved_mid_term__MCQZ_with_refrence CS502_Subjective Impnotes For MidTerm
Course Instructor

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

Introduction to Algorithms
by Thomas H.Cormen, Leiserson, Rivest, and Stein (CLRS) 2001.