DISTANCE EDUCATION
M.Sc. (Computer Science)DEGREE EXAMINATION,
MAY 2018.
DATA STRUCTURES USING
(2007 onwards)
Time Three hours Maximum 100 marks
PART A — (10 x 3 30 marks)
Answer ALL questions.
1. Classify the data structures.
2. Write the rules for destructor.
3. Give an algorithm to insert an element in the stack.
4. What is the difference between stack and queue?
5. Write the advantages of circular list over singly linked
list.
6. Write an algorithm to delete an element in the linked list.

7. When the graph is said to be strongly connected?
Sub. Code
13
DE-3891
2
Wk16
8. Write the recursive procedure which returns nth
fibonacci number.
9. What is the average and worst case of bubble sort?
PART B — x 10 40 marks)
Answer any FOUR questions.
10. How classes are declared in Explain with an
examples.
11. Write a program to evaluate the postfix expression.
12. What is double linked list? Also explain the procedure to
insert and delete an element from the doubly linked list.
13. Describe the post order traversal with an example.
14. With an example, explain and develop a program for
binary search.
15. What is stack? Describe the applications of stack.
PART C — x 15 30 marks)
Answer any TWO questions.
16. Create a class MAT of size mxn. Define all possible
matrix operations for MAT type objects.
17. Explain the basic operations on binary search tree.
18. Describe the quick sort procedure with an example. Also
develop a program for the same.
————————