Scribd
Upload
25 views

Assignment 1

Uploaded by

Mohammad Nasser
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
25 views

Assignment 1

Uploaded by

Mohammad Nasser
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 8

Mohammad Nasser

Assignment 1

Problem 1:

Multiply, subtract, and add in binary:


11011
X1011 = 11011
+110110 = 1111111

1 1 1 1 (Sub)
−1 0 1 0 = 1101

1 1 1 1 (Add)
+1 0 1 0 = 10101

Problem 2:
Convert (7813.400)9 to hexadecimal (base 16). Carry out your answer to 3 places
past the decimal point.
To convert a number from base 9 to base 16, we first convert it to base 10 and then
from base 10 to base 16.
Given: (7813.400)₉
Let's convert it to base 10: =
(7813.400)₉ = 7 * 9^3 + 8 * 9^2 + 1 * 9^1 + 3 * 9^0 + 4 * 9^-1 + 0 * 9^-2 + 0 * 9^-3
= 7 * 729 + 8 * 81 + 1 * 9 + 3 * 1 + 4 * (1/9)
= 5103 + 648 + 9 + 3 + 0.4444
= 5763.444

Problem_3
1. Write a Boolean equation in sum-of-products and product-of-sums canonical form for
each of the following truth tables (C) and (D)
y' = A'.B + B.C' + A.D
y" = (A'.B + B.C' + A.D)'
y = (A + B') (B' + C) (A' + D')
Mohammad Nasser

2. Simplify the obtained solution using the rules of Boolean Algebra


Y = A'B' + B'D' + ACD'

3. Use Karnaugh maps to verify your answers


C'.D' C'.D C.D C.D'
A'.B' 1 1 1 1
A'.B 0 0 0 0
A.B 0 0 0 1
A.B' 1 0 0 1

4. Draw the corresponding circuits for each design

Problem_4
1. Write Boolean equations for the circuit shown below.
Mohammad Nasser

2. Derive the truth table


Mohammad Nasser

3. Minimize the obtained equation by rules of Boolean algebra.

4. Verify the solution using Karnaugh maps


Mohammad Nasser

Problem_5:
1. Simplify the following Boolean equations using Boolean theorems.
Mohammad Nasser

Problem_6
1. Find a minimal Boolean equation for the function shown below
If we choose to include the don't care entries, our simplified equation becomes:

Y = a'b'c' + b'c'd + acd' + ab'd + b'cd

2. Check for correctness using a truth table and K-map (You may not need to consider all
combinations, just consider few remarkable values)
We can verify the correctness of our simplified equation by creating a truth
table for the given function and comparing it with the truth table for our
simplified equation. We only need to consider the input combinations where
the output is 1 or X (don't care):

abcd Y Y = a'b'c' + b'cd + acd' + ab'd


----------------------------
0000 X X

0001 X X

0010 X X

0011 0 0

0100 X X

0101 0 0

0110 X X

0111 X X

1000 1 1

1001 0 0

1010 X X

1011 1 1

1100 1 1
Mohammad Nasser

1101 1 1

1110 X X

1111 1 1

Problem 7:
A switching circuit has three inputs (A, B, C) and one output (Z). If A= 0, the output Z
is
the exclusive-OR of B and C. If A = 1, the output is the equivalence of B and C.
Equivalence of B and C is defined as: (B
⊕C)’
1. Find the truth table for Z.
A | B | C | Z
---------------------
0 | 0 | 0 | 0
0 | 0 | 1 | 1
0 | 1 | 0 | 1
0 | 1 | 1 | 0
1 | 0 | 0 | 1
1 | 0 | 1 | 0
1 | 1 | 0 | 0
1 | 1 | 1 | 1

2. Write the minterm expansion for Z in decimal form and in terms of A, B, C.


Z=Σ(1,2,3,7)

3. Write the maxterm expansion for Z in decimal form and in terms of A, B, C.


Z=Π(0,4,5,6)

4. Verify the minterm result by mean of KMap


Mohammad Nasser

BC
00 01 11 10
A +---+---+---+---+
0 | 0| 1| 0| 1|
+---+---+---+---+
1 | 1| 0| 0| 1|
+---+---+---+---+

5. Draw the corresponding circuit

You might also like