## https:/.../emt161080p.mp4

• 0:19 - 0:23
Welcome to the next video. In
the Boolean series. In this
• 0:23 - 0:27
video I'm going to show you what
Boolean expressions are and how
• 0:27 - 0:31
we can use the laws of logic to
make them simpler.
• 0:32 - 0:38
But I've shown you a lot of
Lowe's and I've shown you a lot
• 0:38 - 0:42
of operations, but what are
actually Boolean expressions?
• 0:42 - 0:45
But Boolean expressions are
basically just input values.
• 0:45 - 0:50
Peace, QS, and Rs combined
together with all these logical
• 0:50 - 0:53
operations, so different letters
representing different input
• 0:53 - 0:56
values and combined together
with these logical operations
• 0:56 - 0:59
just like in algebra for
• 0:59 - 1:05
example. P&Q
XRR is a Boolean expression,
• 1:05 - 1:08
another somewhat more
complicated Boolean expression
• 1:08 - 1:11
is something like P&Q.
• 1:12 - 1:14
Call
• 1:15 - 1:22
Not Q&R Or
P if then K.
• 1:24 - 1:26
And not Q.
• 1:26 - 1:31
If an only if R, so whichever
operation you want to put
• 1:31 - 1:36
together, and then how many
inputs are there, it is again
• 1:36 - 1:40
different for each expressions.
As I mentioned, these different
• 1:40 - 1:43
expressions will carry out
different instructions for the
• 1:43 - 1:45
computer, so the computer can do
• 1:45 - 1:49
different things. And allow
through certain input
• 1:49 - 1:53
combinations and stop certain
input combinations from going
• 1:53 - 1:55
through in the circuit.
• 1:57 - 2:01
Now let's talk a little bit
about the rules of the brackets.
• 2:01 - 2:08
So if I have got the expression
of not P&Q, and if I have got
• 2:08 - 2:12
the expression of not P&Q, what
is the difference in here? What
• 2:12 - 2:17
am I doing by placing the
bracket? Well, just as in
• 2:17 - 2:20
algebra by pressing a bracket
somewhere, I'm emphasizing
• 2:20 - 2:25
priority in this expression. The
knot is only applied to pee and
• 2:25 - 2:28
to be able to calculate the.
• 2:28 - 2:30
Overall, output of this
expression. I need to
• 2:30 - 2:34
calculate not P and combine it
together with the key using
• 2:34 - 2:38
the end operation as opposed
to hear hear the bracket is
• 2:38 - 2:43
applied to the P&Q. So I need
to calculate the P&Q 1st and
• 2:43 - 2:47
then the note is applied to
the all of it with the
• 2:47 - 2:51
bracket. So once I found the
P&Q output values then I need
• 2:51 - 2:55
to invert them. I need to
apply the not operation to
• 2:55 - 3:00
those output values to get to
the whole output so it will be
• 3:00 - 3:02
very different in the two
different cases.
• 3:03 - 3:07
Similarly, if I have got P&Q.
• 3:08 - 3:15
X or R or P&QX or R. The bracket
tells me what I need to do
• 3:15 - 3:19
first. Here I need to use the
end operation and combined
• 3:19 - 3:23
together P&Q then find the
output and combined it together
• 3:23 - 3:29
with the I using the axe or
while in this case is the
• 3:29 - 3:33
opposite way around. I need to
use the exit gate combined Q&R
• 3:33 - 3:38
together 1st and then use the
end operation to combine output
• 3:38 - 3:42
from here. Which P to get to
the final output of the
• 3:42 - 3:43
overall Boolean expression.
• 3:44 - 3:50
Now the last thing I'd like to
show you in this video is how we
• 3:50 - 3:54
can use these laws of logic to
reduce the Boolean expressions.
• 3:54 - 4:00
So I have this expression not P
or not Q. So how can I use the
• 4:00 - 4:05
lose of logic to reduce this
expression? Now I can use the
• 4:05 - 4:09
Morgan low to distribute the not
over the bracket. So what does
• 4:09 - 4:15
the De Morgan do? I can break it
up into not P and not not.
• 4:15 - 4:21
Cute and then I can use the
double negation and applied the
• 4:21 - 4:25
not not key so that gives me not
• 4:25 - 4:31
P&Q. Well, I think he would like
to agree with me that instead of
• 4:31 - 4:34
this bracketed expression, this
expression is rather similar.
• 4:36 - 4:39
One more example, not.
• 4:40 - 4:41
Key or P?
• 4:44 - 4:44
Or
• 4:47 - 4:54
Not P&Q What I have
here is key or P and I have
• 4:54 - 4:59
here not P&Q. So I have got
the same things in here but I
• 4:59 - 5:04
have got them in the opposite
order so why can do? First I
• 5:04 - 5:09
can apply the commutative low
and bring them up in the same
• 5:09 - 5:10
kind of order.
• 5:16 - 5:21
Then what I can use next is the
• 5:21 - 5:26
not inside the bracket. So that
gives me not P and not Q.
• 5:29 - 5:36
Or Not P&Q now what
I have in here now. It's like
• 5:36 - 5:38
in algebra you spot.
• 5:39 - 5:42
That the first term here.
• 5:43 - 5:47
Is the same, so you can do
something called in algebra,
• 5:47 - 5:52
factorization and in this case I
can use the backwards operation.
• 5:52 - 5:57
The backwards version of the
distributive law so I can bring
• 5:57 - 5:58
out the note P.
• 6:00 - 6:02
And the end.
• 6:02 - 6:06
And what remains is the not
• 6:06 - 6:08
Q. Or key.
• 6:09 - 6:11
Now what do I know about not Q
• 6:11 - 6:17
or key? But I know about Nokia
or cubes that that is always
• 6:17 - 6:22
true because it doesn't matter
which not Q or Q is force, the
• 6:22 - 6:26
other will be always true and
true. Or force always gives you
• 6:26 - 6:31
true. So this is also the same
as not P and true.
• 6:33 - 6:34
And.
• 6:35 - 6:37
Not P and true.
• 6:38 - 6:43
That is always equal to not pee.
I can apply the identity law
• 6:43 - 6:48
here, which states that P and
two is always P for the special
• 6:48 - 6:53
case of not PN 2 is always not
paying. So this long complicated
• 6:53 - 6:56
expression is actually nothing
else but not P.
• 6:57 - 7:02
I hope that you now have a
good idea of how to use the
• 7:02 - 7:05
lose of logic to simplify
Boolean expressions in the
• 7:05 - 7:09
next slide you will have some
questions to allow you to do
• 7:09 - 7:13
some practice on your own and
you will find the answers to
• 7:13 - 7:15
these questions shortly after.
• 7:16 - 7:18
So these are the practice
questions.
• 7:24 - 7:26
Title:
https:/.../emt161080p.mp4
Video Language:
English
Duration:
08:29
 mathcentre edited English subtitles for https:/.../emt161080p.mp4