Scribd
Upload
13 views3 pages

Homework: Name: . ID

The document outlines a homework assignment that includes tasks related to simplifying Boolean functions using K-maps, drawing logic circuits, and implementing functions using various digital components such as decoders and multiplexers. It consists of five questions, each requiring simplification and circuit design for given Boolean expressions, along with analysis of a synchronous sequential circuit. The assignment emphasizes both theoretical understanding and practical application of digital logic design concepts.

Uploaded by

Wajdi Elhamzi
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
13 views3 pages

Homework: Name: . ID

The document outlines a homework assignment that includes tasks related to simplifying Boolean functions using K-maps, drawing logic circuits, and implementing functions using various digital components such as decoders and multiplexers. It consists of five questions, each requiring simplification and circuit design for given Boolean expressions, along with analysis of a synchronous sequential circuit. The assignment emphasizes both theoretical understanding and practical application of digital logic design concepts.

Uploaded by

Wajdi Elhamzi
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/ 3

Homework

Name:………………………….
ID: …………………………….
Q1: a) Simplify the following Boolean function using suitable K-map into the Sum-of-Product
(SOP) form and draw its logic circuit.

F(X,Y,Z) = ∑(2,3,7) Simplified F in Sum-of-Product (SOP) form:

b) Draw its logic circuit of the simplified form:

Q2: a) Simplify the following Boolean function using suitable K-map into the Product-of-Sum
(POS) form and draw its logic circuit using NOR gates only:
F(A,B,C,D) = ∑(0,1,5,8,13) with don’t care conditions d(A,B,C,D) = ∑ (7,9,15)

Simplified F in Product-of-Sum (POS) form:


b) Implementation the Simplified F using NOR gates only:

Q3) Implement the following function using one decoder and OR gates only.
F(A,B,C) = ∑(1,3,5,7)

Q4) Implement the following function F with a


• Multiplexer 8/1
• Multiplexer 4/1
F(A,B,C) = ∑(2,3,5,6,7)
Q5) Analyze the following synchronous sequential circuit, showing:
a) The state equation, i.e. A+ as functions of A, x, and y.
b) b) The state table.
c) c) The state diagram.

You might also like