Scribd
Upload
27 views

Assignment 1

The document contains the questions for Assignment 1 of the Digital Logic Design course. It includes 6 questions covering topics like: 1) Converting between hexadecimal and binary numbers and finding 1's and 2's complements. 2) Performing subtraction on unsigned and binary numbers using 10's and 2's complements. 3) Simplifying Boolean expressions and expressing Boolean functions in sum-of-minterms form. 4) Implementing Boolean functions using NAND/NOR and inverter gates.

Uploaded by

talatawan75
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
27 views

Assignment 1

The document contains the questions for Assignment 1 of the Digital Logic Design course. It includes 6 questions covering topics like: 1) Converting between hexadecimal and binary numbers and finding 1's and 2's complements. 2) Performing subtraction on unsigned and binary numbers using 10's and 2's complements. 3) Simplifying Boolean expressions and expressing Boolean functions in sum-of-minterms form. 4) Implementing Boolean functions using NAND/NOR and inverter gates.

Uploaded by

talatawan75
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/ 2

FAST – National University of Computer and Emerging Sciences

Fall 2023 - Digital Logic Design


Assignment 1
Due Date: 19th September 2023

Note: Assignment is to be submitted only is soft form on GCR.

Question 1:

a) Find the 16’s complement of C3DF.


b) Convert C3DF to binary.
c) Find the 2’s complement of the result in (b).
d) Convert the answer in (c) to hexadecimal and compare with the answer in (a).

Question 2: Perform subtraction on the given unsigned numbers using the 10’s complement of the
subtrahend. Where the result should be negative, find its 10’s complement and affix a minus sign. Verify
your answers.

 4,637 - 2,579
 125 - 1,800

Question 3: Perform subtraction on the given unsigned binary numbers using the 2’s complement of the
subtrahend. Where the result should be negative, find its 2’s complement and affix a minus sign.

 10011 - 10010
 100010 - 100110
 1001 - 110101

Question 4: Simplify the following Boolean expressions to a minimum number of literals:

 ABC + A’B + ABC’


 x’yz + xz
 (x + y)’(x’ + y’)
 xy + x(wz + wz’)
 (BC’ + A’D) (AB’ + CD’)
 (a’ + c’) (a + b’ + c’)

Question 5: Express the complement of the following functions in sum‐of‐minterms form:

 F(A,B ,C, D) = ∑(2, 4, 7, 10, 12, 14)


 F ( x, y, z ) = π(3, 5, 7)

Question 6: Implement the Boolean function F = xy + x’y‘+ y’z


 With NAND and inverter gates
 With NOR and inverter gates

You might also like