MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 17 Mcqs, each offering curated multiple-choice questions to sharpen your Automata Theory knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Which of the following does not belong to the closure properties of NP class? |
| A. | Union |
| B. | Concatenation |
| C. | Reversal |
| D. | Complement |
| Answer» E. | |
| 2. |
Which of the following are not in NP? |
| A. | All problems in P |
| B. | Boolean Satisfiability problems |
| C. | Integer factorization problem |
| D. | None of the mentioned |
| Answer» E. | |
| 3. |
Which of the following can be used to define NP complexity class?a) Verifierb) Polynomial timec) Both ( |
| A. | Verifierb) Polynomial timec) Both (a) and ( |
| B. | Polynomial time |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 4. |
In terms of NTIME, NP problems are the set of decision problems which can be solved using a non deterministic machine in _______ time. |
| A. | O(n) |
| B. | O(n1/2) |
| C. | O(nk), k∈N |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 5. |
Which of the following is incorrect for the given phrasePhrase :’solvable by non deterministic algorithms in polynomial time’ |
| A. | NP Problems |
| B. | During control flow, non deterministic algorithm may have more than one choice |
| C. | If the choices that non deterministic algorithm makes are correct, the amount of time it takes is bounded by polynomial time. |
| D. | None of the mentioned |
| Answer» E. | |
| 6. |
State true or false?Statement: If a problem X is in NP and a polynomial time algorithm for X could also be used to solve problem Y in polynomial time, then Y is also in NP. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 7. |
Which of the following contains NP?a) PSPACEb) EXPSPACEc) Both ( |
| A. | PSPACEb) EXPSPACEc) Both (a) and ( |
| B. | EXPSPACE |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 8. |
What does NP stands for in complexity classes theory?a) Non polynomialb) Non-deterministic polynomialc) Both ( |
| A. | Non polynomialb) Non-deterministic polynomialc) Both (a) and ( |
| B. | Non-deterministic polynomial |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» C. Both (a) and (b) | |
| 9. |
WHICH_OF_THE_FOLLOWING_CAN_BE_USED_TO_DEFINE_NP_COMPLEXITY_CLASS??$ |
| A. | Verifier |
| B. | Polynomial time |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 10. |
Which of the following does not belong to the closure properties of NP class?$ |
| A. | Union |
| B. | Concatenation |
| C. | Reversal |
| D. | Complement |
| Answer» E. | |
| 11. |
Which_of_the_following_are_not_in_NP?$ |
| A. | All problems in P |
| B. | Boolean Satisfiability problems |
| C. | Integer factorization problem |
| D. | None of the mentioned |
| Answer» E. | |
| 12. |
In terms of NTIME, NP problems are the set of decision problems which can be solved using a non deterministic machine in _______ time? |
| A. | O(n) |
| B. | O(n<sup>1/2</sup>) |
| C. | O(n<sup>k</sup>), k‚ààN |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 13. |
A problem which is both _______ and _________ is said to be NP complete. |
| A. | NP, P |
| B. | NP, NP hard |
| C. | P, P complete |
| D. | None of the mentioned |
| Answer» B. NP, NP hard | |
| 14. |
Travelling sales man problem belongs to which of the class? |
| A. | P |
| B. | NP |
| C. | Linear |
| D. | None of the mentioned |
| Answer» C. Linear | |
| 15. |
Which of the following contains NP? |
| A. | PSPACE |
| B. | EXPSPACE |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 16. |
The hardest of NP problems can be: |
| A. | NP-complete |
| B. | NP-hard |
| C. | P |
| D. | None of the mentioned |
| Answer» B. NP-hard | |
| 17. |
What does NP stands for in complexity classes theory? |
| A. | Non polynomial |
| B. | Non-deterministic polynomial |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» C. Both (a) and (b) | |