MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 20 Mcqs, each offering curated multiple-choice questions to sharpen your Discrete Mathematics knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
There are two algorithms suppose A takes 1.41 milli seconds while B takes 0.9 milliseconds, which one of them is better considering all other things the same? |
| A. | A is better than B |
| B. | B is better than A |
| C. | Both are equally good |
| D. | None of the mentioned |
| Answer» C. Both are equally good | |
| 2. |
An algorithm: can be represented through _________ |
| A. | flow charts |
| B. | pseudo codes |
| C. | instructions in common language |
| D. | all of the mentioned |
| Answer» E. | |
| 3. |
For an algorithm which is the most important characteristic that makes it acceptable _________ |
| A. | Fast |
| B. | Compact |
| C. | Correctness and Precision |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 4. |
Optimization of algorithm means _________ |
| A. | making that algorithm fast by time and compact by space |
| B. | making that algorithm slow by time and large by space |
| C. | making that algorithm fast by time and large by space |
| D. | making that algorithm slow by time and compact by space |
| Answer» B. making that algorithm slow by time and large by space | |
| 5. |
For a recursive algorithm _________ |
| A. | a base case is necessary and is solved without recursion. |
| B. | a base case is not necessary |
| C. | doesnot solve a base case directly |
| D. | none of the mentioned |
| Answer» C. doesnot solve a base case directly | |
| 6. |
An algorithm which tries all the possibilities unless results are satisfactory is and generally is time-consuming is _________ |
| A. | Brute Force |
| B. | Divide and Conquer |
| C. | Dynamic programming algorithms |
| D. | None of the mentioned |
| Answer» B. Divide and Conquer | |
| 7. |
A Complexity of algorithm depends upon _________ |
| A. | Time only |
| B. | Space only |
| C. | Both Time and Space |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 8. |
An algorithm which uses the past results and uses them to find the new results is _________ |
| A. | Brute Force |
| B. | Divide and Conquer |
| C. | Dynamic programming algorithms |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 9. |
An algorithm in which we divide the problem into subproblem and then we combine the subsolutions to form solution to the original problem is known as _________ |
| A. | Brute Force |
| B. | Divide and Conquer |
| C. | GreedyAlgorithm |
| D. | None of the mentioned |
| Answer» C. GreedyAlgorithm | |
| 10. |
An Algorithm is ___________ |
| A. | A procedure for solving a problem |
| B. | A problem |
| C. | A real life mathematical problem |
| D. | None of the mentioned |
| Answer» B. A problem | |
| 11. |
THERE_ARE_TWO_ALGORITHMS_SUPPOSE_A_TAKES_1.41_MILLI_SECONDS_WHILE_B_TAKE_0.9_MILLISECONDS,WHICH_ONE_OF_THEM_IS_BETTER_CONSIDERING_ALL_OTHER_THINGS_SAME.?$ |
| A. | A is better than B |
| B. | B is better than A |
| C. | Both are equally good |
| D. | None of the mentioned |
| Answer» C. Both are equally good | |
| 12. |
An algorithm: can be represented through? |
| A. | flow charts |
| B. | pseudo codes |
| C. | instructions in common language |
| D. | all of the mentioned |
| Answer» E. | |
| 13. |
For an algorithm which is most important charecterstic that makes it acceptable: |
| A. | Fast |
| B. | Compact |
| C. | Correctness and Precision |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 14. |
Optimization of algorithm means: |
| A. | making that algorithm fast by time and compact by space |
| B. | making that algorithm slow by time and large by space |
| C. | making that algorithm fast by time and large by space |
| D. | making that algorithm slow by time and compact by space |
| Answer» B. making that algorithm slow by time and large by space | |
| 15. |
For a recursive algorithm : |
| A. | a base case is necessary and is solved without recursion. |
| B. | a base case is not necessary |
| C. | doesnot solve a base case directly |
| D. | none of the mentioned |
| Answer» C. doesnot solve a base case directly | |
| 16. |
An algorithm which tries all the possibilities unless results are satisfactory is and genrally is time consuming is: |
| A. | Brute Force |
| B. | Divide and Conquer |
| C. | Dynamic programming algorithms |
| D. | None of the mentioned |
| Answer» B. Divide and Conquer | |
| 17. |
A Complexity of algorithm depends upon: |
| A. | Time only |
| B. | Space only |
| C. | Both Time and Space |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 18. |
An algorithm which uses the past results and and uses them to find the new results is |
| A. | Brute Force |
| B. | Divide and Conquer |
| C. | Dynamic programming algorithms |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 19. |
An algorithm in which we divide the problem into subproblem and then we combine the subsolutions to form solution to the original problem is known as: |
| A. | Brute Force |
| B. | Divide and Conquer |
| C. | GreedyAlgorithm |
| D. | None of the mentioned |
| Answer» C. GreedyAlgorithm | |
| 20. |
An Algorithm is: |
| A. | A procedure for solving a problem |
| B. | A problem |
| C. | A real life mathematical problem |
| D. | None of the mentioned |
| Answer» B. A problem | |