Scribd
Upload
44 views9 pages

CE222-Solutions To Lecture #1 Practice Problems-2

This document provides solutions to 4 problems on combinational circuits and the 4-step process for solving sequential circuit problems: 1) Obtain the state diagram, 2) Obtain the state table by assigning binary codes to states, 3) Obtain the state equations using K-maps, 4) Draw the circuit diagram. Specifically, it works through problems 1-4 on combinational circuits and problem 1 on sequential circuits, outlining the 4 steps to solve it.

Uploaded by

Sajjad Ahmed
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
44 views9 pages

CE222-Solutions To Lecture #1 Practice Problems-2

This document provides solutions to 4 problems on combinational circuits and the 4-step process for solving sequential circuit problems: 1) Obtain the state diagram, 2) Obtain the state table by assigning binary codes to states, 3) Obtain the state equations using K-maps, 4) Draw the circuit diagram. Specifically, it works through problems 1-4 on combinational circuits and problem 1 on sequential circuits, outlining the 4 steps to solve it.

Uploaded by

Sajjad Ahmed
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/ 9

Solutions to Tutorial # 1

Combinational Circuits

Problem # 1
Problem # 2
Problem # 3:

Problem # 4
Sequential Circuits:

Problem # 1
Problem # 2
Problem # 4
Step1: Obtaining the State Diagram
Step2: Obtaining the State Table
• Assign binary codes for the states
• We choose 2 D-FF
• Next state specifies what should be the input to each FF

Step3: Obtaining the State Equations


Using K-Maps
• A(t + 1) = DA = ∑(3,5,7) = A x + B x
• B(t + 1) = DB = ∑(1,5,7) = A x + B’ x
• y = ∑(6,7) = A B
Step4: Draw Circuits

You might also like