My Profile
Active Members
TodayLast 7 Days
more...
Awards & Gifts
Online Exams
Fresher Jobs
Our fresher job section is exclusively for fresh graduates! Find jobs for freshers in major Indian
cities including Bangalore, Chennai, Hyderabad, Pune or Kochi
Resources
Find educational articles, blogs, discussion threads and other resources.
Colleges
Find details about any college in India or search for courses.
|
Download Model question papers & previous years question papers
|
Posted By: yamini Member Level: Gold Posted Date: 12 May 2008
|
2007 Jawaharlal Nehru Technological University B.Tech Computer Science & Engineering II II design and analysis of algorithms aug/sep 2007 set III Question paper
|
|
|
Code No: R05220502 Set No. 3
II B.Tech II Semester Supplimentary Examinations, Aug/Sep 2007
DESIGN AND ANALYSIS OF ALGORITHMS
(Computer Science & Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
? ? ? ? ?
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)). [10+6]
2. (a) Write and explain the control abstraction for Divide and conquer.
(b) Suggest refinements to mergesort to make it in-place. [8+8]
3. (a) What is spanning tree? Explain the prim’s algorithm with an example.
(b) Explain the terms Feasible solution, optimal solution and objective function.
[10+6]
4. (a) For the Travelling sales person algorithm show that the time complexity is
0(n22n) and space complexity is O(n2n).
(b) Write an algorithm of matrix chain multiplication. [8+8]
5. (a) Explain the properties of strongly connected components.
(b) Write a non-recursive algorithm of In-order traversal of a tree and also analyze
its time complexity. [6+10]
6. Describe Backtracking technique to m-coloring graph. Explain with an example.
[16]
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]
8. (a) Explain the classes of P and NP.
(b) Write a nondeterministic Knapsack algorithm. [8+8]
Return to question paper search
|
|
|
Submit Previous Years University Question Papers and make money from adsense revenue sharing program
Are you preparing for a university examination? Download model question papers
and practise before you write the exam.
|
Watch TV Channels
Watch Asianet TV onlineKairali TV in InternetSurya TV onlineAmritha TV Channel
|