Question paper-Madurai Kamraj University (MKU) 2006-2nd Year M.C.A -

M.C.A 2nd Year May 2006

PAPER-V DATA STRUCTURE USING C++

Time: 3 hours maximum: 100marks

PART A ans all ques. (8x5=40 marks)

1. (a) discuss the basics of C++ languages. Or (b) elaborate abstract data types? provide
example.

2. (a) explain the array as an Abstract Data kinds in detail. Or (b) explain the string as an
Abstract Data kind in detail.

3. (a). explain about templates in C++. Or (b). discuss in detail about inheritance.

4. (a). elaborate singly linked lists? define how to represent them in C++. Or (b) what
are virtual functions? provide examples.

5. (a). elaborate circular lists? provide examples. Or (b). provide a brief account on linked
stacks and queues.

6. (a). explain in detail about static hashing. Or (b). provide a detailed description about
Binomial Heaps.

7. (a) What is a AVL Trees? provide examples. Or (b) explain in detail about optimal binary
search trees.

8. (a) elaborate B trees? provide examples. Or (b). define the features of Heap structures

PART B ans ALL ques. (5*12=60 marks)

9. (a) discuss the following: I) Data Abstraction and encapsulation II) system life cycle.

10. (a) elaborate doubly linked lists? define how to represent them in C++. Or (b).
define the following: I) A reusable linked list class. II) Dynamic binding in C++.

11. (a). elaborate binary trees? discuss the different binary tree traversals with
examples. Or (b). provide a detailed description on threaded Binary Trees.

12. (a). explain in detail about optimal Binary search trees. Or (b). Write notes on the
Following: I) AVL Trees. II) B-Trees.

13. (a) explain the different features of Hashing. Or (b). provide a detailed account on Heap
Structure.

Earning:   Approval pending.