MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 10 Mcqs, each offering curated multiple-choice questions to sharpen your Discrete Mathematics knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
In lexical analysis of a compiler______ is used. |
| A. | DFA |
| B. | NDFA |
| C. | NFA |
| D. | Turing machine |
| Answer» B. NDFA | |
| 2. |
In the operating system, newly started processes can have a start in the _________ |
| A. | Blocked state |
| B. | Running sate |
| C. | Ready state |
| D. | Exit state |
| Answer» D. Exit state | |
| 3. |
Equivalence of automata states that ____________ |
| A. | two automata accept the same set of input strings |
| B. | two automata have same set of states |
| C. | two automata does not contain initial input symbols |
| D. | two automata share equal transition function |
| Answer» B. two automata have same set of states | |
| 4. |
Which of the following techniques refer to the equivalence of DFA and N-DFA automata? |
| A. | subset construction |
| B. | superset construction |
| C. | powerset construction |
| D. | finite field construction |
| Answer» C. powerset construction | |
| 5. |
A deterministic automaton system can have ______ transition for a given state of an input symbol. |
| A. | exactly one |
| B. | more than one |
| C. | no transition |
| D. | 2n transition |
| Answer» B. more than one | |
| 6. |
Optimisation of an FSM machine can be done by ________ |
| A. | Naive-bias algorithm |
| B. | Huffman encoding scheme |
| C. | Pirate-plot algorithm |
| D. | Hopcroft minimization algorithm |
| Answer» C. Pirate-plot algorithm | |
| 7. |
In system engineering which of the following methods bridges the gap between the two ends of system development? |
| A. | ASM method |
| B. | VSM method |
| C. | Factor method |
| D. | FSM method |
| Answer» B. VSM method | |
| 8. |
Which of the following is not a member of the set of a deterministic finite state machine? |
| A. | state-transition function |
| B. | initial state |
| C. | input symbols |
| D. | stack |
| Answer» C. input symbols | |
| 9. |
Which of the following algorithms transforms any NFA into its identical DFA? |
| A. | Minimal set construction |
| B. | Dynamic programming |
| C. | Powerset construction |
| D. | Huffman coding |
| Answer» C. Powerset construction | |
| 10. |
How many states are there in combinatorial FSM? |
| A. | 86 |
| B. | 219 |
| C. | 1 |
| D. | 132 |
| Answer» D. 132 | |