Crystal
Crystal
[CO01] [RBT 1]
[CO01] [RBT 1]
3 List the various operations that can be performed on data structure. M.M. :5
[CO01] [RBT 1]
4 Define data structure. What do you mean by non-linear data structure, Give example? M.M. :5
[CO03] [RBT 1]
[CO03] [RBT 3]
5 Discuss the procedure to convert infix expression to postfix expression with the following M.M. :5
expression: ((A –(B+C) * D) / (E+F)).
[CO03] [RBT 2]
6 Convert given Infix expression: (a + b * c ^ d) * (e + f / g) to Postfix expression using Stack and M.M. :5
show the details of Stack at each step of conversion. (Note: ^ indicates exponent operator).
[CO02] [RBT 5]
7 Difference between Stack and queue and explain how do you M.M. :5
test for an empty stack?
[CO02] [RBT 1]
8 Write down the function to insert an element into a queue, in which the queue is implemented as an M.M. :5
array.
[CO02] [RBT 1]