Which construction would you use if your programming code needed to check if at least one of a,b,c is true? Which construction would you use if your programmin
De Morgan’s laws state that specific Boolean statements can be written in different ways with the same meaning.
A group of negated ANDs is the same as a negated group of ORs
(!a && !b && !c) === !(a || b || c)
A group of negated ORs is the same as a negated group of ANDs
(!a || !b || !c) === !(a && b && c)
- Which construction would you use if your
programming code needed to check if at least one of a,b,c is true? - Which construction would you use if your programming code needed to check that a,b,c are all true?
Explain your reasoning about choosing the programming code.
De Morgan’s laws state that specific Boolean statements can be written in different ways with the same meaning.
A group of negated ANDs is the same as a negated group of ORs
(!a && !b && !c) === !(a || b || c)
A group of negated ORs is the same as a negated group of ANDs
(!a || !b || !c) === !(a && b && c)
- Which construction would you use if your programming code needed to check if at least one of a,b,c is true?
- Which construction would you use if your programming code needed to check that a,b,c are all true?
Explain your reasoning about choosing the programming code.
Step by step
Solved in 3 steps
