Data Structures

DOWNLOAD FREE PDF <<CLICK HERE>>

Data Structures

Congratulations - you have completed Data Structures.

You scored %%SCORE%% out of %%TOTAL%%.

Your performance has been rated as %%RATING%%


Your answers are highlighted below.
Question 1 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
Match the Binary Tree type

Data Structures MCQ
A
I-C, II-B, III-D, IV-A
B
I-C, II-A, III-B, IV-D
C
I-C, II-B, III-A, IV-D
D
I-C, II-D, III-A, IV-B
Question 2 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
Circular Queue is also known as

A
Ring Buffer
B
Square Buffer
C
Rectangle Buffer
D
Curve Buffer
Question 3 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
Select operations that can be performed on a Queue Data Structure...

A
isEmpty()
B
pop()
C
push()
D
correctchoice isFull()
Question 4 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
A variable is a named value that can be changed in the program.

A
False
B
True
Question 5 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
The situation when in a linked list Head==NULL

is

A
Full
B
Empty
C
Half full
D
saturated
Question 6 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
Match the vector notation to the diagram

Data Structures MCQ
A
[3, 2]
B
[2, 3]
C
[-3, 2]
D
[-2, -3]
Question 7 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions 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
&A[0][0][0] + w(y * z * q + z * p + r)
B
&A[0][0][0] + w(y * z * p + z*q + r)
C
&A[0][0][0] + w(x * y * p + z * q+ r)
D
&A[0][0][0] + w(x * y * q + z * p + r)
Question 8 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
What is the load factor?

A
Average array size
B
Average key size
C
Average chain length
D
Average hash table length
Question 9 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
Which of the following sorting algorithms can be used to sort a random linked list with minimum time complexity?

A
Insertion Sort
B
Quick Sort
C
Heap Sort
D
Merge Sort
Question 10 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
A stack containing 'Dog' 'Cat' & 'Rat' . What will happen if you carry out a pop operation on the stack?

A
Noting
B
Cat will be removed
C
Dog will be removed
D
Rat will be removed
Once you are finished, click the button below. Any items you have not completed will be marked incorrect. Get Results
There are 10 questions to complete.

DOWNLOAD FREE PDF <<CLICK HERE>>