|
MCA 5 SEM. Subject: Analysis & Design of Algorithm
UNIT - 1 Basic Algorithm analysis, Analyzing algorithms, Worst - case and Average case Analysis, Asymptotic Notations, Recurrence substitution method, master method.
UNIT - 2 Design Methods General Consideration, Algorithm design paradigms and representative problems.
UNIT - 3 Deterministic Algorithms Divide and Conquer Binary search, Merge sort, Quick sort. Greedy Method: Minimal spanning tree, Shortest Paths, Knapsack. Dynamic Programming: Chained matrix multiplication, shortest paths, optimal search trees. Backtracking 8-queens problem, Graph colouring, Hamiltonian cycles. Branch and Bound: 0/1 Knapsack problem, Traveling salesperson.
UNIT - 4 Non Deterministic Algorithms Intractable Problems Basic concepts, Nondeterministic algorithms, NP Completeness, Cook's theorem, Examples of NP-Hard and NP-Complete problems, Problem reduction. Approximation Graph colouring, Task scheduling, Bin packing. Probabilistic Algorithms Numerical integration, Primality testing. Graph Algorithms, BFS, DFS and its applications.
UNIT - 5 Evaluation of Algorithm Lower Bound Techniques, Comparison tree, Reduction, Adversary argument.
|