Machine-translated by Google. Questions are authored in English.
Top

Discussion

To store N-bit word the number of Flip-Flops required is :

  • A.\(2^{n}\) Flip-Flops
  • B.2n Flip-Flops
  • C.n Flip-Flops
  • D.\(2^{n-1}\) Flip-Flops

Answer: C

An N-bit word needs n Flip-Flops.

A flip-flop is a one-bit memory element: it holds a single 0 or 1. A register that stores an n-bit word therefore needs one flip-flop per bit, n in all; an 8-bit register uses 8 flip-flops.

\(2^{n}\) is the number of different values n flip-flops can hold (and the number of states of an n-bit counter), not the number of flip-flops. 2n and \(2^{n-1}\) have no such role: they would double or vastly overcount the storage needed.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.