R05210503 Advanced Data Structure B.Tech Question Paper : djriet.edu.in

Name of the College : Dasari Jhansi Rani Institute Of Engineering And Technology
University : JNTUK
Department : Computer Science And Engineering
Subject Code/Name : R05210503 – Advanced Data Structure
Year : 2008
Degree : B.Tech
Year/Sem : II/I
Website : djriet.edu.in
Document Type : Model Question Paper

Advanced Data Structure : https://www.pdfquestion.in/uploads/djriet.edu.in/2981-R05210503-ADVANCED-DATA-STRUCTURE.pdf

DJRIET Advanced Data Structure Question Paper

II B.Tech I Semester Supplimentary Examinations, November 2008 :
ADVANCED DATA STRUCTURE :
( Common to Computer Science & Engineering and Electronics & Computer Engineering)
Time: 3 hours
Max Marks: 80
Answer any FIVE Questions :

Related : Dasari Jhansi Rani Institute Of Engineering And Technology R05220402 Oop Through Java B.Tech Question Paper : www.pdfquestion.in/2977.html

Set – I

All Questions carry equal marks :
1. (a) Can you think of a situation where your program would crash without reaching the breakpoint which you set at the beginning of main()?
(b) When are copy constructors called?
(c) Can a copy constructor accept an object of the same class as parameter, instead of reference of the object? [5+5+6]
2. What is template? Explain about function templates and class templates with suitable examples. [16]

3. (a) What are some ways try / catch / throw can improve software quality?
(b) How can we handle a constructor that fails?
(c) How can we handle a destructor that fails. [5+5+6]

4. (a) Define a sparse matrix? Explain its representation? Write the program that gives the header for the class sparse Matrix which uses row major mapping of a sparse matrix into an arrayList.
(b) Write the methods get (theRow, the Column) and set (theRow, theColumn, theValue) for a sparse matrix. [10+6]

5. (a) What is Linear Probing? Write a C++ program that gives the data members and constructors for the hash table class that uses linear probing.
(b) Write the C++ program that gives the method search of a hash table. [8+8]

6. Define a Red-Black tree? Write the procedures to perform insertion, deletion in a Red-Black tree? [16]

7. (a) Describe deletion operation of a B-tree with an example.
(b) Prove that the height of a red black tree storing n items is O(logn). [8+8]
8. (a) Describe about search engine and inverted files.
(b) Explain the main features of Boyer-Moore algorithm. [10+6]

Set – II

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. What is template? Explain about function templates and class templates with suitable examples. [16]
3. (a) Explain about the formatted I/O in C++.
(b) Explain about the console I/O in C++. [8+8]
4. Define the Abstract data type for Stack. Write a C ++ program to implement stack ADT using linked list. [16]
5. (a) What is a dictionary? Define the abstract data type for it? Write the abstract class for the dictionary?
(b) Give the applications of dictionary or dictionary with duplicates in which sequential access is desired. [8+8]
6. Define a class called binarySearchTree to represent a Binary search tree. Extend this class by adding a public method outputInRange (Low,High) that outputs, in ascending order of key, all elements in a binary search tree whose key lies between Low and High. Use recursion and avoid entering sub trees that cannot possibly contain any elements with keys in desired range. [16]
7. (a) Describe deletion operation of a B-tree with an example.
(b) Prove that the height of a red black tree storing n items is O(logn). [8+8]
8. (a) Explain the boyar Moore algorithm with an example.
(b) What are the advantages and disadvantages of tries with respect to binary search tree. [10+6]