Author Question: MOD number = 2n, where n = number of flip-flops. Indicate whether the statement is true or ... (Read 56 times)

asan beg · **on:** Jul 28, 2018

MOD number = 2n, where n = number of flip-flops.

Indicate whether the statement is true or false

Question 2

Because all the bit positions in the preceeding problem contain 1s, the simplest approach to completing the conversion for the above problem would be to:

A) determine the weight of the MSB and add 1 to that value.
B) determine the number of bits, raise 2 to that value and then subtract 1.
C) determine the weight of each of the bit positions and sum the results.
D) simply determine the weight of the MSB.