=====discrete Keyword 1=====
Converse Nonimplication

====Definition====
Converse Non-implication is the negation of the reverse of implication. implication is if ... then where it is only false if the first term "p" is true and the second term "q" is false so converse non-implication is only true if the first term "p" is false and the second term "q" is true 
====References====

  *http://en.wikipedia.org/wiki/Converse_nonimplication
  *http://en.wikipedia.org/wiki/Conversion_(logic)
  *http://simple.wikipedia.org/wiki/Implication_(logic)
  *http://en.wikipedia.org/wiki/Converse_implication

=====Discrete keyword 1 Phase 2=====
exclusive disjunction/nonequivalence
====Definition====
Exclusive disjunction means that only one can be true, but not both.  
It's basically an XOR.
====References====
http://en.wikipedia.org/wiki/Exclusive_or\\
====Demonstration====
Demonstration of the indicated keyword.

If you wish to aid your definition with a code sample, you can do so by using a wiki **code** block, an example follows:

<code c>
/*
 * Exclusive Disjunction
 */
#include <stdio.h>

int main()
{
    int p;
    int q;
    int r;
     
    printf("Enter a 1 or a 0 to xor:\n");
    scanf("%d", &p);
    
    printf("Enter a second 1 or 0:\n");
    scanf("%d", &q);
    
    r=p^q;
    
    printf("The xor of the values you've entered is: %d",r);
    
    
    
    
    return(0);
}
</code>