MCQOPTIONS
Saved Bookmarks
| 1. |
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, with each word being ‘n’ bits long is |
| A. | m × 2n |
| B. | 2m+n |
| C. | 2mn |
| D. | m + n |
| Answer» D. m + n | |