Answer
All Questions
Part
A(10*2=20marks)
1.Evaluate
the value of expression ab+c*d using stack
2.How
to perform union operation
3.What
is linked list
4.Define
ADT
5.Give
application of stacks and give example for one of them
6.Differentiate
between arrays and linked list
7.Give
various implementation of tree
8.Define
complete binary tree
9.How
is binary tree represented using an array? Give an example
10.What
is meant by adjacency matrix
Part
A(5*13=65marks)
11(a).Explain about in detail List ADT (13)
(or)
11(b).Explain the operations performed on QUEUE in
detail. Write a C++ program
to implement the Queue operations (13)
12(a).Explain about in detail Stack
(13)
(or)
12(b).Explain about in detail polynomial
manipulation (13)
13(a)i).Explain the concept of binary tree (8)
(b)ii).Explain about in detail Expression Tree (5) (or)
13(b)i).Write an algorithm to traverse binary
tree level by level with each level of the
Tree being traversed from left to
right (13)
14(a).Explain about in detail BST (13)
(or)
14(b).Explain about in detail DFS (13)
15(a).Explain about in detail BFS(13)
(or)
15(b).Explain about in detail Union
&Find Operation (13)
Part
C(1*15=15marks)
16.Write
an algorithm to perform each of the following
i).Reverse a list so that the last element
comes first and so on
ii).Return the sum of integers in a list
iii).Delete every third element from a list (15)
0 Comments