DISTANCE EDUCATION
M.Sc. DEGREE EXAMINATION, DECEMBER 2017.
Computer Science
DATA STRUCTURES USING
(2007 onwards)
Time Three hours Maximum 100 marks
SECTION A — (10 x 3 30 marks)
Answer ALL questions.
1. What is a Class?
2. Define the term "Constructor".
3. List out any three applications of stack.
4. Define Queue as an ADT.
5. Write down any three uses of circular linked list.
6. List out the operations performed on linked list.
7. What is a Tree?
8. List out any three operations on binary tree.
9. What is Big-O notation?
10. What is the complexity of binary search?
SECTION B — x 10 40 marks)
Answer any FOUR questions.
11. What are the different types of inheritance? Explain any
two types.
12. Write a program to arrange the given numbers in an
ascending order.
Sub. Code
13
DE-2791
2
SER
13. Write a procedure to convert infix expression into postfix
expression with example.
14. Write a procedure to add two polynomials and explain it.
15. Explain the linked storage representation of binary tree.
16. Write a procedure for bubble sort and explain it.
SECTION C — 15 30 marks)
Answer any TWO questions.
17. What is a stack? Explain the various operations
performed on stack.
18. What are tree traversals? Explain with examples.
19. Write a procedure for merge sort and explain with
examples.