DISTANCE EDUCATION
M.Sc. (Computer Science) DEGREE EXAMINATION,
MAY 2016.
DATA STRUCTURES USING
(2007 onwards)
Time Three hours Maximum 100 marks
SECTION A — (10 3 30 marks)
Answer ALL questions.
1. How one-dimensional arrays are defined?
2. What is meant by Inheritance?
3. Mention the operations that can be performed on a
STACK.
4. Define Queue.
5. Give the purpose of a pointer in a Linked List.
6. What is meant by double linked list?
7. Define the following nodes in a tree
Root
Leaf.
8. How a tree can be traversed?
9. What is the need for sorting?
10. How time is measured in sorting?
Sub. Code
13
DE-3675
2
SER
SECTION B — 10 40 marks)
Answer any FOUR questions.
11. How classes are defined and used in
12. Give the purpose of a constructor.
13. How Queue differs from a stack?
14. How a node is deleted from a linked list?
15. Explain the technique of creating a Binary tree.
16. How sequential search is performed?
SECTION C — 15 30 marks)
Answer any TWO questions.
17. Explain the concept of operator overloading.
18. Write a program in to evaluate a post fix expression.
19. Explain the technique of Quick sort with an example.