Professional Documents
Culture Documents
1.
2.
Write a C++ code to display pen object initiated and pen object destroyed when class
for pen constructor and destructor are called.
3.
Write a C++ code to display an area of square or rectangle using function overriding.
4.
5.
6.
Find the maximum number of nodes in complete binary tree if d is the depth.
7.
8.
Give the representation of network of cities (Chennai, Delhi, Kolkata and Mumbai) as
weighted graph.
9.
10. What is the time complexity of quick sort and binary search?
11. (a)
PART B (5 x 16 = 80 Marks)
Write a member function and friend function to subtract two complex
numbers in C++.
(16)
Or
(b) Write a member function to perform matrix addition, simple addition and
string concatenation by overloading + operator.
12. (a)
(16)
Write a C++ code to construct classes of a person with name and age as
pubic properties, account details as private properties and percentage of
marks as protected property. Construct a class with sports details of person.
Construct a class to rank person based on the equal weightage to academic
and sports details. Use inheritance concept.
(16)
Or
(b) Explain Class Object to Base and Base to Class Object conversions using
13. (a)
(16)
Write a C++ code to sum up all odd numbers in a single linked list.
(16)
Or
(b) Write a C++ code to perform addition of two polynomials using link list form
14. (a)
of queue.
(16)
(16)
Or
(b) Write C++ code for the implementation of different types of tree traversals.
State few tree applications.
15. (a)
(16)
Write a C++ code to implement quick sort with suitable example. Write C++
code to implement linear search with suitable example.
(16)
Or
(b) Write C++ code to implement merge sort with suitable example. Write C++
code to implement binary search with suitable example.
(16)
Reg. No.
Question Paper Code : 77111
B.E./B.Tech. DEGREE EXAMINATION, APRIL / MAY 2015
Third Semester
Electronics and Communication Engineering
EC6301 OBJECT ORIENTED PROGRAMMING AND DATA STRUCTRUES
(Common to Biomedical Engineering and also common to Fourth Semester
Medical Electronics, Robotics and Automation Engineering)
(Regulation 2013)
Time : Three hours
1.
2.
3.
What is overriding?
4.
5.
What is ADT?
6.
7.
What is a tree?
8.
9.
(16)
Or
(b) What is the purpose of constructor and destructor? Explain with suitable
example the different types of constructors in C++.
12. (a)
(16)
(16)
Or
(b) What is virtual function? Explain with an example how late binding is (16)
achieved using virtual function.
13. (a)
Write a set of routines for implementing two stacks within a single array.
(16)
Or
(b) Write a set of routines for implementing queue using linked lists.
14. (a)
(16)
(16)
Or
(b) Illustrate the Depth First Search algorithm with a graph and explain.
15. (a)
(16)
Discuss the quick sort algorithm and apply the same for the following
numbers:
90, 77, 60, 99, 55, 88, 66.
(16)
Or
(16)
Reg. No.
Question Paper Code : 27188
B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER / DECEMBER 2015
Third Semester
Electronics and Communication Engineering
EC6301 OBJECT ORIENTED PROGRAMMING AND DATA STRUCTRUES
(Common to Biomedical Engineering and also common to Fourth Semester
Medical Electronics, Robotics and Automation Engineering)
(Regulation 2013)
Time : Three hours
1.
What is destructor?
2.
3.
4.
5.
Define ADT.
6.
7.
8.
9.
10. With an example compute the number of comparison, required to search an element
using binary search.
PART B (5 x 16 = 80 Marks)
11. (a)
(i)
(16)
Or
(b) (i)
12. (a)
(8)
(ii)
(8)
(i)
(8)
(ii)
(8)
Or
(b) (i)
13. (a)
(8)
(ii)
(8)
(i)
(8)
(ii)
(8)
Or
14. (a)
(i)
(ii)
(16)
How can you construct an expression tree? Describe your answer with
an example.
(8)
(4)
(4)
Or
(b) Describe in detail about breadth-first-search and depth-first-search in a graph. (16)
15. (a)
(16)
Or
(b) (i)
(ii)
(8)
(8)
Reg. No.
Question Paper Code : 57280
B.E./B.Tech. DEGREE EXAMINATION, MAY / JUNE 2016
Third Semester
Electronics and Communication Engineering
EC6301 OBJECT ORIENTED PROGRAMMING AND DATA STRUCTRUES
(Common to Biomedical Engineering and also common to Fourth Semester
Medical Electronics, Robotics and Automation Engineering)
(Regulation 2013)
Time : Three hours
1.
2.
3.
4.
5.
6.
7.
8.
9.
(16)
Or
(b) (i)
(4)
(ii)
(4)
(ii)
(8)
12. (a)
Consider the class network of above figure. The class master derives
information from both account and admin classes which in turn derive
information from the class person. Define all the four classes and write a
program to create, update and display the information contained in master
objects.
(16)
Or
13. (a)
(i)
Write the ADT operation for insertion and deletion routine in stack.
(ii)
(16)
(8)
(8)
Or
(b) Discuss about addition of two polynomials using linked list with necessary
ADT.
14. (a)
(16)
Draw the binary search tree for the following input list 25, 45, 12, 60, 75, 92,
10. Trace an algorithm to delete the nodes 25, 75, 10 from the tree.
(16)
Or
(b) Discuss types of graph traversal and explain each with suitable examples.
15. (a)
(16)
(i)
(8)
(ii)
(8)
Or
(b) Explain the binary search with sample program.
(16)