Code No: X0523 II B.Tech I Semester (R07) Supply Examinations, May

Transcription

1 SET a) What do you mean by static variable and static function? Give an example? b) Write short notes on copy constructor. 2. Explain the pitfalls of a) operator overloading. b) Abstract class. c) Virtual base class. 3. a) Write C++ functions for PUSH and POP operations done on a stack. b) Convert the following expression (A+B)*C/D+E^ F/G into postfix form. 4. a) Compare Extendible hashing Vs Linear Hashing. b) How is a node inserted into a skip list? 5. a) Write the abstract data type specification of max priority queue. b) Implement max priority in C++ using unordered linked list. 6. a) Draw the figure of a binary search tree (BST) after inserting the numbers 45, 49, 94, 5, 9, 48 and 2 in the given order. b) Explain the procedure for insertion in a BST. Using the above tree insert 10 and 46 with figures and explanation after each insertion 7. Develop a concrete C++ class redblacktree that derive from abstract class bstree(binary search tree). Your implementation must have O (log n) for insert, delete, find. 8. Draw the figure illustrating the comparisons done by the B-M pattern-matching algorithm for the case when the text is aaabaadaabaaa and the pattern is aabaaa and not counting comparisons made to compute last function.

2 SET a) Write a program that demonstrates how certain exception types are not allowed to be thrown b) What is purpose of new operator and differentiate the new operator with the malloc() function 2. a) Explain the concept of generic programming. b) What is the advantage of using streams for I/O operations in C++? c) How can protected members of a class become inheritable? 3. Implement a stack using pointers in C a) Write the C++ code for Skip List class. b) Write the function to find an element in a skip list. 5. a) Implement max priority queue using ordered linked list. b) State the time complexity for insertion and deletion operations in this implementation with explanation. 6. a) Explain the difference between ordinary, complete and full binary search trees (BST) with respect to worst case complexity for insertion, deletion and search operations. b) Write a C++ function template for deleting a node in a BST. 7. Develop a concrete C++ class indexedredblacktree that derive from abstract class indexedbstree(binary search tree). Your implementation must have O (log n) for insert, delete, find. 8. Draw the figure illustrating the comparisons done by the KMP pattern-matching algorithm for the case when the text is aaabaadaabaaa and the pattern is aabaaa and not counting comparisons made to compute the failure function.

3 SET a) What is reference variable? Explain with an example about the usage of reference variable. b) What is the purpose of default arguments? Explain with an example. Does default arguments concept is allowed for constructor? 2. a) Can a destructor be virtual? Can a constructor be virtual? Explain. b) Explain and illustrate the use of private inheritance through suitable example. 3. a) Write the algorithm to convert infix expression into postfix form. b) Convert the following expression A+(B*C-(D/E-F)*G)*H into postfix. Show the stack status in tabular column. 4. a) What is a Skip List? Explain briefly. b) Illustrate how searching for an element is done in a skip list with an example. 5. State different means of implementing priority queues. Discuss time complexity for insertion and deletion operations for each one of them. Which is the best? 6. a) What is an AVL tree? b) How are AVL trees represented? Give a figure (height 4) which shows this representation. 7. a) Write a insertion algorithm for red black tree. Also analyze its complexity b) Compare and contrast splay tree and binary tree with suitable example. 8. Compute the table representing last function used in the BM pattern matching algorithm for the pattern string the quick brown fox jumped over a lazy cat assuming the following alphabet ={a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z}.

4 SET a) What do you mean by dynamic initialization of objects? How is dynamic initialization of Objects achieved? Explain with example. b) With an example explain how an object is passed to a function. 2. a) Write a C++ program to use a base class pointer to point to an object of derived Class without the need for type casting? b) Explain pointers to base and derived classes. 3. a) Translate, by inspection, each infix expression into its equivalent prefix expression i) (A-B)*(D/E) ii) (A+B-D)/(E-F)+G b) Evaluate the postfix expression * 12 4 / - 4. a) Define collision. What are the approaches for collision resolution? Discuss briefly. 5. Give a figure that represents a max heap with a height 4. State all the steps needed to be done with figures and explanation for different cases of insertion 6. a) Explain in detail different balance factors that may result while inserting an element into an AVL search tree. b) The following figure represents a AVL search tree. Rewrite the figure with balance factors by the side of each node. Insert elements 25, 62 and 92 into the tree in that order. Show where each insertion starts and what corrections are to be done to the tree when needed. 1 of 2

5 SET a) Prove that let T be the red-black tree with n internal nodes, then no nodes has depth 2 log(n+1). b) Prove that the amortized time to splay a tree with root T at node X is at most 3(R (T)-R (X)+1=O (log N). 8. Assuming that the characters in alphabet can be enumerated and can be index array. Arrays give an O (m+ ) time method for constructing the last function from an m-length pattern string P. 2 of 2