MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 5 Mcqs, each offering curated multiple-choice questions to sharpen your Automata Theory Questions and Answers knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
The sum of minimum and maximum number of final states for a DFA n states is equal to: |
| A. | n+1 |
| B. | n |
| C. | n-1 |
| D. | n+2 |
| Answer» B. n | |
| 2. |
The maximum sum of in degree and out degree over a state in a DFA can be determined as: |
| A. | ∑= {a, b, c, d} |
| B. | 4+4 |
| C. | 4+16 |
| D. | 4+0 |
| E. | depends on the Language |
| Answer» E. depends on the Language | |
| 3. |
Which of the following x is accepted by the given DFA (x is a binary string ∑= {0,1})? |
| A. | divisible by 3 |
| B. | divisible by 2 |
| C. | divisible by 2 and 3 |
| D. | divisible by 3 and 2 |
| Answer» E. | |
| 4. |
δˆ tells us the best: |
| A. | how the DFA S behaves on a word u |
| B. | the state is the dumping state |
| C. | the final state has been reached |
| D. | Kleene operation is performed on the set |
| Answer» B. the state is the dumping state | |
| 5. |
According to the 5-tuple representation i.e. FA= {Q, ∑, δ, q, F} |
| A. | Statement 1: q ϵ Q’; Statement 2: FϵQ |
| B. | Statement 1 is true, Statement 2 is false |
| C. | Statement 1 is false, Statement 2 is true |
| D. | Statement 1 is false, Statement 2 may be true |
| E. | Statement 1 may be true, Statement 2 is false |
| Answer» C. Statement 1 is false, Statement 2 is true | |