edited by
6,417 views
20 votes
20 votes

What is the minimum size of ROM required to store the complete truth table of an $8-bit \times 8-bit$ multiplier?

  1. $32 K \times 16$ bits
  2. $64 K \times 16$ bits
  3. $16 K \times 32$ bits
  4. $64 K \times 32$ bits
edited by

2 Answers

Best answer
30 votes
30 votes
Answer - B.

Multiplying $2\ 8$ bit digits will give result in maximum $16$ bits

Total number of multiplications possible $= 2^8 \times 2^8$

Hence, space required $= 64K \times 16$ bits
edited by
3 votes
3 votes
I think the answer should be 64K x 32 bits. Because we have an output for each of 2^8 x 2^8 combinations of inputs. But in question, they have asked to store the total truth table which includes inputs as well to tell which output corresponds to which input
Answer:

Related questions

25 votes
25 votes
2 answers
1
Ishrat Jahan asked Nov 2, 2014
4,278 views
The number $(123456)_8$ is equivalent to$\text{(A72E)}_{16}$ and $(22130232)_4$$\text{(A72E)}_{16}$ and $(22131122)_4$$\text{(A73E)}_{16}$ and $(22130232)_4$$\text{(A62E)...
26 votes
26 votes
4 answers
2
Ishrat Jahan asked Nov 2, 2014
10,254 views
Using a $4-bit$ $2's$ complement arithmetic, which of the following additions will result in an overflow?$1100 + 1100$$0011 + 0111$$1111 + 0111$i onlyii onlyiii onlyi and...
29 votes
29 votes
5 answers
3
Ishrat Jahan asked Nov 1, 2014
11,173 views
What is the minimum number of $\text{NAND}$ gates required to implement a $2\text{-input EXCLUSIVE-OR}$ function without using any other logic gate?$2$$4$$5$$6$
36 votes
36 votes
4 answers
4
Ishrat Jahan asked Nov 2, 2014
6,828 views
The function $A \bar B C + \bar A B C + AB \bar C+ \bar A \bar B C+ A \bar B \bar C$ is equivalent to$A \bar C + AB+ \bar A C$$A \bar B+ A \bar C+ \bar A C$$\bar A B+ A \...