15.
16.
17.
18.
19.

20.
21.

132184

2 D 12005
Develop the algorithm to insert a node in a singly linked list.
What is recursion ? Explain the requirement of a stack in recursion process.
What is circular queue ? Explain the procedure to add a new element in to a circular queue.
Explain the binary tree representation in memory using arrays and linked list.

Explain the selection sort procedure with example.
(5 x 5 = 25 marks)

Section C
Answer any one question.
Each question carries 11 marks.
What is linked list representation of queue in memory ? Develop the implementation algorithms.

What are binary search trees ? Develop the algorithm to create a binary search tree in memory.

(1 x 11 = 11 marks)

132184