MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 11 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. |
For the given algorithm, find the probability of finding after k iterations: |
| A. | (1/2)k |
| B. | (1-(1/3))k |
| C. | 1-(1/2)k |
| D. | None of the mentionedView Answer |
| Answer» D. None of the mentionedView Answer | |
| 2. |
State true or false:Statement: A turing machine has the capability of using randomly ‘generated’ numbers. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 3. |
Prisonner’s dilemma can be related to the following:a) cooperative behaviourb) graph theoryc) Both ( |
| A. | cooperative behaviourb) graph theoryc) Both (a) and ( |
| B. | graph theory |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» B. graph theory | |
| 4. |
Which of the following options match the given statement:Statement: The algorithms that use the random input to reduce the expected running time or memory usage, but always terminate with a correct result in a bounded amount of time. |
| A. | Las Vegas Algorithm |
| B. | Monte Carlo Algorithm |
| C. | Atlantic City Algorithm |
| D. | None of the mentioned |
| Answer» B. Monte Carlo Algorithm | |
| 5. |
Which_of_the_following_can_be_solved_in_computer_science?$ |
| A. | P=BPP problem |
| B. | NP=co-NP problem |
| C. | Do one way problems exist? |
| D. | All of the mentioned |
| Answer» E. | |
| 6. |
Unix sort command uses _________ as its sorting technique. |
| A. | Quick Sort |
| B. | Bucket Sort |
| C. | Radix Sort |
| D. | Merge Sort |
| Answer» B. Bucket Sort | |
| 7. |
Prisonner’s dilemma can be related to the following:$ |
| A. | cooperative behaviour |
| B. | graph theory |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» B. graph theory | |
| 8. |
Which of the following algorithms are probably correct as well as fast? |
| A. | Las Vegas Algorithm |
| B. | Monte Carlo Algorithm |
| C. | Atlantic City Algorithm |
| D. | All of the mentioned |
| Answer» D. All of the mentioned | |
| 9. |
Which of the following are probalistic algorithms? |
| A. | Las Vegas Algorithm |
| B. | Monte Carlo Algorithm |
| C. | Atlantic City Algorithm |
| D. | All of the mentioned |
| Answer» E. | |
| 10. |
Which of the following options match the given statement: |
| A. | |
| B. | Las Vegas Algorithm |
| C. | Monte Carlo Algorithm |
| Answer» B. Las Vegas Algorithm | |
| 11. |
A randomized algorithm uses random bits as input inorder to achieve a _____________ good performance over all possible choice of random bits. |
| A. | worst case |
| B. | best case |
| C. | average case |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |