14.
15.

24.

26.
27.

28.

2 D 91686
Evaluate the postfix expression P : 5, 6, 2, +, *, 12, 4,/, — using stack.
What are directed, undirected and weighted graphs ? (5 x 3=15 marks)
Part C

Answer any five questions.
Each question carries 5 marks.

Explain the different types of structures that are used for storing strings.
What are linear arrays ? How they are represented in memory of a computer ?
Given an integer K, write a procedure which deletes the Kth element from a linked list.
Write the procedures to push an item into the stack and pop an item from the stack.
What are priority queues ? Explain the array representation of priority queue.
Explain the traversing of binary trees with an example.
With the help of suitable example explain selection sort and merge sort.
Explain hashing and hash functions,
(5 x 5 = 25 marks)
Part D

Answer any three questions.
Each question carries 10 marks.

Write notes on a) Complexity of algorithms ; and b) Space -time tradeoff. Explain the complexity
of any three algorithms with examples.

What are linked lists ? Explain the algorithm to delete node following a given node from a linked
list.

What are Queues ? Write the algorithm for insertion and deletion in simple queue.
Explain the basic operations of searching and inserting with Binary search tree.
Define a graph. Explain the various methods of traversing a graph.

(3 x 10 = 30 marks)