WorksheetsCLA-2
Total questions: 6
Worksheet time: 5mins
Name
Class
Date
1.
An AVL tree is also a binary search tree. The statement is ____
a)
True
b)
False
2.
Assume that you want to design a data structure for a Library to store the students request to issue books. Which type of data structure will be a transparent approach ?
a)
Tree
b)
Graph
c)
Stack
d)
Queue
3.
How many traversing of head pointer of a single linked list is required to catch a node of distance K from the first node. Assume head node is at distance 0.
a)
K-1
b)
K
c)
K+1
d)
K+2
4.
The minimum hight of a binary search tree with N nodes is…..
a)
Log N
b)
N Log N
c)
n
d)
2^N
5.
Which is NOT an application of stack?
a)
infix to postfix
b)
reversing the list
c)
paranthesis checking of a string
d)
process the object in first in first out
6.
You have implemented stack using array a. Which is correct to check the stack is empty?
a)
a[top]==-1;
b)
a[0]==-1
c)
top==-1
d)
top==0
100 %
