

MCQOPTIONS
Saved Bookmarks
This section includes 5 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. |
Complement of all the problems in PSPACE is ________ |
A. | PSPACE |
B. | NL |
C. | P |
D. | All of the mentioned |
Answer» B. NL | |
2. |
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 | |
3. |
Statement : All PSPACE problems can be reduced to PSPACE-complete problems.
|
A. | true |
B. | false |
Answer» B. false | |
4. |
NL PSPACE EXPSPACE
|
A. | Space hierarchy theorem |
B. | Savitch s theorem |
C. | Space hierarchy and Savitch s theorems |
D. | None of the mentioned |
Answer» D. None of the mentioned | |
5. |
Correct the given order:
|
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 | |