Scribd
Upload
41 views1 page

Assignment#1

This document contains an assignment on digital logic design. It includes 5 questions. Question 1 has multiple parts asking to convert between binary, hexadecimal, and octal, find ones' and twos' complement, and perform subtraction with 10's complement. Question 2 involves simplifying Boolean expressions and converting expressions between sum of products and product of sum form. Question 3 involves simplifying Boolean functions using Karnaugh maps and incorporating don't care conditions. Question 4 asks to implement a Boolean function using two-level logic forms. Question 5 asks to convert Boolean functions between sum of products and product of sum form.

Uploaded by

Subhan Mûghåł
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
41 views1 page

Assignment#1

This document contains an assignment on digital logic design. It includes 5 questions. Question 1 has multiple parts asking to convert between binary, hexadecimal, and octal, find ones' and twos' complement, and perform subtraction with 10's complement. Question 2 involves simplifying Boolean expressions and converting expressions between sum of products and product of sum form. Question 3 involves simplifying Boolean functions using Karnaugh maps and incorporating don't care conditions. Question 4 asks to implement a Boolean function using two-level logic forms. Question 5 asks to convert Boolean functions between sum of products and product of sum form.

Uploaded by

Subhan Mûghåł
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

Assignment#1

ADP-CS-2-A Digital Logic Design


Instructor: Zia Qammar Due Date: 30-04-2020

Q#1: a)- Convert the hexadecimal number F3A7C2 to binary and octal. [3-marks]
b)- Find the 1’s and 2’s complement of the following 8-digit binary number 10101110,
10000001, 10000000,00000001 and 00000000. [3-Marks]
c)- Perform subtraction with the following unsigned decimal numbers by taking 10’s
complement of the subtracted. [4-Marks]
i-5250-1321 ii-1753-8640
iii-20-100 iv-1200-250
Q#2: a)- simplify the following Boolean expression to a minimum number of literals. [5-mARKS]

I)- ABC + A’B + ABC’ II)- x’yz + xz

III)- (x + y)’ (x’ + y’) IV)- xy + x(wz + wz’)

V)- (BC’ + A’D) (AB’ + CD’)

b)- Convert the following expression into sum of product and product of sum. [5-Marks]

i)- (AB + C) (B + C’D) II)- x’ +x(x + y’)(y + z’)

Q#3: a)- Simplify the following Boolean function using three-variable maps: [4-Marks]

i- F (x,y,z)=∑(0,1,5,7) II- F(x,y,x)= ∑(1,2,3,6,7)


ii- F(x,y,x)= ∑(3,5,6,7) IV- F(A,B,C)= ∑(0,2,3,4,6)

b)- Simplify the following Boolean function F together with the don’t-care condition d: then
express the simplified function in sum of Minterms. [6-Marks]

a)- F(x,y,x)= ∑ (0,1,2,4,5)

d(x,y,z)= ∑(3,6,7)

b)- F(A,B,C,D)= ∑ (0,6,8,13,14)

d(A,B,C,D)= ∑(2,4,10)

c)- F(A,B,C,D)= ∑(1,3,5,7,9,15)

d(A,B,C,D)= ∑(4,6,12,13)

Q#4: Implement the following function F with the following two-level forms: NAND-AND,
AND-OR,PR-NAND, NOR-OR [10-Marks]

Q#5: Convert the following to the other canonical form. [10-Marks]

a)- F(x,y,z)= ∑ (1,3,7)

b)- F(,B,C,D)= π(0,1,2,3,4,6,12)

You might also like