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: 08 Jan 2009 Posted By: pradeep Member Level: Diamond
|
2005 Jawaharlal Nehru Technological University III B.Tech I Semester Supplementary Examinations, May 2005 DESIGN AND ANALYSIS OF ALGORITHMS Question paper
Code No: OR310556 OR
III B.Tech I Semester Supplementary Examinations, May 2005
DESIGN AND ANALYSIS OF ALGORITHMS
( Common to Computer Science & Engineering and Information
Technology)
Time: 3 hours Max Marks: 70
Answer any FIVE Questions
All Questions carry equal marks
? ? ? ? ?
1. (a) Write a pseudo code for the implementation of UNION instruction using linked
list. Explain the working of the implementation.
(b) Explain the usefulness of the following fundamental operations on serts
i. MIN
ii. DELETE
iii. FIND
iv. UNION
v. INSERT
2. Explain the strassen’s matrix multiplication concept with an example.
3. (a) Write Prim’s algorithm under the assumption that the graphs are represented
by adjacency lists.
(b) Analyze precisely the computing time and space requirements of your new
version of Prim’s algorithm using adjacency lists.
4. Use an AVL tree as the basis of an algorithm ot execute MIN, UNION, and
DELETE on sets consisting of integers 1 through n, using O(log n) steps per oper-
ation.
5. (a) Show that the computing time of algorithm OBST is O(n2).
(b) Write an algorithm to construct the optimal binary search tree T given the
roots
R(i, j),
0 I J n . Show that this can be done in time O(n).
6. Write and explain an algorithm to determine whether the two binary trees T and U
are equivalent. Two binary trees are equivalent if they are structurally equivalent
and data in corresponding nodes of T and U are same.
7. (a) Define the term branch and bound technique Explain it with an Example.
(b) Explain Properties of LC - Search.
8. What is interpolation? Explain Lagrange interpolation algorithm & Newtonian
Interpolation algorithm.
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
|