DISTANCE EDUCATION
M.Sc. (Information Technology) DEGREE EXAMINATION,
MAY 2017.
DATA STRUCTURES AND ALGORITHMS
(2002 Onwards)
Time Three hours Maximum 100 marks
SECTION A — (10 3 30 marks)
Answer ALL questions.
1. What is meant by data structure?
2. Define: Time complexity of algorithms.
3. State the applications of stack.
4. Distinguish between circularly linked list and linearly
linked list.
5. List the different types of representations for string.
6. List the primitive functions related strings.
7. What is meant by binary search tree?
8. What is
9. Distinguish between binary search and linear search.
10. What are the characteristics of a good hash function?
Sub. Code
14
DE-479
2
Sp 1
SECTION B — × 10 40 marks)
Answer any FOUR questions.
11. Write a note on asymptotic notations for analysis of
algorithms.
12. Explain the concept of 'Pattern Matching in Strings' with
algorithm and an example.
13. Explain the different methods of representing Graphs.
14. Write selection sort algorithm and explain with an
example.
15. Explain Thee and Binary Tree with examples.
16. Write the algorithms for 'operations on stack'.
SECTION C — × 15 30 marks)
Answer any TWO questions.
17. Elaborate on the various operations on 'Binary Tree'
18. Compare and contrast singly linked list and Doubly
linked list.
19. Explain Heap sort with an example.