Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Clear category for Boolean Algebra by Rafal.U
OPERATION_NAMES = ("conjunction", "disjunction", "implication", "exclusive", "equivalence")
def boolean(x, y, operation):
if operation == "conjunction" : #mnozenie bitowe and (&)
return x*y
if operation == "disjunction" : #suma bitowa or (|)
if x == 1 or y == 1:
return 1
return 0
if operation == "implication" : # imlikacja jezeli PRAWDA to FAŁSZ = 0,reszta przypadków 1
if x == 1 and y == 0:
return 0
return 1
if operation == "exclusive" : # XOR suma modulo 2
return (x+y)%2
if operation == "equivalence" : # negacja XOR
return (~(x+y))%2
#return 1 or 0
if __name__ == '__main__':
#These "asserts" using only for self-checking and not necessary for auto-testing
assert boolean(1, 0, "conjunction") == 0, "and"
assert boolean(1, 0, "disjunction") == 1, "or"
assert boolean(1, 1, "implication") == 1, "material"
assert boolean(0, 1, "exclusive") == 1, "xor"
assert boolean(0, 1, "equivalence") == 0, "same?"
Nov. 29, 2016
