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

R05 Set No. 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. (b) Explain the single source shortest path using Greedy method with an example. [8+8] · 4. (a) Let w ...
Download PDF
72KB Sizes 4 Downloads 64 Views
Report

Recommend Documents

R05 Set No. 2
[16] · 4. What are channel,circuit and half circuit in the context of satellite telemetry sys- .... 3. Describe the conditions for total internal reflection within a fibre. [16].
R05 Set No. 2
(b) Describe a DC Servo Motor with a neat sketch. [8+8] · 4. (a) What is a timing belt? Discuss the use of Timing belts in power transmission? (b) Discuss various ...
R05 Set No. 2
(b) In a slider crank mechanism the crank is making an angle of 600 with IDC. The crank and connecting rod lengths are 100mm and 300mm respectively.
R05 Set No. 2
Code No: R05412304. R05. Set No. 2. IV B.Tech I Semester Examinations,November 2010 · DOWNSTREAM PROCESSING · Bio-Technology · Time: 3 hours.
R05 Set No. 2
(b) Consider any two networks of your choice which support Circuit switching or ... (b) Which is more efficient, circuit switching or packet switching? Why?
R05 Set No. 2
(a) What is the difference between logical I/O and device I/O? (b) Explain feed back scheduling policy. [8+8] · 2. (a) How can logical address space be ...
R05 Set No. 2
kerosene, and fuel oil must be limited as also shown in this table. There are no ... equipment is a function of x, the size (horsepower ) of the motor, namely.
R05 Set No. 2
(b) A 30m chain was found to be 15cm too long after chaining 1524m. The same ... 7. (a) Explain compensating and cumulative errors in chain Surveying.
R05 Set No. 2
R05. Set No. 2. II B.Tech I Semester Examinations,MAY 2011 · MATHEMATICS-III · Common to ICE, E.COMP.E, ETM, E.CONT.E, EIE, ECE, EEE · Time: 3 hours.
R05 Set No. 2
(b) What is meant by displacement function? (c) Give the importance of Pascal Triangle. [4+6+6] · 3. Determine the displacements at nodes and the stresses in ...
R05 Set No. 2
The horizontal distance between u/s face and center line of drain holes is 8 m. ... (c) Cut-off trench ... Bed width of parent channel U/S / D/S = 45 m/40 m. [16].
R05 Set No. 2
Also draw the relevant circuit diagram. (b) Draw the resistive model of a CMOS inverter and explain its behavior for. LOW and HIGH outputs. [8+8]. 8. (a) It is necessary to identify the position of mechanical disk, when rotates with a step of 450. Gi
R05 Set No. 2
R05. Set No. 2. II B.Tech I Semester Regular Examinations,November 2010 · MATHEMATICS-III · Common to ICE, E.COMP.E, ETM, E.CONT.E, EIE, ECE, EEE.
R05 Set No. 2
4. Give the syntax for 'awk'. Discuss about the selection criteria in awk. How to · embed action in to this command. Explain with examples. [16] · 5. Write about different Unix locking techniques. [16] · 6. (a) What are the differences between shell
R05 Set No. 2
of Rs. 1,500 would be deposited in this fund under an ordinary annuity plan. All · money in the fund can be .... (b) Discounted cash flow · (c) Net present worth ... would last for 10 years. A worn-out storage tank of capacity equivalent to the new.
R05 Set No. 2
R05. Set No. 2. III B.Tech I Semester Examinations,May 2011 · WEB TECHNOLOGIES · Information Technology ... that describes your college. The paragraph ...
R05 Set No. 2
(b) What is the necessity of heat treatment after carburizing? Explain. On what ... (b) What is the difference in heat treatment between 18% Ni and the 25% Nickel.
R05 Set No. 2
is subjected to a load of 200 kN, find the stresses developed in the two materials. ... Compare the values of max. and minimum hoop stresses for a cast steel ...
R05 Set No. 2
The cores of two identical transformers A and B carry alternating fluxes whose instantaneous values are (0.01 sin 314t)W and 0.012 (1.1 sin 628t+0.1 sin 1884t).
R05 Set No. 2
at 0.8 p.f. lagging and 15A at 0.6 p.f. lagging respectively, both expressed ... (b) A single-phase motor takes a current of 10 amps at a p.f. of 0.707 lagging.
R05 Set No. 2
If the tensile stress is not to exceed 17MPa, find the safe. u.d.l. which the beam can carry. Also find maximum compressive stress. Draw the sketch showing the ...
R05 Set No. 2
beans with the above mentioned beans. [16]. 8. (a) Explain the basic structure of an XML document and highlight the advantages of XML over HTML. 3.
R05 Set No. 2
Code No: R05320201. R05. Set No. 2. III B.Tech II Semester Examinations,December 2010 ... Common to ICE, ETM, E.CONT. ... H(s) = 1/(s + 0.5) (s2 +0.5s+2).
R05 Set No. 2
2. I B.Tech Examinations,December 2010 · C PROGRAMMING AND DATA STRUCTURES · Common to CE, BME, IT, AE, ICE, E.COMP.E, ETM, E.CONT.E, EIE,.