Department of Management School of Business, Economics and Informatics Boolean Algebra Eva Szatmari

Slides:



Advertisements
Similar presentations
Lecture 14 Today we will Learn how to implement mathematical logical functions using logic gate circuitry, using Sum-of-products formulation NAND-NAND.
Advertisements

Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.
EXAMPLE 1 Multiplying Decimals decimal places + 2 decimal places 4 decimal places.
AP Examination Alert The APCS Examination includes a variety of Boolean Logic questions. Many questions require indirect knowledge of Boolean Logic, and.
Computer Science 101 The Boolean System. George Boole British mathematician ( ) Boolean algebra –Logic –Set theory –Circuits –Conditions in if.
XOR and XNOR Logic Gates. XOR Function Output Y is TRUE if input A OR input B are TRUE Exclusively, else it is FALSE. Logic Symbol  Description  Truth.
Review CAS CS210 Ying Ye Boston University. Logical expressions Truth table input: A, B, Coutput: D ABCD (~A)(~B)(~C)
Lecture 7 Topics –Boolean Algebra 1. Logic and Bits Operation Computers represent information by bit A bit has two possible values, namely zero and one.
© 2006 Baylor University Slide 1 Fundamentals of Engineering Analysis EGR 1302 Unit 4, Lecture E Approximate Running Time is 20 Minutes Distance Learning.
 In studying digital integrated circuits, one must start with the simplest group of circuit, the SSIs or Small Scale Integrated Circuits. Since these.
Evaluating Algebraic Expressions MATHO Game #1 Answers for MATHO Board
Unit 8 Lesson 1 (U8L1) PS 5-1: Solve and verify word problems using a mathematical expression Variables & Algebraic Expressions.
Algebra Unit 1: Foundations for Algebra. Write an algebraic expression for the product of 9 and a number, n less than 18.
Module 2 Test Review. Variables and Expressions Writing Algebraic Expression Step 1: Identify key words Step 2: Define the variable Step 3: Work the.
Logic Gates Shashidhara H S Dept. of ISE MSRIT. Basic Logic Design and Boolean Algebra GATES = basic digital building blocks which correspond to and perform.
February 23, Announcements ACSL – March 9 Digital Electronics – 2 Graph Theory – 2 Boolean Algebra – 1 USACO – March
4. Computer Maths and Logic 4.2 Boolean Logic Simplifying Boolean Expressions.
29 September 2015Birkbeck College, U. London1 Introduction to Computer Systems Department of Computer Science and Information Systems Autumn 2015 Preliminary.
Computer Organization and Design Transistors & Logic - II Montek Singh Oct {21,28}, 2015 Lecture 10.
Department of Management School of Business, Economics and Informatics Binary Numbers 2 Eva Szatmari
IB Computer Science – Logic
Lecture 4 Introduction to Boolean Algebra. Binary Operators In the following descriptions, we will let A and B be Boolean variables and define a set of.
8.4 Use Scientific Notation Algebra. Scientific Notation Numbers such as 1,000,000, 153,000 and are written in standard form. Another way to write.
13 October 2015Birkbeck College, U. London1 Introduction to Computer Systems Lecturer: Steve Maybank Department of Computer Science and Information Systems.
Assoc. Prof. Dr. Ahmet Turan ÖZCERİT.  Boolean postulate  Simplifying boolean equations  Truth tables You will learn: 2.
Exponent Quiz Review. Evaluate the expression 4 2  Answer: 16.
Choose a category. You will be given the answer. You must give the correct question. Click to begin.
Brian K. Strickland a ba Λ a aa b Λ -NFA for Regular Expression (aab)*(a + aba)*
Ahmad Almulhem, KFUPM 2009 COE 202: Digital Logic Design Combinational Logic Part 1 Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office:
Circuits & Boolean Expressions. A ABC BC ABC C B A Example # 1: Boolean Expression: Develop a Boolean expression from a circuit.
Department of Management School of Business, Economics and Informatics Binary Numbers 1 Eva Szatmari
MODEL 1 Drag the shapes from the right to represent the situation. Write the algebraic expression (make your best guess) Show 3 groups of 1 apple and 2.
On the screens click on the number you think is the right answer. Three times tables Good luck!
Algebra I Ch. 1 Warm-ups. Warm-Up Instructions 1.For each section use 1 of the boxes on the warm-up sheet 2.Number each problem 3.Show all work 4.Circle.
DIGITAL ELECTRONICS. Everything in digital world is based on binary system. Numerically it involves only two symbols 0 or 1. –0 = False = No –1 = True.
DeMorgan’s Theorem DeMorgan’s 2 nd Theorem The complement of a sum of variables is equal to the product of the complemented variables. A + B = A. B Applying.
Logic Gates and Boolean Algebra Introduction to Logic II.
Logic Gates, Boolean Algebra and Karnaugh Maps. Challenge! By the end of todays session can you complete the following?
Notes Over 1.2.
CPS120 Introduction to Computer Science
Eng. Mai Z. Alyazji October, 2016
Logic Gates and Boolean Algebra
Algebra Review Station #1
Questions Describe the following gates
Logic Gates, Boolean Algebra and Karnaugh Maps
Review Problems Algebra 1 11-R.
Computer Organization and Design Transistors & Logic - II
Boolean Expressions Lecture No. 10.
Circuits & Boolean Expressions
Evaluate the expression by sketching a triangle
Elec 2607 Digital Switching Circuits
Boolean Algebra.
Use the Table of Integrals to evaluate the integral. {image}
Algebra 1 Section 13.4.
Evaluating expressions and Properties of operations
Evaluating Algebraic Expressions
Chapter 4 Gates and Circuits.
Evaluating Algebraic Expressions
ECS15 boolean.
Factorization by Using Identities of Sum and Difference of Two Cubes
The Distributive Property Guided Notes
Functional Notation Addendum to Chapter 4.
Algebra Substitution a = 3 ; b = 4 and c = -1 2a + c b2 – a2 2b2
Learn to identify and evaluate expressions.
Evaluating Algebraic Expressions
Eng. Ahmed M Bader El-Din October, 2018
Dept. of Electrical and Computer Eng., NCTU
Circuits & Boolean Expressions
Agenda Lecture Content: Combinatorial Circuits Boolean Algebras
Presentation transcript:

Department of Management School of Business, Economics and Informatics Boolean Algebra Eva Szatmari

School of BEI Study Skills in Mathematics ntroduction%20to%20computer%20syste ms.html

Learning Objectives Basic Boolean Operations Truth Table Examples Practice Questions Evaluating Boolean Expressions Examples Practice Questions

Basic Boolean Operations What are the basic Boolean operations? What do you know about them?

Truth Table What is a truth table? How do you construct one? What are the key steps when constructing one?

Example 1 (A AND B) OR NOT(A)

Example 2 (NOT(A) OR B) AND C

Example 3 (A AND NOT(B)) XOR C

Example 4 (A IMPLIES B) OR (A IMPLIES C)

Practice Questions Construct the truth table of the following Boolean expressions: A OR (NOT(B) AND A) (A OR B) IMPLIES (A AND B) A OR (B AND C)

Practice Question 1 – Answer ABNOT(B)NOT(B) AND AA OR (NOT(B) AND A)

Practice Question 2 – Answer ABA OR BA AND B(A OR B) IMPLIES (A AND B)

Practice Question 3 – Answer ABCB AND CA OR (B AND C)

Evaluating Boolean Expressions Which operations are used, how do they work? What are the priorities? What values do I know? Is there any value I don’t know?

Example 1 Evaluate the value of the following Boolean expression, if A = 1 and B = 0 A OR NOT(B)

Example 2 Evaluate the value of the following Boolean expression, if A = 1, B = 0 and C = 1 (A AND NOT(B)) IMPLIES C

Example 3 Evaluate the value of the following Boolean expression, if A = 1 and B = 0 A OR NOT(B AND C)

Practice Questions 1)Evaluate the value of the following Boolean expression, if A = 0 and B = 1 NOT(A XOR B) 2)Evaluate the value of the following Boolean expression, if A = 0 and B = 1 A OR (NOT(B) AND C)

Practice Questions – Answers 1) NOT(A XOR B) = NOT (0 XOR 1) = NOT(0) = 1 2) A OR (NOT(B) AND C) If C = 0 0 OR (NOT(1) AND 0) = 0 OR (0 AND 0) = 0 OR 0 = 0 If C = 1 0 OR (NOT(1) AND 1) = 0 OR (0 AND 1) = 0 OR 0 = 0

Any Other Questions?

Contact Details Eva Szatmari Or GOOD LUCK