Documente Academic
Documente Profesional
Documente Cultură
www.andhracolleges.com
1. (a) Explain the asymptotic notations used in algorithm analysis.
(b) Prove that f(n)=0(h(n)) where f(n)=0(g(n)) and g(n)=0(h(n)). [10+6]
2. (a) List some of the relative advantages and disadvantages of the partition algo-
rithm
(b) Write the Quicksort algorithm? Analize the time complexity in worst case.
[6+10]
3. (a) How many comparisons of edge weights will be done by the minimum spanning
tree algorithm, in total, if the input is a complete undirected graph with n
vertices and vi is the start vertex.
(b) Design a linear-time algorithm for solving the single source shortest path algo-
rithm for directed a cyclic graphs represented by their adjacency linked lists.
[6+10]
4. (a) Solve the following 0/1 Knapsack problem using dynamic programming
m=6, n=3, (w1 , w2 , w3 )=(2,3,3), (p1 , p2 , p3 )=(1,2,4)
www.andhracolleges.com
(b) Write an algorithm of all pairs shortest path problem. [8+8]
5. (a) Write a pseudocode for finding the strongly connected components of directed
graph. Also analyze its time complexity.
(b) Explain the Inorder traversal of a tree with an example. [8+8]
7. (a) What is Bounding? Explain how these bound are useful in Branch and Bound
methods.
(b) Describe the TSP in Branch and Bound. [8+8]
⋆⋆⋆⋆⋆
www.andhracolleges.com
1. (a) Give a monte-carlo algorithm for finding the majority element in an array.
(b) Show that f(n)=8n+128=0(n2 ).
prove that
m
2−di ≤ 1 and determine when the equality is true.
i=1
(b) Write and explain the control abstraction algorithm of divide and conquer.
3. (a) What is spanning tree? Explain the prim’s algorithm with an example.
[8+8]
[8+8]
2. (a) Suppose a binary tree has leaves ℓ1 ℓ2 .......lm at depths d1 , d2 ....dm respectively
P
(b) Explain the terms Feasible solution, optimal solution and objective function.
[10+6]
4. (a) Find one problem for which the principle of optimality does not hold. Explain
why the principle does not hold.
(b) Find the shortest path between all pairs of nodes in the following graph.
(Figure 4b) [8+8]
www.andhracolleges.com Figure 4b
5. (a) Write a pseudocode for finding the strongly connected components of directed
graph. Also analyze its time complexity.
(b) Explain the Inorder traversal of a tree with an example. [8+8]
7. (a) What is Bounding? Explain how these bound are useful in Branch and Bound
methods.
(b) Describe the TSP in Branch and Bound. [8+8]
Seminar Topics - Scholarships - Admission/Entrance Exam Notifications
1 ofUSA-UK-Australia-Germany-France-NewZealand
2 Universities List
⋆⋆⋆⋆⋆
www.andhracolleges.com
www.andhracolleges.com
Seminar Topics - Scholarships - Admission/Entrance Exam Notifications
2 ofUSA-UK-Australia-Germany-France-NewZealand
2 Universities List
www.andhracolleges.com
1. (a) Define omega notation. Explain the terms involved in it. Give an example.
(b) Show that f1 (n)×f2 (n) = 0(g1 (n)×g2 (n) wheref1 (n) = 0(g1 (n) and f2 (n) =
0(g2 (n)).
2. (a) Write and explain the control abstraction for Divide and conquer.
(b) Suggest refinements to mergesort to make it in-place.
3. (a) What is spanning tree? Explain the prim’s algorithm with an example.
[10+6]
(b) Explain the terms Feasible solution, optimal solution and objective function.
[8+8]
[10+6]
4. (a) For the Travelling sales person algorithm show that the time complexity is
0(n2 2n ) and space complexity is O(n2n ).
(b) Write an algorithm of matrix chain multiplication. [8+8]
www.andhracolleges.com
its time complexity. [6+10]
7. (a) Explain the method of reduction to solve TSP problem using Branch and
Bound.
(b) Explain the principles of FIFO Branch and Bound. [8+8]
⋆⋆⋆⋆⋆
www.andhracolleges.com
1. (a) Define omega notation. Explain the terms involved in it. Give an example.
(b) Show that f1 (n)×f2 (n) = 0(g1 (n)×g2 (n) wheref1 (n) = 0(g1 (n) and f2 (n) =
0(g2 (n)).
2. (a) Write and explain the control abstraction for Divide and conquer.
(b) Suggest refinements to mergesort to make it in-place.
3. (a) What is spanning tree? Explain the prim’s algorithm with an example.
[10+6]
(b) Explain the terms Feasible solution, optimal solution and objective function.
[8+8]
[10+6]
www.andhracolleges.com
C 4 9 ∞ 18
D 10 3 2 ∞
6. (a) Draw the state space tree for m coloring when n=3 and m=3
(b) Write a recursive backtracking algorithm. [8+8]
7. Write the LCBB algorithm for the 0/1 Knapsack problem. Also Analyse its com-
plexity. [16]
⋆⋆⋆⋆⋆