Binary Operation Boolean Logic

umairsimjee 2,477 views 15 slides Jan 11, 2016
Slide 1
Slide 1 of 15
Slide 1
1
Slide 2
2
Slide 3
3
Slide 4
4
Slide 5
5
Slide 6
6
Slide 7
7
Slide 8
8
Slide 9
9
Slide 10
10
Slide 11
11
Slide 12
12
Slide 13
13
Slide 14
14
Slide 15
15

About This Presentation

This will clear your concept about Binary Operation
Boolean Logic . It will guide you in good way.


Slide Content

Lecture 5 Binary Operation Boolean Logic Lecturer: Sumaira Hussain S.M.I university

Binary Operations Addition Subtraction Multiplication Division

Addition

Subtraction

Multiplication

Division

Boolean Logic Operations Let x, y, z be Boolean variables. Boolean variables can only have binary values i.e., they can have values which are either 0 or 1 . For example, if we represent the state of a light switch with a Boolean variable x, we will assign a value of 0 to x when the switch is OFF, and 1 when it is ON A few other names for the states of these Boolean variables 0 1 Off On Low High False True

Boolean Logic AND OR NOT

We define the following logic operations or functions among the Boolean variables Name Example Symbolically NOT y = NOT(x) x ´ AND z = x AND y x · y OR z = x OR y x + y

Truth Table A truth table defines the output of a logic function for all possible inputs. Number of rows in a truth table? 2n n = number of input variables

NOT Operation Truth Table for the NOT Operation X y = x´ 0 1 1 0

AND Operation Truth Table for the AND Operation X y z = x · y 0 0 0 0 1 0 1 0 0 1 1 1

OR Operation Truth Table for the OR Operation x y z = x + y 0 0 0 0 1 1 1 0 1 1 1 1

Examples z = (x + y)´ x y x + y z = (x + y)´ 0 0 0 1 0 1 1 0 1 0 1 0 1 1 1 0

Examples z = y · (x + y) x y x + y z = y · ( x + y) 0 0 0 0 0 1 1 1 1 0 1 0 1 1 1 1
Tags