Boolean operators: Difference between revisions

From Computer Science Wiki
No edit summary
 
(20 intermediate revisions by the same user not shown)
Line 1: Line 1:
<center>
<blockquote style="padding: 5px; background-color: #FFF8DC; border: solid thin gray;">
  [[File:Exclamation.png]] This is an '''important concept'''.  You should fully understand this.
</blockquote>
</center>
[[File:binary.png|frame|right|This is a basic concept in computer science]]
[[File:binary.png|frame|right|This is a basic concept in computer science]]


Line 10: Line 4:




== Boolean==  
== Boolean operators ==  
 
 
[[File:Boolean circuits why.png]]
 
 
 
 
This is one of the better videos I've seen on boolean. Content gratefully used with permission :  <ref>http://cs50.tv/2015/fall/#license,psets</ref>
This is one of the better videos I've seen on boolean. Content gratefully used with permission :  <ref>http://cs50.tv/2015/fall/#license,psets</ref>


Line 18: Line 19:
</html>
</html>


== Do you understand this topic? ==  
== Truth Tables ==


<html>
<iframe width="560" height="315" src="https://www.youtube.com/embed/-7VHO_ZHV14" frameborder="0" allow="autoplay; encrypted-media" allowfullscreen></iframe>
</html>


== Boolean Logic and Logic Gates ==
From crash course computer science comes this EXCELLENT video teaching us about boolean logic and logic gates<ref>https://www.youtube.com/watch?v=gI-qXk7XojA</ref>


== Do you have an advanced understanding about this topic? ==  
<html>
 
<iframe width="560" height="315" src="https://www.youtube.com/embed/gI-qXk7XojA" frameborder="0" allowfullscreen></iframe>
*[[2.1.11 Define the Boolean operators: AND, OR, NOT, NAND, NOR and XOR. [[Level 1]]
</html>
*[[2.1.12 Construct truth tables using the above operators. [[Level 3]]
*[[2.1.13 Construct a logic diagram using AND, OR, NOT, NAND, NOR and XOR gates. [[Level 3]]
 
 


== See Also ==
== Standards ==


* Define the Boolean operators: AND, OR, NOT, NAND, NOR and XOR.
* Construct truth tables using the above operators.
* Construct a logic diagram using AND, OR, NOT, NAND, NOR and XOR gates.


== References ==
== References ==

Latest revision as of 10:04, 8 October 2020

This is a basic concept in computer science

In computer science, the Boolean data type is a data type, having two values (usually denoted true and false), intended to represent the truth values of logic and Boolean algebra. It is named after George Boole, who first defined an algebraic system of logic in the mid 19th century. The Boolean data type is primarily associated with conditional statements, which allow different actions and change control flow depending on whether a programmer-specified Boolean condition evaluates to true or false. It is a special case of a more general logical data type; logic does not always have to be Boolean.[1]


Boolean operators[edit]

Boolean circuits why.png



This is one of the better videos I've seen on boolean. Content gratefully used with permission : [2]


Truth Tables[edit]

Boolean Logic and Logic Gates[edit]

From crash course computer science comes this EXCELLENT video teaching us about boolean logic and logic gates[3]

Standards[edit]

  • Define the Boolean operators: AND, OR, NOT, NAND, NOR and XOR.
  • Construct truth tables using the above operators.
  • Construct a logic diagram using AND, OR, NOT, NAND, NOR and XOR gates.

References[edit]