13.

14.

15.

16.

17.

18.

19.

20.

C2B003 Pages: 2

MODULE 111

What is priority queue? Write the array implementation of priority queue.
OR

What is a circular queue? Write the Insertion algorithm for circular queue..
MODULE IV
Write an algorithm to insert an element into a singly linked list.
OR
Write an algorithm to add two polynomials using linked list.
MODULE V

What is a binary search tree? Create a binary search tree using the following elements.

50, 20, 70, 10, 5, 4, 30, 28, 80, 40, 25, 45, 29, 98, 100, 42
OR
Write the algorithm for Depth first search (DFS).
MODULE VI
Explain partition exchange sorting method with example.
OR

Sort the following elements using Heap sort.

20, 10, 5, 80, 2, 1, 35, 40, 55, 70, 33, 18

بد بد ید ‎मैप‏

Page 2 of 2