Difference between revisions of "CSC270 Homework 1"

From dftwiki3
Jump to: navigation, search
(Problem 1)
(Problem 1)
Line 13: Line 13:
  
 
{| border="1" cellpadding="2"
 
{| border="1" cellpadding="2"
! a    
+
! x    
! b      
+
! y      
! a U b
+
! x U y
 
|-
 
|-
 
|
 
|
Line 37: Line 37:
 
|  
 
|  
 
α
 
α
 +
|-
 +
|
 +
α
 +
|
 +
α 
 +
|
 +
β
 +
|}
 +
 +
 +
The '''T''' operator has the following truth table:
 +
 +
{| border="1" cellpadding="2"
 +
! x   
 +
! y     
 +
! x T y
 +
|-
 +
|
 +
α
 +
|
 +
α 
 +
|
 +
α
 +
|-
 +
|
 +
α
 +
|
 +
α 
 +
|
 +
β
 +
|-
 +
|
 +
α
 +
|
 +
α 
 +
|
 +
β
 
|-
 
|-
 
|
 
|

Revision as of 17:06, 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:

x y x U y

α

α

α

α

α

α

α

α

α

α

α

β


The T operator has the following truth table:

x y x T y

α

α

α

α

α

β

α

α

β

α

α

β