# LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

```LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034
M.C.A. DEGREE EXAMINATION – COMPUTER APPLICATIONS
FIRST SEMESTER – NOVEMBER 2010
CA 1800 - DATA STRUCTURES USING C++
Date : 30-10-10
Time : 1:00 - 4:00
Dept. No.
Max. : 100 Marks
PART – A
10 x 2 = 20
1. Write any four features of C++.
2. Define Token. List its types.
3. State the use of this pointer.
4. Define file. List the file stream classes.
5. Define Linked list.
6. Define Stack. Write any four applications of stack.
7. What are threaded binary trees?
8. What are AVL trees?
9. Define graph .What are the types of graph?
10. What is spanning tree?
PART – B
5 x 8 = 40
11.a. Explain the different operators used in C++.
(OR)
b. Explain the OOP’s principles.
12.a. Define Polymorphism. List its types and explain any one type of polymorphism
with example.
(OR)
b. Explain the frequently used manipulators for formatting.
13.a. Explain the following:
i. operations on Queue.
ii. types of Queue.
(OR)
b. Sort the elements 101,356,201,478,909,564,772,603,807 using
i. Quick sort
14.a Explain Threaded Binary trees with an example.
(OR)
b. Explain the different Hash functions.
15.a Find the minimum spanning tree for the following graph using
1
i.
Kruskul’s algorithm
ii.
Prim’s algorithm
0
5
1
2
2
6
2
7
3
25
10
14
12
4
11
5
15
6
(OR)
b Explain the dijiskstra’s algorithm for finding the shortest path for the following
graph
V1
1
6
2
V2
V3
3
2
4
V4
5
2
V5
PART – C
Answer any TWO questions
2 X 20 = 40
2
(Q. No 16 is compulsory)
16. a. Sort the following elements using Max Heap sort algorithm
6,8,24,17,22,25,18,35,40,2,32,1,4,10.
b. Perform insertion in a B tree of order 5 for the following data:
AGFBKDHMJESIRXCLNTUP
17. a. Explain the following with example:
i. Constructor Overloading ii. Types of Constructors.
b. “ ios class functions and manipulators are used for formatting the output”- Explain with example.
18.a. Explain the following:
i. Operations of Stack .
ii. convert the infix to postfix notation
A+(B*C-(D/E^F)*G)+H
b. Explain DFS algorithm with suitable example
**************
3
*************
4
```