B.Sc. (Three Year) DEGREE EXAMINATION, MARCH/APRIL 2017.
End Semester Examination
Fourth Semester
Part II Computer Science
Paper IV DATA STRUCTURES
2 C 4311
Time 3 Hours Max. Marks 70
PART — A
Answer any FIVE questions of the following. 4 20 Marks)
1. What is the difference between array and linked list?
2. How stacks are used? Explain about it.
3. What are the different types of trees in data structures?
4. Write about the connected components involved in graphs.
5. What do you mean by insertion sort? How it occurs?
6. What is binary tree and explain its properties, implementations and applications?
7. Write about the dequeue.
8. What is linked list? What are its basic operations involved in it?
PART — B
Answer ALL the questions. 10 50 Marks)
9. Write about Double linked list with its implementation.
Or
Explain about the ADT sets and sparse matrices with examples.
10. Write a programme to implement queue operations using arrays.
Or
How dequeue can you implement? Write with suitable examples.

11. Write about the concept of heap trees along with working.
Or
Explain the ADT operations and linked representation of B-Tree.
12. Explain about depth-first search with an algorithm.
Or
Write about the topological sortings and connectivity in directed graphs.
13. What do you mean by merge sort? How it occurs? Explain with example.
Or
What is binary search? Explain its working and implementation.