Anna University - DATA STRUCTURES AND OBJECT ORIENTED PROGRAMMING IN C++ - Nov / Dec 2010 Question Paper

Third Semester
Electronics and Communication Engineering
(Regulation 2008)

Time : Three hours Maximum : 100 Marks
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 Object
Oriented 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. (12)
(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)

No comments:

Post a Comment