DISTANCE EDUCATION
M.Sc. DEGREE EXAMINATION, MAY 2018.
DATA STRUCTURES AND ALGORITHMS
(2002 onwards)
Time Three hours Maximum 100 marks
PART A — (10 × 3 30 marks)
Answer ALL questions.
1. What is meant by Time Complexity?
2. What do you mean by Primitive Data Type?
3. Define Priority Queue.
4. Define Linear List.
5. Write the steps to add two strings.
6. Mention the applications of Tree.
7. Mention the different types of Graphs.
8. What is the use of Quick Sort?
9. Name any three Searching Techniques.
10. Define Hashing.
PART B — × 10 40 marks)
Answer any FOUR questions.
11. Describe the primitive data types with examples.
12. Explain about the Singly Linked List and write an
algorithm for adding an element in the linked list.
Sub. Code
14
DE-3882
2
wk11
13. Write an algorithm for concatenation of two strings.
14. Explain about the Binary Tree representation.
15. Write an algorithm for Quick Sort.
16. Explain about Binary Search with an algorithm.
PART C — × 15 30 marks)
Answer any TWO questions.
17. Write an algorithm for Reverse Polish Notation with
explanation.
18. Write an algorithm for Graph Traversal with an example.
19. Explain about Hashing.