Font size
WorksheetsNew DSC Quiz
Total questions: 20
Worksheet time: 30mins
What is the outcome of this postfix expression assuming single digit operand 4 3 2 + * 5 6+ * ?
220
106
28
26
If the elements '1', '2', '3' and '4' are added in a stack, so what would be the order for the removal?
1234
2134
4321
none
In the linked list implementation of queue, where will the new element be inserted?
At the middle position of the linked list
At the head position of the linked list
At the tail position of the linked list
anywhere
What would be the output given by display, after performing the following operations in a Double ended queue ?
Insertfront(10) ,Insertrear(30),deletefront(), ,Insertrear(40), deletefront(),deleterear(), Display(); Insertfront(20)
10, 30 ,40
30 ,40
20
none of them
What should be the initial values of top of first and second stack that are implemented using single array of size max
-1 and max-1
0 and max-1
-1 and max
0 and max
How many nodes a complete binary tree will have at level L?
2L-1
2L
2L+1
2*L
Which of the following is true with respect to a graph that is strongly connected?
only if every node is connected to every other node directly by an edge
it is applicable to only directed graph
if we can reach every node from every other node in a graph
none of them
Maximum and minimum number of nodes that can be fit in a binary tree of height 5 is
64,4
5,31
16,5
31,5
What will be the length of the message " all the best 1 " ,if encoded using Huffmann techinque assuming vowels length as 3 and all others as 5?
64
59
49
74
Choose most appropriate one , Binary tree is balanced only if balance factor is
all the above
-1
1
0
Fill the blank with most appropriate choice , In a binary search tree, the root node element ____________is element in right subtree
greater than
greater than or equal to
less than or equal to
less than
Which of the following is essential for converting an infix expression to the postfix form efficiently?
an operator stack
an operand stack
an operator and operator stack
parse tree
What is the minimum number of stacks of size n required to implement a queue of size n?
one
Two
Three
four
The following postfix expression 8 6 + 2 9 + * with single digit operands is evaluated using a stack. The top two elements of the stack after the first + is evaluated are:
8, 6
14,2
6 ,8
14
If the preorder and inorder traversal of binary tree are 10 ,5, 6, 11, 8, 9 and 6, 5 11 ,10, 9, 8 what would be postorder sequence?
6,11,9,5,8,10
6,5,9,8,11,10
6,11,8,5,9,10
6,11,5,9,8,10
What is the balance factor at the root node of this binary tree
0
2
1
-1
Which of these following statements are true
a)all tree can be graph
b)all graph cannot be tree
only a
only b
both true
both false
The following numbers are inserted into an empty binary search tree in the given order: 10, 1, 3, 15, 12, 10. What is the height of the binary search tree (the height is the maximum distance of a leaf node from the root)?
2
4
6
3
For breadth first traversal which data structure is needed?
array
list
stack
queue
If ,In priority queue, elements are stored in accordance with priority(higher) which of thefollowing is/are correct?
a)enqueue is complex
b) dequeue is complex
c) enqueue is simple
d) dequeue is simple
a
b
c
d
