Logic diagram: Difference between revisions

From Computer Science Wiki
Line 14: Line 14:
<html>
<html>
<iframe width="560" height="315" src="https://www.youtube.com/embed/VBDoT8o4q00" frameborder="0" allowfullscreen></iframe>
<iframe width="560" height="315" src="https://www.youtube.com/embed/VBDoT8o4q00" frameborder="0" allowfullscreen></iframe>
</html>
<html>
<iframe width="420" height="315" src="https://www.youtube.com/embed/q2OBYz3K6PM" frameborder="0" allowfullscreen></iframe>
</html>
</html>



Revision as of 07:02, 27 August 2017

Exclamation.png This is an important concept. You should fully understand this.

This is a basic concept in computer science

A truth table is a mathematical table used in logic—specifically in connection with Boolean algebra, boolean functions, and propositional calculus—to compute the functional values of logical expressions on each of their functional arguments, that is, on each combination of values taken by their logical variables (Enderton, 2001). In particular, truth tables can be used to tell whether a propositional expression is true for all legitimate input values, that is, logically valid.[1]


Logic Diagrams[edit]

Do you understand this topic?[edit]

This can be tricky. There is a neat interactive web-based application here that is helpful for understanding logic diagrams

  1. Construct a logic diagram using AND
  2. Construct a logic diagram using OR
  3. Construct a logic diagram using NOT
  4. Construct a logic diagram using NAND
  5. Construct a logic diagram using NOR
  6. Construct a logic diagram using XOR

References[edit]