Code: 13A05402
B.Tech II Year II Semester (R13) Supplementary Examinations December 2016
DESIGN & ANALYSIS OF ALGORITHMS
(Computer Science and Engineering)
--- Content provided by FirstRanker.com ---
Time: 3 hours Max. Marks: 70
Answer all five units
UNIT – I
-
a) What is an algorithm? Explain different algorithm design paradigms.
b) Write an algorithm for finding the maximum and minimum elements in an array.
(OR)
--- Content provided by FirstRanker.com ---
-
a) Solve the following recurrence equation: T(n) = 1 if n = 1; otherwise T(n) = T(n/2) + 1.
b) What is amortized analysis? Explain different methods of amortized analysis.
UNIT – II
-
a) Write an algorithm for implementing the divide and conquer method.
--- Content provided by FirstRanker.com ---
b) Explain the concept of merge sort with example.
(OR)
-
a) Explain the working of quick sort algorithm.
b) Write a short note on Strassen’s matrix multiplication.
--- Content provided by FirstRanker.com ---
UNIT – III
-
a) Write a short note on optimal binary search trees.
b) Explain the concept of dynamic programming.
(OR)
-
a) What is the concept of greedy method? Explain.
b) Explain single source shortest path algorithm.
--- Content provided by FirstRanker.com ---
UNIT – IV
-
a) What is minimum cost spanning tree? Explain Prim’s algorithm.
b) Write a short note on bi-connected components.
--- Content provided by FirstRanker.com ---
(OR)
-
a) What is graph traversal technique? Explain Breadth First Search.
b) Write short note on Depth First Search.
--- Content provided by FirstRanker.com ---
UNIT – V
-
a) Explain the concept of branch and bound method.
b) Write a short note on traveling sales person problem.
(OR)
-
a) Explain the concept of backtracking.
--- Content provided by FirstRanker.com ---
b) What is Hamiltonian cycle? Explain with example.
--- Content provided by FirstRanker.com ---
This download link is referred from the post: AKTU B-Tech Last 10 Years 2010-2020 Previous Question Papers || Dr. A.P.J. Abdul Kalam Technical University