GATE Exercises on Boolean Logic


 Gervase Merritt
 3 years ago
 Views:
Transcription
1 GATE Exerces on Boolean Logic 1 Abstract Th problem set has questions related to Boolean logic and gates taken from GATE papers over the last twenty years. Teachers can use the problem set for courses tutorials. 1) The Boolean expression(x + )(X + ) + (X)+X simplifies to a) X b) c) X d) X+ 2) The SOP (sum of products) form of a Boolean function (0, 1, 3, 7, ),where inputs are A,B,C,D(A MSB,and D LSB).The equivalent minimed expression of the function a) (B+ C)(A+ C)(A+B)(C+ D) b) (B+ C)(A+ C)(A+ C)(C+ D) c) (B+ C)(A+ C)(A+ C)(C+ D) d) (B+ C)(A+B)(A+ B)(C+D) 3) The Boolean expressionf(x,, Z) = XZ+ X.Z+ XZ+ XZ converted into the canonical product of sum (POS) form a) (X+ + Z)(X+ + Z)(X+ + Z)(X+ + Z)(X+ + Z) b) (X++Z)(X++Z)(X++Z)(X++Z) c) (X+ + Z)(X+ + Z)(X+ + Z) d) (X+ + )(X+ + Z)(X+ + Z) 4) If the functions W, X, and Z are as follows W = R + PQ + RS X = PQR.S + P.Q.R.S + PQ.R.S = RS + PR+ PQ+P.Q Z = R+S + PQ+P.Q.R+ PQ.S a) W= Z, X= Z b) W=Z, X= c) W= d) W== Z 5) The Boolean expression AC+BC equivalent to a) AC+BC b) BC+ AC+BC+ACB c) AC+BC+BC+ABC d) ABC+AB.C+ABC+A.B.C 6) The boolean expression = A.B.CD + ABCD+AB.CD+ ABC.D can be a) = A.B.CD+ ABC+ACD b) = A.B.CD+ BCD+ AB.CD c) = ABCD+ B.CD+ AB.CD d) = ABCD+ B.CD+ ABC.D 7) The Boolean expressionxz + X.Z + XZ+ XZ+XZ cab be simplified to a) XZ+ XZ+ Z b) XZ+ Z+ Z c) X+ Z+ XZ d) X+ Z+ XZ 8) The simplified form of the Boolean expression = (ABC+ D)(AD+ B.C) can be written as a) AD+B.CD b) AD+BCD c) (A+ D)(BC+ D) d) AD+BCD 9) A function of Boolean variables X, and Z expressed in terms of the minterms as F(X,, Z)= (1, 2, 5, 6, 7) Which one of the product of sums given below equal to the function F(X,,Z)? a) (X+ + Z)(X+ + Z)(X+ + Z)
2 b) (X+ + Z)(X+ + Z)(X+ + Z) c) (X+ + Z)(X+ + Z(X+ + Z)(X+ + Z)(X+ + Z) d) (X+ + Z)(X+ + Z)(X+ + Z)(X+ + Z)(X+ + Z) ) For the logic circuit shown in Fig., the required input condition (A,B,C) to make the output (X)=1 A B C C Fig. a) 1, 0, 1 b) 0, 0, 1 c) 1, 1, 1 d) 0, 1, 1 ) For the logic circuit shown in Fig., the simplified Boolean expression for the output A B C Fig. a) A+B+C b) 0 c) 1 d) C 12) If X=1 in logic equation [X+ Z+ (Z+X)]X+ Z(X+ ) = 1, then a) =Z b) = Z c) Z= 1 d) Z= 0 13) The output in the circuit below always 1 when P Q R P Fig. 13 a) two or more of the inputs P,Q,R are 0 b) two or more of the inputs P,Q,R are 1 c) any odd number of the inputs P,Q,R 0 d) any odd number of the inputs P,Q,R 1 14) In the sum of product function f(x,,z)= (2, 3, 4, 5),prime implicants are a) X, X b) X, X.Z, XZ c) XZ, XZ, X d) XZ, XZ, X.Z, XZ 15) The logic function f=(x.) + (X.) same as a) (X+ )(X+ ) b) (X+ )+(X+ ) c) (X).(X.) d) None of the above 16) The minimal product of sums function described by the Kmap given in Fig. a) A.C b) A+C c) A+C d) AC 17) For the circuit shown in Fig., the Boolean expression for the output in terms of inputs P, Q,R and S 2
3 P Q R S AB C x x 0 Fig. 16 Fig. 17 a) P+ Q+R+S b) P+ Q+R+S c) (P+Q)(R+S ) d) (P+Q)(R+S ) 18) The following Karnaugh map represents a function F(X,,Z),minimized form of the function F Z X b) X.+ Z c) X+ Z d) X+ Z 19) The output of the logic circuit given below X Fig. 19 a) 1 b) 0 c) X d) X 20) The Boolean expression AB+AC+BC simplifies to a) BC+AC b) AB+AC+B c) AB+AC d) AB+ BC 21) The output expression for the Karnaugh map shown below CD AB Fig. 21 a) X+ Z Fig. 18 a) BD+ BCD b) BD+AB c) BD+ABC d) BD+ABC 3
4 22) For 3 input logic circuit shown below,the output Z can be expressed as P Q R Fig. 22 a) Q+R b) PQ+R c) Q+R d) P+ Q+R 23) Given f (W, X,, Z) = m(0, 1, 2, 3, 7, 8, )+ d(5, 6,, 15), where d represent don tcare condition in Karnaugh maps.which of the following a minimum productofsum(pos)form of f(x,,z,w)? a) (W+ Z)(X+ Z) b) (W+ Z)(X+ Z) c) (W+ Z)(X+ Z) d) (W+ Z)(X+ Z) 24) The output expression for the Karnaugh map shown below BC A a) A+ B b) A+C c) A+C d) A+C Fig. 24 Z 25) The Boolean expression (a+b+c+d)+(b+c) simplifies to a) 1 b) ab c) ab d) 0 26) f (A, B, C, D) = ΠM(0, 1, 3, 4, 5, 7, 9,, 12, 13, 14, 15) a maxterm representation of a Boolean function f(a,b,c,d) where A the MSB and D the LSB.The equivalent minimized representation of th function a) (A+C+ D)(A+ B+ D) b) ACD+ ABD c) ACD+ABCD d) (B+C+D)(A+B+C+D)(A+B+C+D) 27) Consider the following Sum of Products expression, F. F= ABC+ A.BC+ ABC+ ABC+A.B.C The equivalent Product of Sums expression a) (A+ B+C)(A+ B+C)(A+ B+C) b) (A+ B+C)(A+ B+C)(A+ B+C) c) (A+ B+C)(A+ B+C)(A+ B+C) d) (A+ B+C)(A+ B+C)(A+ B+C) 28) The number of product term in the minimized sumofproduct expression obtained through the following Kmap (where d denote don tcare states) a) 2 b) 3 c) 4 d) 5 29) The minimum sum of products form of the Boolean expression = P.Q.R.S+ PQ.R.S+ PQ.RS+ PQRS + a) PQ+Q.S PQRS + P.Q.RS 4
5 d d equivalent to a) XZ+ X.Z b) X..Z + XZ c) (X+ Z)(+ Z) d) (X+ Z)(+ Z) 33) In the digital circuit given below, F X F Fig. 28 b) PQ+QRS c) PQ+Q.R.S d) Q.S+ PQR 30) A logic circuit implements the Boolean function F= X+ X.Z. It found that the input combination X = = 1 can never occur. Taking th into account, a simplified expression for F, a) X+.Z b) X+ Z c) X+ d) + XZ 31) The logic evaluated by the circuit at the output X Fig. 31 Output a) X+ X b) (X+ )X c) (X)+ X d) X+ X+ X+ 32) The Boolean expression X+ (X+ )Z Z Fig. 33 a) X+ Z b) X+ Z c) X. d) XZ+ 34) For the Boolean expression f = a.b.c + abc+ab.c+abc+abc,the minimized Product of Sum (PoS) expression a) f= (b+c)(a+c) b) f= (b+c)(a+c) c) f= (b+c)(a+c) d) f= c+abc 35) The minimal sumofproducts expression for the logic function f represented by the given Karnaugh map a) QS+ PRS+ PQR+PRS+ PQR b) QS+ PRS+ P.QR+PR.S+ PQR c) PRS + P.Q.R d) PRS+ PQR+PRS+ PQR 36) The expression A+AB equivalent to a) A+ B b) A+ B c) AB+A d) AB 37) The simplest form of the Boolean expression ABC.D+ABCD+ABCD+ABCD 5
6 PQ RS Fig. 35 a) AD b) BC c) AB d) AB 38) The Karnaugh map for a four variable Boolean function given in Fig. PQ RS Boolean variables x, y, z and w, x+y+z=1 xy=0 xz+w=1 xy+z.w=0 have following solution for x,y,z and w,respectively: a) 00 b) c) d) 00 40) If P, Q, R are Boolean variables, then (P+ Q)(PQ+PR)(P.R+ Q) Simplifies to a) PQ b) PR c) PQ+R d) PR+ Q 41) Which functions does NOT implement the Karnaugh map given below? a) (w+ x)y b) xy+yw c) (w+ x)(w+y)(x+y) d) Noneo f theabove WZ X 00 0 x 0 0 Fig. 38 a) PQRS+ QS b) PQRS+ QS c) PQR+QS d) PQRS+ Q 39) The simultaneous equations on the 6 0 x x 0 0 Fig. 41
7 42) Given the following Karnaugh map, which one of the following represents the minimal SumOfProducts of the map? WX Z 00 0 x 0 x x 1 x 1 0 x x 0 Fig. 42 a) X+ Z b) WX.+ X+ XZ c) WX+ Z+X d) XZ+ 43) Minimum sum of product expression for f(w,x,y,z) shown in Karnaughmap below wx yz a) XZ+ Z x x x 1 Fig. 43 b) XZ+ ZX c) X+ ZX d) None of the above 44) The minterm expansion of f (P, Q, R) = PQ+QR+ PR a) m 2 + m 4 + m 6 + m 7 b) m 0 + m 1 + m 3 + m 5 c) m 0 + m 1 + m 6 + m 7 d) m 2 + m 3 + m 4 + m 5 45) In the Karnaugh map shown below, X denotes a don t care term. What the minimal form of the function represented by the Karnaugh map? ab cd x x 1 1 x Fig. 45 a) b.d+a.d b) a.b+b.d+abd c) b.d+abd d) a.b+b.d+a.d 46) The simplified SOP (Sum of Product) form of the Boolean expression (P+Q+R)(P+Q+R)(P+ Q+R) a) PQ+R b) P+ Q.R c) PQ+R d) PQ+R 47) Which one of the following gives the 7
8 simplified sum of products expression for the Boolean function F= m 0 + m 2 + m 3 + m 5, where m 0, m 2, m 3 and m 5 are minterms corresponding to the input A, B and C, with A as MSB and C as the LSB. a) ĀB+Ā B C+ A BC b) Ā C+ĀB+ A BC c) Ā C+A B+ A BC d) ĀBC+Ā C+A BC 48) What the minimal form of the Karnaugh map shown below? Assume that X denotes a don t care term. a) b.d b) b.d+b.c c) b.d+ab.cd d) b.d+b.c+c.d 50) The truth table represents the Boolean function X f(x,) a) X b) X+ c) X d) ab cd 00 1 x x 1 x 1 1 x Fig ) Consider the Boolean function,f(w, X,, Z) = W + X + WXZ+ W X+ XZ+ XȲ Z. Which of the following the complete set of essential prime implicants? a) W,, XZ, X Z b) W,, XZ c), XȲ Z d), XZ, X Z 8
ENGINEERS ACADEMY. 7. Given Boolean theorem. (a) A B A C B C A B A C. (b) AB AC BC AB BC. (c) AB AC BC A B A C B C.
Digital Electronics Boolean Function QUESTION BANK. The Boolean equation Y = C + C + C can be simplified to (a) (c) A (B + C) (b) AC (d) C. The Boolean equation Y = (A + B) (A + B) can be simplified to
More informationGate Level Minimization
Gate Level Minimization By Dr. M. Hebaishy Digital Logic Design Ch Simplifying Boolean Equations Example : Y = AB + AB Example 2: = B (A + A) T8 = B () T5 = B T Y = A(AB + ABC) = A (AB ( + C ) ) T8 =
More informationCMPE223/CMSE222 Digital Logic
CMPE223/CMSE222 Digital Logic Optimized Implementation of Logic Functions: Strategy for Minimization, Minimum ProductofSums Forms, Incompletely Specified Functions Terminology For a given term, each
More informationChapter 3 Simplification of Boolean functions
3.1 Introduction Chapter 3 Simplification of Boolean functions In this chapter, we are going to discuss several methods for simplifying the Boolean function. What is the need for simplifying the Boolean
More informationCSCI 220: Computer Architecture I Instructor: Pranava K. Jha. Simplification of Boolean Functions using a Karnaugh Map
CSCI 22: Computer Architecture I Instructor: Pranava K. Jha Simplification of Boolean Functions using a Karnaugh Map Q.. Plot the following Boolean function on a Karnaugh map: f(a, b, c, d) = m(, 2, 4,
More informationGate Level Minimization Map Method
Gate Level Minimization Map Method Complexity of hardware implementation is directly related to the complexity of the algebraic expression Truth table representation of a function is unique Algebraically
More informationECE380 Digital Logic
ECE38 Digital Logic Optimized Implementation of Logic Functions: Strategy for Minimization, Minimum ProductofSums Forms, Incompletely Specified Functions Dr. D. J. Jackson Lecture 8 Terminology For
More informationBOOLEAN ALGEBRA. 1. State & Verify Laws by using :
BOOLEAN ALGEBRA. State & Verify Laws by using :. State and algebraically verify Absorption Laws. (2) Absorption law states that (i) X + XY = X and (ii) X(X + Y) = X (i) X + XY = X LHS = X + XY = X( + Y)
More informationDKT 122/3 DIGITAL SYSTEM 1
Company LOGO DKT 122/3 DIGITAL SYSTEM 1 BOOLEAN ALGEBRA (PART 2) Boolean Algebra Contents Boolean Operations & Expression Laws & Rules of Boolean algebra DeMorgan s Theorems Boolean analysis of logic circuits
More informationPhiladelphia University Faculty of Information Technology Department of Computer Science. Computer Logic Design. By Dareen Hamoudeh.
Philadelphia University Faculty of Information Technology Department of Computer Science Computer Logic Design By Dareen Hamoudeh Dareen Hamoudeh 1 Canonical Forms (Standard Forms of Expression) Minterms
More informationGateLevel Minimization
GateLevel Minimization ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C. Fall, 2011 ldvan@cs.nctu.edu.tw http://www.cs.nctu.edu.tw/~ldvan/ Outlines The Map Method
More informationGateLevel Minimization
MEC520 디지털공학 GateLevel Minimization JeeHwan Ryu School of Mechanical Engineering GateLevel MinimizationThe Map Method Truth table is unique Many different algebraic expression Boolean expressions may
More informationA B AB CD Objectives:
Objectives:. Four variables maps. 2. Simplification using prime implicants. 3. "on t care" conditions. 4. Summary.. Four variables Karnaugh maps Minterms A A m m m3 m2 A B C m4 C A B C m2 m8 C C m5 C m3
More informationIT 201 Digital System Design Module II Notes
IT 201 Digital System Design Module II Notes BOOLEAN OPERATIONS AND EXPRESSIONS Variable, complement, and literal are terms used in Boolean algebra. A variable is a symbol used to represent a logical quantity.
More informationChapter 2 Boolean algebra and Logic Gates
Chapter 2 Boolean algebra and Logic Gates 2. Introduction In working with logic relations in digital form, we need a set of rules for symbolic manipulation which will enable us to simplify complex expressions
More informationNODIA AND COMPANY. GATE SOLVED PAPER Computer Science Engineering Digital Logic. Copyright By NODIA & COMPANY
No part of this publication may be reproduced or distributed in any form or any means, electronic, mechanical, photocopying, or otherwise without the prior permission of the author. GATE SOLVED PAPER Computer
More informationGateLevel Minimization
GateLevel Minimization ( 范倫達 ), 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 The Map Method
More informationDr. S. Shirani COE2DI4 Midterm Test #1 Oct. 14, 2010
Dr. S. Shirani COE2DI4 Midterm Test #1 Oct. 14, 2010 Instructions: This examination paper includes 9 pages and 20 multiplechoice questions starting on page 3. You are responsible for ensuring that your
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 2 Circuit Optimization Overview Part Gate Circuits and Boolean Equations Binary Logic and Gates Boolean Algebra Standard
More informationExperiment 3: Logic Simplification
Module: Logic Design Name:... University no:.. Group no:. Lab Partner Name: Mr. Mohamed ElSaied Experiment : Logic Simplification Objective: How to implement and verify the operation of the logical functions
More informationSpecifying logic functions
CSE4: Components and Design Techniques for Digital Systems Specifying logic functions Instructor: Mohsen Imani Slides from: Prof.Tajana Simunic and Dr.Pietro Mercati We have seen various concepts: Last
More informationCombinational Logic Circuits
Chapter 3 Combinational Logic Circuits 12 Hours 24 Marks 3.1 Standard representation for logical functions Boolean expressions / logic expressions / logical functions are expressed in terms of logical
More informationX Y Z F=X+Y+Z
This circuit is used to obtain the compliment of a value. If X = 0, then X = 1. The truth table for NOT gate is : X X 0 1 1 0 2. OR gate : The OR gate has two or more input signals but only one output
More informationDigital Logic Design. Outline
Digital Logic Design GateLevel Minimization CSE32 Fall 2 Outline The Map Method 2,3,4 variable maps 5 and 6 variable maps (very briefly) Product of sums simplification Don t Care conditions NAND and NOR
More informationUnitIV Boolean Algebra
UnitIV Boolean Algebra Boolean Algebra Chapter: 08 Truth table: Truth table is a table, which represents all the possible values of logical variables/statements along with all the possible results of
More informationChapter 3. GateLevel Minimization. Outlines
Chapter 3 GateLevel Minimization Introduction The Map Method FourVariable Map FiveVariable Map Outlines Product of Sums Simplification Don tcare Conditions NAND and NOR Implementation Other TwoLevel
More informationGraduate Institute of Electronics Engineering, NTU. CH5 Karnaugh Maps. Lecturer: 吳安宇教授 Date:2006/10/20 ACCESS IC LAB
CH5 Karnaugh Maps Lecturer: 吳安宇教授 Date:2006/0/20 CCESS IC L Problems in lgebraic Simplification The procedures are difficult to apply in a systematic way. It is difficult to tell when you have arrived
More informationAssignment (36) Boolean Algebra and Logic Simplification  General Questions
Assignment (36) Boolean Algebra and Logic Simplification  General Questions 1. Convert the following SOP expression to an equivalent POS expression. 2. Determine the values of A, B, C, and D that make
More informationComputer Organization
Computer Organization (Logic circuits design and minimization) KR Chowdhary Professor & Head Email: kr.chowdhary@gmail.com webpage: krchowdhary.com Department of Computer Science and Engineering MBM Engineering
More informationStandard Forms of Expression. Minterms and Maxterms
Standard Forms of Expression Minterms and Maxterms Standard forms of expressions We can write expressions in many ways, but some ways are more useful than others A sum of products (SOP) expression contains:
More information1. Mark the correct statement(s)
1. Mark the correct statement(s) 1.1 A theorem in Boolean algebra: a) Can easily be proved by e.g. logic induction b) Is a logical statement that is assumed to be true, c) Can be contradicted by another
More informationDigital Design. Chapter 4. Principles Of. Simplification of Boolean Functions
Principles Of Digital Design Chapter 4 Simplification of Boolean Functions Karnaugh Maps Don t Care Conditions Technology Mapping Optimization, Conversions, Decomposing, Retiming Boolean Cubes for n =,
More informationChapter 2 Combinational
Computer Engineering 1 (ECE290) Chapter 2 Combinational Logic Circuits Part 2 Circuit Optimization HOANG Trang 2008 Pearson Education, Inc. Overview Part 1 Gate Circuits and Boolean Equations Binary Logic
More informationUNIT4 BOOLEAN LOGIC. NOT Operator Operates on single variable. It gives the complement value of variable.
UNIT4 BOOLEAN LOGIC Boolean algebra is an algebra that deals with Boolean values((true and FALSE). Everyday we have to make logic decisions: Should I carry the book or not?, Should I watch TV or not?
More informationSwitching Circuits & Logic Design
Switching Circuits & Logic Design JieHong Roland Jiang 江介宏 Department of Electrical Engineering National Taiwan University Fall 23 5 Karnaugh Maps Kmap Walks and Gray Codes http://asicdigitaldesign.wordpress.com/28/9/26/kmapswalksandgraycodes/
More informationCHAPTER2 STRUCTURE OF BOOLEAN FUNCTION USING GATES, KMap and QuineMcCluskey
CHAPTER2 STRUCTURE OF BOOLEAN FUNCTION USING GATES, KMap and QuineMcCluskey 2. Introduction Logic gates are connected together to produce a specified output for certain specified combinations of input
More informationSwitching Theory & Logic Design/Digital Logic Design Question Bank
Switching Theory & Logic Design/Digital Logic Design Question Bank UNIT I NUMBER SYSTEMS AND CODES 1. A 12bit Hamming code word containing 8bits of data and 4 parity bits is read from memory. What was
More information2.1 Binary Logic and Gates
1 EED2003 Digital Design Presentation 2: Boolean Algebra Asst. Prof.Dr. Ahmet ÖZKURT Asst. Prof.Dr Hakkı T. YALAZAN Based on the Lecture Notes by Jaeyoung Choi choi@comp.ssu.ac.kr Fall 2000 2.1 Binary
More informationCode No: R Set No. 1
Code No: R059210504 Set No. 1 II B.Tech I Semester Supplementary Examinations, February 2007 DIGITAL LOGIC DESIGN ( Common to Computer Science & Engineering, Information Technology and Computer Science
More informationR.M.D. ENGINEERING COLLEGE R.S.M. Nagar, Kavaraipettai
L T P C R.M.D. ENGINEERING COLLEGE R.S.M. Nagar, Kavaraipettai 601206 DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING EC8392 UNIT  I 3 0 0 3 OBJECTIVES: To present the Digital fundamentals, Boolean
More informationQUESTION BANK FOR TEST
CSCI 2121 Computer Organization and Assembly Language PRACTICE QUESTION BANK FOR TEST 1 Note: This represents a sample set. Please study all the topics from the lecture notes. Question 1. Multiple Choice
More information2008 The McGrawHill Companies, Inc. All rights reserved.
28 The McGrawHill Companies, Inc. All rights reserved. 28 The McGrawHill Companies, Inc. All rights reserved. All or Nothing Gate Boolean Expression: A B = Y Truth Table (ee next slide) or AB = Y 28
More informationSWITCHING THEORY AND LOGIC CIRCUITS
SWITCHING THEORY AND LOGIC CIRCUITS COURSE OBJECTIVES. To understand the concepts and techniques associated with the number systems and codes 2. To understand the simplification methods (Boolean algebra
More informationCombinational Logic Circuits
Chapter 2 Combinational Logic Circuits J.J. Shann (Slightly trimmed by C.P. Chung) Chapter Overview 21 Binary Logic and Gates 22 Boolean Algebra 23 Standard Forms 24 TwoLevel Circuit Optimization
More informationModule 7. Karnaugh Maps
1 Module 7 Karnaugh Maps 1. Introduction 2. Canonical and Standard forms 2.1 Minterms 2.2 Maxterms 2.3 Canonical Sum of Product or SumofMinterms (SOM) 2.4 Canonical product of sum or ProductofMaxterms(POM)
More informationKarnaugh Map (KMap) Karnaugh Map. Karnaugh Map Examples. Ch. 2.4 Ch. 2.5 Simplification using Kmap
Karnaugh Map (KMap) Ch. 2.4 Ch. 2.5 Simplification using Kmap A graphical map method to simplify Boolean function up to 6 variables A diagram made up of squares Each square represents one minterm (or
More informationSimplification of Boolean Functions
Simplification of Boolean Functions Contents: Why simplification? The Map Method Two, Three, Four and Five variable Maps. Simplification of two, three, four and five variable Boolean function by Map method.
More informationComputer Science. Unit4: Introduction to Boolean Algebra
Unit4: Introduction to Boolean Algebra Learning Objective At the end of the chapter students will: Learn Fundamental concepts and basic laws of Boolean algebra. Learn about Boolean expression and will
More information數位系統 Digital Systems 朝陽科技大學資工系. Speaker: FuwYi Yang 楊伏夷. 伏夷非征番, 道德經察政章 (Chapter 58) 伏者潛藏也道紀章 (Chapter 14) 道無形象, 視之不可見者曰夷
數位系統 Digital Systems Department of Computer Science and Information Engineering, Chaoyang University of Technology 朝陽科技大學資工系 Speaker: FuwYi Yang 楊伏夷 伏夷非征番, 道德經察政章 (Chapter 58) 伏者潛藏也道紀章 (Chapter 14) 道無形象,
More informationDigital Logic Design (CEN120) (3+1)
Digital Logic Design (CEN120) (3+1) ASSISTANT PROFESSOR Engr. Syed Rizwan Ali, MS(CAAD)UK, PDG(CS)UK, PGD(PM)IR, BS(CE)PK HEC Certified Master Trainer (MTFPDP) PEC Certified Professional Engineer (COM/2531)
More information2.6 BOOLEAN FUNCTIONS
2.6 BOOLEAN FUNCTIONS Binary variables have two values, either 0 or 1. A Boolean function is an expression formed with binary variables, the two binary operators AND and OR, one unary operator NOT, parentheses
More informationSIDDHARTH GROUP OF INSTITUTIONS :: PUTTUR Siddharth Nagar, Narayanavanam Road QUESTION BANK (DESCRIPTIVE)
SIDDHARTH GROUP OF INSTITUTIONS :: PUTTUR Siddharth Nagar, Narayanavanam Road 517583 QUESTION BANK (DESCRIPTIVE) Subject with Code : STLD(16EC402) Year & Sem: IIB.Tech & ISem Course & Branch: B.Tech
More informationB.Tech II Year I Semester (R13) Regular Examinations December 2014 DIGITAL LOGIC DESIGN
B.Tech II Year I Semester () Regular Examinations December 2014 (Common to IT and CSE) (a) If 1010 2 + 10 2 = X 10, then X is  Write the first 9 decimal digits in base 3. (c) What is meant by don
More informationCS6201DIGITAL PRINCIPLE AND SYSTEM DESIGN I YEAR/II SEM PARTB UNITI BOOLEAN ALGEBRA AND LOGIC GATES.
CS6201DIGITAL PRINCIPLE AND SYSTEM DESIGN I YEAR/II SEM PARTB UNITI BOOLEAN ALGEBRA AND LOGIC GATES. 1) Simplify the boolean function using tabulation method. F = (0, 1, 2, 8, 10, 11, 14, 15) List all
More informationCh. 5 : Boolean Algebra &
Ch. 5 : Boolean Algebra & Reduction elektronik@fisika.ui.ac.id Objectives Should able to: Write Boolean equations for combinational logic applications. Utilize Boolean algebra laws and rules for simplifying
More informationUNIT II. Circuit minimization
UNIT II Circuit minimization The complexity of the digital logic gates that implement a Boolean function is directly related to the complexity of the algebraic expression from which the function is implemented.
More informationDigital Logic Lecture 7 Gate Level Minimization
Digital Logic Lecture 7 Gate Level Minimization By Ghada AlMashaqbeh The Hashemite University Computer Engineering Department Outline Introduction. Kmap principles. Simplification using Kmaps. Don tcare
More informationCode No: R Set No. 1
Code No: R059210504 Set No. 1 II B.Tech I Semester Regular Examinations, November 2006 DIGITAL LOGIC DESIGN ( Common to Computer Science & Engineering, Information Technology and Computer Science & Systems
More informationCode No: R Set No. 1
Code No: R059210504 Set No. 1 II B.Tech I Semester Regular Examinations, November 2007 DIGITAL LOGIC DESIGN ( Common to Computer Science & Engineering, Information Technology and Computer Science & Systems
More informationELCT201: DIGITAL LOGIC DESIGN
ELCT201: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 3 Following the slides of Dr. Ahmed H. Madian محرم 1439 ه Winter
More informationELCT201: DIGITAL LOGIC DESIGN
ELCT201: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 3 Following the slides of Dr. Ahmed H. Madian ذو الحجة 1438 ه Winter
More informationLSN 4 Boolean Algebra & Logic Simplification. ECT 224 Digital Computer Fundamentals. Department of Engineering Technology
LSN 4 Boolean Algebra & Logic Simplification Department of Engineering Technology LSN 4 Key Terms Variable: a symbol used to represent a logic quantity Compliment: the inverse of a variable Literal: a
More informationExperiment 4 Boolean Functions Implementation
Experiment 4 Boolean Functions Implementation Introduction: Generally you will find that the basic logic functions AND, OR, NAND, NOR, and NOT are not sufficient to implement complex digital logic functions.
More informationSimplification of Boolean Functions
COM111 Introduction to Computer Engineering (Fall 20062007) NOTES 5  page 1 of 5 Introduction Simplification of Boolean Functions You already know one method for simplifying Boolean expressions: Boolean
More informationDate Performed: Marks Obtained: /10. Group Members (ID):. Experiment # 04. Boolean Expression Simplification and Implementation
Name: Instructor: Engr. Date Performed: Marks Obtained: /10 Group Members (ID):. Checked By: Date: Experiment # 04 Boolean Expression Simplification and Implementation OBJECTIVES: To understand the utilization
More information10EC33: DIGITAL ELECTRONICS QUESTION BANK
10EC33: DIGITAL ELECTRONICS Faculty: Dr.Bajarangbali E Examination QuestionS QUESTION BANK 1. Discuss canonical & standard forms of Boolean functions with an example. 2. Convert the following Boolean function
More informationLiteral Cost F = BD + A B C + A C D F = BD + A B C + A BD + AB C F = (A + B)(A + D)(B + C + D )( B + C + D) L = 10
Circuit Optimization Goal: To obtain the simplest implementation for a given function Optimization is a more formal approach to simplification that is performed using a specific procedure or algorithm
More informationSEE1223: Digital Electronics
SEE223: Digital Electronics 3 Combinational Logic Design Zulkifil Md Yusof Dept. of Microelectronics and Computer Engineering The aculty of Electrical Engineering Universiti Teknologi Malaysia Karnaugh
More informationCode No: 07A3EC03 Set No. 1
Code No: 07A3EC03 Set No. 1 II B.Tech I Semester Regular Examinations, November 2008 SWITCHING THEORY AND LOGIC DESIGN ( Common to Electrical & Electronic Engineering, Electronics & Instrumentation Engineering,
More informationCS8803: Advanced Digital Design for Embedded Hardware
CS883: Advanced Digital Design for Embedded Hardware Lecture 2: Boolean Algebra, Gate Network, and Combinational Blocks Instructor: Sung Kyu Lim (limsk@ece.gatech.edu) Website: http://users.ece.gatech.edu/limsk/course/cs883
More informationCombinational Logic Circuits Part III Theoretical Foundations
Combinational Logic Circuits Part III Theoretical Foundations Overview Simplifying Boolean Functions Algebraic Manipulation Karnaugh Map Manipulation (simplifying functions of 2, 3, 4 variables) Systematic
More informationLarger Kmaps. So far we have only discussed 2 and 3variable Kmaps. We can now create a 4variable map in the
EET 3 Chapter 3 7/3/2 PAGE  23 Larger Kmaps The variable Kmap So ar we have only discussed 2 and 3variable Kmaps. We can now create a variable map in the same way that we created the 3variable
More informationLOGIC CIRCUITS. Kirti P_Didital Design 1
LOGIC CIRCUITS Kirti P_Didital Design 1 Introduction The digital system consists of two types of circuits, namely (i) Combinational circuits and (ii) Sequential circuit A combinational circuit consists
More informationSwitching Theory And Logic Design UNITII GATE LEVEL MINIMIZATION
Switching Theory And Logic Design UNITII GATE LEVEL MINIMIZATION Twovariable kmap: A twovariable kmap can have 2 2 =4 possible combinations of the input variables A and B. Each of these combinations,
More informationPoints Addressed in this Lecture. Standard form of Boolean Expressions. Lecture 4: Logic Simplication & Karnaugh Map
Points Addressed in this Lecture Lecture 4: Logic Simplication & Karnaugh Map Professor Peter Cheung Department of EEE, Imperial College London Standard form of Boolean Expressions SumofProducts (SOP),
More informationLecture 4: Implementation AND, OR, NOT Gates and Complement
EE210: Switching Systems Lecture 4: Implementation AND, OR, NOT Gates and Complement Prof. YingLi Tian Feb. 13, 2018 Department of Electrical Engineering The City College of New York The City University
More informationINDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR Stamp / Signature of the Invigilator
INDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR Stamp / Signature of the Invigilator EXAMINATION ( Mid Semester ) SEMESTER ( Spring ) Roll Number Section Name Subject Number C S 2 1 0 0 2 Subject Name Switching
More informationGateLevel Minimization. BME208 Logic Circuits Yalçın İŞLER
GateLevel Minimization BME28 Logic Circuits Yalçın İŞLER islerya@yahoo.com http://me.islerya.com Complexity of Digital Circuits Directly related to the complexity of the algebraic expression we use to
More informationIntroduction to Computer Architecture
Boolean Operators The Boolean operators AND and OR are binary infix operators (that is, they take two arguments, and the operator appears between them.) A AND B D OR E We will form Boolean Functions of
More informationCS470: Computer Architecture. AMD Quad Core
CS470: Computer Architecture Yashwant K. Malaiya, Professor malaiya@cs.colostate.edu AMD Quad Core 1 Architecture Layers Building blocks Gates, flipflops Functional bocks: Combinational, Sequential Instruction
More informationLecture 5. Chapter 2: Sections 47
Lecture 5 Chapter 2: Sections 47 Outline Boolean Functions What are Canonical Forms? Minterms and Maxterms Index Representation of Minterms and Maxterms SumofMinterm (SOM) Representations ProductofMaxterm
More informationTo write Boolean functions in their standard Min and Max terms format. To simplify Boolean expressions using Karnaugh Map.
3.1 Objectives To write Boolean functions in their standard Min and Max terms format. To simplify Boolean expressions using. 3.2 Sum of Products & Product of Sums Any Boolean expression can be simplified
More informationBHARATHIDASAN ENGINEERING COLLEGE Degree / Branch : B.E./ECE Year / Sem : II/ III Sub.Code / Name : EC6302/DIGITAL ELECTRONICS
BHARATHIDASAN ENGINEERING COLLEGE Degree / Branch : B.E./ECE Year / Sem : II/ III Sub.Code / Name : EC6302/DIGITAL ELECTRONICS FREQUENTLY ASKED QUESTIONS UNIT I MINIMIZATION TECHNIQUES AND LOGIC GATES
More informationSynthesis 1. 1 Figures in this chapter taken from S. H. Gerez, Algorithms for VLSI Design Automation, Wiley, Typeset by FoilTEX 1
Synthesis 1 1 Figures in this chapter taken from S. H. Gerez, Algorithms for VLSI Design Automation, Wiley, 1998. Typeset by FoilTEX 1 Introduction Logic synthesis is automatic generation of circuitry
More informationOutcomes. Unit 9. Logic Function Synthesis KARNAUGH MAPS. Implementing Combinational Functions with Karnaugh Maps
.. Outcomes Unit I can use Karnaugh maps to synthesize combinational functions with several outputs I can determine the appropriate size and contents of a memory to implement any logic function (i.e. truth
More informationDHANALAKSHMI SRINIVASAN COLLEGE OF ENGINEERING AND TECHNOLOGY
DHANALAKSHMI SRINIVASAN COLLEGE OF ENGINEERING AND TECHNOLOGY Dept/Sem: II CSE/03 DEPARTMENT OF ECE CS8351 DIGITAL PRINCIPLES AND SYSTEM DESIGN UNIT I BOOLEAN ALGEBRA AND LOGIC GATES PART A 1. How many
More informationLecture 22: Implementing Combinational Logic
8 Lecture 22: Implementing ombinational Logic S 5 L22 James. Hoe Dept of EE, MU April 9, 25 Today s Goal: Design some combinational logic circuits Announcements: Read Rizzoni 2.4 and 2.5 HW 8 due today
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 2 Circuit Optimization Charles Kime & Thomas Kaminski 2008 Pearson Education, Inc. (Hyperlinks are active in View Show
More informationDIGITAL CIRCUIT LOGIC UNIT 5: KARNAUGH MAPS (KMAPS)
DIGITAL CIRCUIT LOGIC UNIT 5: KARNAUGH MAPS (KMAPS) 1 Learning Objectives 1. Given a function (completely or incompletely specified) of three to five variables, plot it on a Karnaugh map. The function
More informationGet Free notes at ModuleI One s Complement: Complement all the bits.i.e. makes all 1s as 0s and all 0s as 1s Two s Complement: One s complement+1 SIGNED BINARY NUMBERS Positive integers (including zero)
More informationSECTION A / 1. Any point where graph of linear equation in two variables cuts xaxis is of the form. (a) (x, y) (b) (0, y) (c) (x, 0) (d) (y, x)
SECTION A / Question numbers 1 to 8 carry 1 mark each. For each question, four alternative choices have been provided, of which only one is correct. You have to select the correct choice. 1 8 1 1. Any
More informationBawar Abid Abdalla. Assistant Lecturer Software Engineering Department Koya University
Logic Design First Stage Lecture No.6 Boolean Algebra Bawar Abid Abdalla Assistant Lecturer Software Engineering Department Koya University Outlines Boolean Operations Laws of Boolean Algebra Rules of
More informationBinary logic. Dr.AbuArqoub
Binary logic Binary logic deals with variables like (a, b, c,, x, y) that take on two discrete values (, ) and with operations that assume logic meaning ( AND, OR, NOT) Truth table is a table of all possible
More informationChapter 2. Boolean Expressions:
Chapter 2 Boolean Expressions: A Boolean expression or a function is an expression which consists of binary variables joined by the Boolean connectives AND and OR along with NOT operation. Any Boolean
More informationKarnaugh Maps. Kiril Solovey. TelAviv University, Israel. April 8, Kiril Solovey (TAU) Karnaugh Maps April 8, / 22
Karnaugh Maps Kiril Solovey TelAviv University, Israel April 8, 2013 Kiril Solovey (TAU) Karnaugh Maps April 8, 2013 1 / 22 Reminder: Canonical Representation Sum of Products Function described for the
More informationMidTerm Exam Solutions
CS/EE 26 Digital Computers: Organization and Logical Design MidTerm Eam Solutions Jon Turner 3/3/3. (6 points) List all the minterms for the epression (B + A)C + AC + BC. Epanding the epression gives
More informationQuineMcCluskey Algorithm
QuineMcCluskey Algorithm Useful for minimizing equations with more than 4 inputs. Like Kmap, also uses combining theorem Allows for automation Chapter Edward McCluskey (9906) Pioneer in Electrical
More information4 KARNAUGH MAP MINIMIZATION
4 KARNAUGH MAP MINIMIZATION A Karnaugh map provides a systematic method for simplifying Boolean expressions and, if properly used, will produce the simplest SOP or POS expression possible, known as the
More informationVALLIAMMAI ENGINEERING COLLEGE. SRM Nagar, Kattankulathur DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING EC6302 DIGITAL ELECTRONICS
VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur603 203 DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING EC6302 DIGITAL ELECTRONICS YEAR / SEMESTER: II / III ACADEMIC YEAR: 20152016 (ODD
More informationMcGILL UNIVERSITY Electrical and Computer Engineering Department MIDTERM EXAM
McGILL UNIVERSITY Electrical and Computer Engineering Department ECSE323 DIGITAL SYSTEM DESIGN MIDTERM EXAM Winter 2010 Question Maximum Points Points Attained 1 15 2 10 3 10 4 15 5 20 6 5 Total 75 Please
More information