11

12

13

14

15

16

a)

b)

a)

b)

a)

b)

a)

b)
a)

b)

02000CS205092002

(3) ८)
Xx ൭൭.
പ്‌ © 9
Evaluate the following postfix expression ABC*D/+ where 0-2 8-3 C=4 0-6

PART D
Answer any two full questions, each carries 9 marks.
Write an algorithm/pseudocode to convert a given infix expression to postfix

expression? Trace the steps involved in converting the given infix expression
((A +B)*C)-((D*C)/F) to postfix expression.
What is DEQUEUE?

Write a non recursive algorithm/pseudocode for pre-order traversal of a Binary
Tree.
Write an algorithm/pseudocode to perform the following operations on a binary
search tree

(i) insert an element k

(ii) search for an element k
What is a Binary Search Tree (BST)? Show the structure of the binary search
tree after adding each of the following values in that order: 10, 25, 2, 4, 7, 13,
11, 22. What is the height of the created binary search tree?
How can you represent a multiple stack using array?

PART E

Answer any four full questions, each carries 10 marks.
Give any two representations of graphs? What do you mean by in-degree and

out-degree of a graph?

Give algorithm/pseudocode for DFS. Demonstrate DFS using suitable example?
Design an algorithm/ pseudocode for selection sort. Illustrate the working of
selection sort on the following array with 7 elements : 30,45,25,32,55,60,49

What you mean by Open Addressing and Closed Addressing?

Page 2 of 3

(3)

(7)

(2)

(3)

(6)

(5)

(4)

(4)

(6)
(6)

(4)