CS-702 Advancd Algorithms Analysis and Design
Mcqs
Q & A
Video
Online Test
Foram
Course Category: Computer Science/Information Technology
Course Level: Graduate
Credit Hours: 3
Pre-requisites: CS301, CS502
Share this page on:
Downloads:
CS702 Handouts version 1
CS702_Final_Term_2015_Mega_File
Course Contents:
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,

Computers and Intractability, Guide to the Theory of NP Completeness by M. R. Garey and D. S. Johnson

An 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