< Return to Video

https:/.../emt131080p.mp4

  • 0:19 - 0:23
    Hello and welcome to the first
    video on Boolean logic.
  • 0:24 - 0:28
    And Boolean expressions. You
    might know this topic in an
  • 0:28 - 0:31
    alternative name because the
    same topic sometimes also
  • 0:31 - 0:36
    referred to as digital Logic or
    Boolean algebra or algebra of
  • 0:36 - 0:41
    proposition. What this topic is
    looking at is looking at a
  • 0:41 - 0:42
    collection of input values.
  • 0:43 - 0:45
    A collection of operators.
  • 0:46 - 0:50
    That sometimes we refer to as
    logic gates and looking at what
  • 0:50 - 0:54
    happens at the end, what is a
    particular set of of these
  • 0:54 - 0:58
    inputs and operators? What kind
    of outputs you can end up with?
  • 0:58 - 1:03
    Now the origonal part of this
    coming from the at the very very
  • 1:03 - 1:07
    beginning, the computer has been
    built up from logic circuits.
  • 1:07 - 1:10
    Tiny, tiny little circuits and
    then depending on which circuits
  • 1:10 - 1:15
    you connected together, you were
    able to tie the computer to do
  • 1:15 - 1:16
    different things so.
  • 1:16 - 1:21
    The input and output values can
    be recorded in a number of
  • 1:21 - 1:24
    different ways. Again, there are
    two common ways.
  • 1:25 - 1:31
    One is the true for set up and
    the other one is the 1 zero set
  • 1:31 - 1:36
    up again. It comes from the fact
    that logic circuits can be
  • 1:36 - 1:41
    turned on or off true and one is
    equal to the on position and
  • 1:41 - 1:45
    force in OR equal to the off
    position. Remember circuits turn
  • 1:45 - 1:48
    it on or turn it off. So let's
  • 1:48 - 1:54
    look at. What are the
    basic Boolean operations? The
  • 1:54 - 1:56
    first Boolean operation?
  • 1:57 - 2:02
    Is the end operation now this
    end operation sometimes just
  • 2:02 - 2:07
    written out as end in capital
    letters sometimes is referred to
  • 2:07 - 2:09
    as this symbol?
  • 2:10 - 2:13
    And sometimes it's referred to
    as a multiplication simple
  • 2:13 - 2:16
    symbol because it works like
    ordinary multiplication within
  • 2:16 - 2:20
    the binary system. Now it also
    has got in digital logic. If
  • 2:20 - 2:23
    you're looking at the circuits
    themselves. If you're looking
  • 2:23 - 2:27
    at how to build boards
    together, it has got a logic
  • 2:27 - 2:30
    gate symbol and that logic
    gate symbol is this one.
  • 2:32 - 2:37
    Now this tells you that this
    endgate can take a minimum
  • 2:37 - 2:41
    of two input values and it
    will give you always one
  • 2:41 - 2:42
    output value.
  • 2:44 - 2:48
    So what does the end gate do
    now? The end gate is actually
  • 2:48 - 2:53
    working as if you had a water
    pipe fixed with two taps on it,
  • 2:53 - 2:55
    one after the other.
  • 2:58 - 3:02
    So when we have water flow
    through, the water will flow
  • 3:02 - 3:07
    through only if both of the
    tabs are open. If I turn
  • 3:07 - 3:08
    this tab off.
  • 3:09 - 3:14
    The voter will stop here if I
    turn this step on when I leave
  • 3:14 - 3:17
    this tab of the water will stop
    here, so water still doesn't
  • 3:17 - 3:21
    flow through an. Obviously, if
    I have both taps turned off,
  • 3:21 - 3:25
    the water doesn't go further
    than here. So what are we only
  • 3:25 - 3:29
    go through if all of these
    steps are on, so would have can
  • 3:29 - 3:33
    go through only this way. Now
    how can we sort of summarize
  • 3:33 - 3:36
    this information in a nice and
    simple visual format? That's
  • 3:36 - 3:37
    why truth tables.
  • 3:41 - 3:44
    Has been invented through.
    Tables are simple tables which
  • 3:44 - 3:49
    tells you what are the input
    values or other possible input
  • 3:49 - 3:54
    values that can come. What is
    the logic gate or what is the
  • 3:54 - 3:59
    Boolean operation that we use
    here and then? What will be the
  • 3:59 - 4:02
    end result of that Boolean
    operation for every possible
  • 4:02 - 4:06
    income combinations? Now let's
    look at the simple examples.
  • 4:06 - 4:09
    Let's see how does the P&Q
  • 4:09 - 4:13
    operation works. B is an input
    queue, is a different input.
  • 4:13 - 4:17
    What happens if I combine them
    together? What will be the
  • 4:17 - 4:19
    common output so P.
  • 4:20 - 4:21
    And Q.
  • 4:23 - 4:25
    And here will be my output.
  • 4:28 - 4:33
    Now what kind of setups can the
    two taps have? While I can turn
  • 4:33 - 4:35
    both of them on?
  • 4:37 - 4:42
    I can turn one of them on
    the other one off, all in
  • 4:42 - 4:43
    the other combination.
  • 4:44 - 4:47
    Or I can have both
    of them turned off.
  • 4:48 - 4:52
    So what did we say? The water
    can only go through if both of
  • 4:52 - 4:54
    the taps are on?
  • 4:54 - 4:59
    Every other combination will
    stop the water from flowing, so
  • 4:59 - 5:02
    this is the truth table
    accompanying the end.
  • 5:03 - 5:08
    Operation. With this Boolean
    trip tables, you need to know
  • 5:08 - 5:12
    them. You need to understand
    them because later on we'll be
  • 5:12 - 5:15
    combining more than just one
    single operation together and
  • 5:15 - 5:20
    see what happens if we start to
    mix them up. So this was the
  • 5:20 - 5:24
    first one, the end operation.
    Let's have a look at the next
  • 5:24 - 5:29
    one, which is the OR operator.
    Now the symbol for the OR
  • 5:29 - 5:32
    operator can be this small away.
    The opposite, the turned upside
  • 5:32 - 5:36
    of the end or the addition
    because it works.
  • 5:36 - 5:37
    Like the audition.
  • 5:39 - 5:42
    And if you are coming from
    the engineering background.
  • 5:43 - 5:46
    You can see either this.
  • 5:48 - 5:51
    Symbol or this symbol?
  • 5:54 - 5:58
    For the OR gates, again it
    takes in at least two
  • 5:58 - 6:02
    incoming values and gives you
    one outgoing value, so at
  • 6:02 - 6:04
    least two inputs, one output.
  • 6:05 - 6:08
    You can think about the OR gate.
  • 6:08 - 6:12
    As water pipes but fixed
  • 6:12 - 6:18
    now. In a different way now
    these water pipes I fixed
  • 6:18 - 6:21
    together in a parallel
    fashion and on each branch
  • 6:21 - 6:24
    we have got a tap.
  • 6:25 - 6:31
    So what happens in this case?
    Now if I turn this tap off, stop
  • 6:31 - 6:36
    the water flowing here, but I
    don't turn this stuff off.
  • 6:36 - 6:41
    The water will be able to bypass
    that turned side and fluid flow
  • 6:41 - 6:44
    through. Here the same the other
    way around. And obviously if
  • 6:44 - 6:49
    both of the tabs are open then
    the voter have got the choice of
  • 6:49 - 6:52
    flowing through one or the
    other, so the OR operation.
  • 6:52 - 6:56
    Opposite to what the end does,
    it only stops the water. In one
  • 6:56 - 7:00
    case it stops the water if both
    of the taps are turned off.
  • 7:02 - 7:06
    So what does it look like in the
    truth table fashion? So again.
  • 7:08 - 7:12
    P or Q. What are the possible
    income combinations and what are
  • 7:12 - 7:15
    the possible outcome
    combinations of these? So again,
  • 7:15 - 7:17
    I can have two values.
  • 7:18 - 7:20
    Two input values P.
  • 7:20 - 7:21
    K.
  • 7:22 - 7:27
    So again, what are the different
    input combinations for these two
  • 7:27 - 7:29
    values? The P&QA quick trick.
  • 7:30 - 7:37
    True, true Force Force 3434.
    This fact comes from I've
  • 7:37 - 7:40
    got two input values.
  • 7:42 - 7:48
    P or K, but all both of them can
    be true or false, so I only have
  • 7:48 - 7:52
    got two possible switch stands.
    So 2 to the power of two gives
  • 7:52 - 7:58
    me 4, but two is the number of
    input values and two is the
  • 7:58 - 8:00
    number of possible outcomes like
    trues or force.
  • 8:01 - 8:06
    So what did we establish if
    both of the taps are turned
  • 8:06 - 8:12
    on, then the voter can flow
    through. If one of the taps
  • 8:12 - 8:16
    are turned on, then the water
    can flow through that branch
  • 8:16 - 8:18
    and bypass the off tab.
  • 8:19 - 8:24
    But if both of the taps are
    turned off than the water it
  • 8:24 - 8:28
    stopped. So that's when this
    this operation is forced.
  • 8:29 - 8:34
    So the next operation that I
    would like to talk about is the
  • 8:34 - 8:37
    not operation, which sometimes
    also used this symbol.
  • 8:37 - 8:42
    Sometimes this symbol and
    sometimes it used just by a bar
  • 8:42 - 8:47
    over the input for the pictorial
    symbol for the Northgate. For
  • 8:47 - 8:52
    engineers is this it's a little
    triangle with a little circle at
  • 8:52 - 8:53
    the end now.
  • 8:54 - 8:59
    Compared with the others, the
    not operation only have one
  • 8:59 - 9:02
    input and has one output.
  • 9:02 - 9:09
    OK, so that state to wait as you
    something. So if I have got just
  • 9:09 - 9:12
    one input then that input P.
  • 9:13 - 9:18
    Can only be true or false and
    then not P.
  • 9:19 - 9:25
    But what is not true? What
    is not true is force and
  • 9:25 - 9:29
    what is not force is true.
    So the not operation has
  • 9:29 - 9:34
    got a very special role. It
    flips it inverts it changes
  • 9:34 - 9:36
    the input to its opposite.
  • 9:38 - 9:40
    The next simple operation
    is the X or.
  • 9:42 - 9:48
    Which has got this symbol, so it
    doesn't have that many symbol as
  • 9:48 - 9:53
    the not. So that's easier. And
    the exors pictorial symbol for
  • 9:53 - 9:55
    joining as circuit.
  • 9:56 - 9:58
    Is the OR gate?
  • 10:00 - 10:05
    But with an extra leg added to
    it so it can take again at least
  • 10:05 - 10:09
    two inputs. Or if we use the
    alternative way of the X or.
  • 10:11 - 10:12
    And it would look.
  • 10:12 - 10:14
    Something like that.
  • 10:15 - 10:20
    OK, now this is called the
    axle operation because it's
  • 10:20 - 10:21
    exclusive.
  • 10:22 - 10:23
    Or
  • 10:24 - 10:29
    so it's exclusively one or the
    other input, so the xclusive
  • 10:29 - 10:35
    or the X or operation filters
    out the input values when the
  • 10:35 - 10:42
    inputs are the same. So what
    do I mean by that? If I have
  • 10:42 - 10:43
    got inputs P&Q?
  • 10:45 - 10:50
    What will the acts or do
    to them?
  • 10:52 - 10:57
    So again, be can be true
    to force force and Q is
  • 10:57 - 10:59
    true force three force.
  • 11:00 - 11:04
    So exclusive, or if the inputs
    are the same, which is this
  • 11:04 - 11:09
    case? Because both of them are
    true. The Exor Gate gives you a
  • 11:09 - 11:13
    4th signal. Basically the axle
    gates stops the signal going
  • 11:13 - 11:18
    through. If one is to the other
    one is forced then that's when
  • 11:18 - 11:22
    the signal can go through and
    again because force enforces the
  • 11:22 - 11:26
    same input value that the EXOR
    gate stops your signal going
  • 11:26 - 11:30
    through. And remember that I
    mentioned at the beginning of
  • 11:30 - 11:35
    this video. These are based on
    the electric circuits and then
  • 11:35 - 11:38
    you wanted to manipulate at the
    very, very early stages or
  • 11:38 - 11:42
    lippit stages of computing you
    wanted to manipulate where the
  • 11:42 - 11:45
    electrical signal goes doesn't
    go through here doesn't go
  • 11:45 - 11:48
    through that you wanted to
    manipulate and filter out
  • 11:48 - 11:52
    certain inputs in favor of other
    inputs. So these different gates
  • 11:52 - 11:57
    give you that kind of option of
    turning them around. Saying, I
  • 11:57 - 12:01
    don't want this input, I want
    that that input combination to
  • 12:01 - 12:02
    go through and nothing else.
  • 12:04 - 12:07
    There are a couple of more
    operations that I would like
  • 12:07 - 12:09
    to talk about. These are
    slightly more complicated. I
  • 12:09 - 12:13
    can't really give you any nice
    and simple example of why they
  • 12:13 - 12:17
    work in here. We just have to
    learn that this is the way
  • 12:17 - 12:20
    that they work, so one of them
    is that you've done.
  • 12:22 - 12:25
    And the symbol for that
    is this forward error.
  • 12:26 - 12:30
    So again. I've got inputs P&Q.
  • 12:31 - 12:35
    And then what will be
    the Alpha output of the
  • 12:35 - 12:37
    P IF then Q operation?
  • 12:40 - 12:47
    So true true Force force
    three force, three force.
  • 12:48 - 12:51
    Sometimes this also
    called the implies.
  • 12:53 - 12:57
    So true implies true, that is
  • 12:57 - 13:04
    true. But true cannot imply
    force, so this one is force
  • 13:04 - 13:07
    force can imply true.
  • 13:08 - 13:11
    And force can imply force
    that's true. Again, this is
  • 13:11 - 13:14
    probably going to be the most
    difficult gate to understand
  • 13:14 - 13:18
    why this works. You just have
    to learn the truth tables, and
  • 13:18 - 13:22
    once you know the truth
    tables, you can apply it to
  • 13:22 - 13:23
    any kind of combinations.
  • 13:25 - 13:29
    And the last operation that I
    would like to talk about is that
  • 13:29 - 13:31
    if and only if.
  • 13:33 - 13:37
    And the symbol for that is
    an arrow that goes both
  • 13:37 - 13:41
    ways. So if I have got the
    two inputs again P&Q.
  • 13:43 - 13:48
    The P if and only Q
    will work this way.
  • 13:49 - 13:55
    33443434.
  • 13:57 - 13:59
    This one is only true.
  • 14:00 - 14:05
    If both inputs are the same, so
    true and true are the same, so
  • 14:05 - 14:09
    this will be true. True annefors
    are different, so the output
  • 14:09 - 14:15
    will be force same for the third
    right and for some for side the
  • 14:15 - 14:20
    same. So this is true in here.
    Now if you look at this one and
  • 14:20 - 14:24
    if you remember the X or you can
    support that these two
  • 14:24 - 14:29
    operations if and only if an the
    X or are doing exactly the
  • 14:29 - 14:31
    opposite in this using this.
  • 14:31 - 14:37
    Operation I can filter out the
    same input values and stop the
  • 14:37 - 14:39
    different input values.
  • 14:40 - 14:43
    So that's again a very useful
    operation to have.
  • 14:46 - 14:51
    This short video was intended to
    expose you to the basics of the
  • 14:51 - 14:55
    Boolean logic or digital logic
    and show you had the truth.
  • 14:55 - 14:59
    Tables can be built up and what
    are the most commonly used
  • 14:59 - 15:03
    operations to be able to follow
    up on digital logic? You will
  • 15:03 - 15:08
    need to be able to know this by
    heart, so these are different
  • 15:08 - 15:12
    operations that every time you
    need to apply them you will be
  • 15:12 - 15:16
    have to be very, very confident
    knowing these operations how
  • 15:16 - 15:19
    they work. What they do? What
    kind of inputs they let
  • 15:19 - 15:23
    through an? What kind? What
    kind of inputs they stop from
  • 15:23 - 15:26
    going through? And again, as I
    mentioned at the beginning,
  • 15:26 - 15:29
    this is all coming from the
    basic principles that went
  • 15:29 - 15:32
    first. Human started team when
    the computers they build them
  • 15:32 - 15:33
    together from very tiny basic
    circuits.
Title:
https:/.../emt131080p.mp4
Video Language:
English
Duration:
15:58

English subtitles

Revisions