YOU CAN DOWNLOAD 200+ SUBJECTS PDF BOOK FOR COMPETITIVE EXAMINATIONS
Data Structures
Question 1 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |
Match the Binary Tree type 

I-C, II-B, III-D, IV-A | |
I-C, II-A, III-B, IV-D | |
I-C, II-B, III-A, IV-D | |
I-C, II-D, III-A, IV-B |
Question 2 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |
Circular Queue is also known as
Ring Buffer | |
Square Buffer | |
Rectangle Buffer | |
Curve Buffer |
Question 3 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |
Select operations that can be performed on a Queue Data Structure...
isEmpty() | |
pop() | |
push() | |
correctchoice isFull() |
Question 4 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |
A variable is a named value that can be changed in the program.
False | |
True |
Question 5 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |
The situation when in a linked list Head==NULL
is
Full | |
Empty | |
Half full | |
saturated |
Question 6 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |
Match the vector notation to the diagram 

[3, 2] | |
[2, 3] | |
[-3, 2] | |
[-2, -3] |
Question 7 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |
A three dimensional array in 'C' is declared as int A[x][y][z]. Consider that array elements are stored in row major order and indexing begins from 0. Here, the address of an item at the location A[p][q][r] can be computed as follows (where w is the word length of an integer):
&A[0][0][0] + w(y * z * q + z * p + r) | |
&A[0][0][0] + w(y * z * p + z*q + r) | |
&A[0][0][0] + w(x * y * p + z * q+ r) | |
&A[0][0][0] + w(x * y * q + z * p + r) |
Question 8 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |
What is the load factor?
Average array size | |
Average key size | |
Average chain length | |
Average hash table length |
Question 9 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |
Which of the following sorting algorithms can be used to sort a random linked list with minimum time complexity?
Insertion Sort | |
Quick Sort | |
Heap Sort | |
Merge Sort |
Question 10 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |
A stack containing 'Dog' 'Cat' & 'Rat' . What will happen if you carry out a pop operation on the stack?
Noting | |
Cat will be removed | |
Dog will be removed | |
Rat will be removed |
There are 10 questions to complete.