DISTANCE EDUCATION
M.Sc. (Computer Science) DEGREE EXAMINATION,
MAY 2017.
DATA STRUCTURES USING
(2007 onwards)
Time Three hours Maximum 100 marks
SECTION A — (10 3 30 marks)
Answer ALL questions.
1. Define Arrays.
2. List the types of inheritance.
3. Why a stack is sometimes called LIFO?
4. What are the operations of a queue?
5. List out differences between getnode and freenode
operations.
6. Draw a circular lists and doubly linked list.
7. What is a asymmetric deletion algorithm?
8. What is a height balanced trees?
9. Define sorting.
10. Name any two sorting methods.
Sub. Code
13
DE-488
WS
2
SECTION B — 10 40 marks)
Answer any FOUR questions.
11. Why constructors are used? Give examples.
12. Explain the concept of overloading.
13. Discuss the operations of a stack.
14. With examples, show the working of a Doubly linked list.
15. How to destroy a binary search tree? Explain.
16. Explain the heap sort with an example.
SECTION C— 15 30 marks)
Answer any TWO questions.
17. What are the types of arrays? Give examples?
18. Explain the tree traversals.
19. Explain bubble sort and quick sort.