Scribd
Upload
7 views2 pages

Syllabus Design and Analysis of Algorithm

Uploaded by

AJAY ROCK
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
7 views2 pages

Syllabus Design and Analysis of Algorithm

Uploaded by

AJAY ROCK
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

🖇️

Syllabus : Design and Analysis


of Algorithm
Module I
Algorithm Analysis: Algorithm, Properties of a good algorithm, efficiency
considerations,
Complexity: Time and Space complexity, Asymptotic notations: Big O notations, best
case, worst case, average case, simple examples, recursion and its elimination-
recursive and no-recursive algorithms for binary search.

Module II
Algorithm design techniques – Divide and conquer method : binary search as a
divide-and- conquer algorithm, finding maximum and minimum, Strassen’s matrix
multiplication, Greedy method: Knapsack problem, minimum cost spanning trees,
Prim’s algorithm, Kruskal’s algorithm.

Module III
Dynamic programming: principle of optimality, all pair shortest paths, single source
shortest paths, travelling sales person’s problem, Backtracking: implicit constraints
and explicit constraints, N queen problem, Branch and bound: LC search.

Syllabus : Design and Analysis of Algorithm 1


Module IV
Standard Algorithms: sorting-quicksort, merge sort, complexity of sorting algorithms,
Deterministic and non-deterministic algorithms, NP-hard and NP complete-basic
concepts.

Syllabus : Design and Analysis of Algorithm 2

You might also like