#1
26th February 2016, 03:48 PM
| |||
| |||
AOAD Mumbai University
Can you provide me the syllabus of Analysis Of Algorithm & Design (Abbreviated as AOAD) which is offered under Semester IV of Computer Engineering of University of Mumbai?
|
#2
26th February 2016, 03:50 PM
| |||
| |||
Re: AOAD Mumbai University
The University of Mumbai is one of the first three state universities of India and the oldest in Maharashtra. It offers Bachelors, Masters and Doctoral courses apart from diplomas and certificates in many disciplines. The language of instruction for most courses is English. Several private colleges in and around Mumbai are affiliated to MU. AOAD Syllabus Mumbai University Module 1 Introduction to analysis of algorithm • Design and analysis fundamentals. • Performance analysis ,space and time complexity. • Growth of function – Big-Oh, Omega, theta notation. • Mathematical background for algorithm analysis. • Randomized and recursive algorithm. Module 2 Divide and Conquer .Genaral method , Binary search, finding the min and max. .Merge sort analysis. .Quick sort, performance measurement. .Randomized version of quick sort and analysis. .Partitioned algorithm selection sort, radix sort, efficiency considerations. .Strassen’s matrix multiplication. Module 3 Greedy Method .General mehod. .Knapsack problem. .Minimum cost spanning tree- kruskal and primal algo, performanance analysis. .Single source shorted path . .Job sequencing with deadlines. .Optimal storage on tapes. Module 4 Dynamic Programming . The general method . Multistage graphs, all pair shortest paths, single source shortest paths .Optimal BST ,0/1 knapsack .TSP, flow shop scheduling Module 5 Backtracking .The general method. .8 queen problem ,sum of subsets. .Graph coloring,hamltonian cycles. . Knapsack problem. Module 6 Branch and Bound .The method, LC search. .15 puzzle:An example. . Bounding and FIFO branch and bound . . LC branch and bound . . 0/1 knapsack problem. .TP efficiency considerations. Module 7 Internet algorithm .Strings and patterns matching algorithm . .Tries. .Text compression. .Text similarity testing. AOAD Syllabus Mumbai University |
|