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: 28 Jan 2009 Posted By: chikka sravana kumar Member Level: Gold
|
2008 Jawaharlal Nehru Technological University Computer Science & Engineering II B.Tech. I Semester Regular Examinations, November -2008 ADVANCED DATA STRUCTURES,set 3 Question paper
1. (a) What do you mean by dynamic initialization of object? Why do we need to
do this?
(b) How Is dynamic initialize of objects achieved?
(c) Write a C++ program for generating Fibonacci series? [4+4+8]
2. (a) What are all the restrictions and limitations in overloading operators?
(b) Write a C++ program to demonstrate overloading add(+) and compare ()
operators on strings? [8+8]
3. (a) What is the key difference between algorithm and program?
(b) Explain the eight asymptotic identity rules?
(c) Explain the steps to implement the following operations of singly-linked list
without head node using illustrative examples?
i. removing at front
ii. removing at end
iii. removing node before a specified node
iv. removing node after a specified node. [2+4+2+2+3+3]
4. (a) What is skip list? How it is different from a linear linked list?
(b) Explain with a neat example the insertion operation?
(c) Explain with a neat example the deletion operation? [4+6+6]
5. (a) If a d-heap is stored as an array, for an entry located in position k, where are
the parents and children?
(b) Write a C++ function to build a binary heap? How many number of compar-
isons required for it? [8+8]
6. Start with empty binary search tree:
(a) Insert the keys 15,5,20,14,30,22,2,4,5,7,9,18 in this order. Draw the tree fol-
lowing each insert using binary search insert method.
(b) Delete the keys 2, 4, 5 in the order and draw the tree following each deletion.
[8+8]
7. (a) Define splay trees? Explain splay operation using a suitable example?
(b) Start with a splay tree that is a 10- node full binary tree; the keys are1-10.
Remove the keys in the order 10, 9, 8... 1. Draw your tree immediately
following each deletion. [8+8]
8. Write an Huffman coding algorithm and prove that Huffman’s algorithm constructs
an optimal prefix code for a string of length n with d distinct characters in O(n +
d log d)? [16]
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
|