ISRO | ISRO CS 2014 | Question 2

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 2ⁿ
(B) 2^m+n
(C) 2^mn
(D) m+n


Answer: (C)

Explanation: Given, ‘m’ words, each of length ‘n’ bits, so total number of bits = m*n
A state of finite state automata can store 1 bit of data, and a state can have either 0 or 1.
Therefore, total number of states required by a Finite State Machine = 2^mn.

So, option (C) is correct.

Quiz of this Question

My Personal Notes arrow_drop_up

Save