This action might not be possible to undo. Are you sure you want to continue?

BooksAudiobooksComicsSheet Music### Categories

### Categories

### Categories

### Publishers

Scribd Selects Books

Hand-picked favorites from

our editors

our editors

Scribd Selects Audiobooks

Hand-picked favorites from

our editors

our editors

Scribd Selects Comics

Hand-picked favorites from

our editors

our editors

Scribd Selects Sheet Music

Hand-picked favorites from

our editors

our editors

Top Books

What's trending, bestsellers,

award-winners & more

award-winners & more

Top Audiobooks

What's trending, bestsellers,

award-winners & more

award-winners & more

Top Comics

What's trending, bestsellers,

award-winners & more

award-winners & more

Top Sheet Music

What's trending, bestsellers,

award-winners & more

award-winners & more

P. 1

daa|Views: 292|Likes: 4

Published by andhracolleges

See more

See less

https://www.scribd.com/doc/30770524/daa

09/28/2010

text

original

com The Complete Information About Colleges in Andhra Pradesh

Set No: 1

Code No: V3123 / R07 III B.Tech. I Semester Regular Examinations, November – 2009 DESIGN AND ANALYSIS OF ALGORITHMS (Computer Science & Engineering)

1.

2. 3. 4. 5.

**www.andhracolleges.com
**

Answer Any Five of the following All Questions carry equal marks ***** (a) what is ment by algorithm? Explain about the criteria’s for an algorithm. (b) Calculate space and time complexity for matrix multiplication algorithm.[8+8] (a) Explain about simple find and union algorithms with examples. (b) What is meant by connected components? Explain.[10+6] (a) write prim’s algorithm for minimum spanning tree? (b) Find the time complexity for minimum spanning tree.[12+4] Using algorithm OBST compute W (i, j), R (i, j) and C (i, j), 0<=I < j <=4 for the identifier Set (a1,a22,a3,a4)= (end, goto, print, stop) with P(1)=1/20,P(2)=1/5, P(3)=1/10, P(4)=1/20, Q(0)=1/5,Q(1)=1/10,Q(2)=1/5,Q(2)=1/20,Q(4)=1/20. Using the R (i, i) s construct the optimal binary search tree.[16]

Time: 3 hours

Max. Marks: 80

Write an algorithm for quick sort? Find the best, average and worst case complexity for quick sort.[16]

6.

7. 8.

**www.andhracolleges.com
**

(a) Modify the general backtracking control abstraction, so that they find only a Single solution rather than all solutions. (b) What is meant by graph coloring? Explain with example. [8+8] Answer the following (a) Non deterministic algorithms (b) NP-Hard problems (c) NP-Complete problems [5+6+5] @@@

Write an algorithm for LC branch and bound to find minimum cost answer node. And also explain using an example.[16]

Seminar Topics - Scholarships - Admission/Entrance Exam Notifications USA-UK-Australia-Germany-France-NewZealand Universities List www.andhracolleges.com Engineering-MBA-MCA-Medical-Pharmacy-B.Ed-Law Colleges Information

www.andhracolleges.com The Complete Information About Colleges in Andhra Pradesh

Code No: V3123 / R07

Set No: 2

III B.Tech. I Semester Regular Examinations, November – 2009 DESIGN AND ANALYSIS OF ALGORITHMS (Computer Science & Engineering) Answer Any Five of the following All Questions carry equal marks *****

1.

2. 3) 4.

**www.andhracolleges.com
**

Time: 3 hours (a) what are the characteristics of an algorithm? Explain. (b) Write an algorithm for Armstrong number and also alculate space and time complexity? [8+8] (a) Explain about union algorithm using Weighting Rule. (b) What is meant by biconnected components? Explain.[10+6] Write an algorithm for merge sort? Find the best, average and worst case Complexity for merge sort.[16] (a) Find an optimal solution to the knapsack instance n=7, M=15(p1, p2, p7) = (10, 5, 15, 7, 6, 18, 3) and (w1, w2, w7) = (2, 3, 5, 7, 1, 4, 1)? (b) Write an algorithm for knapsack problem? [8+8] Using algorithm OBST compute W (i, j), R (i, j) and C (i, j), 0<=I < j <=4 for the identifier Set (a1,a22,a3,a4)= (end, goto, print, stop) with P(1)=3, P(2)=3, P(3)=1, P(4)=1, Q(0)=2,Q(1)=3,Q(2)=1,Q(2)=1,Q(4)=1. Using the R (i, i) s Construct the optimal binary search tree.[16]

Max. Marks: 80

5.

6.

7. 8.

**www.andhracolleges.com
**

(a) what is meant by Hamiltonian cycle? Explain. (b) Write an algorithm to find all Hamiltonian cycles for a given graph? [8+8] Write an algorithm for FIFO branch and bound to find minimum cost answer node. And also explain using an example.[16] Answer the following (a) Cook’s theorem (b) NP-Hard problems (c) NP-Complete problems[5+6+5] @@@

Seminar Topics - Scholarships - Admission/Entrance Exam Notifications USA-UK-Australia-Germany-France-NewZealand Universities List Engineering-MBA-MCA-Medical-Pharmacy-B.Ed-Law Colleges Information

www.andhracolleges.com

www.andhracolleges.com The Complete Information About Colleges in Andhra Pradesh

Code No: V3123 / R07

Set No: 3

III B.Tech. I Semester Regular Examinations, November – 2009

1. 2. 3.

**www.andhracolleges.com
**

Time: 3 hours Answer Any Five of the following All Questions carry equal marks ***** Explain about asymptotic notations with 3 examples for each.[16] (a) Explain about find using Collapsing Rule. (b) What is meant by biconnected components? Explain[10+6] (a) Show how procedure QUICKSORT sorts the following the sets of keys: (1, 1, 1, 1, 1, 1, 1) and (5, 5, 8, 3, 4, 3, 2). (b) Write control abstraction for divide and conquer method? [10+6] (a) write kruskal’s algorithm for minimum spanning tree? (b) Find the time complexity for kruskal’s algorithm?[12+4] Design a three stage system with device types D1, D2 and D3. The costs are $30, $15 and $20 respectively. The cost of the system is to be no more than $105. The reliability of each device type is 0.9, 0.8, and 0.5.[16] (a) what is meant by graph coloring? Explain with example. (b) Write an algorithm for finding all m-colorings of a graph. [8+8]

DESIGN AND ANALYSIS OF ALGORITHMS (Computer Science & Engineering)

Max. Marks: 80

4. 5.

6. 7.

**www.andhracolleges.com
**

Consider the traveling salesperson instance defined by the cost matrix: 7 3 12 8 3 6 14 9 5 8 6 18 9 3 5 11 18 14 9 8 (a) Obtain the reduced cost matrix (b) Draw the state space tree and describe the progress of the method from node to node.[4+12] Answer the following (a) non deterministic algorithms (b) NP-Hard classes (c) NP-Complete classes[5+6+5] @@@

Seminar Topics - Scholarships - Admission/Entrance Exam Notifications USA-UK-Australia-Germany-France-NewZealand Universities List Engineering-MBA-MCA-Medical-Pharmacy-B.Ed-Law Colleges Information

8

www.andhracolleges.com

www.andhracolleges.com The Complete Information About Colleges in Andhra Pradesh

Code No: V3123 / R07 III B.Tech. I Semester Regular Examinations, November – 2009

Set No: 4

1.

**www.andhracolleges.com
**

Time: 3 hours Answer Any Five of the following All Questions carry equal marks ***** (a) Explain the procedure for calculating time and space complexity. (b) Write an algorithm for strong number and also alculate space and time Complexity[8+8] (a) Explain about simple find and union algorithms with examples. (b) What is meant by connected components? Explain.[12+4] (a) Explain about Strassen’s matrix multiplication. (b) Write control abstraction for divide and conquer method?[10+6] (a)Write greedy algorithm to generate shortest paths? (b) Write control abstraction for greedy method[10+6] Design a three stage system with device types D1, D2 and D3. The costs are $30, $15 and $20 respectively. The cost of the system is to be no more than $105. The reliability of each device type is 0.9, 0.8 , 0.5.[16]

DESIGN AND ANALYSIS OF ALGORITHMS (Computer Science & Engineering)

Max. Marks: 80

2.

3. 4. 5.

6.

7.

**www.andhracolleges.com
**

Consider the traveling salesperson instance defined by the cost matrix: 20 30 10 11 15 16 4 2 3 5 2 4 19 6 18 3 16 4 7 16 (a) Obtain the reduced cost matrix (b) Draw the state space tree and describe the progress of the method from node to node.[4+12] Answer all of the following (a) Cook’s theorem (b) NP-Hard classes (c) NP-Complete classes[5+6+5] @@@

(a) Modify the general backtracking control abstraction, so that they find only a single solution rather than all solutions (b) Explain about n-Queens problem. [8+8]

8.

Seminar Topics - Scholarships - Admission/Entrance Exam Notifications USA-UK-Australia-Germany-France-NewZealand Universities List www.andhracolleges.com Engineering-MBA-MCA-Medical-Pharmacy-B.Ed-Law Colleges Information

Eamcet Agriculture Last Ranks Cutoffs Andhracolleges Eamcet 2013 cutoffs

Polycet2014 Web Counselling Notification

Polycet 2014 St Certificatates Verification Dates

Polycet 2014 Sc Bc Oc Certificatates Verification Dates

ICET 2014 Preliminary Key Primary Key Andhracolleges

JEE Main Advanced 2014 Paper I Maths Paper Answer Solutions

JEE Main Advanced Paper I Answer Key 25 May 2014

JEE Advanced 2014 Paper I PHYSICS Paper Answer Solutions

JEE Advanced 2014 Paper I Chemistry Paper Answer Solutions

Eamcet 2014 Medical Jntu Preliminary Key Andhracolleges

Eamcet 2014 Engineering Jntu Preliminary Key Andhracolleges

Eamcet 2014 Medical Question Paper With Key Solutions Andhracolleges

Eamcet 2014 Engineering Key Solutions Andhracolleges

Eamcet 2014 Medical Question Paper Andhracolleges

Eamcet 2014 Engineering Key Solutions

Andhracollege Eamcet 2014 Engineering Question Paper with key solutions

Polycet 2014 Question Paper

Eamcet 2013 Engineering Paper Key

Eamcet 2013 Engineering Paper

Eamcet 2012 Medical Paper Key

Eamcet 2012 Medical Paper

Eamcet 2012 Engineering Paper Key

Eamcet 2012 Engineering Paper

Eamcet 2011 Engineering Paper

Eamcet 2010 Medical Paper

- Read and print without ads
- Download to keep your version
- Edit, email or read offline

Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

CANCEL

OK

You've been reading!

NO, THANKS

OK

scribd

/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->