Karnaugh Maps, Simplifying If Statements
Channel:
Subscribers:
2,640
Published on ● Video Link: https://www.youtube.com/watch?v=lCeuUftr2ec
Today we learned how digital logic, logic, and if statements in software connect together, and how an Electrical Engineering technique to minimize the number of logic gates you need (called Karnaugh Mapping) can be used to reduce the complexity of your if statements as well.
Your assignment will be to apply these techniques in a code golf competition.
We then started talking about classical logic, like from the time of Aristotle.
Other Videos By Bill Kerney
2021-09-28 | Graph Theory I |
2021-09-27 | 2D Vectors and Arrays |
2021-09-27 | Scratch Part II |
2021-09-25 | Auto + Growing Vectors + Nonblocking I/O |
2021-09-24 | Introduction to Scratch |
2021-09-23 | Niagara Part II |
2021-09-23 | Landscape + Foliage, Hitscan Weapons, Niagara Particle Effects |
2021-09-23 | Syllogisms |
2021-09-23 | Vectors vs. Arrays (i.e. why Vectors are better) |
2021-09-22 | Ethics in Autonomous Vehicles |
2021-09-21 | Karnaugh Maps, Simplifying If Statements |
2021-09-21 | Destructible Meshes - Blueprint Interactions |
2021-09-20 | Ethical Systems II - Is/Ought + Virtue Ethics |
2021-09-18 | Digital Logic II |
2021-09-17 | Making Video Games Interactive + Blueprints Coding |
2021-09-17 | Doubly Nested Loops + Chars + Strings |
2021-09-17 | Ethical Theories I |
2021-09-17 | Introducing Colorslib |
2021-09-16 | Voronoi Relaxation / Lloyd's Algorithm |
2021-09-15 | How to Approach Writing Code + Lvalues vs. Rvalues |
2021-09-15 | Truth Tables II + Denying the Antecedent + Affirming the Consequent |
Tags:
csci 26
karnaugh maps
simplifying if statements
bivalent logic
aristotlean logic