MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 16 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 PSPACE can be characterized into? |
| A. | APTIME |
| B. | AP |
| C. | Quantom complexity class |
| D. | None of the mentioned |
| Answer» E. | |
| 2. |
Complement of all the problems in PSPACE is ________ |
| A. | PSPACE |
| B. | NL |
| C. | P |
| D. | All of the mentioned |
| Answer» B. NL | |
| 3. |
Without needing extra __________ we can simulate non deterministic turing machine using deterministic turing machine. |
| A. | time |
| B. | space |
| C. | both time and space |
| D. | none of the mentioned |
| Answer» C. both time and space | |
| 4. |
Statement : All PSPACE problems can be reduced to PSPACE-complete problems.State true or false: |
| A. | true |
| B. | false |
| Answer» B. false | |
| 5. |
NL ∈ PSPACE ∈ EXPSPACEThe given relation involves which of the following theorems?a) Space hierarchy theoremb) Savitch’s theoremc) Both ( |
| A. | Space hierarchy theoremb) Savitch’s theoremc) Both (a) and ( |
| B. | Savitch’s theorem |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 6. |
Correct the given order:NL∈ P∈ NP∈ PH∈ PSPACE |
| A. | NP∈ P∈ NL∈ PH∈ PSPACE |
| B. | NL∈ PH∈ NP∈ P∈ PSPACE |
| C. | NL∈ P∈ NP∈ PH∈ PSPACE |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 7. |
COMPLEMENT_OF_ALL_THE_PROBLEMS_IN_PSPACE_IS_________?$ |
| A. | PSPACE |
| B. | NL |
| C. | P |
| D. | All of the mentioned |
| Answer» B. NL | |
| 8. |
Which_of_the_following_PSPACE_can_be_characterized_into?$ |
| A. | APTIME |
| B. | AP |
| C. | Quantom complexity class |
| D. | None of the mentioned |
| Answer» E. | |
| 9. |
Without needing extra __________ we can simulate non deterministic turing machine using deterministic turing machine? |
| A. | time |
| B. | space |
| C. | both time and space |
| D. | none of the mentioned |
| Answer» C. both time and space | |
| 10. |
Statement : All PSPACE problems can be reduced to PSPACE-complete problems. |
| A. | |
| B. | true |
| Answer» B. true | |
| 11. |
NL ‚àà PSPACE ‚àà EXPSPACE$ |
| A. | |
| B. | Space hierarchy theorem |
| C. | Savitch’s theorem |
| Answer» D. | |
| 12. |
Correct the given order: |
| A. | |
| B. | NP‚àà P‚àà NL‚àà PH‚àà PSPACE |
| C. | NL‚àà PH‚àà NP‚àà P‚àà PSPACE |
| Answer» D. | |
| 13. |
The class PSPACE is closed under the following operations: |
| A. | Union |
| B. | Concatenation |
| C. | Kleene |
| D. | All of the mentioned |
| Answer» E. | |
| 14. |
Savitch theorem relates to which of the following: |
| A. | PSPACE=NPSPACE |
| B. | Alternating Turing Machine |
| C. | Time complexity |
| D. | None of the mentioned |
| Answer» B. Alternating Turing Machine | |
| 15. |
PSPACE is strictly the super set of: |
| A. | Regular language |
| B. | Context free language |
| C. | Context Sensitive Language |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 16. |
All set of polynomial questions which can be solved by a turing machine using a polynomial amount of space: |
| A. | PSPACE |
| B. | NPSPACE |
| C. | EXPSPACE |
| D. | None of the mentioned |
| Answer» B. NPSPACE | |