WorksheetsCLA-3
Total questions: 8
Worksheet time: 6mins
Name
Class
Date
1.
Assume that you want to design a data structure for a Library to store the records of books. Which type of data structure is required to find its availability
a)
Tree
b)
Graph
c)
Stack
d)
Queue
2.
Number of nodes in level K of a complete binary tree is ____
a)
2^K
b)
2^(K+1)
c)
2^(K-1)
d)
Log K
3.
The maximum hight of a binary search tree of N nodes is …..
a)
O(Log N)
b)
O(N Log N)
c)
O(N)
d)
O(2^N)
4.
Which data structure is linear ?
a)
Array
b)
Graph
c)
Tree
d)
Double Linked list
5.
Which data structure is NON-LINEAR ?
a)
Single Linked List
b)
Stack
c)
Queue
d)
Double Linked list
6.
Which is an application of Queue?
a)
infix to postfix
b)
reversing the list
c)
paranthesis checking of a string
d)
process the object in first in first out
7.
You have implemented stack using singly linked list where head of the list is stored at *R. Which condition is to be satisfied to check the stack is full or not?
a)
R==NULL
b)
R==TOP
c)
stack can not be full
d)
None of these
8.
You want to update kth element of array "a" to 5. Which is correct syntax ?
a)
a[k]=5;
b)
a[k+1]=5;
c)
a[5]=k;
d)
a[k-1]=5;
100 %
