[go: up one dir, main page]
Scribd
Upload
16 views7 pages

DLD Assignment1 Sol

The document is an assignment for a Digital Logic Design course, detailing various tasks related to binary number conversions, arithmetic operations, and logic expressions. It includes questions on converting binary to decimal, hexadecimal, octal, and BCD codes, as well as performing binary arithmetic and demonstrating complements. Additionally, it requires the development of truth tables and the conversion of expressions to standard forms.

Uploaded by

sawerafatima193
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
16 views7 pages

DLD Assignment1 Sol

The document is an assignment for a Digital Logic Design course, detailing various tasks related to binary number conversions, arithmetic operations, and logic expressions. It includes questions on converting binary to decimal, hexadecimal, octal, and BCD codes, as well as performing binary arithmetic and demonstrating complements. Additionally, it requires the development of truth tables and the conversion of expressions to standard forms.

Uploaded by

sawerafatima193
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/ 7

Digital Logic Design - Fall 2024 – Assignment-1 – (CLO1) - Solution

Q1. Demonstrate the following binary numbers into decimal


a) 100001 (33) d) 111001 (57) f) 1110001.0001
b) 100111 (39) e) 1011100.10101 (113.0625)
c) 11111101 (253) (92.65625) g) 110011.01 (51.25)
h) 1111000.101 (120.625)

Q2. Demonstrate the following binary numbers into hexadecimal, octal, Gray codes and BCD
codes:
a) 100001 (21)16 (41)8 (110001)GC (0011 0011)BCD
b) 100111 (27)16 (47)8 (110100)GC (0011 1001)BCD
c) 11111101 (FD)16 (375)8 (10000011)GC (0010 0101 0011)BCD
d) 111001 (39)16 (71)8 (100101)GC (0101 0111)BCD
Q3. Demonstrate each decimal number to binary and BCD codes (a, b only):
a) 25 (11001)2 (0010 0101)BCD
b) 78 (1001110)2 (0111 1000)BCD
c) 0.456 (000.01110100101111000111)2
d) 12.8732 (1100.11011111100010100001)2

Q4. Demonstrate the following binary arithmetic operations:


a) 111 + 110 (1101)2
b) 1101 – 101 (1000)2
c) 1100 × 101 (111100)2
d) 1010 ÷ 10 (0101)2

Q5. Demonstrate the 1’s and 2’s complement of each binary number:
a) 1100 - 1’s complement (0011) 2’s complement (0100)
b) 101010 - 1’s complement (010101) 2’s complement (010110)
c) 10111011 - 1’s complement (01000100) 2’s complement (01000101)
d) 11001100 - 1’s complement (11001100) 2’s complement (11001101)

Q6. Demonstrate the following into binary number:


a) 6358 (110 011 101)2
b) 788 (invalid)
c) A7B816 (1010 0111 1011 1000)2
d) 74CD16 (0111 0100 1100 1101)2
Q7. Demonstrate and add the following BCD numbers:
a) 1000 + 0110 (14)BCD

b) 0111 + 0101 (12)BCD

c) 1001 + 0111 (10)BCD


d) 00100101 + 00100111 (52)BCD

e) 10011000 + 10010111 (135)BCD

f) 010101100001 + 011100001000 (1269)BCD

Q8. Demonstrate each Gray code to Binary conversion:


a) 1010 (1100)2
b) 00010 (00011)2
c) 1100001000 (1000001111)2
Q9. Demonstrate and write the output expression for each circuit:

Q10. Demonstrate the following expressions to standard/canonical sum-of-product (SOP)


forms.
a) 𝐵𝐶(𝐶̅ 𝐷
̅ + 𝐶𝐸)

b) (𝐵 + 𝐶𝐷)(𝐶 + 𝐵𝐷)
c) 𝐵 + 𝐶[𝐵𝐷 + (𝐶̅ + 𝐷)𝐸]
Q11. Demonstrate the following expressions to standard/canonical product-of-sum (POS)
forms.
̅ )(𝐵 + 𝐶̅ )
a) (𝐴 + 𝐷

b) (𝐵 + 𝐶̅ + 𝐷)(𝐶 + 𝐷)(𝐴)
Q12. Develop a truth table for each of the following SOP expressions:
a) 𝐴̅𝐵 + 𝐴𝐵̅𝐶 + 𝐴̅𝐶̅ + 𝐴𝐵𝐶̅

Truth Table
INPUT OUTPUT
A B C Y
0 0 0 1
0 0 1 0
0 1 0 1
0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 1
1 1 1 0
b) 𝐴̅𝐵𝐶𝐷
̅ + 𝐴𝐵𝐶̅ 𝐷 + 𝐴̅𝐵̅𝐶𝐷 + 𝐴𝐵𝐶𝐷

Truth Table
INPUT OUTPUT
A B C D Y
0 0 0 0 0
0 0 0 1 0
0 0 1 0 0
0 0 1 1 1
0 1 0 0 0
0 1 0 1 0
0 1 1 0 1
0 1 1 1 0
1 0 0 0 0
1 0 0 1 0
1 0 1 0 0
1 0 1 1 0
1 1 0 0 0
1 1 0 1 1
1 1 1 0 0
1 1 1 1 1

You might also like