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: satish Member Level: Gold Posted Date: 12 Feb 2008
|
2007 Jawaharlal Nehru Technological University B.E Computer Science ADVANCED DATA STRUCTURE II B.Tech I Semester Supplementary Examinations, February 2007 set 2 Question paper
|
|
|
Code No: R059210503 Set No. 2
II B.Tech I Semester Supplementary Examinations, February 2007
ADVANCED DATA STRUCTURE
( Common to Computer Science & Engineering and Electronics &
Computer Engineering)
Time: 3 hours
Answer any FIVE Questions
All Questions carry equal marks
? ? ? ? ?
Max Marks: 80
1. (a) What are the two steps that happen with delete p?
(b) What are the advantages of new operator than malloc in C?
(c) Explain about the C++ classes in detail and design a class for playing cards?
[5+5+6]
2. What is polymorphism? Explain about different types of polymorphism in C++
with suitable examples.
3. (a) How can we provide printing for an entire hierarchy of classes?
(b) How can we open a stream in binary mode?
(c) How can we “reopen” std::cin and std::cout in binary mode?
[16]
[5+5+6]
4. Write a C ++ program using stack ADT that reads an infix expression, converts
the expression to postfix form and evaluates the postfix expression. [16]
5. Define the abstract class for dictionary? Write the methods f ind, insert, erase used
in dictionary? Explain the time complexities to perform above three operations?
[16]
6. (a) What is an AVL search tree? How do we define the height of it? Explain
about the balancef actor associated with a node of an AVL tree.
(b) Explain how an AVL tree can be used to sort a sequence of n elements in O
(n log n) time.
7. (a) Describe the Btrees?
Explain the advantages of Btrees.
[8+8]
(b) Prove that let T be a red black tree with n interval nodes then no node has
depth greater than 2 log(n+1). [8+8]
8. (a) Write an algorithm for the kmp flow chart construction? Compute the performance
of an algorithm.
(b) What are the properties of standard trie. [10+6]
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
|