CS702 - Advancd Algorithms Analysis and Design
Course Page
Mcqs
Q & A
Video
Downloads
Course Category: Computer Science/Information Technology
Course Level: Graduate
Credit Hours: 3
Pre-requisites: CS301 CS502
Introduction, Underlying mathematical theory, Induction and recursion techniques in analyzing algorithms, Asymptotic notations, Search techniques, Divide-and conquer technique, Randomized algorithms, Heuristic algorithms, Brute Force approach, Backtracking, branch-and-bound, Optimization techniques in algorithms designing, Dynamic algorithms, Greedy algorithms, Graph Theory, Searching algorithms, Minimal spanning tree algorithms, Polynomials and FFT, Number theoretic notations, Number theoretic algorithms, RSA cryptosystems, String matching, pattern matching, NP completeness and NP completeness proofs.
Course Instructor

Dr. N. A. Zafar Ph.D
Computer Science Kyushu University, Japan
Books
Introduction to Algorithms by T. H. Cormen, C. E. Leiserson and R. L. Rivest
Introduction to Formal Languages and Automata by Peter Linz
Fundamentals of Algorithmics by Gilles Brassard and Paul Bretly
Discrete Mathematics and Its Applications by Kenneth Rosen
Computers & Intractability, Guide to the Theory of NPC by M. R. Garey