II B.Tech I Semester Supplementary Examinations, February 2007ADVANCED DATA STRUCTURES & ALGORITHMS

II B.Tech I Semester Supplementary Examinations, February 2007ADVANCED DATA STRUCTURES & ALGORITHMS( Common to Information Technology and Computer Science & SystemsEngineering)Time: 3 hoursMax Marks: 80Answer any FIVE QuestionsAll Questions carry equal marks. . . . .
1. (a) What is di. between malloc()/free() and new/delete.
(b) What are the access privileges in C++. What is the default access level.
(c) What is destructor.(d) What is passing by reference.[4+4+4+4]
2. (a) What’s the deal with operator overloading.
(b) What are the benefits of operator overloading.
(c) What are some examples of operator overloading.
(d) What operators can/cannot be overloaded.[4+4+4+4]
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.[5+5+6]
4. (a) What are the applications of stack explain with an example.
(b) Explain the list representation of a tree by means of an example.
(c) Mention some common computing times for algorithms in order of increasingdi.culty.[5+5+6]
5. (a) What is a dictionary. Define the abstract data type for it. Write the abstractclass for the dictionary.
(b) Give the applications of dictionary or dictionary with duplicates in whichsequential access is desired.[8+8]
6. What is a Binary search tree. Provide a specification for the abstract data typeBSTree(binary search tree with duplicates). Define a C++ abstract class thatcorresponds to this ADT. Write a program to insert a pair into a binary searchtree.[16]
7. Write and explain a non recursive algorithm for post order traversal of a Binarytree with an example.[16]
8. (a) Explain the Job sequencing with deadlines with an example using the greedyapproach.