Scribd
Upload
8 views1 page

Assignment 1

This document outlines Assignment 1 for a Digital Logic Design course, detailing tasks related to number systems, conversions, and Boolean function simplifications. The assignment includes explanations of binary, octal, decimal, and hexadecimal systems, as well as conversion exercises and applications of 2's complement. Additionally, it requires the use of Karnaugh Maps (K-Map) for simplifying Boolean functions into Sum-of-Products and Product-of-Sums forms.

Uploaded by

yawarzaman2
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views1 page

Assignment 1

This document outlines Assignment 1 for a Digital Logic Design course, detailing tasks related to number systems, conversions, and Boolean function simplifications. The assignment includes explanations of binary, octal, decimal, and hexadecimal systems, as well as conversion exercises and applications of 2's complement. Additionally, it requires the use of Karnaugh Maps (K-Map) for simplifying Boolean functions into Sum-of-Products and Product-of-Sums forms.

Uploaded by

yawarzaman2
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

DLD – Digital Logic Design

Assignment 1
Date: 13-12-2021
Due Date: 20-12-2021
Instructor: Dr. F. Anjam Total Marks: 80 (relative)

1. Explain the following number systems with examples. (CLO 1 --- marks = 10)
a. Binary
b. Octal
c. Decimal
d. Hexadecimal

2. Convert the following. (CLO 1 --- marks = 10)


a. 101011.1012 to ( )10
b. 5607.258 to ( )10
c. F9E2.50C16 to ( )10
d. 1100112 to ( )16
e. AB0116 to ( )8

3. If If A = 10012 and B = 0011, using 2’s compliment, find (CLO 1 --- marks = 10)
a. A – B
b. B – A

4. If M = 1111012 and N = 0100002, using 2’s compliment, find (CLO 1 --- marks = 10)
a. M – N
b. N – M

5. Using K-Map, simplify the Boolean functions into Sum-of-products (SOP) forms and draw
the simplified logic diagrams: (CLO 2 --- marks = 20)
a. F(A, B, C, D) = ∑ (1, 3, 6, 7, 9, 10, 12, 14)
b. F(X, Y, Z) = XY + YZ’ + XY’Z + XYZ

6. Using K-Map, simplify the Boolean functions into Product-of-sums (POS) forms and draw
the simplified logic diagrams: (CLO 2 --- marks = 20)
a. F(A, B, C, D) = ∏ (0, 2, 4, 5, 8, 11, 13, 15)
b. F(X, Y, Z) = (X + Y) * (Y + Z’) * (X + Y’ + Z) * (X + Y + Z)

You might also like