Cs6402 design and analysis of algorithms impartant part b questions appasami
Download as DOCX, PDF2 likes1,233 views
This document outlines important questions from 5 units that could appear on the CS64O2 DESIGN AND ANALYSIS OF ALGORITHMS exam. Unit I covers algorithm problem types, problem solving fundamentals, asymptotic notations, and analyzing recursive/non-recursive algorithms. Unit II discusses closest pair, convex hull, TSP, KP, sorting algorithms, and binary search. Unit III is about dynamic programming, graph algorithms, OBST, and HMT. Unit IV is linear programming problems. Unit V covers complexity classes, backtracking, branch and bound, and approximation algorithms for NP-hard problems like TSP and KP. The document provides guidance on questions to study for the exam.
1 of 1
Downloaded 42 times
More Related Content
What's hot (20)
Ad
Viewers also liked (8)
Ad
Similar to Cs6402 design and analysis of algorithms impartant part b questions appasami (20)
More from appasami (20)
Recently uploaded (20)
Cs6402 design and analysis of algorithms impartant part b questions appasami
- 1. CS64O2 DESIGN AND ANATYSIS OF ALGORITHMS Important Part-B 16 mark questions Unit I 1. Explain important problem types in detail. 2. Explain fundamentals of algorithmic problem solving in detail. 3. Discuss on Asymptotic Notations and its properties with examples. 4. Elaborate Mathematical analysis for Recursive algorithms. 5. Elaborate Mathematical analysis of recursive and non-recursive algorithms. Unit II 1. Explain closest pair and convex hull problems using brute force. 2. Explain TSP and KP 3. Explain merge sort and quicksort with algorithm, all case analysis and problem. 4. Explain strassens matrix multiplication. 5. What is divide and conquer strategy and explain the binary search with suitable example. Unit III 1. Explain how to compute a Binomial Coefficient using dynamic programming method. 2. Solve problems by Warshall’s and Floyd’s algorithm. 3. Explain the following (i) OBST (ii) HMT. 4. Explain prims or kruskals algorithm. 5. Explain Dijkstra's Algorithm. Unit IV 1. Formulate and solve the given LPP. 2. Explain the maximum flow problem algorithm and prove the max Flow min cut theorem. 3. Explain in detail about the maximum matching in bipartite graph with an example. 4. What is Stable Marriage problem? Explain with an Example and also give its applications. Unit V 1. Explain class N, NP and NP complete problems with example. 2. Using Backtracking enumerate (a) queens problem (b) Hamiltonian circuit problem. 3. Illustrate Branch and Bound method( AP / KP / TSP) 4. Explain Approximation algorithms for NP – Hard Problems in detail (TSP, KP). All the Best – No substitution for hard work. Mr. G. Appasami SET, NET, GATE, M.Sc., M.C.A.,M.Phil., M.Tech.,(P.hd.), MISTE, MIETE, AMIE, MCSI, MIAE, MIACSIT, MASCAP, MIARCS, MISIAM, MISCE, MIMS, MISCA, MISAET, PGDTS, PGDBA, PGDHN, PGDST, (AP / CSE / DRPEC).