Question: The next 3 questions use the following boolean expression: T = ((NOT A ) AND (((NOT B ) AND C ) OR ( B AND
The next 3 questions use the following boolean expression:
T = ((NOT A) AND (((NOT B) AND C) OR (B AND C))) OR (A AND (((NOT B) AND C) OR (B AND C)))
1. Complete the truth table for the circuit. You may copy this table to fill out.
| A | B | C | T |
| 0 | 0 | 0 | |
| 0 | 0 | 1 | |
| 0 | 1 | 0 | |
| 0 | 1 | 1 | |
| 1 | 0 | 0 | |
| 1 | 0 | 1 | |
| 1 | 1 | 0 | |
| 1 | 1 | 1 |
|
2. Given a computer with 10-bit addressability and 5 bits for the address, what's the maximum number of memory this computer can have in bits?
3. Given a computer with 300 memory locations, each 18-bit assessable, how many bits of addressing are needed?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
