Miscellaneous on Data Structures MCQ question and answer with solution

Home / Data Structure / Miscellaneous On Data Structures

Section 1 Section 2 Section 3 Section 4 Section 5 Section 6 Section 7 Section 8 Section 9 Section 10 Section 11 Section 12

91.
Consider the array {1, 1, 1, 1, 1}. Select the wrong option?

A. Iterative linear search can be used to search for the elements in the given array

B. Recursive linear search can be used to search for the elements in the given array

C. Recursive binary search can be used to search for the elements in the given array

D. No method is defined to search for an element in the given array

Answer & Solution Discuss in Board Save for Later

92.
The type of encoding where no character code is the prefix of another character code is called?

A. optimal encoding

B. prefix encoding

C. frequency encoding

D. trie encoding

Answer & Solution Discuss in Board Save for Later

93.
Under which of the following scenarios is page replacement algorithm required?

A. When total memory exceeds physical memory

B. To determine the number of frames for each process

C. When paging and segmentation are to be used

D. Execution of a process, not in memory

Answer & Solution Discuss in Board Save for Later

94.
Mo's algorithm can only be used for problems where the query can be calculated from the result of the previous query.

A. true

B. false

Answer & Solution Discuss in Board Save for Later

95.
What can be the minimum sum of digits for a 4 digit number?

A. 0

B. 1

C. 16

D. 36

Answer & Solution Discuss in Board Save for Later

96.
Recursive solution of subset sum problem is faster than dynamic problem solution in terms of time complexity.

A. true

B. false

Answer & Solution Discuss in Board Save for Later

97.

Predict the output of the following code.

#include <stdlib.h> 
int main() 
{ 
     srand(0); 
     printf("%d\n", rand()%50); 
     return 0; 
}

A. compilation error

B. random number between 0 to 50 (both inclusive)

C. random number between 0 to 51 (both inclusive)

D. random number between 0 to 49 (both inclusive)

Answer & Solution Discuss in Board Save for Later

98.
A simple acyclic path between source and sink which pass through only positive weighted edges is called?

A. augmenting path

B. critical path

C. residual path

D. maximum path

Answer & Solution Discuss in Board Save for Later

99.
Consider the figure given below. If a message is flooded from node A, it will reach to which of the following nodes?

A. A, B, C, D, E, F

B. A, B, C, D, E,

C. A, B, C, D, E, F, G

D. A, B, C, D

Answer & Solution Discuss in Board Save for Later

100.
In which of the following cases is the reversal of a string not equal to the original string?

A. Palindromic strings

B. Strings of length 1

C. Empty String

D. Strings of length 2

Answer & Solution Discuss in Board Save for Later

1 2 3 4 5 6 7 8 9 10

91.
Consider the array {1, 1, 1, 1, 1}. Select the wrong option?

Answer & Solution

92.
The type of encoding where no character code is the prefix of another character code is called?

Answer & Solution

93.
Under which of the following scenarios is page replacement algorithm required?

Answer & Solution

94.
Mo's algorithm can only be used for problems where the query can be calculated from the result of the previous query.

Answer & Solution

95.
What can be the minimum sum of digits for a 4 digit number?

Answer & Solution

96.
Recursive solution of subset sum problem is faster than dynamic problem solution in terms of time complexity.

Answer & Solution

97.
Predict the output of the following code.

`#include <stdlib.h> int main() { srand(0); printf("%d\n", rand()%50); return 0; }`

Answer & Solution

98.
A simple acyclic path between source and sink which pass through only positive weighted edges is called?

Answer & Solution

99.
Consider the figure given below. If a message is flooded from node A, it will reach to which of the following nodes?

Answer & Solution

100.
In which of the following cases is the reversal of a string not equal to the original string?

Answer & Solution

Read More Section(Miscellaneous on Data Structures)

Miscellaneous on Data Structures MCQ question and answer with solution

91. Consider the array {1, 1, 1, 1, 1}. Select the wrong option?

Answer & Solution

92. The type of encoding where no character code is the prefix of another character code is called?

Answer & Solution

93. Under which of the following scenarios is page replacement algorithm required?

Answer & Solution

94. Mo's algorithm can only be used for problems where the query can be calculated from the result of the previous query.

Answer & Solution

95. What can be the minimum sum of digits for a 4 digit number?

Answer & Solution

96. Recursive solution of subset sum problem is faster than dynamic problem solution in terms of time complexity.

Answer & Solution

97. Predict the output of the following code. #include <stdlib.h> int main() { srand(0); printf("%d\n", rand()%50); return 0; }

Answer & Solution

98. A simple acyclic path between source and sink which pass through only positive weighted edges is called?

Answer & Solution

99. Consider the figure given below. If a message is flooded from node A, it will reach to which of the following nodes?

Answer & Solution

100. In which of the following cases is the reversal of a string not equal to the original string?

Answer & Solution

Read More Section(Miscellaneous on Data Structures)

91.
Consider the array {1, 1, 1, 1, 1}. Select the wrong option?

92.
The type of encoding where no character code is the prefix of another character code is called?

93.
Under which of the following scenarios is page replacement algorithm required?

94.
Mo's algorithm can only be used for problems where the query can be calculated from the result of the previous query.

95.
What can be the minimum sum of digits for a 4 digit number?

96.
Recursive solution of subset sum problem is faster than dynamic problem solution in terms of time complexity.

97.
Predict the output of the following code.

`#include <stdlib.h> int main() { srand(0); printf("%d\n", rand()%50); return 0; }`

98.
A simple acyclic path between source and sink which pass through only positive weighted edges is called?

99.
Consider the figure given below. If a message is flooded from node A, it will reach to which of the following nodes?

100.
In which of the following cases is the reversal of a string not equal to the original string?