EVALUATING BASIC LOGIC STATEMENTS INTRO TO SYSTEM DESIGN.

Slides:

Advertisements

Similar presentations

Truth Tables and Logic Gates. What are Logic Gates? Logic gates are components used in making logic circuits. Each gate has one or more inputs and produces.

Advertisements

Logic Gates A logic gate is an elementary building block of a digital circuit Most logic gates have two inputs and one output At any given moment, every.

Computer Science 210 Computer Organization Introduction to Logic Circuits.

Programmable Logic Controllers.

Basic Logic Gate Sayed Mahbub Hasan Amiri Dhaka Residential Model College.

1 COMP541 Combinational Logic Montek Singh Jan 16, 2007.

Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.

Propositional Calculus Math Foundations of Computer Science.

Objective: Graph integers on a number line and find absolute value.

Logic Gates Circuits to manipulate 0’s and 1’s. 0’s and 1’s used for numbers Also to make decisions within the computer. In that context, 1 corresponds.

Simple One and Two Input Logic Gates Truth Tables and Function Tables Based Upon TTL Levels.

Lesson Objective: I can…

Adapted from Discrete Math

Intro to Digital Electronics. Classifications of Electronic Circuits Switching Circuits – by turning electricity on and off. – Figure 1 – Known as the.

Computer Science 101 The Boolean System. George Boole British mathematician ( ) Boolean algebra –Logic –Set theory –Circuits –Conditions in if.

CPSC 171 Introduction to Computer Science Boolean Logic, Gates, & Circuits.

Systems Architecture I1 Propositional Calculus Objective: To provide students with the concepts and techniques from propositional calculus so that they.

Logic gates & Boolean Algebra. Introduction Certain components (called logic elements) of the computer combine electric pulses using a set of rules. Electric.

 In studying digital integrated circuits, one must start with the simplest group of circuit, the SSIs or Small Scale Integrated Circuits. Since these.

Computer Science 210 Computer Organization Introduction to Boolean Algebra.

Basic Logic Operations and Standard Logic Gates (Lecture #1) ECE 331 – Digital System Design.

Combinational Logic 1.

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.

Lecture 22: 11/19/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.

Chapter 33 Basic Logic Gates. 2 Objectives –After completing this chapter, the student should be able to: Identify and explain the function of the basic.

Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.

Combination of logic gates  Logic gates can be combined to produce more complex functions.  They can also be combined to substitute one type of gate.

Logic Gates. The Inverter The inverter (NOT circuit) performs the operation called inversion or complementation. Standard logic symbols: 1 1 input output.

Logic and Reasoning Conditional Statements. Logic The use and study of valid reasoning. When studying mathematics it is important to have the ability.

IB Computer Science – Logic

© BYU 03 BA1 Page 1 ECEn 224 Boolean Algebra – Part 1.

The inverter performs the Boolean NOT operation. When the input is LOW, the output is HIGH; when the input is HIGH, the output is LOW. The Inverter AX.

CS Class 04 Topics  Selection statement – IF  Expressions  More practice writing simple C++ programs Announcements  Read pages for next.

Logic Gates and Boolean Algebra Introduction to Logic II.

LOGIC GATES. INTRODUCTION TO LOGIC GATES Boolean functions may be practically implemented by using electronic gates. The following points are important.

Logic Gates and Boolean Algebra

Computer Science 210 Computer Organization

Integers and Absolute Values

Boolean Algebra & De Morgan's Theorems

Logic Gates Benchmark Companies Inc PO Box Aurora CO

2.1 Propositions and Logical Operations

Basic Logical Operations (Fascinating)

KS4 Electricity – Electronic systems

KS4 Electricity – Electronic systems

Digital Signals Digital Signals have two basic states:

Computer Science 210 Computer Organization

Agenda – 2/12/18 Questions? Readings: CSI 4, P

Chapter 1 The Foundations: Logic and Proof, Sets, and Functions

Computer Science 210 Computer Organization

KS4 Electricity – Electronic systems

Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y

GCSE Computer Science – Logic Gates & Boolean Expressions

Today You are Learning simple logic diagrams using the operations AND, OR and NOT truth tables combining Boolean operators using AND, OR and NOT.

Discrete Mathematics Lecture 2: Propositional Logic

Inductive Reasoning and Conjecture, and Logic

Lecture 5 Binary Operation Boolean Logic. Binary Operations Addition Subtraction Multiplication Division.

Truth tables Mrs. Palmer.

Department of Electronics

2-2 Logic Part 2 Truth Tables.

DIGITAL ELECTRONICS AND LOGIC GATES. ANALOG SIGNAL:- Analog signal is continuous time varying current or voltage signal.

boolean Expressions Relational, Equality, and Logical Operators

Presentation transcript:

EVALUATING BASIC LOGIC STATEMENTS INTRO TO SYSTEM DESIGN

What is a Statement? – a meaningful, declarative sentence that can only be either true or false. Examples of sentences that are (or make) statements: STATEMENTEVALUATES AS: "Socrates is a man."TRUE "A triangle has three sides."TRUE "Paris is the capital of Spain."FALSE x = 6TRUE (only if there are 6 ‘x’s) The first two (make statements that) are true, the third is (or makes a statement that is) false, the fourth is an evaluative statement (assigns a value).

There are only 2 possible logic states: True = ON, HI, YES, CLOSED, NOT FALSE, any integer greater than 0 False = OFF, LO, NO, OPEN, NOT TRUE, zero

Not all sentences are statements… Examples of sentences that are not (or do not make) statements: "Who are you?" "Run!" "Greenness walks slowly." "I had one cucumber but the eggplant over there." "The King of France is wise." "Pegasus exists."

EXPRESSIONS: Evaluating logical statements always occurs by comparing 2 statements in an EXPRESSION: AND – the expression evaluates to TRUE only if both statements are TRUE OR – the expression evaluates to TRUE only if either statement is TRUE NAND – the expression evaluates to TRUE only if neither statement is TRUE (This is called an inverse statement) NOR – the expression evaluates to TRUE only if neither statement is TRUE NOT – the expression always evaluates as the OPPOSITE of the statement. This is not an evaluative or comparative statement. It is called a LOGIC INVERTER.

Truth Table A truth table is composed of one column for each input variable (for example, A and B), and one final column for all of the possible results of the logical operation that the table is meant to represent. Each row of the truth table contains one possible configuration of the input variables (for instance, A=true B=false), and the result of the operation for those values.

ANDORNAND INPUTOUTPUTINPUTOUTPUTINPUTOUTPUT ABA AND BAB AB NORNOT INPUTOUTPUTINPUTOUTPUT ABA AND BA A

Conditional Expressions the input conditions in the expression must be either TRUE or FALSE (depending on the expression) in order for the output condition to be evaluated as either TRUE or FALSE. Conditional expressions are always written as IF (STATEMENT A) LOGICAL OPERATOR (STATEMENT B) THEN (OUTPUT) REMEMBER: Statement A and Statement B can only be evaluated to TRUE or FALSE and the OUTPUT will only evaluate to TRUE or FALSE, depending on the operator.