Download as pdf or txt
Download as pdf or txt
You are on page 1of 146

POLL

Solution
Poll
Solutions
Poll
Solutions
Poll
Solu
Discussions
Questions
Questions

Solve and paste answer in LPULIVE


Solutions
Questions
Solutions
Questions

Solve b part now-


share answer in
lpulive students.
ok
Solutions
Solutions
Solutions
Poll
SOlu
SOP to Standard SOP Conversion
Solve the question

Solve it and let me know the answer in LPULIVE


Solutions
Convert to Standard POS form
We shall use this identity
Questions

Solve
Solutions
Concepts of Minterms(m) and Maxterms(M)
Poll
Solu
How are minterms and maxterms obtained
Poll
Solu
Find minterm and maxterm(Questions)
Solutions
Poll
Solu
Poll
Solu
Poll
Solu
From the truth table obtain logical expression in standard SOP form
From the truth table obtain logical expression in standard SOP form
Discussions

A+ B.C=(A+B) (A+C)

A+AC+AB+BC
AA+AC+AB+BC(A.A=A)
Binary to Gray code

1010
Ans:
1111
Yes/No
Gray to Binary Code
Binary to gray

It is an ordering of the binary system such that two successive


values differ in only one bit.
00
01
11
10
Gray code
Poll
Solu
Poll
Solu
Poll
SOlu
SOP=FILL LOGIC 1
POS=FILL LOGIC 0
OCTET
Y(A,B,C,D)
SUM minterm means
fill ‘1’ logic
Y(A,B,C,D)
SUM minterm means
fill ‘1’ logic
Y(A,B,C,D)
SUM minterm means
fill ‘1’ logic
Y(A,B,C,D)
SUM minterm means
Simplification of Boolean expression
fill ‘1’ logic
Poll
Solutions
Solu
1. Overlapping pairs are
allowed like this
2. No logic 1 should be left
3. Go from higher (octet) to
lower (single)
Question
Solution

Follow this logic


1. Check left-for common variable
2. Check top for common variable
3. Done
Questions

Follow this logic


1. Check left-for common variable
2. Check top for common variable
3. Done
Solution
Questions
Solution
Solu
001
Octet Conditions
Questions
Solu
Ques
Solutions
Poll
Solutions
1. All don’t care- can not make
pair.
2. Don’t care can help in pairing
3. K-Map- Aim
4. All 1’ must be covered.
5. Follow-
6. 16 then 8 then 4 then 2 then 1
Poll
Solutions
Solutions
Questions
Solutions
Questions
Combinational Circuits

• Combinational circuit is a circuit in which we combine the different gates in the


circuit, for example encoder, decoder, multiplexer and demultiplexer.

• Some of the characteristics of combinational circuits are following −

• The output of combinational circuit at any instant of time, depends only on the
levels present at input terminals.
Adders
• Addition of binary bits is the most basic operation.
Diagram
Truth table
Kmap
Full adders using half adders
Carry calculations
Poll
Solutions
Poll
Poll
POll
Solutions

You might also like