MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 13 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. |
Given: ∑= {a, b}L= {xϵ∑*|x is a string combination}∑4 represents which among the following? |
| A. | {aa, ab, ba, bb} |
| B. | {aaaa, abab, ε, abaa, aabb} |
| C. | {aaa, aab, aba, bbb} |
| D. | All of the mentionedView Answer |
| Answer» C. {aaa, aab, aba, bbb} | |
| 2. |
For the following change of state in FA, which of the following codes is an incorrect option? |
| A. | δ (m, 1) =n |
| B. | δ (0, n) =m |
| C. | δ (m,0) =ε |
| D. | s: accept = false; cin >> char; if char = “0” goto n; |
| Answer» C. δ (m,0) =ε | |
| 3. |
The number of elements in the set for the Language L={xϵ(∑r) *|length if x is at most 2} and ∑={0,1} is_________ |
| A. | 7 |
| B. | 6 |
| C. | 8 |
| D. | 5 |
| Answer» B. 6 | |
| 4. |
Statement 1: A Finite automata can be represented graphically; Statement 2: The nodes can be its states; Statement 3: The edges or arcs can be used for transitionsHint: Nodes and Edges are for trees and forests too.Which of the following make the correct combination? |
| A. | Statement 1 is false but Statement 2 and 3 are correct |
| B. | Statement 1 and 2 are correct while 3 is wrong |
| C. | None of the mentioned statements are correct |
| D. | All of the mentioned |
| Answer» E. | |
| 5. |
A regular language over an alphabet ∑ is one that cannot be obtained from the basic languages using the operation |
| A. | Union |
| B. | Concatenation |
| C. | Kleene* |
| D. | All of the mentioned |
| Answer» E. | |
| 6. |
FOR_THE_FOLLOWING_CHANGE_OF_STATE_IN_FA,_WHICH_OF_THE_FOLLOWING_CODES_IS_AN_INCORRECT_OPTION??$ |
| A. | δ (m, 1) =n |
| B. | δ (0, n) =m |
| C. | δ (m,0) =ε |
| D. | s: accept = false; cin >> char; |
| Answer» C. ‚âà√≠¬¨‚Ä¢ (m,0) =‚âà√≠¬¨¬µ | |
| 7. |
The number of elements in the set for the Language L={xϵ(∑r) *|length if x is at most 2} and ∑={0,1} is________?# |
| A. | 7 |
| B. | 6 |
| C. | 8 |
| D. | 5 |
| Answer» B. 6 | |
| 8. |
If an Infinite language is passed to Machine M, the subsidiary which gives a finite solution to the infinite input tape is ______________ |
| A. | Compiler |
| B. | Interpreter |
| C. | Loader and Linkers |
| D. | None of the mentioned |
| Answer» B. Interpreter | |
| 9. |
Which of the following is a not a part of 5-tuple finite automata? |
| A. | Input alphabet |
| B. | Transition function |
| C. | Initial State |
| D. | Output Alphabet |
| Answer» E. | |
| 10. |
The minimum number of states required to recognize an octal number divisible by 3 are/is |
| A. | 1 |
| B. | 3 |
| C. | 5 |
| D. | 7 |
| Answer» C. 5 | |
| 11. |
A regular language over an alphabet ‚àë is one that cannot be obtained from the basic languages using the operation$ |
| A. | Union |
| B. | Concatenation |
| C. | Kleene* |
| D. | All of the mentioned |
| Answer» E. | |
| 12. |
The non- Kleene Star operation accepts the following string of finite length over set A = {0,1} | where string s contains even number of 0 and 1 |
| A. | 01,0011,010101 |
| B. | 0011,11001100 |
| C. | ε,0011,11001100 |
| D. | ε,0011,11001100 |
| Answer» C. ‚âà√≠¬¨¬µ,0011,11001100 | |
| 13. |
Assume the R is a relation on a set A, aRb is partially ordered such that a and b are _____________ |
| A. | reflexive |
| B. | transitive |
| C. | symmetric |
| D. | reflexive and transitive |
| Answer» E. | |