Which of the following is a properly reversed version of the following Boolean expression, according to De
Question:
Which of the following is a properly reversed version of the following Boolean expression, according to De Morgan’s Laws?
(2 == 3) && (–1 < 5) && isPrime(n)
a. (2 != 3) && (–1 > 5) && isPrime(n)
b. (2 == 3) || (–1 < 5) || isPrime(n)
c. !(2 == 3) && !(–1 < 5) && !isPrime(n)
d. (2 != 3) || (–1 >= 5) || !isPrime(n)
e. !(2 != 3) || !(-1 < 5) || isNotPrime(n)
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Building Java Programs A Back To Basics Approach
ISBN: 9780135471944
5th Edition
Authors: Stuart Reges, Marty Stepp
Question Posted: