1.
_____ contains the information about an array used in a program.
Answer: Option 'A'
Dope vector
2.
A sort that compares each element with its adjacent element in a list is called _______
Answer: Option 'B'
Bubble Sort
3.
The term DEQUE refers _______
Answer: Option 'B'
double ended queue
4.
Which of the following data structure is required to evaluate a post fix expression?
Answer: Option 'A'
Stack
5.
A matrix in which number of zero elements are much higher than the number of non zero elements is called
Answer: Option 'C'
Sparse Matrix
6.
In order traversal is also known as _______
Answer: Option 'B'
Symmetric order
7.
Which data structure is required to check balanced parenthesis in an expression?
Answer: Option 'C'
Stack
8.
The smallest element of an Array’s index is known as _______
Answer: Option 'C'
Lower bound
9.
A linked list that has no beginning and no end is called _______
Answer: Option 'C'
Circular linked list
10.
Rows of a relation are called ________
Answer: Option 'C'
tuples