Data Tables!

Truth tables are used to easily describe boolean algebra operations. Boolean algebra is an branch of mathematics dealing with, rather than the vast stretches of integers, two digits: 1 and 0 (or true and false).

There are many different types of boolean operations, and we’ll be covering them all here. We also have an interactive quiz that allows you to see how good you are at this!

NOT (and states).

Boolean states

As you may know, binary and boolean states are very simple, 1 and 0, true and false. Boolean operations occur based off the comparison of two binary values, or inversion. Thus, these two boolean states are imperative to understanding. 1 and 0 are inverses, like on to off. They are also mutually exclusive. You can’t have a state that’s both on and off at the same time!

NOT

The NOT operator inverses whatever it is affecting.

The most basic operation is one that does

Operation(s): AND

AND

AND is a boolean operation that you see in your everyday life! And in english is a conjugation, which denotes a combination of two or more objects, and in programming and binary math, it is very similar.

For Example, in English you’d say: Take this and that and you would not be fulfilling the request unless both this and that were taken.

Similarly, in Binary math, when you use the and operator, you are only considering the output true unless both are true.

AND: (XY)
python: True and False
javascript: true && false
java: true && false

X	Y	Output
TRUE	TRUE	TRUE
TRUE	FALSE	FALSE
FALSE	TRUE	FALSE
FALSE	FALSE	FALSE

NAND

NAND is the not operator for and. In other words, it is the complete inverse of the AND function.

In english this would be: DON'T take this and that. Note how the DON'T is a negative, asking you not to take both, but to take either.

In binary this would be:

NAND: (XY)’ (The ' denotes inverse)
python: not (True and False)
javascript: !(true && false)
java: !(true && false)

X	Y	Output
TRUE	TRUE	FALSE
TRUE	FALSE	TRUE
FALSE	TRUE	TRUE
FALSE	FALSE	TRUE

Inhibition

Inhibition is a pseudo-and (not actual jargon) function. Written in plain-text, the Inhibition function can be two things: X·NOT(Y) or NOT(X)·Y. It is when one input is True, but the other is False. This is the inverse of either X or Y, but not both. It can be written as X or Y Inhibition.

Inbiting X: (X’Y)
python: (Not X)&Y
javascript: !(X)&&Y
java: !(X)&&Y

X	Y	Output
TRUE	TRUE	FALSE
TRUE	FALSE	FALSE
FALSE	TRUE	TRUE
FALSE	FALSE	FALSE

Inbiting Y: (XY’)
python: X&(Not Y)
javascript: X&&!(Y)
java: X&&!(Y)

X	Y	Output
TRUE	TRUE	FALSE
TRUE	FALSE	TRUE
FALSE	TRUE	FALSE
FALSE	FALSE	FALSE

Note how the first and second terms (in their respective inhibitions) are inverted.

Operation(s): OR

AND operations require both arguments in the function to be true in order to return true. However, or operations only require one to be true to return true. OR gates being more forgiving makes them great to check for different cases that AND simply cannot take. However, there are many variations that allow for greater specificity.

OR

English Example: Take either this or that. Here, if you take this, you fulfill the request. But if you also took that, you would also fulfill the request. In fact, if you took both, you’d actually be fulfilling the request, because they didn’t specify to not take both.

Translated to binary, this is: OR: (X + Y)
python: True or False
javascript: true || false
java: true || false

X	Y	Output
TRUE	TRUE	TRUE
TRUE	FALSE	TRUE
FALSE	TRUE	TRUE
FALSE	FALSE	FALSE

NOR

Remember NAND? This is NAND, but for or. It takes the complete output of OR, and takes the inverse of it.

NOR: (X + Y)’
python: not (True or False)
javascript: !(true || false)
java: !(true || false)

X	Y	Output
TRUE	TRUE	False
TRUE	FALSE	FALSE
FALSE	TRUE	FALSE
FALSE	FALSE	True

XOR

XOR, eXclusive OR, or bitwise OR allows for a coder to only return true if specifically only one input is true, but the other input is false. For example, this would be a situation where, if you have two objects, you can only take one or the other, not both, and not none.

XOR: (X^Y)
python: True^False
javascript: true^false
java: true^false

X	Y	Output
TRUE	TRUE	FALSE
TRUE	FALSE	TRUE
FALSE	TRUE	TRUE
FALSE	FALSE	FALSE

XNOR

XNOR is the Exclusive NOR. This is the direct inverse of the XOR function, so it would be pretty simple.

XNOR: (X^Y)’
python: not (True^False)
javascript: !(true^false)
java: !(true^false)

X	Y	Output
TRUE	TRUE	TRUE
TRUE	FALSE	FALSE
FALSE	TRUE	FALSE
FALSE	FALSE	TRUE

Hacks:

Complete the following quiz below! Once you are done, take a screen shot of your score, and blog about the questions you got wrong. If you got everything right, reflect a bit on the quiz and congrats! Do a bit more below.

Coding Challenges

You can pick one coding challenge to get .9, but if you complete at least one more, you can get up to .1. If you do all three, maybe some extra credit is in order (also if you play the game you may be able to get extra as well.)

1. Download the following csv file of data. Iterate over it to find the mean of the data. However, then iterate over it again, with the stipulation that you cannot have odd numbers, if a number is divisible by 5 multiply it by 2, however, if one number meets both stipulations, keep it the same. Print out the mean of all the data, and how many words meet the first criteria
2. 
   
3. Iterate over the following file. Create a list. If the word doesn’t begin it a, b, c, or d, append it to a list. If the word ends with a, b, c, or d, append it to the list. If one word meets one, but not both of the criteria, add the suffix ism to the word and append it to the list. The print out the list.
4. 
   
5. Use this data. This is a list of dictionaries containing user data, and tweets made by the user, the likes, etc. You can use this data to do whatever you’d like, however be sure to explain and write out what and why you are selecting for. Write a small snippet on how this information could be used in the real world. Make sure your code uses at least two selection methods and displays out both the unfiltered and filtered data.

Go to Game