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: Sriram Member Level: Diamond Posted Date: 04 Sep 2008
|
2008 Andhra Pradesh State Jawaharlal Nehru Technological University B.Tech ADVANCED DATA STRUCTURES AND ALGORITHMS Set No. 2 Question paper
|
|
|
Code No: R059211201 Set No. 2
II B.Tech I Semester Supplimentary Examinations, February 2008
ADVANCED DATA STRUCTURES AND ALGORITHMS
( Common to 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 Data abstraction?
(b) Difference between “C structure” and “C++ structure”.
(c) Diffrence between a “assignment operator” and a “copy constructor”.
(d) What is the difference between ?overloading? and “overridding”? [4+4+4+4]
2. (a) Explain the need for “Virtual Destructor”.
(b) Can we have “Virtual Constructors”? [8+8]
3. (a) What does throw; (without an exception object after the throw keyword)
mean? Where would we use it?
(b) How do we throw polymorphically?
(c) When we throw this object, how many times will it be copied? [5+5+6]
4. (a) Discuss briefly the asymptotic notations used for finding the complexity of
Algorithms.
(b) Write a C++ program to implement the sparse matrix. [8+8]
5. Define the abstract class for dictionary? Write the methods find, insert, erase used
in dictionary? Explain the time complexities to perform above three operations?
[16]
6. (a) Prove that the insertion of a new node in a red-black tree with n nodes in ?
(logn) time in the worst case.
(b) Derive the amortized complexity of a find, insert or delete operation performed
on a splay tree with n elements. [8+8]
7. (a) Find a necessary and sufficient condition for the root of a depth first search
for a connected graph to be an articulation point.
(b) Solve the following recurrence relation using substitution method [8+8]
T(n) = 1 where n <= 4
= 2T(pn)+logn where n > 4
8. (a) Show how Prim’s algorithm can be implemented using heap. What would be
the time complexity of the algorithm.
(b) What is the time complexity of traveling sales person problem using dynamic
programming. [10+6]
? ? ? ? ?
1 of 1
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
|