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: 04 Sep 2008 Posted By: Sriram Member Level: Diamond
|
2008 Andhra Pradesh State Jawaharlal Nehru Technological University B.Tech ADVANCED DATA STRUCTURES AND ALGORITHMS Set No. 4 Question paper
Code No: R059211201 Set No. 4
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) Explain about the static variable?
(b) Explain about the static functions and static classes in detail with a program.
[8+8]
2. (a) What special considerations do we need to know about when I use Virtual
Inheritance?
(b) What special considerations do we need to know about when I inherit from a
class that uses virtual inheritance?
(c) What special considerations do I need to know about when I use a class that
uses virtual inheritance? [5+5+6]
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) What is a heap ? Differentiate between heap and binary search tree.
(b) Show that log3n is O(n1/3).
(c) Briefly explain about Hashing. [5+5+6]
5. (a) Explain the linear probing method in Hashing? Explain its performance analy-
sis?
(b) What is hashing with Chains? Explain? Compare this with Linear Probing?
[8+8]
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. Prove the equation T( N ) + a T ( N /b ) + ?(NklogpN) [16]
Where a1, b1 and P0 is
T(N) = O(Nlog
b a)ifa > bk
O(Nklogp+1N) if a = bk
O(NklogpN) if a < bk.
1 of 2
Code No: R059211201 Set No. 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]
? ? ? ? ?
2 of 2
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
|