Wednesday, September 21, 2016

EC2202 Data Structures and Object Oriented Programming in C++ Nov Dec 2010 Question Paper

Anna University Chennai
Third Semester
Electronics and Communication Engineering
(Regulation 2008)
Time : Three hours Maximum : 100 Marks

Note: New Subject Code in R-2013 is EC6301

Answer ALL questions
PART A — (10 × 2 = 20 Marks)
1. What effects do the visibility labels private, protected and public have on the members of a class?
2. What are the advantages of operator overloading?
3. What is inheritance? What are its advantages?
4. Define virtual function.
5. Define stack. Mention the operations on stack.
6. What is binary heap? What are its types?
7. What is meant by an adjacency matrix?
8. State the properties of binary search tree.
9. What is sorting? How is sorting essential for data base applications?
10. What is meant by dynamic programming?
PART B — (5 × 16 = 80 Marks)
11. (a) (i) Compare and contrast Structured Programming and ObjectbOriented Programming. (8)
(ii) Distinguish between Data Encapsulation and Data Abstraction. (4)
(iii) Mention the purpose of Constructor and Destructor functions. (4)
(b) (i) Explain the control structures of C++ with suitable examples.
 (ii) Define function overloading with a simple example. (4)
12. (a) (i) Differentiate inheritance from polymorphism. (6)
(ii) Write a C++ program to illustrate the concept of hierarchical inheritance.(10)
(b) (i) What is the use of template? Write an overloaded function template called max( ), which will find the maximum of any two given integers. (8)
(ii) Explain the exception handling mechanism of C++ in detail. (8)
13. (a) (i) Explain the operations performed on queue in detail. Write a C++ program to implement these queue operations. (10)
(ii) Explain insertion, deletion and replacement of nodes in a heap. (6)
(b) (i) What are the advantages of linked list over array? (4)
(ii) Define Hashing. (2)
(iii) Write a C++ program to implement stack through linked list. (10)
14. (a) (i) Write an algorithm to traverse binary tree level by level, with each level of the tree being traversed from left to right. (10)
(ii) Explain spanning tree and minimal spanning tree with examples.(6)
(b) (i) Define AVL tree. Explain the operations on AVL tree with illustrations. (6)
(ii) Explain breadth first search algorithm for the traversal of any graph with suitable examples. Define time complexity of the algorithm. (10)
15. (a) (i) Explain heap sort with an illustration. (8)
(ii) Explain the greedy algorithm to find minimum spanning tree. (8)
(b) (i) Explain the insertion sort with its time complexity. (8)
(ii) Explain as to how divide and conquer technique can be applied for merge sort. (8)


Share This
Previous Post
Next Post

B.E Civil Engineer Graduated from Government College of Engineering Tirunelveli in the year 2016. She has developed this website for the welfare of students community not only for students under Anna University Chennai, but for all universities located in India. That's why her website is named as . If you don't find any study materials that you are looking for, you may intimate her through contact page of this website to know her so that it will be useful for providing them as early as possible. You can also share your own study materials and it can be published in this website after verification and reviewing. Thank you!


Pen down your valuable important comments below

Search Everything Here