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 Date: 31 Aug 2008 Posted By: prashanth beerelli Member Level: Diamond
|
2005 Jawaharlal Nehru Technological University Information Technology II B.Tech. I Semester Supplementary Examinations, May -2005, DESIGN AND ANALYSIS OF ALGORITHMS Question paper
Code No: RR210504 Set No.2
II B.Tech. I Semester Supplementary Examinations, May -2005
DESIGN AND ANALYSIS OF ALGORITHMS
( Common to Computer Science & Engineering, Information Technology
and Computer Science & Systems Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
? ? ? ? ?
1. (a) What do you mean by performance analysis of an algorithm? Explain.
(b) What do you mean by the input size of a problem? Explain its significance.
2. (a) Show that the procedure SEARCH of the Binary Search algorithm gives the
smallest expected search time if all the elements in the set are sorted.
(b) Write the non-recursive Binary search algorithm.
3. Explain the algorithm for Job sequencing with deadlines. Applying the same, find
the solution for the instance n = 4, (p1.....p4)=(100,10,15,27) and (d1.....d4)=(2,1,2,1).
4. Given 3 sets {1, 3, 5, 7}, {2, 4, 8} and {6} in which n=8 with external names 1, 2 and
3 respectively with the corresponding internal names 2, 3, and 1.
(a) Write the data structures for UNION-FIND algorithm using a linked list
(b) Write the data structures after UNION instruction.
5. Consider 4 elements a1 < a2 < a3 < a4 with q(0)=1/8, q(1)=3/16, q(2)=q(3)=q(4)=1/16;
p(1)=1/4, p(2)=1/8, p(3)=p(4)=1/16. Construct the table of values of W (i, j),
R (i, j) and C (i, j) computed by the algorithm to compute the roots of optimal
subtrees.
6. Write an algorithm to search a binary search tree T for an identifier X. Assume
that each node in T has 3 fields: LCHILD, DATA, and RCHILD. What is the
computing time of your algorithm?
7. (a) Write the algorithm for the post-order evaluation of game tree.
(b) Define the terms & -values, - pruning, deep - pruning, and
-cutoff.
8. (a) Explain the solution to the Traveling sales person problem using LCBB.
(b) Is the above technique applicable for a non-symmetric distance matrix? Sub-
stantiate.
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.
|
Advertise Here
|