You are on page 1of 10

Reg. No.

Question Paper Code : 97058


B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER / DECEMBER 2014
Third Semester
Electronics and Communication Engineering
EC6301 OBJECT ORIENTED PROGRAMMING AND DATA STRUCTRUES
(Common to Biomedical Engineering)
(Regulation 2013)
Time : Three hours

Maximum : 100 Marks

1.

Answer ALL questions


PART A (10 x 2 = 20 Marks)
Write a C++ code to swap values of two variable using reference variables in function.

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.

Write a sample code to show the usage of this pointer in C++.

5.

Evaluate the value of expression a b + c * d using stack.

6.

Find the maximum number of nodes in complete binary tree if d is the depth.

7.

Write short notes on connected components.

8.

Give the representation of network of cities (Chennai, Delhi, Kolkata and Mumbai) as
weighted graph.

9.

How to perform union operation?

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.

B.BHUVANESWARAN / AP (SS) / CSE / REC - 2

(16)

Or
(b) Explain Class Object to Base and Base to Class Object conversions using

13. (a)

C++ with suitable example.

(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)

Explain BFS and DFS with suitable example.

(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.

B.BHUVANESWARAN / AP (SS) / CSE / REC - 3

(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

Maximum : 100 Marks


Answer ALL questions
PART A (10 x 2 = 20 Marks)

1.

What is a reference variable?

2.

What is a friend function?

3.

What is overriding?

4.

Why there is need for operator overloading?

5.

What is ADT?

6.

Write short notes on queue.

7.

What is a tree?

8.

How a graph is represented?

9.

What is meant by sorting?

10. What is time complexity?


PART B (5 x 16 = 80 Marks)
11. (a)

Describe the major component of object oriented programming with


illustrations.

(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)

What is inheritance? Discuss in detail about the various types of inheritances


in C++ with suitable examples.

(16)
Or

(b) What is virtual function? Explain with an example how late binding is (16)
achieved using virtual function.

B.BHUVANESWARAN / AP (SS) / CSE / REC - 4

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)

Discuss the different methods traversing a binary tree with algorithm.

(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

(b) Explain in detail about linear search algorithm with an example.

B.BHUVANESWARAN / AP (SS) / CSE / REC - 5

(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

Maximum : 100 Marks


Answer ALL questions
PART A (10 x 2 = 20 Marks)

1.

What is destructor?

2.

Define friend function.

3.

Differentiate private and protected members of a class.

4.

What is dynamic binding?

5.

Define ADT.

6.

What do you mean by queue ADT?

7.

What is binary tree?

8.

When a graph is said to be connected?

9.

How array elements are sorted using merge sort?

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)

Narrate on parameterized constructor and copy constructor with an


example for each of them.

(16)
Or

(b) (i)

12. (a)

What do you mean by function overloading and explain it with an


example.

(8)

(ii)

Elaborate on binary operator overloading with an example.

(8)

(i)

Explain base and derived classes with examples.

(8)

(ii)

Write a program to illustrate how constructors are implemented when


the classes are inherited.

B.BHUVANESWARAN / AP (SS) / CSE / REC - 6

(8)

Or
(b) (i)

13. (a)

Give an account on virtual functions with an example.

(8)

(ii)

Write a note on this pointer with an example.

(8)

(i)

Write a note on singly linked lists.

(8)

(ii)

Explain List ADT.

(8)
Or

(b) Explain the applications of stack in detail.

14. (a)

(i)

(ii)

(16)

How can you construct an expression tree? Describe your answer with
an example.

(8)

Discuss how sets are represented?

(4)

(iii) Explain union, find operations.

(4)

Or
(b) Describe in detail about breadth-first-search and depth-first-search in a graph. (16)

15. (a)

Explain quick sort in detail.

(16)
Or

(b) (i)
(ii)

Describe binary search in detail.

(8)

Explain linear search in detail.

(8)

B.BHUVANESWARAN / AP (SS) / CSE / REC - 7

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

Maximum : 100 Marks


Answer ALL questions
PART A (10 x 2 = 20 Marks)

1.

Define constructor. List the type of constructor.

2.

List the operator that cannot be overloaded.

3.

Write a simple C++ program to demonstrate the virtual functions.

4.

State about cast operator.

5.

Convert the infix expression a + b * c + (d * e + f) * g into postfix.

6.

Define sentinel nodes, header node and tail node.

7.

Draw expression tree for (a + b * c) + ((d * e + f) * g).

8.

What do you mean by articulation points?

9.

List the advantages of quick sort.

10. Which search is faster and why?


PART B (5 x 16 = 80 Marks)
11. (a)

Discuss about function overloading with varying number of arguments and


data types.

(16)
Or

(b) (i)

List the characteristics of friend function.

(4)

(ii)

Write short notes on destructor.

(4)

(ii)

Explain in detail about static class member with employee class


program.

B.BHUVANESWARAN / AP (SS) / CSE / REC - 8

(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

(b) Explain the polymorphism with example.

13. (a)

(i)

Write the ADT operation for insertion and deletion routine in stack.

(ii)

Explain the process of conversion from infix expression to postfix


using stack.

(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)

Write a C++ program to implement quick sort.

(8)

(ii)

Sort the sequence 4, 7, 2, 0, -8, 5 using insertion sort.

(8)

Or
(b) Explain the binary search with sample program.

B.BHUVANESWARAN / AP (SS) / CSE / REC - 9

(16)

B.BHUVANESWARAN / AP (SS) / CSE / REC - 10

You might also like