Modeling Computations MCQ

Test your knowledge with important Modeling Computations MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Modeling Computations MCQs at Bissoy

• In lexical analysis of a compiler______ is used.
  ক

  DFA

  খ

  NDFA

  গ

  NFA

  ঘ

  Turing machine
• In the operating system, newly started processes can have a start in the _________
  ক

  Blocked state

  খ

  Running sate

  গ

  Ready state

  ঘ

  Exit state
• Equivalence of automata states that ____________
  ক

  two automata accept the same set of input strings

  খ

  two automata have same set of states

  গ

  two automata does not contain initial input symbols

  ঘ

  two automata share equal transition function
• Which of the following techniques refer to the equivalence of DFA and N-DFA automata?
  ক

  subset construction

  খ

  superset construction

  গ

  powerset construction

  ঘ

  finite field construction
• A deterministic automaton system can have ______ transition for a given state of an input symbol.
  ক

  exactly one

  খ

  more than one

  গ

  no transition

  ঘ

  2n transition
• Optimisation of an FSM machine can be done by ________
  ক

  Naive-bias algorithm

  খ

  Huffman encoding scheme

  গ

  Pirate-plot algorithm

  ঘ

  Hopcroft minimization algorithm
• In system engineering which of the following methods bridges the gap between the two ends of system development?
  ক

  ASM method

  খ

  VSM method

  গ

  Factor method

  ঘ

  FSM method
• Which of the following is not a member of the set of a deterministic finite state machine?
  ক

  state-transition function

  খ

  initial state

  গ

  input symbols

  ঘ

  stack
• Which of the following algorithms transforms any NFA into its identical DFA?
  ক

  Minimal set construction

  খ

  Dynamic programming

  গ

  Powerset construction

  ঘ

  Huffman coding
• How many states are there in combinatorial FSM?
  ক

  86

  খ

  219

  গ

  1

  ঘ

  132