M.Sc. DEGREE EXAMINATION, APRIL 2018
First Semester
Computer Science and information Technology
DATA STRUCTURE AND ALGORITHMS
(CBCS 2017 onwards)
Time 3 Hours Maximum 75 Marks
Part A (10 x 2 20)
Answer all questions.
1. Define: List.
2. What is searching?
3. Define: Circular Queue.
5. What is a Binary Tree? Give an example.
6. What are the ways to represent a binary tree?
7. What is the complexity of quick sort?
8. Distinguish between linear search and binary search.
9. Define: Big notation.
10. Write down the properties of an algorithm.
Sub. Code
7MCI1C3
AFS-0661
2
Wk 10
Part B x 5 25)
Answer all questions, choosing either or
11. Write the algorithm for traversing a list and give an
example.
Or
Write the procedures to insert and delete an
element in a list.
12. Write an algorithm to convert infix expression into
postfix expression.
Or
What is a queue? Explain the array implementation
of queues.
13. What is binary search tree? Explain with examples.
Or
What do you mean by hashing? Explain any two
popular hash functions.
14. Write a binary search algorithm and explain with
examples.
Or
Write an algorithm for insertion sort and explain it.
15. Why do we need algorithm analysis? Explain.
Or
Write an algorithm for adding "n" natural numbers
and find the time and space required by that
algorithm.
AFS-0661
3
Wk 10
Part C x 10 30)
Answer any three questions.
16. Write the procedures to perform predecessor and
successor in a list.
17. Define a stack. What are the operations performed on it?
Explain.
18. What are the binary tree traversals? Explain.
19. Write an algorithm to sort a list using Merge sort method
and explain it.
20. How do you find the complexity of an algorithm? What is
the relation between the time and space complexities of
an algorithm? Justify your answer with an example.
—————————