DISTANCE EDUCATION
M.Sc. (I.T.) DEGREE EXAMINATION, MAY 2016.
DATA STRUCTURES AND ALGORITHMS
(2002 onwards)
Time Three hours Maximum 100 marks
PART A — (10 3 30 marks)
Answer ALL questions.
1. Define the term Data structure.
2. List the operations an array data structure.
3. List the applications of stack.
4. What is Linked list?
5. What is String? Give an example.
6. List any three searching techniques.
7. What is binary tree?
8. Define the term graph.
9. What is internal and external sorting?
10. What is Hashing?
Sub. Code
14
DE-3666
2
wk 3
PART B — 10 40 marks)
Answer any FOUR questions.
11. Describe the queue data structure with an example.
12. Explain the doubly linked list in detail.
13. Briefly explain the linked list representation of graph.
14. Describe the selection sort algorithm with an example.
15. Explain the radix sort in detail.
16. Explain the binary search with an example.
PART C — 15 30 marks)
Answer any TWO questions.
17. How do you evaluate postfix expression using stack?
Explain with an example.
18. Discuss the pattern matching algorithms.
19. Explain the BFS and DFS algorithm.