Difference between revisions of "CSC270 Homework 1"
(→Problem 1) |
(→Problem 1) |
||
| Line 12: | Line 12: | ||
The '''U''' operator has the following truth table: | The '''U''' operator has the following truth table: | ||
| − | {| | + | {| border="1" cellpadding="2" |
| − | + | ! a | |
| − | + | ! b | |
| − | + | ! a U b | |
|- | |- | ||
| | | | ||
Revision as of 17:05, 28 January 2009
(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:
| a | b | a U b |
|---|---|---|
|
α |
α |
α |
|
α |
α |
α |
|
α |
α |
α |
|
α |
α |
β |
