Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
5 views1 page

Nr-Design and Analysis of Algorithms

This document outlines the examination paper for the M.Tech I Semester in Design and Analysis of Algorithms at Jawaharlal Nehru Technological University Hyderabad. It includes a variety of questions covering topics such as virtual functions, inheritance, sorting algorithms, graph algorithms, dynamic programming, and complexity theory. Students are required to answer any five questions, with all questions carrying equal marks.

Uploaded by

sudhakar k
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views1 page

Nr-Design and Analysis of Algorithms

This document outlines the examination paper for the M.Tech I Semester in Design and Analysis of Algorithms at Jawaharlal Nehru Technological University Hyderabad. It includes a variety of questions covering topics such as virtual functions, inheritance, sorting algorithms, graph algorithms, dynamic programming, and complexity theory. Students are required to answer any five questions, with all questions carrying equal marks.

Uploaded by

sudhakar k
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

www.jntuworld.

com

Code No: A5801


NR
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
M.Tech I Semester Examinations, October/November 2011
DESIGN AND ANALYSIS OF ALGORITHMS
(COMPUTER SCIENCE AND ENGINEERING)
Time: 3hours Max. Marks: 60
Answer any five questions
All questions carry equal marks
---

1.a) What is a virtual function? What are the implications of making a function a pure virtual
function?
b) What are the different forms of inheritance? Give an example for each. [6+6]

2.a) Discuss union and find algorithms.


b) Define Heap. Briefly explain about Heap sort with neat example. [6+6]

D
3.a) Write and explain the control abstraction for Divide and Conquer.
b) Briefly explain Merge Sort Algorithm with suitable example and derive its Time

4.
Complexity.

R L [6+6]

Write and explain the Kruskal’s algorithm, applying the algorithm construct a minimal
spanning tree for graph given bellow. [12]

1 10 2

O
30
45

U W 40
50

N T 25 5 35
3

J 20

6
55
15

5. Discuss the dynamic programming solutions for the problems of


a) Reliability design and
b) Traveling salesperson problem. [6+6]

6.a) Briefly explain about DFS and BFS graph traversal techniques.
b) Briefly explain about Bi-Connected components. [6+6]

7.a) Briefly explain 8-queen problem using backtracking. Explain its application.
b) Briefly explain graph coloring using backtracking. [6+6]

8.a) Compare and contrast between NP-HARD and NP-COMPLETE.


b) Briefly explain Cooks-theorem. [6+6]

******
www.jntuworld.com

You might also like