Skip to content
Related Articles

Related Articles

ISRO | ISRO CS 2014 | Question 2
  • Last Updated : 07 May, 2018
GeeksforGeeks - Summer Carnival Banner

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

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 = 2mn.

So, option (C) is correct.

Quiz of this Question

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.

My Personal Notes arrow_drop_up
Recommended Articles
Page :