Procuring digital preservation CAN be quick and painless with our new dynamic...
Digital logic assn
1. Date: 10.4.2020 I BCA-A
DIGITAL LOGIC
ASSIGNMENT
Last date of submission of handwritten work is on 13.4.2020 11:59 PM
1. Perform the following conversions:-
a) Convert (4057.06)8 to decimal =
b) Convert (5C7)16 to decimal =
c) Convert A0F9.0EB16 to decimal =
d) Convert (163.875)10 to binary =
e) Convert 367.528 to binary =
f) Convert 110101.1010102 to octal =
g) Convert 1245 to hex =
h) Convert 756.6038 to hex =
i) Convert B9F.AE16 to octal =
j) Convert (58)10 to BCD =
2. Reduce the following Boolean expression:-
a) [(A + B’) (C + D’)]’
b) [(P + Q’) (R’ + S)]’
c) (A + (BC)’)’ (AB’ + ABC)
3. Simplify the following Boolean expression as far as possible, using the postulates
and theorems of Boolean algebra. DO NOT use a Karnaugh map except possibly to
check your work.
f (w, x, y) = wxy + wx + wy + wxy
4. Given Y = f (w, x, y, z) = M (0, 1, 3, 5, 13),
a) Write the complete truth table.
b) Use K map- Write Y = f (w, x, y, z) in minimized POS form.
c) Use K map-Write Y = f (w, x, y, z) in minimized SOP form.
5. Find 3510−7210 using two’s complement format with 8-bit numbers. Then convert
your result back to decimal.
6. Find 6510−2510 using one’s complement format with 8-bit numbers. Then convert
your result back to decimal.
7. Add 6510 + 7210 using 8-bit sign-magnitude format for the numbers. Convert your
result to decimal. Is your answer correct? Why or why not?
8. Draw a block diagram of a 4-to-1 multiplexer. Label all inputs and outputs.
9. Draw a block diagram of a 4-to-2 encoder. Label all inputs and outputs. How is
the 4-to-2 encoder different from a 4-to-1 multiplexer?
10. Write the truth table for a 4-to-2 priority encoder. Write a simplified truth table
for a 4-to-1 multiplexer (hint: your multiplexer truth table should have 2 inputs).
![Date: 10.4.2020 I BCA-A
DIGITAL LOGIC
ASSIGNMENT
Last date of submission of handwritten work is on 13.4.2020 11:59 PM
1. Perform the following conversions:-
a) Convert (4057.06)8 to decimal =
b) Convert (5C7)16 to decimal =
c) Convert A0F9.0EB16 to decimal =
d) Convert (163.875)10 to binary =
e) Convert 367.528 to binary =
f) Convert 110101.1010102 to octal =
g) Convert 1245 to hex =
h) Convert 756.6038 to hex =
i) Convert B9F.AE16 to octal =
j) Convert (58)10 to BCD =
2. Reduce the following Boolean expression:-
a) [(A + B’) (C + D’)]’
b) [(P + Q’) (R’ + S)]’
c) (A + (BC)’)’ (AB’ + ABC)
3. Simplify the following Boolean expression as far as possible, using the postulates
and theorems of Boolean algebra. DO NOT use a Karnaugh map except possibly to
check your work.
f (w, x, y) = wxy + wx + wy + wxy
4. Given Y = f (w, x, y, z) = M (0, 1, 3, 5, 13),
a) Write the complete truth table.
b) Use K map- Write Y = f (w, x, y, z) in minimized POS form.
c) Use K map-Write Y = f (w, x, y, z) in minimized SOP form.
5. Find 3510−7210 using two’s complement format with 8-bit numbers. Then convert
your result back to decimal.
6. Find 6510−2510 using one’s complement format with 8-bit numbers. Then convert
your result back to decimal.
7. Add 6510 + 7210 using 8-bit sign-magnitude format for the numbers. Convert your
result to decimal. Is your answer correct? Why or why not?
8. Draw a block diagram of a 4-to-1 multiplexer. Label all inputs and outputs.
9. Draw a block diagram of a 4-to-2 encoder. Label all inputs and outputs. How is
the 4-to-2 encoder different from a 4-to-1 multiplexer?
10. Write the truth table for a 4-to-2 priority encoder. Write a simplified truth table
for a 4-to-1 multiplexer (hint: your multiplexer truth table should have 2 inputs).](https://image.slidesharecdn.com/digitallogicassn-200410113355/85/digital-logic-assn-1-320.jpg?cb=1684144425)
