DSTL Notes PDF
DSTL Notes PDF
Dan
Page
222222 2
2
(teht, x) (2thtik)
Page
Boolean algebra:- A
non
A non empty set B
with
empty.
two binary operations +
and.
Called
and two distinct element o
Boolean algebra of is
by (B, +,, 10, 1)
0 9 dempotent
laws
unary
operatia
and
1 is
denoted
2 2222222222
22222
@is
ata = a
# aEB
i)
a a=a
V AEB
[+6]
Proof : 1)
L.H.S
:
a+a=(a+a)⋅1
11) Lm a a = a. a +0
inmaa
aa+o
(ata). (ata)
alata a+la⋅ā)
ato
a a + asă
- a (a+a)
= a. 1
= A R. H.S
RH.S
@ Boundedness laws;
1) a + 1 = 1
3 Absorption laws i)
a +(ab) = a
6 Associative laws 1)
(a+b) +1 =
a RH.S
ii) a·0= 0
ii) a⋅ (a+b) = a
(
a+ (b+c)
(abrealme
Shot by kaushar
222
[unit-I
agram [AS]
Hasse diagram
C for every
element
relalida
a (A
даєть
retation
Page
create a vertex
self loop
Hasse
diagram
{13/ × 1323
A
5127
{1}
123
not wass
dicysa
m
Hass
realme Shot by kaushar
diagra
m
222
[unit-I
agram [AS]
Hasse diagram
C for every
element
relalida
a (A
даєть
retation
Page
create a vertex
self loop
Hasse
diagram
{13/ × 1323
A
5127
{1}
123
not wass
dicysa
m
Hass
realme Shot by kaushar
diagra
m
222
[unit-I
agram [AS]
Hasse diagram
C for every
element
relalida
a (A
даєть
retation
Page
create a vertex
self loop
Hasse
diagram
{13/ × 1323
A
5127
{1}
123
not wass
dicysa
m
Hass
realme Shot by kaushar
diagra
m
Hasse-
diagram
[24 8 12 24 36
17
24
36
Page
2
X = {2,3,6, 12,
24/7
2,3,6,12,24
1
12
24
($1,2,3,5,6,195,30)
76
3
What
1,2,3,4,6,12 >!
(8) (1,2,3,4,6,947
realme Shot by kaushar
11ט
Gale
Page.
@
212.
4
251
ever
y
Minimum element: 9) 51 is minimal and 3) is
related to every element in posel.
d
e
e
posel
.
2222222222
d
upper
d
@
b
a
bound: het B be a subset of a setA. An element
XEA is in upperbound of B of (y,x) €
pose
VJCB a a lower bound: Lel B be a subset of a
set A. An element
XEA is in lowerband of B of Qyje
posed by EB
realme Shot by kaushar
222
[unit-I
agram [AS]
Hasse diagram
C for every
element
relalida
a (A
@ Draw an edge from a
to b
a
даєть
retation
Page
create a vertex
{13/ × 1323
A
5127
{1}
123
not wass
dicysa
m
Hass
Page
B: 29, जद UB(1); ef
LUB(BD = f
LB (B) = a
GLB(B)= a
fet
Meet-semi- lattice
B: {dc3 UBCA) =
ed LUBINE d
LB - a c
GLB =
C
In a poset of GLB/meet/^
exist for every pour of elements
then post
is called meet
Semi-lattice
d
e
d
X
a
a
b
Co
*
evf=3 eef not
exist
6
e
b
X
a
पे
B- Sech
B =
55193
1.B(B) =
{95c3
LBIA). [gez
LB(B = d
UB(B)=ght
3= {0,
1}
bound
(LUB)/Jon/V
Page
heast upper
least (minimum) dement in upper
bound
b
₹1,2,3,4,6,93
MSL
Lattice x
@ $234,6,123
2.34, 6123 JSL
Page
12
3
[1,2,3,5, 30,
1]
Catheex
(0)
8)
[D11021]
[1 2 3 6 9 18, 1] L~
1236918,
119
to
22
Latte
@ [Duse 1] -
13,5,915,45
9
b
₹1,2,3,4,6,93
MSL
Lattice x
@ $234,6,123
2.34, 6123 JSL
Page
12
3
[1,2,3,5, 30,
1]
Catheex
(0)
8)
[D11021]
[1 2 3 6 9 18, 1] L~
1236918,
119
to
22
Latte
@ [Duse 1] -
13,5,915,45
9
properties of lattice;
-
C Idempotent laco
Qva = a
ana = a
Associative law
(avb) ve
av (bvc)
(anb) AC =
Ac
an (bnc)
3
Commutative law
avb =
bra
Page
anbs baa
Distributive laws
av (bic) = (avb) (ave) an (bvc) = (anb)
V (ane).
b
a
f
tbrave bv (dve)
C
bvc
C
c
b
[AMV]
f
It
舌
b+
4
6
a (o)
d
Calculate Complement
of C
Dabe Page
ab
bb d
o abd
debd
A
baca (0)
bvce (1)
Distributive lattice
to be distributive
A lattice is said
¥ abccL
Ex
d
+C-be
Cab
Mere thin out complex
a) av(bnc) = (arb)^ (ave)
Iris is
had distin
ave
did
पे
A
ex
61
av(bac) = (aub) a (axc)
avd
bad
a
d
at a
22222
[Date]
Page
cf
f=c
only one
Compturl
As most one
Complent
or
d-b
c-d
unique
Complement
Complement for every
element.
(teast)
a
Bounded
lattice
6
no least dent
hat
Bounded
Lattice
greate
st
b
a (too!)
Bounded
lattice.
AEL
Complement of an element in a lattice: In a
bounded lattice L for any element there
exist an element HEL Such that
anb= 0 -1 hat bis Called
avb=1
Complement of a
We
Can
say
4 l b
b=cde
a
and d
bac=
brc=f
a
A
bala
and a
5 is
Comptes of G
of d
a is Complemet 5 is compting bid
a
realme Shot by kaushar
5Vcd
bvd - f
Complent
of d
*
(5) Involution law
(a) = a
6
(0 = 1
(11)
Date
Page
1 De- Morgan's
law
;) (a+b) = a.b (ii) (ab) = a+b2
© Identity law
16
1) a +o=a
") aa2= 0
11) a. 1 = a
Theorem:
i) (a+b) = ab
11
(a.b) = a+b!
Boolean algebra:- A
non
A non empty set B
with
empty.
two binary operations +
and.
Called
and two distinct element o
Boolean algebra of is
by (B, +,, 10, 1)
0 9 dempotent
laws
unary
operatia
and
1 is
denoted
2 2222222222
22222
@is
ata = a
# aEB
i)
a a=a
V AEB
[+6]
Proof : 1)
L.H.S
:
a+a=(a+a)⋅1
11) Lm a a = a. a +0
inmaa
aa+o
(ata). (ata)
alata a+la⋅ā)
ato
a a + asă
- a (a+a)
= a. 1
= A R. H.S
RH.S
@ Boundedness laws;
1) a + 1 = 1
3 Absorption laws i)
a +(ab) = a
6 Associative laws 1)
(a+b) +1 =
a RH.S
ii) a·0= 0
ii) a⋅ (a+b) = a
(
a+ (b+c)
(abrealme
Shot by kaushar
two varable (a,b)
ex. atb atb, a tab
Types of
Normal
Турелов
form
s
/Date
Page
a
X
A booken function of n
vainable, whe ompressed as a
polynomial in the the form of sum
of product is such way
that each terms mvolves all the
no Variable known as DNF.
nicaldone
is called
Conjuctive Normal
form.
f(xy)=(x+4)
(2+4)
08
Page
@ 9 any stibly st
by 1 equal to no
of
term is missing one or
more variable
able
missing varable
(11) Now Replace each I of term or
term by
G Sum of missing vanable and its
complimented
I
because we know that x+x2 = 1.
a+aca
&
(i) y
f(x,y) = x. 1
= X-L
-x-(y+y')
multiplicative
[Ives
Identity]
[:: 4+3=1]
XY +x 4'
4x
th
[ Distribud give
law]
(xx-x')
[] is multiply, calive
scentity)
[= x + x2 =
1]
[ distributive law]
realme Shot by kaushar
Doln
Page
(a+b) + (alb) =
1
& (a+b)•(a! b) = 0
a tall
[ b+b=l
(1+9=1
2. H.S=
(a+b). (a.b)
(a.a. b) + (b. a.b')
(b. a.b) Distributive law
(0 b') + (al bb')
= O
+ (alo)
676
=OR.H.S
a⋅a=0
66=0
* Boolean function:
→
the unary
unary operation (1 of algebox are
called brokem
the given boolean
functio
n
ex
x.Y, x+y+2' x・y+y'z
Nole) The no of all minimal boolean fh in
invariable 11/22 Tybes of Bastian function:-
(19)
Co
nve
rt
inli
Disj
unc
tive
nor
mal
for
m.
√(x
+2)
=
(x+4
)
(x2
+y')
[22/20
[mg] [ihr, x) Ft (^t, x) * =
ZZ ZZZ Z Z
ZZ
realme Shot by kaushar
teht, he to
at
= x4
+24
- ny!
1+
x24-
1
- x
42 (2
+21)
+ x
Y.
(2+2
)
RD 12h, m + 2x, x +11hitz, he=
into DNF
(Abs
uptio
n low
a+b=
(a+b)
(a+1
)
(iht,
x)
(ht,
x)
(h+x
) =
(3kx
)+
(shh
) Tx
(int)
(+4)
X+0
=
x+y!
x 1
x2'4' (1)
= x'y' ( 2+21)
12,h,x + 2, h, x =
[(x) = x
bx+y
+2)
[(2x4
).
(2/2)
']
=
(1+
4+2
)
[(x2+
4')
·}
{(x))
2
+2'
}]
[D10. Morgan's low
19:0=
(470
)
1976
(9.6
)
h
(igher, whereder
[12, 1
74
7
K
Convert Bookan function into Coquetive, normal
form (CNF)
Step Simility
@ Now in each factor of any is missing then
add 0:
~
Q = 0x
Distributive law.
o
7jhx
+ 1-
hx
(12+2
), hx
+
(12+
2)
Lix
=
Convert in DNF.
√(x,y
2) =
x+y!
X-
14y'.1
=x
(4+4
1) +
y2
(x+x)
[atal=)
= xy+xy! +y/x+Y!X! [Distributed lag
favere
1:h, x+
1;hx + 1 ((
12+2)/h, x
+
(12+2),
hx+ (2+2)
hx=
12/h;k+
2,h,x+12,
hx + 2hx
+, chat
Zhu
$12,
4,k+
2,h,
x+, 2,
hxt 2,
hat,
churc
hx
OFF
S
(RATAPR)
(2+in+x) (12+h+x) (2+h+1)
(+7+2.21) (x+4 + 2.21)
(at, h+x) (ath+x) = (intk) (hex).
(=x+1 ~]
[Distor
1=1++h]
[Dist
o lav]
Asso
&
Com
mu
Q+ x = (271) X-
ZXFX
Zut
(ht,h
x.
zx
thirin
k
AB
00
AB 01
AB
12
AB 10 B
이
S
M
St
ني
9
6
10
>
Rul
e
for
crea
ting
grou
p in
le
map
0
No
zero
s
allo
wed
1
Group
Cam
be
Vertic
al or
horizo
ntal
but
can't
be
diago
nals.
1 Group
allowed.
Group must contard in cells (11)
Overlapping
hould be lange as possible
F(A,B) = Σ (0,2,3)
D
B+ A A
Page
F(ABL)-5
8) Find K-map and simplify the Expressions
(U AB+ AB
(i) AB +
AB
CAD AB+ABI
Wa
B 8
B
B
T
AB 8
B
A
realme Shot by kaushar
i z 2 2 2 2 2 2 2 Z Z LZZLL
AT
AI
B
A
Cami Semplify
furthe
F (A,B,C) = = (0,1,2,3,5)
60
01
1110
A
அ
A+B
A
A + BC a
K-map method is
K-map
(Karna
ugh
Map): -
> ical
techni
que
whic
h
provid
ea
simpl
e
Je
p
for
wa
rd
pr
oc
ed
ur
e
for
Si
mp
lifi
cat
ion
two, three
of Boolean expression of
கூட
diays
four variables. I map. up of a number of squares.
or
Tam
maide
Ok-
map
is a
graphi
cal
repre
sentat
ion
used
for
Sim
plifyi
ng
the
Broll
an
@ For
Boolea
n
Variables
xpressions.
Consisting of n- int
le map=
12h Collo
Expression Consisting of cells required
no of
2. variable k-map
= Variable
AZZZZZZLL LL
LLLL
2
B
B
24 Cells
B
A
A O
AT
A
LA
BC
BC
О
Π
6
AKTU (20-21)
(a)
== (0,1,2,3,4,5, 6, 7, 8, 9, 11)
CB
BB
B
BBB
BB
B
CD CD CD CD
CD 60
AB
10
10
ABO
O
ABO
AB
11
AB
10
A+BC +BD
B) @2 +(x, y, z) == (0,24,5,6)
x
42 42 42 42 12
xo
x1
TY
= 42+Wx2
OR gate:
A
Y=A+B
OR
B
Truth table:
gruput
Output
A
B
Y=A+B
O
O
Y=A+B+C
In
B
OR
Inbut
output
A
B
C
Y=A+B+L
о
O
0
0
T
0
о
0
realme Shot by kaushar
Page
$590.
[č d
use
k-
ma
p to
sim
plify
the
follo
win
g
Exp
res
m
a) X
=
ABC
D+
ABCD
+
ABC
D+
ABC
D
CD
CD
AB 00
AB 60
0
AB OI
AB 11
AB
LOT
D
ABC + ABD A
b) X= ABCD + ABED + ABCD + ABCD
AB
00 01 11 10
AB 00
AB 01
OB 11+
AB 10
BD de
realme Shot by kaushar
NAND gate:
A.
B
Do
(AND-INOT)
Y=A.B
Trut
h
table
for
NAN
D
Galé
grou
t
outb
y
BY =
A-B
a
О
1
O
122222 222
22
AND gale
A.
B
D
Y=AB
Truth table for AND
AND galé
gapu
AB
outby
Y-AG
01
O
O
O
11
Date
Page
Not gate:
Truth table
A
Y-A
A
F=A
O
NOR Gale:→
YA+B
ghout output
AB
Y = AB
O
0
Page
x y z + x 42 + x 2 + x42
f(x, y, z) =
хуа
45
chutzhx
G
X42
f = x42+242 +
2
242
R
g
hx+
(hth
) x
=
L, XF
X=
(hast (2)
Simplify the
expressions
Boolean flxy) = xy2+x4+xy
@
[(RA
BU)
=
((B
+C)
(A+
B+()
=
(CB+
(C)
(A+B
+1)
=
((B
+C)
C(B+
1)
(A+B+)
(A+B+1)
C
CATB
I0
CA
+CB+
CC
=
CA+CB+
C ~
CA+
((B+1)
~C
(A+
1)=
C
7 7 7777777778/
realme Shot by kaushar
Date
[Page
(@)
+
(A,B)
=A+
BLA+
B) +
A
(A+B
)
A + BA
BB TAA
+ AB
=A
+BA +
B
+O+A
B
=A
+ACA
+D+A
B
A
B+AB
A +
B (IA)
A+B
De
ADA(4)
B+E
7 7 7777777778/
realme Shot by kaushar
Date
[Page
(@)
+
(A,B)
=A+
BLA+
B) +
A
(A+B
)
A + BA
BB TAA
+ AB
=A
+BA +
B
+O+A
B
=A
+ACA
+D+A
B
A
B+AB
A +
B (IA)
A+B
De
ADA(4)
B+E
realme Shot by kaushar
Exclusive. NOR (XNOR) Gale
gorput
output
A BY = AOB
♡0
Date
Page.
AOB- AB+AB
+= A-B+C
AB
AB+C
D
A
AB + CD
D
AB
CD
ABICD