The number of states required by a Finite State Machine, to simulate the…
2014
The number of states required by a Finite State Machine, to simulate the behavior of a computer with a memory capable of storing 'm' words, each of length 'n' bits is?
- A.
m x 2n
- B.
2m+n
- C.
2mn
- D.
m+n
Attempted by 182 students.
Show answer & explanation
Correct answer: C
The total memory capacity is determined by the number of words multiplied by the length of each word.
Total bits = m × n.
Each bit can be in one of two states (0 or 1). Therefore, the total number of unique memory configurations is 2 raised to the power of the total bits.
Thus, the number of states required is 2^(mn).