Global ETD Search

41	Episode 4.02 – Truth Tables Tarnoff, David 01 January 2020 (has links) In this episode, we introduce one of the most important tools in the description of logic operations: the truth table. Not only do truth tables allow us to describe a logic operation, they provide a means for us to prove logical equivalence. computer organization computer design truth tables Computer Sciences
42	Episode 4.03 – Combinational Logic Tarnoff, David 01 January 2020 (has links) Individual logic gates are not very practical. Their power comes when you combine them to create combinational logic. This episode takes a look at combinational logic by working through an example in order to generate its truth table. computer organization computer design combinational logic Computer Sciences
43	Episode 4.04 – NAND, NOR, and Exclusive-NOR Logic Tarnoff, David 01 January 2020 (has links) The simplest combinational logic circuits are made by inverting the output of a fundamental logic gate. Despite this simplicity, these gates are vital. In fact, we can realize any truth table using a circuit made only from AND gates with inverted outputs. computer organization computer design NAND NOR exclusive-NOR Computer Sciences
44	Episode 4.05 – Introduction to Boolean Algebra Tarnoff, David 01 January 2020 (has links) Truth tables and circuit diagrams fall short in many ways including their abilities to evaluate and manipulate combinational logic. By using algebraic methods to represent logic expressions, we can apply properties and identities to improve performance. computer organization computer design Boolean Algebra Computer Sciences
45	Episode 4.06 – Properties of Boolean Algebra Tarnoff, David 01 January 2020 (has links) In this episode, we bring together our knowledge of logic operations, truth tables, and boolean expressions to prove some basic properties of Boolean algebra. computer organization computer design Boolean Algebra properties Computer Sciences
46	Episode 4.07 – Identities of Boolean Algebra Tarnoff, David 01 January 2020 (has links) We are familiar with algebraic laws such as multiply zero by anything, and we get zero. In this episode, we see how a Boolean expression containing a constant, a duplicated signal, or a signal being combined with its inverse will simplify…always. computer organization computer design Boolean algebra identities Computer Sciences
47	Episode 4.08 – DeMorgan’s Theorem Tarnoff, David 01 January 2020 (has links) In this episode, we add one more tool to our Boolean algebra toolbox: DeMorgan’s Theorem. We then use it, along with some of our other tools, to modify an expression down to its simplest form. computer organization computer design DeMorgan's theorem Computer Sciences
48	Episode 4.10 – More Boolean Simplifications Tarnoff, David 01 January 2020 (has links) Because many students have trouble when trying to simplify Boolean expressions, we’re going to dedicate another episode to examples of simplification. We’re also going to show how sometimes, there’s more than one way to crack an egg. computer organization computer design Boolean simplifications Computer Sciences
49	Episode 5.01 – The Sum-of-Products Expression Tarnoff, David 01 January 2020 (has links) Who knew how easy it would be to derive a Boolean expression from a truth table? By following a few simple steps, sum-of-products expressions are quickly converted to and from truth tables. In addition, the SOP expression is a heck of a performer. computer organization computer design sum-of-products expression Computer Sciences
50	Episode 5.02 – NAND Logic Tarnoff, David 01 January 2020 (has links) The NAND gate outputs a logic zero only when all its inputs equal logic one. Let’s explore how this universal gate can be used to implement any Boolean expression. computer organization computer design NAND logic Computer Sciences

Search results