MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 103 Mcqs, each offering curated multiple-choice questions to sharpen your Automata Theory knowledge and support exam preparation. Choose a topic below to get started.
| 101. |
Which of the following is/are an example of pigeon hole principle? |
| A. | Softball team |
| B. | Sock picking |
| C. | Hair counting |
| D. | All of the mentioned |
| Answer» E. | |
| 102. |
The language of balanced paranthesis is |
| A. | regular |
| B. | non regular |
| C. | may be regular |
| D. | none of the mentioned |
| Answer» C. may be regular | |
| 103. |
Which kind of proof is used to prove the regularity of a language? |
| A. | Proof by contradiction |
| B. | Direct proof |
| C. | Proof by induction |
| D. | None of the mentioned |
| Answer» B. Direct proof | |