CSE 120 Quiz 2 With 100% correct answers
( graded A+ )
T/F In Boolean algebra, 1x0=0 - answer TRUE
To change a 3-input NAND gate into a 3-input NOR gate would require - answer 4 inverters
The least number of gates that could be used to build logic circuit with the boolean algebra
expression (A+B+C)' - answer 1
T/F Any combinational logic function can be built using combinations of inverters, ANDs and ORs
- answer TRUE
An OR gate is equivalent to - answer A NAND with bubbles on its inputs
A NOR gate with all its inputs tied together is equivalent to - answer NOT
The final output of a sum-of-products circuit is generated by - answer an OR
How many NAND gates does it take to make an AND gate - answer 2
( graded A+ )
T/F In Boolean algebra, 1x0=0 - answer TRUE
To change a 3-input NAND gate into a 3-input NOR gate would require - answer 4 inverters
The least number of gates that could be used to build logic circuit with the boolean algebra
expression (A+B+C)' - answer 1
T/F Any combinational logic function can be built using combinations of inverters, ANDs and ORs
- answer TRUE
An OR gate is equivalent to - answer A NAND with bubbles on its inputs
A NOR gate with all its inputs tied together is equivalent to - answer NOT
The final output of a sum-of-products circuit is generated by - answer an OR
How many NAND gates does it take to make an AND gate - answer 2
