VALLIAMMAI ENGNIEERING COLLEGE SRM Nagar, Kattankulathur DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK

VALLIAMMAI ENGNIEERING COLLEGE SRM Nagar, Kattankulathur 603203. DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK Degree & Branch : B.E E.C.E. Year & Semester : II / IV Section : ECE 1, 2 & 3 Subject Code : EC6301 Subject Name : OOPS AND DATA STRUCTURES Name of the Teacher : Ms. A. Lalitha, Ms. N. Meenakshi and Ms. V. Prema UNIT - I DATA ABSTRACTION & OVERLOADING PART A S. No 1 Infer the features of Object Oriented Programming. BTL -4 Analyzing 2 Distinguish between Procedure Oriented Programming and Object Oriented programming. BTL -2 Understanding 3 Which is used for data hiding in C++? List its types. BTL -1 Remembering 4 Collect the use of scope resolution operator. BTL -1 Remembering 5 Assess the control structures used in C++. BTL -5 Evaluating 6 Define a class and object BTL -1 Remembering 7 Differentiate between structures and class. BTL -2 Understanding 8 Analyze the theme behind Encapsulation and Data Abstraction. BTL -4 Analyzing 9 Name the access modes used within a class. BTL -1 Remembering 10 Summarize polymorphism and its types. BTL -5 Evaluating 11 Create a C++ code to swap two variable using reference variables in function. BTL -6 Creating 12 Illustrate constructor and its characteristics. BTL -3 Applying 13 Show various types of constructors with example. BTL -3 Applying 14 Point out the characteristics of member functions. BTL -4 Analyzing 15 Generalize about friend function. BTL -6 Creating 16 Quote the properties of a static data member and function. BTL -1 Remembering 17 Discuss about proxy class and container class BTL -2 Understanding 18 Demonstrate function overloading and operator overloading. BTL -3 Applying Page 1

19 Give the types of operator overloading with an example. BTL -2 Understanding 20 Describe any four operators that cannot be overloaded in C++. BTL -1 Remembering PART B S. No 1 Discuss in detail about the basic concepts of object oriented programming. (13) BTL -2 Understanding 2 Compare the concept of constructor and destructor? Explain with suitable example the different types of constructors in C++. (13) BTL -4 Analyzing 3 Define a supplier class. Assume that the items supplied by any given supplier are different and varying in number. Use dynamic memory allocation in the constructor function to achieve the solution. (13) BTL -1 Remembering 4 i) Write a Program For Fibonacci Series Using Loop In C++. (10) ii) Write a program to swap two numbers in C++. (3) BTL- 1 Remembering i) Describe in detail about structure and compare the members of 5 structure and class with an example program. BTL -1 Remembering ii) Examine in detail about friend function with an example. 6 7 8 9 10 11 12 Develop a program to get the student details and print the same using pointers to objects and pointers to members of a class. Create a class student. And use appropriate functions and data members. i) Assess the advantages of using default arguments Explain with example program. ii) Write a member function and friend function to test the subtraction of two complex numbers in C++. i) Express a C++ program to find the mean value of a given number using friend function. ii) Express a Program to Find Prime Number Using For Loop In C++. What is a proxy class and identify container classes and integrators with suitable code? i) Demonstrate the ways in which member function of the class can be derived and called using a suitable example program. ii) Apply an example to static members. Differentiate between pointer to constant and constant pointers? Give an example program and explain it. i) Give a program to interpret how a static data is accessed b y a static member function. ii) Express a member function to extend the concept of matrix addition, simple addition and string concatenation by overloading + operator. (13) BTL-6 Creating BTL -5 Evaluating BTL- 2 Understanding (13) BTL -1 Remembering BTL- 3 Applying (13) BTL- 4 Analyzing BTL-2 Understanding Page 2

13 14 Illustrate about Unary Operator and Binary Operator Overloading with program. i) Connect function overloading concept with an example program. ii) Point out the concept of reference variables. With example (13) BTL -3 Applying BTL -4 Analyzing PART C 1 2 Consider A book shop maintains the inventory of books that are being sold at the shop. The list includes details such as author, title, price, publisher and stock position. Whenever a customer wants a book, the sales person inputs the title and author and the system searches the list and displays whether it is available or not. If it is not, an appropriate message is displayed. If it is, then the system displays the book details and requests for the number of copies required. If the requested copies are available, the total cost of the requested copies is displayed; otherwise the message required copies not in stock is displayed. Deduce a system using a class called books with suitable member functions and constructors. Use new operator in constructors to allocate memory space required. Create a base class called shape. Use this class to store to store two double type values that could be used to compute the area of figures. Derive two specific classes called triangle from the base shape. Add to the base class, a member function get_data() to initialize base class data members and another member function display_area() to compute and display the area of figures. Make display_area() as a virtual function and redefine this function in the derived classes to suit their requirements. Using these three classes, design a program that will accept dimensions of a triangle or a rectangle interactively, and display the area. Remember the two values given as input will be treated as lengths of two sides in the case of rectangles, and as base and height in the case of triangles, and used as follows: Area of rectangle = x * y Area of triangle = ½ * x * y (15) BTL -5 Evaluating (15) BTL-6 Creating UNIT-II INHERITANCE AND POLYMORPHISM PART-A S. No 1 Define Message Passing. BTL -1 Remembering Page 3

2 There are several restrictions in C++ while using static keyword. Support your views. BTL -5 Evaluating 3 Create syntax for overriding. BTL -6 Creating 4 Demonstrate on how a private member be made inheritable? BTL -3 Applying 5 List out the types of inheritance. BTL -1 Remembering 6 Give the syntax for inheritance. BTL -2 Understanding 7 When did you use the multi-level inheritance? BTL -1 Remembering 8 Examine multiple inheritances. BTL -1 Remembering 9 Infer concept of Hierarchical inheritance. BTL -4 Analyzing 10 Assess about Hybrid inheritance. BTL -5 Evaluating 11 Describe cross casting and down casting. BTL -1 Remembering 12 Illustrate the role of constructors and destructors in derived classes. BTL -3 Applying 13 Identify the syntax for virtual base class. BTL -1 Remembering 14 Differentiate Compositions versus. Inheritance. BTL-4 Analyzing 15 Discuss about virtual function. BTL -2 Understanding 16 Apply your understanding about this pointer. Write a sample code to show the usage of this pointer in C++. BTL -3 Applying 17 Generalize the term Abstract base class. BTL -6 Creating 18 Extend your views about Abstract class and concrete class. BTL -2 Understanding 19 Compare virtual function and pure virtual function. BTL -4 Analyzing 20 Summaries thevirtual destructor. BTL -2 Understanding PART-B S. No 1 Interpret the various types of Inheritance with suitable example program. (13) BTL -2 Understanding 2 Develop a C++ code to construct classes of a person name and age as public properties, account details as private properties and percentage of mark as protected properties. Construct the class with sports details of the person. Construct a class to rank the based on the equal weightage to academic and sports details. Use inheritance concept. (13) BTL -6 Creating Infer a student class. Inherit that into MCAStudent class and NonMCAStudent. MCA Students inherits into GLSStudents and 3 NonGLSStudents. A function HowPracticalHours can only be applied to MCAStudents. We have a base class Student pointer to a (13) BTL -4 Analyzing GLSStudentobject. Usedynamic_cast to check that NonMCA Students do not Show PracticalHours. 4 List out the use of template? Write an overloaded function template called max( ), which will find the maximum of any two given integers. (13) BTL -1 Remembering 5 Discuss in detail about casting class pointers and member functions. (13) BTL -2 Understanding Page 4

6 Examine the different forms of inheritance supported in C++? Discuss on the visibility of base class members in privately and publicly inherited (13) BTL -1 Remembering classes. 7 Criticize class object to Base and Base to class object conversions using C++ with suitable examples. (13) BTL-5 Understanding i) Discover your understanding about this pointer? Explain with 8 example. BTL- 3 Applying ii) Show your understanding about concreate classes with example. 9 Express the abstract classes? Give an example (with the program) to illustrate the use of abstract class. (13) BTL -2 Understanding 10 Explain virtual functions and pure virtual functions with example. What are the rules associated with virtual functions? (13) BTL -4 Analyzing 11 i) Describe in detail about Dynamic Binding with example. ii) Define virtual destructor? Explain the use of it with an example. BTL -1 Remembering 12 i) When constructor overloading is used confer with example. ii) Identify Dynamic initialization through constructors.with example BTL- 1 Remembering 13 Apply your understanding about static binding and dynamic binding. (13) BTL- 3 Applying 14 Differentiate Overloading and Overriding with an example program. (13) BTL- 4 Analyzing PART C 1 Test the code and correct the errors. Write the corrected code and output. #include<iostream.h> class room float mwidth; float mlength; public: room() } room(float w, float h) :mwidth(w), mlength(h) } operator float() return (float)mwidth * mlength; } float getwidth() } (15) BTL-5 Understanding Page 5

float getlength() return mlength; } }; void main() room objroom1(2.5, 2.5); float ftotalarea; ftotalarea=objroom1; cout << ftotalarea; } 2 Assume that a bank maintains two kinds of accounts for customers, one called as savings account and the other as current account. The savings account provides compound interest and withdrawal facilities but no cheque book facility. The current account provides cheque book facility but no interest. Current account holders should also maintain a minimum balance and if the balance falls below this level, a service charge is imposed. Prepare a class account that stores customer name, account number and type of account. From this derive the classes cur_acct and sav_acct to make them more specific to their requirements. Include necessary member functions in order to achieve the following tasks: a) Accept deposit from a customer and update the balance. b) Display the balance. c) Compute and deposit interest. d) Permit withdrawal and update the balance. e) Check for the minimum balance, impose penalty, necessary, and update the balance. Do not use any constructors. Use member functions to initialize the class members. Rewrite the code with these modifications. (15) BTL -6 Creating UNIT III LINEAR DATA STRUCTURES PART-A S. No 1 Where did you use the Data structure in the computer system? BTL -1 Remembering 2 Name ADT (Abstract Data Type) operations. BTL -1 Remembering 3 Summarize linear data structure and Non linear data structure. BTL -5 Understanding 4 List the different types of Linked List. BTL -1 Remembering Page 6

5 contrast between array and linked list BTL -2 Understanding 6 Explain the term single linked list. BTL -4 Analyzing 7 Show how to create a new node. BTL -3 Applying 8 Generalize the use of header pointer and Null pointer in a linked list. BTL -6 Creating 9 Apply your understanding about dummy header. BTL -3 Applying 10 Illustrate about circular linked list. BTL -3 Applying 11 Define push and pop operations. BTL -1 Remembering 12 When did you use the stack in the computer system? BTL -1 Remembering 13 Differentiate stack and queue. BTL -4 Analyzing 14 Associate the conditions that are followed in the array implementation of queue. BTL -2 Understanding 15 Differentiate between stack and queue and give its application. BTL -2 Analyzing 16 Point out any two data structures used in Operating System. BTL -4 Analyzing 17 Tabulate prefix, infix and postfix notations. BTL -1 Remembering 18 Rewrite the following expression into postfix and prefix forms. A+B*(C-D)/(P-R) BTL -6 Creating 19 Evaluate the value of the expression ab+c*d- using stack. BTL -5 Evaluating 20 Give ADT representation used to evaluate arithmetic expressions? BTL -2 Understanding PART B S. No 1 Explain Array based implementation of list with an example program. (13) BTL -4 Analyzing 2 Summarize in detail about linked list ADT with suitable example. (13) BTL -2 Understanding 3 Name the Queue ADT operation for insertion and deletion routine in linked lists. (13) BTL -1 Remembering 4 i) Demonstrate the concept of pointer implementation and cursor implementation. ii) Show a C++ function to test whether a linked list is empty using cursor implementation. BTL 3 Applying 5 i) Point out the application of stack. ii) Infer in detail about Circular linked list. BTL 4 Analyzing 6 Describe in detail about the implementation stack using linked list. (13) BTL 1 Remembering 7 Identify the ADT operation for insertion and deletion routine in stack using array implementation. (13) BTL-1 Remembering 8 Explain the array and linked list implementation of queue operation (13) BTL -3 Applying 9 i) Write the applications of queue. ii) Differentiate between stack and queue. BTL 2 Understanding 10 Evaluate the following postfix expression 2 4 + 3 * 1 5-8 3 + * -. (13) BTL -5 Evaluating 11 Givea procedure to convert an infix expression a+b*c+(d*e+f)*g to postfix notation. (13) BTL -2 Understanding Page 7

12 13 14 i) Tabulate the process of postfix valuation with an example. ii) Identify balancing symbols with example. Analyze the process of conversion from infix expression to postfix using stack. Formulate an algorithm to add and subtract two polynomials P1 and P2. BTL -1 Remembering (13) BTL -4 Analyzing (13) BTL -6 Creating PART C 1 A deque is a data structure consisting of a list of items, on which the following operations are possible: Push (X,D): Insert item X on the front end of deque D. Pop(D): remove the front item from deque D and return it. Inject(x,D): Insert item X on the rear end of deque D. Eject(D): Remove the rear item from deque that take O(1) time per operation. Combine the above mentioned operations and write a C++ code to formulate deque operations. 2 Recommend a suitable C++ code to swap two adjacent elements by adjusting only the pointers using: a. Singly linked lists. b. Doubly linked lists. (15) BTL -6 Creating (15) BTL -5 Evaluating UNIT-IV NON-LINEAR DATA STRUCTURES PART A S.No 1 Compose the term height and depth of the tree. BTL -6 Creating 2 Show the number of trees possible with 3 nodes? BTL -3 Applying 3 Define Binary tree and list its properties? BTL -1 Remembering 4 Describe the two methods of binary tree implementation? BTL -1 Remembering 5 Calculate the maximum number of nodes in a binary tree of Height H is 2 H+1-1. BTL -3 Applying 6 Point out the applications of binary tree. BTL -4 Analyzing 7 Grade the different type of tree traversal. BTL -5 Evaluating 8 Name the type of binary tree. BTL -1 Remembering 9 Generalize the term equivalence relation. BTL -6 Creating 10 Discuss about union operation. BTL -2 Understanding 11 Label the different types of union. BTL -1 Remembering 12 Tabulate Graph and Acyclic graph. BTL -1 Remembering 13 Compare and contrast in-degree and out degree of the graph. BTL -4 Analyzing Page 8

14 Demonstrate an acyclic graph. BTL -3 Applying 15 List out the different ways of representing graph. BTL -1 Remembering 16 Analyze the two traversal strategies used in traversing graph. BTL -4 Analyzing 17 Differentiate path and Cycle of the graph. BTL -2 Understanding 18 Associate DFS and BFS. BTL -2 Understanding 19 Express the tree and a graph. BTL -2 Analyzing 20 Summarize about connected components. BTL -5 Evaluating PART B S.N o Write short note on the following terms related to tree: i) Path (2) ii) Degree (2) 1 iii) Level (3) BTL -1 Remembering iv) Leaves (2) v) Child (2) vi) Height (2) 2 Apply your understanding to explain about binary search tree and draw the binary search tree for the following input list 60, 25,75,15,50,66,33,44. Trace an algorithm to delete the nodes 25, 75, (13) BTL -3 Applying 44 from the tree. 3 Infer the various tree traversal and predict a binary tree with Preorder:ABCDEFGHI and Inorder:BCAEDGHF (13) BTL -4 Analyzing 4 Summarize the two applications of tree with a neat example. (13) BTL -2 Understanding 5 Conclude the types of tree traversal methods? Explain it with example and deduce a routine for each of them. (13) BTL -5 Evaluating i) Express your understanding by finding the inorder, preorder and postorder form for the following graph: (10) 6 BTL - 2 Understanding 7 8 (3) ii) Give some applications of trees. Analyze in detail the implementation of Binary Search Tree and perform its operations. (13) BTL - 4 Analyzing i) Point out and evaluate the dynamic equivalence problem. BTL -4 Analyzing Page 9

ii) Explain the path compression algorithm and analyze the Union/Find algorithm used. 9 Describe in detail about the smart union algorithm. (13) BTL -1 Remembering 10 Define graph? List out the different ways for representing the graph and explain them with example? (13) BTL -1 Remembering i) Tabulate the following graph using breadth first search. (8) 11 BTL - 1 Remembering ii) Examine BFS and DFS with suitable example. i) Illustrate the following graph using depth first search. (8) 12 BTL - 3 Applying (5) ii) Demonstrate a C++ routine for BFS and DFS. 13 Interpret in detail about BFS and DFS with suitable examples. (13) BTL -2 Understanding 14 Compose an example in detail about connected component. (13) BTL -6 Creating PART C 1 Generalize the trem binary search tree and do the following operations. a) Show the result of inserting 3,1,4,6,9,2,5,7 into an initially empty binary search tree. b) Show the result of deleting the root. (15) BTL -6 Creating 2 Consider the following graph: a) Measure the shortest path from A to all other vertices for the following (8) graph: b) Evaluate the shortest unweighted path from B to all other vertices for the graph. BTL -5 Evaluating Page 10

UNIT-V SORTING AND SEARCHING PART A Level Competence Level Competence 1 Express your views about sorting. BTL -2 Understanding 2 Label the two main classifications of sorting based on the source of data. BTL -1 Remembering 3 Analyze the applications of external and internal sorting. BTL -4 Analyzing 4 Identify the purpose of quick sort. BTL -1 Remembering 5 Assess the advantage of merge sort. BTL -5 Evaluating 6 Define median three partitioning. BTL -1 Remembering 7 Associate divide and conquer technique with merge sort. BTL -2 Understanding 8 Examine the purpose of insertion sort. BTL -1 Remembering 9 Summarize about merge sort. BTL -2 Understanding 10 List out the advantages of merge sort. BTL -1 Remembering 11 Point out the key characteristics of binary search. BTL -4 Analyzing 12 Differentiate linear search and binary search. BTL -2 Understanding 13 Name the techniques used to choose the pivot element for quick sort. BTL -1 Remembering 14 Infer why quick sort is more efficient than merge sort. BTL -4 Analyzing 15 Show the advantage of merge sort. BTL -3 Applying 16 Create algorithm for quick sort and insertion sort. BTL -6 Creating 17 Support your views about insertion sort with example BTL -5 Evaluating 18 Trace the steps of insertion sort 12, 19, 33, 26, 29, 35, 22. Illustrate the total number of comparisons made during sorting. BTL -3 Applying 19 Calculate the time complexity of quick sort and binary search. BTL -3 Applying 20 Rearrange the following numbers 45,22,6,77,47,8 using insertion sort. BTL -6 Creating PART B Page 11

Le vel Competence Level Competence 1 Identify the correct sequence 3, 1, 4,7,5,9,2,6,5 using Insertion sort with (13) BTL -1 Remembering routine. 2 Explain in detail about insertion sort with example and code. (13) BTL -5 Evaluating 3 Point out an algorithm for quick sort with example. (13) BTL -4 Analyzing 4 Summarize quick sort algorithm and trace the following list of numbers: (13) BTL -2 Understanding 90,77,60,99,55,88,66, 10. 5 Examine Merge sort routine and trace the following numbers 1, 13, 24, (13) BTL -1 Remembering 26, 2, 15, 27, 38. 6 Associate an algorithm for merge sort and give its worst case, best case (13) BTL -2 Understanding and average case analysis. 7 Demonstrate linear search & binary search algorithm in detail with an (13) BTL -3 Applying example for each. 8 Differentiate linear search algorithm with binary search algorithm. (13) BTL -4 Analyzing 9 Write C++ code and explain the implementation of linear search technique with an example. 10 Generalize your view about bubble sort technique with suitable example. PART C (13) BTL -1 Remembering (13) BTL -6 Creating 11 Discuss Merge sort and quick sort with example. (13) BTL - 2 Understanding 12 13 14 Describe binary search algorithm and search the element 22 from the given list 2,7,14,4,17,5,19,8,22,9,25,12,27,14,28,33. Illustrate the technique insertion sort for the following 9,7, 6, 15, 16, 5, 10, 2 5,26,18, 11. Analyze the algorithm for i) Quick sort ii) Insertion sort (13) (13) BTL - 1 BTL - 3 BTL - 4 Remembering Applying Analyzing 1 a. Conclude how quick sort processes the input 142, 543, 123, 65, 453, 879, 572, 434, 111, 242, 811, 102. b. For the quicksort implementation, what is the running time when all keys are equal? 2 Given an array containing only 0s and 1s in sorted order. Create a strategy using any of the sorting techniques to do the following: a. Find the first occurrence of 1 in array. b. Find the last occurance of 0. c. Find number of instances of 0s in sorted array. (15) BTL -5 Evaluating (15) BTL -6 Creating Page 12