LabWeek4 - M Cyrulik
LabWeek4 - M Cyrulik
LabWeek4 - M Cyrulik
Part 1: Background
1. Convert the following binary numbers to decimal numbers.
a. 100110112 = 155
b. 111100102 = 242
c. 10001111011001102 = 36710
d. 01100111101110012 = 26553
2. Convert the following decimal numbers to binary numbers.
a. 789 = 1100010101
b. 79,786 = 10011011110101010
c. 281,944 = 1000100110101011000
d. 362,175 = 1011000011010111111
3. Convert the following binary numbers to hexadecimal numbers.
a. 100110112 = 9B
b. 111100102 = F2
c. 10001111011001102 = 8F66
d. 11110001011110112 = F17B
4. Convert the following hexadecimal numbers to decimal numbers.
a. 5E5F16 = 24159
b. 6B2D16 = 27437
c. 7A2D3216 = 8006962
d. 13F45E16 = 1307742
5. Draw the AND gate symbol and develop the truth table for it.
6. Draw the OR gate symbol and develop the truth table for it.
7. Draw the XOR gate symbol and develop the truth table for it.
Part 2: Simplify and Build a Circuit
Simplify the following Boolean expressions using Karnaugh diagrams.
4. Draw the circuit diagram for the reduced Boolean expression from #3 above.
Part 3: Build a 2-bit Full-Adder
Half Adder vs. Full Adder
In the truth table above, we see that the Sum is determined by “XORing” the two inputs, and the
Carry bit is the result of “ANDing” the two inputs, A and B.
A circuit that implements these two functions is known as a half adder. This adder is referred to as
a half adder because it only solves half the general problem of adding numbers with more than one
bit. Let's take a look at an example of what happens when we add two 8-bit numbers:
Carry 1 0 1 0 0 0 1 0
A 1 0 1 0 0 0 1 1
Adding 163 + 186:
B 1 0 1 1 1 0 1 0
Sum 0 1 0 1 1 1 0 1
With the exception of the right-most column, we are actually adding three bits: a bit from each of
the 2 numbers and a carry bit from the bits immediately to the right. Note also that each addition
produces 2 bits - the result bit (Sum), and the carry bit (C). Now, let's make a truth table for this
addition process. The truth table will have three variables, one bit from each of the numbers A and
B, and a carry in bit, Cin, which represents the carry from the previous position. The two outputs
are the sum bit and the carry out bit, Cout, which will be used in the next position.
1. Based on the above discussion, fill in the truth table. Cin A B Sum Cout
0 0 0 0 0
2. Use Karnaugh maps to simplify the two functions from 0 0 1 1 0
the truth table: 0 1 0 1 0
0 1 1 0 1
1 0 0 0 0
1 0 1 1 0
1 1 0 1 0
1 1 1 0 1
3. Based on the simplified logic, draw the circuits required to implement each:
Check your circuit for various input values, and submit a short video of your circuit working for the
following input values: 2 + 2, 1 + 1, and 3 + 3.
I apologize, I honestly could not figure out how to physically wired this, and I've run out of time.
I should have left myself with more time, but i did not.
Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.
Alternative Proxies: