CS6402 Design and Analysis of Algorithms Important Questions

CS6402 Design and Analysis of Algorithms Important Questions

Unit 1
 Fundamentals of Algorithmic Problem Solving
 Fundamentals of the Analysis of Algorithm Efficiency
 Asymptotic Notations and its properties
 Mathematical analysis for Recursive and Non-recursive algorithms

Unit 2
 Brute Force
 Closest-Pair and Convex-Hull Problems
 Traveling Salesman Problem
 Knapsack Problem
 Divide and conquer methodology
 Merge and Quick sort
 Binary search

Unit 3
 Warshall's and Floyd's algorithm
 Optimal Binary Search Trees
 Knapsack Problem and Memory functions Greedy Technique
 Prim's, Kruskal's and Dijkstra's algorithm

Unit 4
 The Maximum-Flow Problem
 Maximm Matching in Bipartite Graphs
 The Stable marriage Problem

Unit 5
 Lower-Bound Arguments
 Decision Trees-P, NP and NP-Complete Problems
 Backtracking
 n-Queens problem
 Hamiltonian Circuit Problem
 Traveling Salesman Problem
 Approximation Algorithms for NP

Next Post »
Official APP to get INSTANT UPDATES Direct to your Mobile.