WorksheetsAlgouniversity - Nomdic Gurukul - 14th august
Total questions: 6
Worksheet time: 3mins
Name
Class
Date
1.
In order traversal of binary search tree will produce ?
a)
unsorted list
b)
reverse of input
c)
sorted list
d)
none of the above
2.
In order traversal of binary search tree will produce ?
a)
unsorted list
b)
reverse of input
c)
sorted list
d)
none of the above
3.
push() and pop() functions are found in
a)
queues
b)
lists
c)
stacks
d)
trees
4.
Minimum number of queues required for priority queue implementation?
a)
5.0
b)
4.0
c)
3.0
d)
2.0
5.
The minimum number of edges required to create a cyclid graph of n vertices is
a)
n
b)
n-1
c)
n+1
d)
2n
6.
What about recursion is true in comparison with iteration?
a)
very expensive in terms of memory.
b)
low performance.
c)
every recursive program can be written with iteration too.
d)
all of the above are true!
100 %
