15.
16.
17.
18.
19.

20.

21.

289099

2 D 31787

Develop the algorithm to delete a node from a singly linked list.
What are Stacks ? Explain the implementation of linear stack in memory.
What are various types of priority queues ? Explain.
How to represent an expression in a binary tree ? Also, perform a post order traversal on that tree.
Explain the depth first and breadth first graph traversals.
Section C (Essay Type Questions)
Answer any one question, correct answer carries 10 marks.

What is polish notation ? Explain the procedure to convert an infix expression in to post fix with
the help of an operand stack.

Explain the quick sort algorithm and also find the efficiency measures.

(1 x 10 = 10 marks)

289099