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 2n
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
Whether you're preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape, GeeksforGeeks Courses
are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we've already empowered, and we're here to do the same for you. Don't miss out - check it out now!