Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Speedy category for Boolean Algebra by PythonWithPI
OPERATION_NAMES = ("conjunction", "disjunction", "implication", "exclusive", "equivalence")
def boolean(x, y, operation):
#table of operations for lookup
ops=('conjunction','disjunction','implication','exclusive','equivalence')
#represent ops as tuple in tuple in tuple
bool=(((0,0,1,0,1),(0,1,1,1,0)),((0,1,0,1,0),(1,1,1,0,1)))
return bool[x][y][ops.index(operation)]
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?"
March 6, 2016
