CSC270 Homework 1

From dftwiki3
Revision as of 17:06, 28 January 2009 by Thiebaut (talk | contribs) (Problem 1)
Jump to: navigation, search

(c) --D. Thiebaut 22:01, 28 January 2009 (UTC)
[CSC270 | Back ] to Main Page


This assignment is due on Wednesday evening, at the beginning of Lab 2.

Problem 1

Assume that we define a Boolean Algebra where the two values possible are { α, β }, and where the operators are U, T, and NOT.

The U operator has the following truth table:

x y x U y

α

α

α

α

α

α

α

α

α

α

α

β


The T operator has the following truth table:

x y x T y

α

α

α

α

α

β

α

α

β

α

α

β