Cse11104 Set A
Cse11104 Set A
Group A
Answer All the Questions (5 x 2 = 10)
1 Differentiate between arrays and linked lists. Remembering CO1
2 Define full binary tree with suitable example. Remembering CO3
3 Explain why stack is called LIFO list? Understanding CO1, CO3
4 Define an AVL-tree with suitable example. Remembering CO1, CO3
5 What is the drawback of a singly linked list? Remembering CO2
Group B
Answer all the Questions (5 x 4 = 20)
6 Evaluate the postfix expression 4 2 3 ^ / 4 3 * + 5 2 * - Evaluating CO1, CO3
using stack and convert the above expression into infix.
[2+2]
7 Change the following postfix expression into its equivalent Creating CO1, CO3
infix expression by using stack:
ABD-/E*FGHK^-/+
8 a) Build the expression tree for the following expression. Applying CO1
(x * 5y) ^ (a / b)2
b) How can a polynomial such as 5x2 - 2x + 9 be
represented by a linked list? Remembering CO3
ii) Construct a binary search tree (BST) by considering the Creating CO3
following values sequentially:
22, 17, 28, 26, 13, 9, 11, 21, 27, 8, 25 [2+2]
Group C
Answer All the Questions (10 x 2 = 20)
11 a) i) Define B-tree. Remembering CO1
ii) Construct a B-tree of order 3 with the following data: Creating CO3
p, q, r, d, h, m, l, s, k, n
In-order: DIBEJAFCKG
Pre-order: ABDIEJCFGK
[3+3+4]
12 a) i) Build a C functions or algorithm to insert an element in a Applying CO3
circular queue by using an array.
ii) Build an AVL tree by inserting the following keys in the Applying CO4
order given below:
A, Z, B, Y, C, X, D, W
Clearly mention different rotations used and balance factor
of each node. [4 + 6]
(OR)
12 b) i) Develop a C function or algorithm to delete an element Creating CO1, CO3
from a linear queue by using a singly linked list.
CO1, CO3
ii) Change the following infix expression into its equivalent Creating
prefix expression by using stack:
A + (B * (C / D) / E) $ F - G CO1, CO3