LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034
M.C.A DEGREE EXAMINATION – COMPUTER APPLICATIONS
FIRST SEMESTER – NOV 2006
CA 1800 - DATA STRUCTURES USING C++
Date & Time : 26-10-2006/1.00-4.00
Dept. No.
Answer All Questions (10X2=20)
1. What are the data types used in C++?
2. List the operators that are used in C++.
3. What are all the stream classes.
4. How detecting end-of-file?
5. What is meant by queue?
6. Define radix sort.
7. Draw a binary tree.
8. What is threaded binary trees?
9. Define (a)NODE (b)EDGE with respect to graph theory.
10. What is spanning forest?
PART-B
Answer All Questions (5X8=40)
11) a. Define scope resolution operator? Explain with an example.
Or
b. Explain function overloading with example.
12) a. Discuss the concept of polymorphism.
Or
b. Write short notes on unformatted I/O operations?
13) a. Explain the concept of queue.
Or
b. Discuss the concept of insertion sort.
14) a. How binary search is performed? Explain with example.
Or
b. Write briefly on B-tree.
15) a. Explain connected and biconnected components in graph.
Or
b. Discuss various stages in kruskal’s algorithm.
PART-C
Answer Any Two Questions (2X20=40)
16) a. Explain the various control structures of C++ with examples.
b. Discuss different inheritance methods with examples.
17) a. Explain doubly linked lists with an example.
b. Discuss briefly on external sorting.
18) a. Write briefly on Red-black tree.
b. Discuss briefly on graph representations and traversal.
_______________________
AL 08
Max. : 100 Marks