Fundamentals of Digital Logic Flashcards
What is Voltage?
● Measure of potential Force
● It is measured in Volts
What is Current?
● Measure of electron flow across a wire
● It is measured in Amps
How are 0s and 1s represented in a computer?
It is based on digital currents
● Ground - 0 volts – represent a “0”
● Power – 5 volts – represent a “1”
What is a transistor?
● Building block of digital circuits
● Acts like a switch
What are a transistors connections, and how do they work?
● A transistor has three connections:
● Emitter
● Base
● Collector
The current between “Base” and “Emitter”
controls the current between “Collector” and “Emitter”.
What do the and, or, and not gates look like? (Visualize in head)
|) is AND, )) is Or, |*trangle is NOT
A and B as boolean expression
AB
A or B as boolean expression
A+B
not A as boolean expression
A’
Sum of Products
Way to represent boolean expression.
To create from truth table: Take 1 outputs, if input is x = 1, use x. If input Is x = 0 use x’. IF MATCHING USE NORMAL VAR
z = x’y + xy’
Product of sums
Way to represent boolean expression
To create from truth table: Take 0 outputs, if input is x = 0, use x. If input Is x = 1 use x’. IF MATCHING USE NORMAL VAR
z = (x+y)(x’+y’)
De Morgan’s law
Useful in boolean math. Negates expression
(A+B)’ = A’B’
(AB)’ = A’ + B’
Karnaugh Map
Way of expression truth table.
How to generate Karnaugh Map?
- Draw table
- Find groups of 2, 4, 8 1s that are adjacent
- Build expression from groups
Overlapping more is good because it yields a smaller final expression
How can you convert a boolean expression to only use NAND gates?
To convert a sum of products to only NAND gates negate the function twice and reduce
