Lab46 Wiki

This page is read only. You can view the source, but not change it. Ask your administrator if you think this is wrong.
=====discrete Keyword 1=====
Left Complementation

====Definition====

Left Complement is similar to negation p.  it is a logic operation that basically negates the p.  For example if p was a 1 it would not matter what q was the result would be a 0.  Likewise if p was a 0 regardless of q the result would be a 1.  



====References====

Reference 1:  http://en.wikipedia.org/wiki/Negation

=====discrete Keyword 1 Phase 2=====
**//Right Complementation//**

====Definition====
When given a Truth Table, you see two columns of two different values that are related to each other and show opposite relationships, most of the time they are represented by F for false and T for true. Right Complementation is the opposite of the second column, or the right one. When representing each of the results for a 4 by 2 table, there are 16 possible results, one of them being the right complementation, which is actually represented by negation q. 
====References====

  * Matt Haas
  * http://en.wikipedia.org/wiki/Truth_table
====Demonstration====
Demonstration of the indicated keyword.

Right Complementation is very similar the Negation P except its Negation Q if you get a combination of P:1 and Q:0 the result will be 1 negating Q and similarly if it is P:0 and Q:1 then the result will be 0.  so no mater what P is the answer will always be the negation of Q

The c code block below reflects this.  

<code c>
char NP(char P, char Q)                                                                                      
  2 {
  3     char x;
  4 
  5     if (Q == 0)
  6         x = 1;
  7     else
  8         x = 0;
  9 
 10     return (x);
 11 }
</code>
Lab46 Wiki

User Tools

Site Tools

Page Tools
