14.

15.

16.

17.

18.

19.

20.

BC201 Pages: 2

Explain different types of queues. What are the limitations of a linear queue? Illustrate with
an example.
MODULE IV
Describe various operations on a singly linked list.
OR
Describe operations on a circular linked list with algorithms.
MODULE V
Explain an algorithm to find the shortest path in graphs.
OR
What is a minimum spanning tree? Explain an algorithm for constructing MST.
MODULE VI
Illustrate insertion sort with suitable example. Compare the time complexities of any two
sorting algorithms.
OR
Sort the following numbers 3,9,1,5,0,2,6,8 using Merge Sort. ****

Page 2 of 2