Question 1

A Mod-1000 counter requires a chain containing ______ T-FF's.

Accepted Answer

$\text { 10. } 2 ^ { 9 } = 512$ is not sufficient.

Question 2

The number of inputs to an N-input AND gate in an efficient Mod-1000 counter is N=____.

Accepted Answer

7.100110= 11111010012 contains 7 1's.See Section 6.5.2.

Question 3

The number of inputs to an N-input AND gate in an efficient Mod-101 counter is N=____.

Accepted Answer

$\text { 4. } 100 _ { 10 } = 64 + 32 + 4 + 1 = 1100101 _ { 2 } \text { contains four } 1 ^ { \prime } \mathrm { s } \text {. }$

Question 4

Your computer has a memory with 16-bit addresses.The maximum number of memory locations
that can be addressed equals ____.

Accepted Answer

The answer of Your computer has a memory with 16-bit...

Question 5

You have a Mod-8 counter and a Mod-16 counter.Using all the T-FFs from both counters you can make Mod-N counter.The maximum value for N=_____.

Accepted Answer

The answer of You have a Mod-8 counter and a...

A Mod-1000 counter requires a chain containing ______ T-FF's.

The number of inputs to an N-input AND gate in an efficient Mod-1000 counter is N=____.