MATCHING

Identify the letter of the choice that best matches the common logical construct.
-OR(NOT(A1),NOT(A2),NOT(A3),NOT(A4))
A)#1
B)#2
C)#3
D)#4
E)#5
F)#6
G)#7
H)#8

Question

MATCHING
  
Identify the letter of the choice that best matches the common logical construct.
-OR(NOT(A1),NOT(A2),NOT(A3),NOT(A4))
A)#1 
B)#2 
C)#3 
D)#4 
E)#5 
F)#6 
G)#7 
H)#8

Quizplus · Accepted Answer

The expression OR(NOT(A1),NOT(A2),NOT(A3),NOT(A4)) can be simplified using De Morgan's laws to NOT(A1 AND A2 AND A3 AND A4). This means the output is true unless all inputs (A1, A2, A3, A4) are true. In binary, this corresponds to the case where all inputs are 1, which is the binary number 1111 or decimal 15. Since the question seems to ask for the number of true cases out of 16 possible (0 to 15 in decimal or 0000 to 1111 in binary), and only one case (all inputs true) results in a false output, there are 15 (16-1) cases where the output is true.

MATCHING Identify the Letter of the Choice That Best Matches the That