Code No: R05321904
R05
Set No. 2
1. (a) Derive a time complexity of Quicksort in average case.
[8+8]
ld .
(b) Explain the divide and conquer method with an example.
in
III B.Tech II Semester Examinations,APRIL 2011 DESIGN AND ANALYSIS OF ALGORITHMS Electronics And Computer Engineering Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks ?????
2. (a) Explain live node, E-node and dead node with an example.
(b) Explain the method of reduction to solve TSP problem using Branch and Bound. [8+8] 3. (a) Prove that Prim’s algorithm finds a minimum spanning tree.
or
(b) Explain the single source shortest path using Greedy method with an example. [8+8]
4. (a) Let w = {5, 7, 10, 12, 15, 18, 20} and m=35. Find all possible subsets of w that sum to m. Draw the portion of the state space tree that is generated.
uW
(b) Compare and Contrast Brute force approach and Backtracking.
[10+6]
5. (a) Explain about cook’s theorem.
(b) Explain the strategy to prove that a problem is NP hard.
[8+8]
Aj
nt
6. (a) Find the shortest tour of a TSP for the following graph (figure 2a) using dynamic programming.
Figure 2a (b) Design a θ (n ) algorithm for finding an optimal Binary search tree. 2
[8+8]
7. (a) Explain the BFS algorithm with an example. (b) The Preorder and Postorder sequences of a binary tree do not uniquely define the binary tree. Justify the answer. [8+8] 8. (a) Write an algorithm to find the largest of given ‘n’numbers. Derive its time complexity. 1
Code No: R05321904
R05
Set No. 2
(b) Differentiate between profilling and debugging.
[10+6]
Aj
nt
uW
or
ld .
in
?????
2
Code No: R05321904
R05
Set No. 4
in
III B.Tech II Semester Examinations,APRIL 2011 DESIGN AND ANALYSIS OF ALGORITHMS Electronics And Computer Engineering Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks ????? 1. (a) Write an algorithm to find the largest of given ‘n’numbers. Derive its time complexity.
[10+6]
ld .
(b) Differentiate between profilling and debugging.
uW
or
2. (a) Find the shortest tour of a TSP for the following graph (figure 2a) using dynamic programming.
Figure 2a (b) Design a θ (n2 ) algorithm for finding an optimal Binary search tree.
[8+8]
3. (a) Explain live node, E-node and dead node with an example. (b) Explain the method of reduction to solve TSP problem using Branch and Bound. [8+8]
nt
4. (a) Let w = {5, 7, 10, 12, 15, 18, 20} and m=35. Find all possible subsets of w that sum to m. Draw the portion of the state space tree that is generated. (b) Compare and Contrast Brute force approach and Backtracking.
[10+6]
5. (a) Derive a time complexity of Quicksort in average case.
Aj
(b) Explain the divide and conquer method with an example.
[8+8]
6. (a) Prove that Prim’s algorithm finds a minimum spanning tree. (b) Explain the single source shortest path using Greedy method with an example. [8+8]
7. (a) Explain the BFS algorithm with an example. (b) The Preorder and Postorder sequences of a binary tree do not uniquely define the binary tree. Justify the answer. [8+8] 8. (a) Explain about cook’s theorem. 3
Code No: R05321904
R05
Set No. 4
(b) Explain the strategy to prove that a problem is NP hard.
[8+8]
Aj
nt
uW
or
ld .
in
?????
4
Code No: R05321904
R05
Set No. 1
1. (a) Explain about cook’s theorem.
[8+8]
ld .
(b) Explain the strategy to prove that a problem is NP hard.
in
III B.Tech II Semester Examinations,APRIL 2011 DESIGN AND ANALYSIS OF ALGORITHMS Electronics And Computer Engineering Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks ?????
2. (a) Derive a time complexity of Quicksort in average case.
(b) Explain the divide and conquer method with an example.
[8+8]
3. (a) Explain the BFS algorithm with an example.
or
(b) The Preorder and Postorder sequences of a binary tree do not uniquely define the binary tree. Justify the answer. [8+8] 4. (a) Write an algorithm to find the largest of given ‘n’ numbers. Derive its time complexity.
(b) Differentiate between profilling and debugging.
[10+6]
nt
uW
5. (a) Find the shortest tour of a TSP for the following graph (figure 2a) using dynamic programming.
Figure 2a (b) Design a θ (n ) algorithm for finding an optimal Binary search tree. 2
[8+8]
Aj
6. (a) Let w = {5, 7, 10, 12, 15, 18, 20} and m=35. Find all possible subsets of w that sum to m. Draw the portion of the state space tree that is generated. (b) Compare and Contrast Brute force approach and Backtracking.
[10+6]
7. (a) Prove that Prim’s algorithm finds a minimum spanning tree. (b) Explain the single source shortest path using Greedy method with an example. [8+8]
8. (a) Explain live node, E-node and dead node with an example.
5
Code No: R05321904
R05
Set No. 1
(b) Explain the method of reduction to solve TSP problem using Branch and Bound. [8+8]
Aj
nt
uW
or
ld .
in
?????
6
Code No: R05321904
R05
Set No. 3
1. (a) Explain live node, E-node and dead node with an example.
in
III B.Tech II Semester Examinations,APRIL 2011 DESIGN AND ANALYSIS OF ALGORITHMS Electronics And Computer Engineering Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks ?????
ld .
(b) Explain the method of reduction to solve TSP problem using Branch and Bound. [8+8]
uW
or
2. (a) Find the shortest tour of a TSP for the following graph (figure 2a) using dynamic programming.
Figure 2a (b) Design a θ (n2 ) algorithm for finding an optimal Binary search tree.
[8+8]
3. (a) Derive a time complexity of Quicksort in average case. (b) Explain the divide and conquer method with an example.
[8+8]
nt
4. (a) Let w = {5, 7, 10, 12, 15, 18, 20} and m=35. Find all possible subsets of w that sum to m. Draw the portion of the state space tree that is generated. (b) Compare and Contrast Brute force approach and Backtracking.
[10+6]
5. (a) Write an algorithm to find the largest of given ‘n’ numbers. Derive its time complexity.
Aj
(b) Differentiate between profilling and debugging.
[10+6]
6. (a) Explain about cook’s theorem. (b) Explain the strategy to prove that a problem is NP hard.
[8+8]
7. (a) Explain the BFS algorithm with an example. (b) The Preorder and Postorder sequences of a binary tree do not uniquely define the binary tree. Justify the answer. [8+8] 8. (a) Prove that Prim’s algorithm finds a minimum spanning tree.
7
Code No: R05321904
R05
Set No. 3
(b) Explain the single source shortest path using Greedy method with an example. [8+8]
Aj
nt
uW
or
ld .
in
?????
8
