DISTANCE EDUCATION
M.Sc. DEGREE EXAMINATION, DECEMBER 2017.
DATA STRUCTURES AND ALGORITHMS
(2002 onwards)
Time Three hours Maximum 100 marks
PART A — (10 x 3 30 marks)
Answer ALL questions.
1. What is meant by Space Complexity?
2. What is meant by User Defined Data Type?
3. List the applications of Queue.
4. What is meant by Doubly Linked List?
5. Write the steps to compare two strings.
6. Write about Tree Traversal.
7. Write about Graph Traversal.
8. Define Pivot value.
9. Compare Selection Sort with Bubble Sort.
10. What is the use of Heap Sort?
PART B — 10 40 marks)
Answer any FOUR questions.
11. Explain about Time complexity.
12. Explain about Doubly Linked List and write an algorithm
for deletion of an item.
Sub. Code
14
DE-2782
2
wk12
13. Write an algorithm for String Comparison.
14. Explain about the Graph representation.
15. Write an algorithm for Heap Sort.
16. Explain about Linear Search with an algorithm.
PART C — x 15 30 marks)
Answer any TWO questions.
17. Write an algorithm for addition and deletion of an
element in the Circular Linked List.
18. Write an algorithm for Tree Traversal with an example.
19. Explain about Tree Sorting.
———————