MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 3 Mcqs, each offering curated multiple-choice questions to sharpen your Computer Science knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Consider the following languages: \({L_1} = \{ {a^{{{̇ z}^z}}}|̇ Z\;is\;an\;integer\} \)L2 = {azż | Ż ≥ 0}L3 = {ωω | ω ϵ {a, b}* }Which of the languages is (are) regular ?Choose the correct answer from the options given below: |
| A. | L1 and L2 only |
| B. | L1 and L3 only |
| C. | L1 only |
| D. | L2 only |
| Answer» E. | |
| 2. |
Consider the following Deterministic Finite Automaton M.Let S denote the set of eight-bit strings whose second, third, sixth and seventh bits are 1. The number of strings in S that are accepted by M is |
| A. | 0 |
| B. | 1 |
| C. | 2 |
| D. | 3 |
| Answer» D. 3 | |
| 3. |
An FSM (Finite State Machine) can be considered to be a Turning Machine of finite tape length |
| A. | Without rewinding capability and unidirectional tape movement |
| B. | Rewinding capability and unidirectional tape movement |
| C. | Without rewinding capability and bidirectional tape movement |
| D. | Rewinding capability and bidirectional tape movement |
| Answer» B. Rewinding capability and unidirectional tape movement | |