Prof.Manoj Kavedia 2 Algebra
|
|
- Erica Robbins
- 5 years ago
- Views:
Transcription
1 ` Logic Gates and Boolean 2 Algebra Chapter-2 (Hours:06 Marks:14 )( Digital Techniques) Logic Gates And Boolean Algebra 2.1 Logical symbol, logical expression and truth table of AND, OR, NOT, NAND, NOR, EX-OR and EX-NOR gates. 2.2 Universal gates NAND and NOR gates 2.3 Logical circuits of basic gates using universal gates 2.4 Gates using more than two inputs. 2.5 TTL and CMOS logic gate ICs and their pin configurations. (To be covered in Practical) 2.6 Basic laws of Boolean algebra, Duality theorem. 2.7 De Morgan s theorems. Logic Gates Q.1What is meaning of Word Logic Gate? Ans. The word logic is commonly used in conversation English and it is derived form Greek word LOG which refers to reason and the suffix IC meaning the study of so logic is study of reason. Gate is another common word. The common usage of gate is an opening in a wall, a means of exit or entrance. The technical definition of gate is a natural extension of its common form. It is a device whose output is a specific when specified input condition are met. Gate A gate is a logic circuit which has one or many input and a single output. There will be an output only for certain condition of input. The logic gate is a basic building block of digital electronics. There are three basic or fundamental logic gates or logic operators. Those are 1. NOT gate 2. OR gate 3. AND gate Q.2.Describe with symbol, truth table, operation of NOT gate Ans. Not operation is referred as Inversion or Complementation The NOT gate is also called as Inverter because it only inverts the input i.e. logic 1 state at the input becomes logic 0 at the output and vice versa. NOT gate is an electronic circuit with only one input and one output signal. 1
2 Logic Equation Y = A Y = NOT A Y is complement of A The presence of the small circle, known as bubble always denotes inversion in the digital circuit. Symbol : NOT gate Truth table A Waveform Y = A A Y Input (A) Output (Y) IC NOT Gate Fig.IC 7404 Hex Inverter Q.3.Describe with symbol, truth table, operation of AND gate Ans. A circuit which performs an AND operation is called as AND gate. This gate has two or more inputs signals but only one output signal. The AND gate has a high output only when all inputs are high. It indicates Logical Multiplication denoted by dot (.). Symbol A Y = A. B B = A And B Waveform Truth Table of And Gate A B Y
3 Summary of And Function 1.When all the inputs are 1 then only output is 1 2.Output is equal to 0 when one or more inputs are 0 3.The And operation is performed exactly same as ordinary multiplication of 1s and 0s AND Gate IC ( 7408 Quad Two Input AND gate ) Fig.IC 7408 Quad 2Input AND gate Q.4. Describe with symbol, truth table, operation of OR gate Ans. An electronics circuit which performs OR Function is called as OR gate.the OR gate has two or more inputs signal but only one outputs signal. If any or all input signal is high the output signal is high. It indicates logical addition and denoted by + sign. Symbol Truth Table A B Y Wave form of OR Gate 3
4 OR Gate IC ( 7432 Quad Two Input OR gate ) Fig.Quad 2-Input OR gate Summary of OR Function 1.When any of the inputs is 1 the output of OR function is 1 2.Output is equal to 0 when all inputs are 0 3.With OR operation 1+1 =1, 1+1+1=1, =1. and so on Q.5.Draw the symbol and write the truth table for 3 input OR and AND Gate Ans.3 Input OR Gate A B C Y = A + B + C Truth Table Input Output A B C Y=A+B+C
5 3 Input AND Gate A B C Y = A. B. C Truth Table Input Output A B C Y=A+B+C IC numbers for 3 Input gates //Diagram Q.6.Why NAND and NOR gates are called as Universal gates Ans. Any Boolean (or logic) equation can be realized by using the AND, OR & NOT gates. From these three operation two more operations are derived 1) The NAND operation ( AND + NOT) 2) The NOR operation ( OR + NOT ) These operation have before very popular and are widely used. The reason being the only one type of gates either NAND or NOR are sufficient for the realization (implementing ) of any logical operation. Because of this reason NAND and NOR gates are known as universal gates. Using theses gates one can realize any given logical expression like AND, OR, NOT,XOR, XNOR, as a result they are called as Universal Logic Gates 5
6 Q.7.Describe with symbol, truth table, operation of NAND gate Ans.NOT Operation followed by AND operation(and+not) The word NAND stands for NOT-AND. When a NOT gate is combined with the AND gate the resultant is NAND gate. In these with AND gate function, inversion occurs. In this gate output is high when any of the input are high, whereas output is low when all the input are high. Symbol Truth Table Wave form A B Y Equivalent and Symbols of NAND Gate Note : Bubble indicate inversion and Bar on the equation indicates the inversion The NAND gate has two or more inputs but only one output. All the inputs must be set to high to get a low output. If any input is low output is high. Fig. Quad 2 Input NAND Gate 6
7 Q.8.Describe with symbol, truth table, operation of NOR gate Ans. The word NOR stands for NOT-OR. When a Not gate is combined with the OR gate in cascade the resultant gate is known as NOR gate. Here together with OR gate inversion takes place. Symbol Truth Table Waveform A B Y Equivalent and symbol of NOR gate The NOR gate has two or more inputs but only one output. In NOR gate all must tied high to get output logic low. If any input is high output is low. Fig.Quad 2-Input NOR gate 7
8 Q.9.Describe with symbol, truth table, operation of EXOR gate Ans. Exclusive-OR or Ex-OR is called Ex-OR because it is special case of OR gate. It is not a basic operation and can be performed using basic gates AND, OR, NOT or universal gates (NOR and NAND). Comparison of Gates Truth table - OR gate Truth table - EX-OR gate A B Y A B Y If we compare truth table of EXOR gate with OR gate then in truth table three rows are same, only fourth row is different. Hence it is named as EXOR which excludes the condition of OR gate,where both A and B are 1 and normal OR operation is called as Inclusive OR. Truth Table A B Y Symbol and Equation of Ex-OR gate waveform Truth Table The EXOR gate has two or more inputs but only one output. For an EXOR gate if odd number of inputs are 1 then output is logic 1 and if even number of input are same then output is logic 0. For two input EXOR gate, then output of gate is logic 1 if both the inputs are different (i.e. one input as logic 0 and other as logic 1). The output is logic 0 if both input are same i.e. either logic 0 or logic 1. Basic Property The property of the gate is that output is HIGH only if ODD number of the inputs are HIGH. If EVEN number are HIGH then the output is LOW. 8
9 Fig.Quad 2-Input ExOR Gate Q.10. Describe with symbol, truth table, operation of EXNOR gate Ans. This gate is NOT followed by EX-OR gate. The output of EX-OR gate is logic 1 when both the inputs are same i.e. logic 0 or logic 1. The output is logic 0 when both the inputs are different i.e. one held at logic 0 and another at logic 1. EXNOR is complement of EXOR operation. Symbol and equation Truth Table Waveform A B Y Q.11.Prove NAND Gate as Universal Logic or Prove NAND Gate as NOT, OR, AND, EXOR Ans. 1) NAND as NOT gate Y = A.B = X.X Let B = A = X Since A.A =A Y = X which equation for Not Gate A B Y Analysis For all input = O, output is For all input = 1, output is 0 9
10 An Inverter can be made form NAND gate by connecting all of the inputs together and taking a single input as shown in the figure 2) NAND as AND gate An AND function can be generated using only NAND gates. It is generated by simply inverting output of NAND gate. Fig. shows the two input AND gate using NAND gates. Fig. And gate using Nand gate Output of 1 ST NAND gate X = A.B Output of 2 nd NAND gate Y = X Y = A.B = A.B Which is same as for And gate. 3) NAND as OR gate Or gate can be designed using the Nand Gate as follows Fig. Nand gate as Or Gate 10
11 Y = A.B = A + B By DMT = A + B since A = A this is the Equation for OR gate Note : Bubble at the input of NAND gate indicates inverted input. 4) NAND as EX-OR gate: Y = X.Z = AB. AB BY D.M.T = AB + AB = A B Which is same for EX- OR gate Q.12.Prove NOR Gate as Universal Logic or Prove NOR Gate as NOT, OR, AND, EXOR Ans. Basic gates using NORgate 1) NOR as NOT gate: An inverter can be made from a NOR gate by connecting all of the inputs together and making a single common input, as shown in Fig. Logic Circuit Y = A+B = X+X Truth table = X Since A.A =A this is the Equation for NOT gate 11
12 Boolean Equation 2) NOR as OR gate : An OR function can be generated using only NOR gates. It can be generated by simply inverting output of NOR gate. Fig shows the two input OR gate Output of 1 ST NAND gate X = A+B Output of 2 nd NAND gate Y = X Y = A+B = A+B Same as that of OR gate 3) NOR as AND gate: And Can be designed using NOR as Follows ` Y = A+B = A.B A.B = 12
13 By DMT Same as that of AND Gate Fig. Nor as And gate logic diagram Boolean Equation Truth Table Note : Bubble at the input of NOR gate indicates inverted input. 4) NOR as EX-NOR gate ( For Students) Y = (A+B)+(A+B) = AB + AB = A Ο B Same as that of EX- NOR gate Q.13.Implement EXOR gate using Basic Gate Ans. Ex-OR gate using Basic Gates ExNor Using Basic Gates (For Students) Boolean Laws and Demorgans Theorem 13
14 The rules for manipulation of binary numbers developed English mathematician George Boolea are known as Boolean Algebra. This the basic of all digital systems like computer, calculator etc. A Boolean variable has two values 1 and 0 s (high or low, true or false). The basic Boolean operation are AND,OR,NOT. Q.14.How Boolean Algebra differ Conventional Algebra Ans. Basic of Boolean Algebra Logical algebra differs from conventional algebra in three respects 1. The symbols used in logical algebra (usually) letters, do not represent numerical values. 2. Arithmetic operations are not performed in logical algebra. In Boolean Algebra there are no fractions, decimals, negative numbers, square root,cube root, logarithms, imaginary numbers and so on. 3. Third and very important point is logical algebra allows only two possible values 1 and 0 s for any variables. Thus logical algebra is ideally suited for the system based on the two opposite values such as ON and OFF. Q.15.List and Describe different Boolean Laws Ans.Laws of Boolean Algebra 1. And Law 2. OR Law 3. Double Complementation Law 4. Commutative law 5. Associative Law 6. Distributive Law The AND law The AND operation or ANDing is similar to multiplication. The AND law Says a) A.0=0 b) A.1=A c) A.A=A d) A.A=0 The OR law The OR operation or ORing mean adding two Boolean variables. The OR laws are a) A+0=A b) A+1=1 c) A+A=A d) A+A=1 14
15 Double complementation Law Complementation means inversion and law of complementation results from the NOT operation. The law state a) 0 = 1 if A = 0 b) 1 = 0 if A = 1 A = A i.e. called as double Inversions. Cumulative law The Cumulative law states that the order in which an operation is performed on a pair of variables does not affect the result of operation. In Boolean operation order of variables in OR and AND is insignificant ie Cumulative law allows the changes of position of and OR and AND variables. Thus a) A+B = B+A b) A.B = B.A Proof by perfect induction method. A B A+B B+A A B A.B B.A Law (a) Proved Law (b)proved Law can be proved by perfect induction method. Associative Law Law 1 The associative law that one can group any two terms of sum,or any two of a product. In other words it allows grouping of variables. Ie This states that ORing of several variable the result is the same irrespective of the grouping of variables.thus A+(B+C) = (A+B)+C The above laws can be proved using induction method Proof by perfect induction method A B C B+C A+B A+(B+C) (A+B)+C
16 Logical Implementation == > Law 2 The associative law of multiplication states that it makes no difference in what order the variables are grouped when ANDing several variables. As shown in Fig. This law as applied to AND gates. A.(B.C) = (A.B).C The above laws can be proved using induction method Proof by perfect induction method A B C B.C A.B A.(B.C) (A.B).C Logical Implementation == > Distributive law The distributive laws states that factoring or multiplication of different term in an expression is allowed. They are expressed ad follows: a) A.(B+C) = AB + AC b) A+(B.C) = (A+B)(A+C) LAW 1 : 16
17 The distributive law states that ORing several variables and ANDing the result with a single variable is equivalent to ANDing the result with a single variable with each of the several variables and then ORing the products. The Fig. illustrates this law in terms of gate implementation. Proof by perfect Induction Method A.(B+C) = AB + AC A+(B.C) = (A+B)(A+C) A B C B+C A.B A.C A.(B+C) A.B+A.C A+(BC) (A+B)(A+C) Logical Implementation of the Law 1 LAW 2 The distributive law states that ORing several variables and ANDing the result with a single variable is equivalent to ANDing the result with a single variable with each of the several variables and then ORing the products. The Fig. illustrates this law in terms of gate implementation. Proof by perfect Induction Method A.(B+C) = AB + AC A+(B.C) = (A+B)(A+C) A B C B+C A.B A.C A.(B+C) A.B+A.C A+(BC) (A+B)(A+C)
18 Q.16.State and Prove Demorgan s Theorem Ans. This theorem are named behind the discoverer Bas Augustus Demorgan. The use of these theorems enables us to realize OR operation by using AND-NAND family gates or vice-versa. Demorgans 1st theorem Demorgan 1 st theorem states that The complement of a sum is equal to the product of the complement. A+B = A.B Proof: By perfect induction method or by truth table. LHS RHS A B A+B A+B A B A.B Therefore LHS = RHS Hence Theorem is proved two truth table are identical.fig. Logical Implementation of DMT1 Hence according to Demorgan s 1 st theorem NOR gate = Bubbled AND gate Demorgan s 2nd theorem The second theorem states that The complement of a product is equal to the sum of the complement. A.B = A+B Proof: By perfect induction method: LHS RHS A B A.B A.B A B A+B
19 Therefore LHS = RHS Since two truth table are identical hence Demorgan s 2 nd theorem is proved. LHS = A.B RHS = A+B LHS = RHS Hence it is proved that NAND gate = Bubbled OR gate. Note. For Simple remembrance it is Change the Sign and Break the Line Q.17.State and Prove Duality Theorem Ans.The duality theorem is one of those elegant theorems proved in advanced mathematics. Duality theorems says, starting with a Boolean relation, one can derive another Boolean relation by a) Change each OR sign to AND sign. b) Change each AND sign to OR sign. c) Complementing any 0 to 1 appearing in the expression. A+0 = A A.1 = A This dual property is obtained by changing the OR sign to an AND sign and by complementing the 0 to get 1. E.g.: A(B+C) = AB+AC By changing each OR and AND operation we get the dual relation AB+AC = (A+B)(A+C) By changing each AND and OR operation we get the dual relation A+BC = (A+B)(A+C) Same can be proved using truth table method. Expected by the students Q.18.List all the standard Theorems used in Boolean Algebra Ans.Standard Theorems 19
20 Boolean Theorems 1. A+0=A 2. A.1=A 3. A+1=1 4. A.0=0 5. A+A=A 6. A.A=1 7. A+A=1 8. A.A=0 9. A.(B+C) = AB+AC 10. A+BC=(A+B)(A+C) 11. A+AB=A 12. A(A+B)=A 13. A+AB=(A+B) 14. A(A+B)=AB 15. AB+AB=A 16. (A+B)(A+B)=A 17. AB+AC =(A+C)(A+B) 18. (A+B)(A+C)=AC+AB 19. AB+AC+BC=AB+AC 20. (A+B)(A+C)(B+C)=(A+B)(A+C) 21. A.B.C...= A+B+C A+B+C+... = A.B.C... Board Solved Questions Q.19.Solve using Boolean Algebra Ans. Y = (A+B)(A+C) = AA +AC +AB + BC = A + AC + AB + BC since A.A = A = A(1+C+B) +BC Since 1+C+B = 1 Y= A+BC Q
Boolean Algebra & Logic Gates. By : Ali Mustafa
Boolean Algebra & Logic Gates By : Ali Mustafa Digital Logic Gates There are three fundamental logical operations, from which all other functions, no matter how complex, can be derived. These Basic functions
More informationEx: Boolean expression for majority function F = A'BC + AB'C + ABC ' + ABC.
Boolean Expression Forms: Sum-of-products (SOP) Write an AND term for each input combination that produces a 1 output. Write the input variable if its value is 1; write its complement otherwise. OR the
More informationBoolean algebra. Examples of these individual laws of Boolean, rules and theorems for Boolean algebra are given in the following table.
The Laws of Boolean Boolean algebra As well as the logic symbols 0 and 1 being used to represent a digital input or output, we can also use them as constants for a permanently Open or Closed circuit or
More informationLogic Design. Chapter 2: Introduction to Logic Circuits
Logic Design Chapter 2: Introduction to Logic Circuits Introduction Logic circuits perform operation on digital signal Digital signal: signal values are restricted to a few discrete values Binary logic
More informationChapter 2: Switching Algebra and Logic Circuits
Chapter 2: Switching Algebra and Logic Circuits Formal Foundation of Digital Design In 1854 George Boole published An investigation into the Laws of Thoughts Algebraic system with two values 0 and 1 Used
More informationChapter 2. Boolean Algebra and Logic Gates
Chapter 2 Boolean Algebra and Logic Gates Basic Definitions A binary operator defined on a set S of elements is a rule that assigns, to each pair of elements from S, a unique element from S. The most common
More informationBinary Logic and Gates. Our objective is to learn how to design digital circuits.
Binary Logic and Gates Introduction Our objective is to learn how to design digital circuits. These circuits use binary systems. Signals in such binary systems may represent only one of 2 possible values
More informationEEE130 Digital Electronics I Lecture #4
EEE130 Digital Electronics I Lecture #4 - Boolean Algebra and Logic Simplification - By Dr. Shahrel A. Suandi Topics to be discussed 4-1 Boolean Operations and Expressions 4-2 Laws and Rules of Boolean
More informationBOOLEAN ALGEBRA THEOREMS
OBJECTIVE Experiment 4 BOOLEAN ALGEBRA THEOREMS The student will be able to do the following: a. Identify the different Boolean Algebra Theorems and its properties. b. Plot circuits and prove De Morgan
More information. T SHREE MAHAPRABHU PUBLIC SCHOOL & COLLEGE NOTES FOR BOARD EXAMINATION SUBJECT COMPUTER SCIENCE (Code: 083) Boolean Algebra
. T SHREE MAHAPRABHU PUBLIC SCHOOL & COLLEGE NOTES FOR BOARD EXAMINATION 2016-17 SUBJECT COMPUTER SCIENCE (Code: 083) Boolean Algebra Introduction to Boolean Algebra Boolean algebra which deals with two-valued
More informationChapter 2: Boolean Algebra and Logic Gates
Chapter 2: Boolean Algebra and Logic Gates Mathematical methods that simplify binary logics or circuits rely primarily on Boolean algebra. Boolean algebra: a set of elements, a set of operators, and a
More information4 Switching Algebra 4.1 Axioms; Signals and Switching Algebra
4 Switching Algebra 4.1 Axioms; Signals and Switching Algebra To design a digital circuit that will perform a required function, it is necessary to manipulate and combine the various input signals in certain
More informationSchool of Computer Science and Electrical Engineering 28/05/01. Digital Circuits. Lecture 14. ENG1030 Electrical Physics and Electronics
Digital Circuits 1 Why are we studying digital So that one day you can design something which is better than the... circuits? 2 Why are we studying digital or something better than the... circuits? 3 Why
More informationCS 121 Digital Logic Design. Chapter 2. Teacher Assistant. Hanin Abdulrahman
CS 121 Digital Logic Design Chapter 2 Teacher Assistant Hanin Abdulrahman 1 2 Outline 2.2 Basic Definitions 2.3 Axiomatic Definition of Boolean Algebra. 2.4 Basic Theorems and Properties 2.5 Boolean Functions
More informationDigital Logic (2) Boolean Algebra
Digital Logic (2) Boolean Algebra Boolean algebra is the mathematics of digital systems. It was developed in 1850 s by George Boole. We will use Boolean algebra to minimize logic expressions. Karnaugh
More informationDigital Logic Design ABC. Representing Logic Operations. Dr. Kenneth Wong. Determining output level from a diagram. Laws of Boolean Algebra
Digital Logic Design ENGG1015 1 st Semester, 2011 Representing Logic Operations Each function can be represented equivalently in 3 ways: Truth table Boolean logic expression Schematics Truth Table Dr.
More informationMC9211 Computer Organization
MC92 Computer Organization Unit : Digital Fundamentals Lesson2 : Boolean Algebra and Simplification (KSB) (MCA) (29-2/ODD) (29 - / A&B) Coverage Lesson2 Introduces the basic postulates of Boolean Algebra
More informationCS 226: Digital Logic Design
CS 226: Digital Logic Design 0 1 1 I S 0 1 0 S Department of Computer Science and Engineering, Indian Institute of Technology Bombay. 1 of 29 Objectives In this lecture we will introduce: 1. Logic functions
More informationCombinational Logic Design/Circuits
3 ` Combinational Logic Design/Circuits Chapter-3(Hours : 12 Marks:24 ) Combinational Logic design / Circuits 3.1 Simplification of Boolean expression using Boolean algebra. 3.2 Construction of logical
More informationBOOLEAN ALGEBRA TRUTH TABLE
BOOLEAN ALGEBRA TRUTH TABLE Truth table is a table which represents all the possible values of logical variables / statements along with all the possible results of the given combinations of values. Eg:
More informationBoolean Algebra. The Building Blocks of Digital Logic Design. Section. Section Overview. Binary Operations and Their Representation.
Section 3 Boolean Algebra The Building Blocks of Digital Logic Design Section Overview Binary Operations (AND, OR, NOT), Basic laws, Proof by Perfect Induction, De Morgan s Theorem, Canonical and Standard
More informationChapter 1: Logic systems
Chapter 1: Logic systems 1: Logic gates Learning Objectives: At the end of this topic you should be able to: identify the symbols and truth tables for the following logic gates: NOT AND NAND OR NOR XOR
More informationLecture 3: Boolean Algebra
Lecture 3: Boolean Algebra Syed M. Mahmud, Ph.D ECE Department Wayne State University Original Source: Prof. Russell Tessier of University of Massachusetts Aby George of Wayne State University Overview
More informationEvery time has a value associated with it, not just some times. A variable can take on any value within a range
Digital Logic Circuits Binary Logic and Gates Logic Simulation Boolean Algebra NAND/NOR and XOR gates Decoder fundamentals Half Adder, Full Adder, Ripple Carry Adder Analog vs Digital Analog Continuous»
More informationBoolean Algebra and Logic Gates
Boolean Algebra and Logic Gates ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C. Fall, 2017 ldvan@cs.nctu.edu.tw http://www.cs.nctu.edu.tw/~ldvan/ Outlines Basic
More informationCombinational Logic. Review of Combinational Logic 1
Combinational Logic! Switches -> Boolean algebra! Representation of Boolean functions! Logic circuit elements - logic gates! Regular logic structures! Timing behavior of combinational logic! HDLs and combinational
More informationSwitches: basic element of physical implementations
Combinational logic Switches Basic logic and truth tables Logic functions Boolean algebra Proofs by re-writing and by perfect induction Winter 200 CSE370 - II - Boolean Algebra Switches: basic element
More informationBinary Logic and Gates
1 COE 202- Digital Logic Binary Logic and Gates Dr. Abdulaziz Y. Barnawi COE Department KFUPM 2 Outline Introduction Boolean Algebra Elements of Boolean Algebra (Binary Logic) Logic Operations & Logic
More informationEECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits)
EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) September 5, 2002 John Wawrzynek Fall 2002 EECS150 Lec4-bool1 Page 1, 9/5 9am Outline Review of
More information2. Associative Law: A binary operator * on a set S is said to be associated whenever (A*B)*C = A*(B*C) for all A,B,C S.
BOOLEAN ALGEBRA 2.1 Introduction Binary logic deals with variables that have two discrete values: 1 for TRUE and 0 for FALSE. A simple switching circuit containing active elements such as a diode and transistor
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 1 Gate Circuits and Boolean Equations Charles Kime & Thomas Kaminski 2008 Pearson Education, Inc. (Hyperlinks are active
More informationOutline. EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) Combinational Logic (CL) Defined
EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) January 30, 2003 John Wawrzynek Outline Review of three representations for combinational logic:
More informationUNIVERSITI TENAGA NASIONAL. College of Information Technology
UNIVERSITI TENAGA NASIONAL College of Information Technology BACHELOR OF COMPUTER SCIENCE (HONS.) FINAL EXAMINATION SEMESTER 2 2012/2013 DIGITAL SYSTEMS DESIGN (CSNB163) January 2013 Time allowed: 3 hours
More informationCombinational Logic Design Principles
Combinational Logic Design Principles Switching algebra Doru Todinca Department of Computers Politehnica University of Timisoara Outline Introduction Switching algebra Axioms of switching algebra Theorems
More informationCombinational Logic. By : Ali Mustafa
Combinational Logic By : Ali Mustafa Contents Adder Subtractor Multiplier Comparator Decoder Encoder Multiplexer How to Analyze any combinational circuit like this? Analysis Procedure To obtain the output
More informationNumber System. Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary
Number System Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary BOOLEAN ALGEBRA BOOLEAN LOGIC OPERATIONS Logical AND Logical OR Logical COMPLEMENTATION
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 3 Additional Gates and Circuits Overview Part 1 Gate Circuits and Boolean Equations Binary Logic and Gates Boolean Algebra
More informationDIGITAL CIRCUIT LOGIC BOOLEAN ALGEBRA
DIGITAL CIRCUIT LOGIC BOOLEAN ALGEBRA 1 Learning Objectives Understand the basic operations and laws of Boolean algebra. Relate these operations and laws to circuits composed of AND gates, OR gates, INVERTERS
More informationChapter 2 Boolean Algebra and Logic Gates
Chapter 2 Boolean Algebra and Logic Gates Huntington Postulates 1. (a) Closure w.r.t. +. (b) Closure w.r.t.. 2. (a) Identity element 0 w.r.t. +. x + 0 = 0 + x = x. (b) Identity element 1 w.r.t.. x 1 =
More informationWEEK 2.1 BOOLEAN ALGEBRA
WEEK 2.1 BOOLEAN ALGEBRA 1 Boolean Algebra Boolean algebra was introduced in 1854 by George Boole and in 1938 was shown by C. E. Shannon to be useful for manipulating Boolean logic functions. The postulates
More informationLogic Gate Level. Part 2
Logic Gate Level Part 2 Constructing Boolean expression from First method: write nonparenthesized OR of ANDs Each AND is a 1 in the result column of the truth table Works best for table with relatively
More informationCombinational Logic Fundamentals
Topic 3: Combinational Logic Fundamentals In this note we will study combinational logic, which is the part of digital logic that uses Boolean algebra. All the concepts presented in combinational logic
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 1 Gate Circuits and Boolean Equations Chapter 2 - Part 1 2 Chapter 2 - Part 1 3 Chapter 2 - Part 1 4 Chapter 2 - Part
More informationChapter 2 Boolean Algebra and Logic Gates
Ch1: Digital Systems and Binary Numbers Ch2: Ch3: Gate-Level Minimization Ch4: Combinational Logic Ch5: Synchronous Sequential Logic Ch6: Registers and Counters Switching Theory & Logic Design Prof. Adnan
More information10/14/2009. Reading: Hambley Chapters
EE40 Lec 14 Digital Signal and Boolean Algebra Prof. Nathan Cheung 10/14/2009 Reading: Hambley Chapters 7.1-7.4 7.4 Slide 1 Analog Signals Analog: signal amplitude is continuous with time. Amplitude Modulated
More informationChapter 2 Boolean Algebra and Logic Gates
Chapter 2 Boolean Algebra and Logic Gates The most common postulates used to formulate various algebraic structures are: 1. Closure. N={1,2,3,4 }, for any a,b N we obtain a unique c N by the operation
More informationCHAPTER 2 BOOLEAN ALGEBRA
CHAPTER 2 BOOLEAN ALGEBRA This chapter in the book includes: Objectives Study Guide 2.1 Introduction 2.2 Basic Operations 2.3 Boolean Expressions and Truth Tables 2.4 Basic Theorems 2.5 Commutative, Associative,
More informationXOR - XNOR Gates. The graphic symbol and truth table of XOR gate is shown in the figure.
XOR - XNOR Gates Lesson Objectives: In addition to AND, OR, NOT, NAND and NOR gates, exclusive-or (XOR) and exclusive-nor (XNOR) gates are also used in the design of digital circuits. These have special
More informationDigital Techniques. Figure 1: Block diagram of digital computer. Processor or Arithmetic logic unit ALU. Control Unit. Storage or memory unit
Digital Techniques 1. Binary System The digital computer is the best example of a digital system. A main characteristic of digital system is its ability to manipulate discrete elements of information.
More informationXI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL.
2017-18 XI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL HALF ADDER 1. The circuit that performs addition within the Arithmetic and Logic Unit of the CPU are called adders. 2. A unit that adds two
More informationUniversity of Technology
University of Technology Lecturer: Dr. Sinan Majid Course Title: microprocessors 4 th year معالجات دقيقة المرحلة الرابعة ھندسة الليزر والبصريات االلكترونية Lecture 3 & 4 Boolean Algebra and Logic Gates
More informationCSC9R6 Computer Design. Practical Digital Logic
CSC9R6 Computer Design Practical Digital Logic 1 References (for this part of CSC9R6) Hamacher et al: Computer Organization App A. In library Floyd: Digital Fundamentals Ch 1, 3-6, 8-10 web page: www.prenhall.com/floyd/
More informationELEC Digital Logic Circuits Fall 2014 Boolean Algebra (Chapter 2)
ELEC 2200-002 Digital Logic Circuits Fall 2014 Boolean Algebra (Chapter 2) Vishwani D. Agrawal James J. Danaher Professor Department of Electrical and Computer Engineering Auburn University, Auburn, AL
More informationIf f = ABC + ABC + A B C then f = AB C + A BC + AB C + A BC + A B C
Examples: If f 5 = AB + AB then f 5 = A B + A B = f 10 If f = ABC + ABC + A B C then f = AB C + A BC + AB C + A BC + A B C In terms of a truth table, if f is the sum (OR) of all the minterms with a 1 in
More informationDigital Circuit And Logic Design I. Lecture 3
Digital Circuit And Logic Design I Lecture 3 Outline Combinational Logic Design Principles (). Introduction 2. Switching algebra 3. Combinational-circuit analysis 4. Combinational-circuit synthesis Panupong
More informationChap 2. Combinational Logic Circuits
Overview 2 Chap 2. Combinational Logic Circuits Spring 24 Part Gate Circuits and Boolean Equations Binary Logic and Gates Boolean Algebra Standard Forms Part 2 Circuit Optimization Two-Level Optimization
More informationBOOLEAN ALGEBRA. Introduction. 1854: Logical algebra was published by George Boole known today as Boolean Algebra
BOOLEAN ALGEBRA Introduction 1854: Logical algebra was published by George Boole known today as Boolean Algebra It s a convenient way and systematic way of expressing and analyzing the operation of logic
More informationECE380 Digital Logic. Axioms of Boolean algebra
ECE380 Digital Logic Introduction to Logic Circuits: Boolean algebra Dr. D. J. Jackson Lecture 3-1 Axioms of Boolean algebra Boolean algebra: based on a set of rules derived from a small number of basic
More informationDigital electronic systems are designed to process voltage signals which change quickly between two levels. Low time.
DIGITL ELECTRONIC SYSTEMS Digital electronic systems are designed to process voltage signals which change quickly between two levels. High Voltage Low time Fig. 1 digital signal LOGIC GTES The TTL digital
More informationCOS 140: Foundations of Computer Science
COS 140: Foundations of Computer Science Boolean Algebra Fall 2018 Introduction 3 Problem................................................................. 3 Boolean algebra...........................................................
More informationPart 5: Digital Circuits
Characteristics of any number system are: Part 5: Digital Circuits 5.: Number Systems & Code Conversions. ase or radix is equal to the number of possible symbols in the system 2. The largest value of digit
More informationDigital Logic. Lecture 5 - Chapter 2. Outline. Other Logic Gates and their uses. Other Logic Operations. CS 2420 Husain Gholoom - lecturer Page 1
Lecture 5 - Chapter 2 Outline Other Logic Gates and their uses Other Logic Operations CS 2420 Husain Gholoom - lecturer Page 1 Digital logic gates CS 2420 Husain Gholoom - lecturer Page 2 Buffer A buffer
More informationNumber System conversions
Number System conversions Number Systems The system used to count discrete units is called number system. There are four systems of arithmetic which are often used in digital electronics. Decimal Number
More informationChapter 2 Combinational logic
Chapter 2 Combinational logic Chapter 2 is very easy. I presume you already took discrete mathemtics. The major part of chapter 2 is boolean algebra. II - Combinational Logic Copyright 24, Gaetano Borriello
More informationUC Berkeley College of Engineering, EECS Department CS61C: Representations of Combinational Logic Circuits
2 Wawrzynek, Garcia 2004 c UCB UC Berkeley College of Engineering, EECS Department CS61C: Representations of Combinational Logic Circuits 1 Introduction Original document by J. Wawrzynek (2003-11-15) Revised
More informationChapter-2 BOOLEAN ALGEBRA
Chapter-2 BOOLEAN ALGEBRA Introduction: An algebra that deals with binary number system is called Boolean Algebra. It is very power in designing logic circuits used by the processor of computer system.
More informationMODULE- 07 : FLUIDICS AND FLUID LOGIC
MODULE- 07 : FLUIDICS AND FLUID LOGIC LECTURE- 26 : INTRODUCTION TO FLUID LOGIC INTRODUCTION Fluidics (also known as Fluidic logic) is the use of a fluid or compressible medium to perform analog or digital
More informationFundamentals of Digital Design
Fundamentals of Digital Design Digital Radiation Measurement and Spectroscopy NE/RHP 537 1 Binary Number System The binary numeral system, or base-2 number system, is a numeral system that represents numeric
More informationCS/COE0447: Computer Organization and Assembly Language
CS/COE0447: Computer Organization and Assembly Language Logic Design Introduction (Brief?) Appendix B: The Basics of Logic Design Dept. of Computer Science Logic design? Digital hardware is implemented
More informationVidyalankar S.E. Sem. III [CMPN] Digital Logic Design and Analysis Prelim Question Paper Solution
. (a) (i) ( B C 5) H (A 2 B D) H S.E. Sem. III [CMPN] Digital Logic Design and Analysis Prelim Question Paper Solution ( B C 5) H (A 2 B D) H = (FFFF 698) H (ii) (2.3) 4 + (22.3) 4 2 2. 3 2. 3 2 3. 2 (2.3)
More informationEC-121 Digital Logic Design
EC-121 Digital Logic Design Lecture 2 [Updated on 02-04-18] Boolean Algebra and Logic Gates Dr Hashim Ali Spring 2018 Department of Computer Science and Engineering HITEC University Taxila!1 Overview What
More informationUnit 2 Boolean Algebra
Unit 2 Boolean Algebra 2.1 Introduction We will use variables like x or y to represent inputs and outputs (I/O) of a switching circuit. Since most switching circuits are 2 state devices (having only 2
More informationLecture 2 Review on Digital Logic (Part 1)
Lecture 2 Review on Digital Logic (Part 1) Xuan Silvia Zhang Washington University in St. Louis http://classes.engineering.wustl.edu/ese461/ Grading Engagement 5% Review Quiz 10% Homework 10% Labs 40%
More informationBOOLEAN ALGEBRA CLASS XII. Presented By : Dinesh Patel PGT CS KV IIT Powai
BOOLEAN ALGEBRA CLASS II Presented By : Dinesh Patel PGT CS KV IIT Powai Introduction Boolean Algebra is a set of rules and regulation which is suitable for Digital Circuits, whose answer is either True
More information1 Boolean Algebra Simplification
cs281: Computer Organization Lab3 Prelab Our objective in this prelab is to lay the groundwork for simplifying boolean expressions in order to minimize the complexity of the resultant digital logic circuit.
More informationChapter 2 : Boolean Algebra and Logic Gates
Chapter 2 : Boolean Algebra and Logic Gates By Electrical Engineering Department College of Engineering King Saud University 1431-1432 2.1. Basic Definitions 2.2. Basic Theorems and Properties of Boolean
More informationII. COMBINATIONAL LOGIC DESIGN. - algebra defined on a set of 2 elements, {0, 1}, with binary operators multiply (AND), add (OR), and invert (NOT):
ENGI 386 Digital Logic II. COMBINATIONAL LOGIC DESIGN Combinational Logic output of digital system is only dependent on current inputs (i.e., no memory) (a) Boolean Algebra - developed by George Boole
More informationUnit 2 Boolean Algebra
Unit 2 Boolean Algebra 1. Developed by George Boole in 1847 2. Applied to the Design of Switching Circuit by Claude Shannon in 1939 Department of Communication Engineering, NCTU 1 2.1 Basic Operations
More informationLecture 22 Chapters 3 Logic Circuits Part 1
Lecture 22 Chapters 3 Logic Circuits Part 1 LC-3 Data Path Revisited How are the components Seen here implemented? 5-2 Computing Layers Problems Algorithms Language Instruction Set Architecture Microarchitecture
More informationBOOLEAN LOGIC. By- Neha Tyagi PGT CS KV 5 Jaipur II Shift, Jaipur Region. Based on CBSE curriculum Class 11. Neha Tyagi, KV 5 Jaipur II Shift
BOOLEAN LOGIC Based on CBSE curriculum Class 11 By- Neha Tyagi PGT CS KV 5 Jaipur II Shift, Jaipur Region Neha Tyagi, KV 5 Jaipur II Shift Introduction Boolean Logic, also known as boolean algebra was
More informationEECS Variable Logic Functions
EECS150 Section 1 Introduction to Combinational Logic Fall 2001 2-Variable Logic Functions There are 16 possible functions of 2 input variables: in general, there are 2**(2**n) functions of n inputs X
More informationLearning Objectives. Boolean Algebra. In this chapter you will learn about:
Ref. Page Slide /78 Learning Objectives In this chapter you will learn about: oolean algebra Fundamental concepts and basic laws of oolean algebra oolean function and minimization Logic gates Logic circuits
More informationCS/COE1541: Introduction to Computer Architecture. Logic Design Review. Sangyeun Cho. Computer Science Department University of Pittsburgh
CS/COE54: Introduction to Computer Architecture Logic Design Review Sangyeun Cho Computer Science Department Logic design? Digital hardware is implemented by way of logic design Digital circuits process
More informationCs302 Quiz for MID TERM Exam Solved
Question # 1 of 10 ( Start time: 01:30:33 PM ) Total Marks: 1 Caveman used a number system that has distinct shapes: 4 5 6 7 Question # 2 of 10 ( Start time: 01:31:25 PM ) Total Marks: 1 TTL based devices
More informationPacket #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics
CSC 224/226 Notes Packet #2: Set Theory & Predicate Calculus Barnes Packet #2: Set Theory & Predicate Calculus Applied Discrete Mathematics Table of Contents Full Adder Information Page 1 Predicate Calculus
More informationSignals and Systems Digital Logic System
Signals and Systems Digital Logic System Prof. Wonhee Kim Chapter 2 Design Process for Combinational Systems Step 1: Represent each of the inputs and outputs in binary Step 1.5: If necessary, break the
More informationLOGIC GATES. Basic Experiment and Design of Electronics. Ho Kyung Kim, Ph.D.
Basic Eperiment and Design of Electronics LOGIC GATES Ho Kyung Kim, Ph.D. hokyung@pusan.ac.kr School of Mechanical Engineering Pusan National University Outline Boolean algebra Logic gates Karnaugh maps
More information211: Computer Architecture Summer 2016
211: Computer Architecture Summer 2016 Liu Liu Topic: Storage Project3 Digital Logic - Storage: Recap - Review: cache hit rate - Project3 - Digital Logic: - truth table => SOP - simplification: Boolean
More informationCHAPTER1: Digital Logic Circuits Combination Circuits
CS224: Computer Organization S.KHABET CHAPTER1: Digital Logic Circuits Combination Circuits 1 PRIMITIVE LOGIC GATES Each of our basic operations can be implemented in hardware using a primitive logic gate.
More informationL2: Combinational Logic Design (Construction and Boolean Algebra)
L2: Combinational Logic Design (Construction and Boolean Algebra) Acknowledgements: Lecture material adapted from Chapter 2 of R. Katz, G. Borriello, Contemporary Logic Design (second edition), Pearson
More informationWeek-I. Combinational Logic & Circuits
Week-I Combinational Logic & Circuits Overview Binary logic operations and gates Switching algebra Algebraic Minimization Standard forms Karnaugh Map Minimization Other logic operators IC families and
More informationCS61c: Representations of Combinational Logic Circuits
CS61c: Representations of Combinational Logic Circuits J. Wawrzynek March 5, 2003 1 Introduction Recall that synchronous systems are composed of two basic types of circuits, combination logic circuits,
More information2009 Spring CS211 Digital Systems & Lab CHAPTER 2: INTRODUCTION TO LOGIC CIRCUITS
CHAPTER 2: INTRODUCTION TO LOGIC CIRCUITS What will we learn? 2 Logic functions and circuits Boolean Algebra Logic gates and Synthesis CAD tools and VHDL Read Section 2.9 and 2.0 Terminology 3 Digital
More informationExperiment 7: Magnitude comparators
Module: Logic Design Lab Name:... University no:.. Group no: Lab Partner Name: Experiment 7: Magnitude comparators Mr. Mohamed El-Saied Objective: Realization of -bit comparator using logic gates. Realization
More informationS C F F F T T F T T S C B F F F F F T F T F F T T T F F T F T T T F T T T
EECS 270, Winter 2017, Lecture 1 Page 1 of 6 Use pencil! Say we live in the rather black and white world where things (variables) are either true (T) or false (F). So if S is Mark is going to the Store
More informationKP/Worksheets: Propositional Logic, Boolean Algebra and Computer Hardware Page 1 of 8
KP/Worksheets: Propositional Logic, Boolean Algebra and Computer Hardware Page 1 of 8 Q1. What is a Proposition? Q2. What are Simple and Compound Propositions? Q3. What is a Connective? Q4. What are Sentential
More informationAdditional Gates COE 202. Digital Logic Design. Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals
Additional Gates COE 202 Digital Logic Design Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals Presentation Outline Additional Gates and Symbols Universality of NAND and NOR gates NAND-NAND
More informationIn Module 3, we have learned about Exclusive OR (XOR) gate. Boolean Expression AB + A B = Y also A B = Y. Logic Gate. Truth table
Module 8 In Module 3, we have learned about Exclusive OR (XOR) gate. Boolean Expression AB + A B = Y also A B = Y Logic Gate Truth table A B Y 0 0 0 0 1 1 1 0 1 1 1 0 In Module 3, we have learned about
More informationBoolean Algebra and Digital Logic 2009, University of Colombo School of Computing
IT 204 Section 3.0 Boolean Algebra and Digital Logic Boolean Algebra 2 Logic Equations to Truth Tables X = A. B + A. B + AB A B X 0 0 0 0 3 Sum of Products The OR operation performed on the products of
More informationLearning Objectives 10/7/2010. CE 411 Digital System Design. Fundamental of Logic Design. Review the basic concepts of logic circuits. Dr.
/7/ CE 4 Digital ystem Design Dr. Arshad Aziz Fundamental of ogic Design earning Objectives Review the basic concepts of logic circuits Variables and functions Boolean algebra Minterms and materms ogic
More information