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. 1 Question paper
|
|
|
Code No: R059211201 Set No. 1
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 is a friend function? Explain the advantages and disadvantages of it?
(b) What is static member function? Explain it’s limitations. [8+8]
2. (a) Explain the concept of virtual functions in C++ with suitable examples.
(b) Explain the concept of operator overloading in C++. [8+8]
3. (a) Write a program to replace all the occurrences of a word with some other word
in a given file.
(b) Write a program to check whether the given string is palindrome or not. [8+8]
4. Write an algorithm for transposing a given matrix of n × m size and determine the
time complexity of the algorithm by using Asymptotic notation method. [16]
5. (a) What is the structure to represent node in a skip list. Write the constructor
for skipList.
(b) Write a method in C++ to find a pair with key theKey in a dictionary using
skip list representation? What is its complexity? [8+8]
6. What is an AVL Tree? Explain about the different rotation patterns in AVL trees
for balancing with appropriate examples? [16]
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) If objects are selected in order of decreasing Vi/Wi then prove that the algo-
rithm Knapsack finds an optimal solution.
(b) Explain the Optimal binary search tree. [8+8]
? ? ? ? ?
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
|