MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 7 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. |
Suppose we have a las vegas algorithm C to prove ZPP is contained in RP and co-RP. Run C for double its expected running time.
|
| A. | 1/2 |
| B. | 1/4 |
| C. | 1/3 |
| D. | none of the mentioned |
| Answer» B. 1/4 | |
| 2. |
ZPP is exactly equal to the ____________of the classes RP and co-RP. |
| A. | Union |
| B. | Intersection |
| C. | Concatenation |
| D. | Difference |
| Answer» C. Concatenation | |
| 3. |
ZPP is based on ________ |
| A. | Probabalistic turing machine |
| B. | Alternative turing machine |
| C. | Quantum turing machine |
| D. | None of the mentioned |
| Answer» B. Alternative turing machine | |
| 4. |
Which among the following is false?
|
| A. | f+g = O(h+k) |
| B. | fg = O(hk) |
| C. | f<sup>g</sup>=O(h<sup>k</sup>) |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 5. |
Let f: N->N be a step counting function. Then for some constant C, Time(f) is a proper subset of Time(_______) |
| A. | O(nf) |
| B. | O(n+f) |
| C. | O(n<sup>2</sup>f<sup>2</sup>) |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 6. |
Which of the following are basic complexity classes for a function f:N->N? |
| A. | Ntime(f) |
| B. | Nspace(f) |
| C. | Space(f) |
| D. | All of the mentioned |
| Answer» E. | |
| 7. |
In order to reduce the run time of a turing machine: |
| A. | we can reduce the number of tapes |
| B. | we can increase the number of tapes |
| C. | use infinite tapes |
| D. | none of the mentioned |
| Answer» C. use infinite tapes | |