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.

Size: px
Start display at page:

Download "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."

Transcription

1 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 (a) A B (c) A + B (b) (d) 3. The K-map for a Boolean function is shown in figure. The number of essential prime implicants of this function is CD (a) 4 (b) 5 (c) 6 (d) 8 4. The function shown in the figure when simplified will yield a result with CD (a) terms (c) 7 terms (b) 4 terms (d) 6 terms 5. The minimized form of the logical expression C C C C is 6. A bulb is controlled by two switches A and B. The bulb glows only when either switch A or switch B is ON. Its Boolean expression is (a) (b) (c) 7. Given Boolean theorem (d) A + B AC BC AC Which one of following identifies is true (a) A BA CB C A BA C (b) AC BC BC (c) AC BC A BA CB C (d) A BA CB C AC 8. What is dual of X XY X Y (a) X Y XY (b) X XY XY (c) XX Y XY (d) X XYZ XYZ XYZ 9. What is dual of A + [B (A + C)] + D (a) A + [(B(A + C)] + C (b) A [B + AC] D (c) A + [B(A + C)] D (d) A [B (A + C)] D. With 4 Boolean variables, how many Boolean expressions can be formed? (a) 6 (b) 56 (c) 4 (K) (d) 64 K (64 4). The number of Boolean functions that can be generated by n variables, is equal to (a) AC BC (b) AC BC (c) AC BC (d) AC BC (a) n (c) n (b) n (d) n # -, Ram Nagar, Bambala Puliya Ph.: ,

2 Boolean Function ECE. For the product-of sums expression L = (X + Y) X Z, the equivalent sum-of-products expression will be (a) XY XZ (b) XY XZ (c) XY XZ (d) XY XZ 3. What is the minimum of NAND gates required to implement A C? (a) (b) (c) 4 (d) 7 4. Match List-I (Boolean function) with List-II (Minimum number of two-input NAND gates) and select the correct answer using the codes given below the Lists List-I # -, Ram Nagar, Bambala Puliya Ph.: , List-II A. Y C C. Five B. Y C. Four C. Y C 3. Six Codes : A B C (a) 3 (b) 3 (c) 3 (d) 3 5. A, B and C are three Boolean variables. Which one of the following Boolean expressions cannot be minimized any further? (a) Z C C C C (b) Z C C C C (c) Z C C C C (d) Z C C C C 6. Karnaugh map is used to (a) minimize the number of flip-flop in a digital circuit. (b) minimize the number of gates in a digital circuit. (c) minimize the number of gates and fan-in of a digital circuit. (d) design gates 7. While obtaining minimal sum of products expression (a) all don t cares are ignored (b) all don t cares are treated as logic ones (c) all don t cares are treated as logic zeros (d) only such don t cares that aid minimization are treated as logic ones 8. The product-of sum expression for given truth table is X Y Z (a) Z X YX Y (b) Z X YX Y (c) Z X YX Y (d) None of the above 9. The Boolean expression AC + BC is equivalent to (a) AC BC AC (b) BC AC BC ACB (c) AC BC BC C (d) C C C C. The Boolean expression Y (A, B, C) = A + BC, is to be realized using -input gates of only one type. What is the minimum number of gates required for the realization? (a) (b) (c) 3 (d) 4 or more. If X, Y and Z are Boolean variables, then the expression X(X XY) Z(X + Y + Z) is equal to (a) X XY (c) XYZ (b) X + Y + Z (d) XZ. If X and Y are Boolean variables, which one of the following is the equivalent of X Y XY? (a) X Y (b) X + Y (c) (d)

3 Digital Electronics Boolean Function 3 3. In boolean algebra if F = (A + B) ( A + C). Then (a) F AC (b) F (c) F AC (d) F AA 4. The logical expression y = A is equivalent to (a) y = (b) y (c) y A B (d) y = A + B 5. The Boolean function A + BC is a reduced form of (a) + BC (b) (A + B)(A + C) (c) C (d) (A + C)B 6. Boolean expression for the output of XNOR (Equivalent) logic gate with inputs A and B is (a) (b) (c) (A B)(A B) (d) (A B)(A B) 7. The simplified form of the Boolean expression Y (C D)(AD BC) can be written as (a) AD BCD (b) AD BCD (c) (A D)(BC D) (d) AD BCD 8. The logic Y = + A B is equivalent to (a) Y = (b) Y A B (c) Y = (d) Y = 9. The logic function f = (xy) (xy) is the same as (a) f (x y) (x y) (b) f (x y) (x y) (c) f (xy)(xy) (d) None of the above # -, Ram Nagar, Bambala Puliya Ph.: , According to boolean algebra, (A B ) equal to (a) (b) (c) (d) 3. The boolean expression for NAND gate is (a) A A (b) A + B + C = Y (c) = Y (d) A B Y 3. The simplified form of Boolean function (A B)(A C)(B C) is (a) (A B)C (b) (A B)C (c) (A B)C (d) (A B)C 33. The complement of boolean expression F (X Y Z) (X Z) (X Y) is (a) XYZ XZ YZ (b) XYZ XZ X Y (c) XYZ XZ Y Z (d) XYZ XY 34. In the logic equation A(A BC C) B(C A BC) (A BC AC) if C A then (a) A + B = (b) A B (c) A B (d) A = 35. A Boolean function can be expressed (a) as sum of maxterms or product of minterms (b) as product of maxterms or sum of minterms (c) parity as product of maxterms and partly as sum minterms (d) partly as sum of maxterms and partly os minterms 36. Which one of the following Boolean expressions is correct (a) x y x y (b) x y x y (c) x y x y (d) x y x y

4 4 Boolean Function ECE 37. The minimized form of the Boolean expression F(A, B, C) = (,, 3) is (a) A BC (b) A BC (c) A C B (d) A BC A B 38. For the identity AC BC AC, the dual form is (a) (A B)(A C)(B C) (A B)(A C) (b) (A B)(A C)(B C) (A B)(A C) (c) (A B)(A C)(B C) (A B)(A C) (d) A B AC BC AC 39. The minimized expression for the K-map shown in the above figure is CD 4. The term + AC + CB reduce to (a) + CA (c) AC + CB (b) AC + BC (d) + BC 4. The reduced form of the Boolean expression A B C AC is (a) (b) (c) (d) BC 43. The Karnaugh map for a four variable boolean function is given in figure. The correct boolean sum of product is PQ RS (a) CD CD C C BCD (b) CD + C + C + CD + CD (c) BCD + BCD + CD (d) B D C D 4. For the Karnaugh map shown in the given figure, the minimum boolean function is x yz (a) PQRS QS (b) PQRS QS (c) PQR QS (d) PQRS Q 44. The minimal sum of products form of f = CD C BCD is (a) AC BD (b) ACD C (c) AC BD (d) CD 45. A combinational circuit has input A, B and C and its Karnaugh map is given in figure. The output of the circuit is C (a) x y z yz (b) xz z zy (c) xy z yz (d) x y z # -, Ram Nagar, Bambala Puliya Ph.: , (a) ( ) (b) ( )C (c) A B C (d) C

5 Digital Electronics Boolean Function Which one of the following is the dual-form of the Boolean identity AC A CA B (a) AC AC (b) A BA C A CA B (c) A BA C AC (d) AC AC BC 47. The number of switching function of 3 variables is (a) 8 (b) 64 (c) 8 (d) Karnaugh map is used to (a) minimize the number of flip-flop in a digital circuit. (b) minimize the number of gates in a digital circuit. (c) minimize the number of gates and fan-in of a digital circuit. (d) design gates. 49. Y = f (A, B) = M (,,, 3) represents (M is Maxterm) (a) NOR gate (b) NAND gate (c) OR gate (d) a situation where output is independent of input 5. How many minterms (excluding redundant terms) does the minimal switching function f(v, w, x, y, z) = x + yz originally have? (a) 6 (b) (c) 4 (d) 3 # -, Ram Nagar, Bambala Puliya Ph.: ,

6 6 Boolean Function ECE ANSWERS WITH EXPLANATIONS. Ans. (d) Y = C + C + C = C ( + + ) = C () = C. Ans. (c) Y = (A + B) (A + B) = AA + + BA + BB = A + + B = A [ + B] + B = A + B 3. Ans. (a) 4. Ans. (c) 5. Ans. (a) 6. Ans. (a) The bulb is controlled by two switches A and B such that the bulb glows only when either switch A or switch B is ON then truth table will be 7. Ans. (a) A B Output # -, Ram Nagar, Bambala Puliya Ph.: , Output = AC BC = AC To find out the any Boolean expression we just replace AND operation by OR and OR operation by AND operation (A B)(A C)(B C) = (A B)(A C) 8. Ans. (c) X XY = X + Y Its dual will be 9. Ans. (b) X[X Y] = XY then its dual will be F = A + [B(A + C)] + D F D = A [B + AC]D. Ans. (d) With n Boolean variables, we can form different Boolean expression. For n = 4 We can form 4 = 6 = 6 Since = K or 4 6 = 64 K or (64 4) Boolean expressions.. Ans. (b) n By n variables we can generate Boolean functions.. Ans. (c) We are provided with the POS expression 3. Ans. (a) L = (X Z)(X Y) = (X Z)(X Y)(X X) L = (X Z) (X XY) = XY ZX XYZ L = XY( Z) ZX = XY ZX F = A C F = A[ B BC] F = A There is no need of any NAND gate to realize A since it is given input. 4. Ans. (a) 5. Ans. (c) 6. Ans. (b) A K-map is used to simplify the expressions thus it minimizes the number of gates of a digital circuit. The fan-in of a gate is the number of inputs connected to the gate without any degradation in the voltage levels. Thus K-map minimizes the number of gates and fan-in of a digital circuit. n

7 Digital Electronics Boolean Function 7 7. Ans. (d) A function with don t care combinations is simplified to obtain minimal SOP expression the value can be assigned to selected don t care combination. This is done order to increase the number of s in the selected groups, wherever further simplification is possible. Also, a don t care combination need not be used in grouping if it does not cover a large number of s. 8. Ans. (b) 9. Ans. (d). Ans. (c). Ans (d) X Y Z (X+Y) (X+Y) F = (X Y)(X Y) F = AC BC F = AC BC X(X XY)Z(X Y Z). Ans. (b) F = AC(B B) BC(A A) F = C C C C = (XX XXY)Z(X Y Z) = (X + )Z(X + Y + Z) = XZX + XZY + XZZ = XZ + XZY + XZ = XZ [ + Y + ] = XZ[] = XZ F = X Y XY = X Y[Y(XY) Y(XY) = X [ Y(X Y)] = X YX = X(YX) X(YX) = XY X(Y X) 3. Ans. (c) 4. Ans. (d) = XY XY X = XY (Y l)x = X XY F = (X + Y) F = (A B)(A C) l F = (A B)(A C)(A A) F = (A B)(A AC) F = AC C = AC(l B) F = AC Y = A = (A A)(A B) = (A + B) 5. Ans. (b) A + BC = (A + B)(A + C) (distributive property) 6. Ans. (c) 7. Ans. (a) Y = = ( A) (+B) = (A A) (A+B) (B+B) (B+A) Y = (A B) (A+B) (C D) (AD+BC) = (C)(AD) (C)(BC)+D(AD)+D(BC) = CD DA BCD = AD(l BC) BCD = AD BCD 8. Ans. (c) Y = A B = (A B) B = A = # -, Ram Nagar, Bambala Puliya Ph.: ,

8 8 Boolean Function ECE 9. Ans. (d) f = (xy) (xy) = (xy)(xy) = (x y)(x y) = (x y)(x y) 3. Ans. (c) (A B)(A C)(B C) = (A B)( AC CB CC) = (A B)( AC CB C) = (A B) ( (A B )C = (A B) C 3. Ans. (a) = xx x y xy yy = x y xy = x yxy Y = A B = A (B ) = A (B A) (B+B) = A (B A) (l) = A A B) 33. Ans. (b) 34. Ans. (c) 35. Ans. (b) 36. Ans. (a) 37. Ans. (a) 38. Ans. (a) 39. Ans. (d) CD = (A B)(A.B) (A B)C = A() B() (A B)C = (A B)C = (A B)C = l B = 3. Ans. (d) A NAND gate is a contraction of NOT-AND gates. It has two or more inputs and one output. A B A B Y = Y = 4. Ans. (a) 4. Ans. (c) X = CD BD F = + AC + CB Now according to De-morgan s theorem the complement of a product is equal to the sum of complements. Y = = A B # -, Ram Nagar, Bambala Puliya Ph.: , A BC F = AC + BC

9 Digital Electronics Boolean Function 9 4. Ans. (c) 43. Ans. (b) 44. Ans. (b) 45. Ans. (c) 46. Ans. (c) 47. Ans. (d) PQ RS F = A B C( AC) F = A B CA(B C) F = A B C(A BC) F = AC[A BC] F = Y = QS PQRS C Y = C C C C = ( )C ( )C = (A B)C (A B)C = A B C For n variables, the number of switching functions = For n = 3 n Number of switching functions = 3 = 8 = Ans. (c) A K-map is used to simplify the expressions thus it minimizes the number of gates of a digital circuit. The fan-in of a gate is the number of inputs connected to the gate without any degradation in the Voltage levels. Thus K-map minimizes the number of gates and fan-in of a digital circuit. 49. Ans. (d) Y = f(a, B) A B = M (,,, 3) = y = Thus output is for all inputs. It is independent of the input. 5. Ans. (b) xyz vw f(v, w, x, y, z) = x + yz There are minterms in the function. # -, Ram Nagar, Bambala Puliya Ph.: ,

CSCI 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,

QUESTION 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

2.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

Chapter 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

Gate 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 =

Gate 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

Unit-IV Boolean Algebra

Unit-IV 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

IT 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.

BOOLEAN 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)

Assignment (3-6) Boolean Algebra and Logic Simplification - General Questions

Assignment (3-6) 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

Code 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

Experiment 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.

X 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

Gate-Level Minimization

Gate-Level 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

Chapter 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

Chapter 3. Gate-Level Minimization. Outlines

Chapter 3 Gate-Level Minimization Introduction The Map Method Four-Variable Map Five-Variable Map Outlines Product of Sums Simplification Don t-care Conditions NAND and NOR Implementation Other Two-Level

DKT 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

Binary logic. Dr.Abu-Arqoub

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

Menu. Algebraic Simplification - Boolean Algebra EEL3701 EEL3701. MSOP, MPOS, Simplification

Menu Minterms & Maxterms SOP & POS MSOP & MPOS Simplification using the theorems/laws/axioms Look into my... 1 Definitions (Review) Algebraic Simplification - Boolean Algebra Minterms (written as m i ):

Gate-Level Minimization

MEC520 디지털공학 Gate-Level Minimization Jee-Hwan Ryu School of Mechanical Engineering Gate-Level Minimization-The Map Method Truth table is unique Many different algebraic expression Boolean expressions may

Chapter 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

CHAPTER-2 STRUCTURE OF BOOLEAN FUNCTION USING GATES, K-Map and Quine-McCluskey

CHAPTER-2 STRUCTURE OF BOOLEAN FUNCTION USING GATES, K-Map and Quine-McCluskey 2. Introduction Logic gates are connected together to produce a specified output for certain specified combinations of input

GATE Exercises on Boolean Logic

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

CMPE223/CMSE222 Digital Logic

CMPE223/CMSE222 Digital Logic Optimized Implementation of Logic Functions: Strategy for Minimization, Minimum Product-of-Sums Forms, Incompletely Specified Functions Terminology For a given term, each

Chapter 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

B.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

Combinational 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

R.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

Gate-Level Minimization

Gate-Level 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

Experiment 3: Logic Simplification

Module: Logic Design Name:... University no:.. Group no:. Lab Partner Name: Mr. Mohamed El-Saied Experiment : Logic Simplification Objective: How to implement and verify the operation of the logical functions

UNIT-4 BOOLEAN LOGIC. NOT Operator Operates on single variable. It gives the complement value of variable.

UNIT-4 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?

Gate-Level Minimization

Gate-Level Minimization Mano & Ciletti Chapter 3 By Suleyman TOSUN Ankara University Outline Intro to Gate-Level Minimization The Map Method 2-3-4-5 variable map methods Product-of-Sums Method Don t care

ECE380 Digital Logic

ECE38 Digital Logic Optimized Implementation of Logic Functions: Strategy for Minimization, Minimum Product-of-Sums Forms, Incompletely Specified Functions Dr. D. J. Jackson Lecture 8- Terminology For

Gate-Level Minimization. BME208 Logic Circuits Yalçın İŞLER

Gate-Level 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

Digital Logic Design. Outline

Digital Logic Design Gate-Level 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

28 The McGraw-Hill Companies, Inc. All rights reserved. 28 The McGraw-Hill Companies, Inc. All rights reserved. All or Nothing Gate Boolean Expression: A B = Y Truth Table (ee next slide) or AB = Y 28

A 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

Code 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

UNIT 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.

Standard 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:

ELCT201: 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

SIDDHARTH 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: II-B.Tech & I-Sem Course & Branch: B.Tech

Code 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,

Chapter 2: Combinational Systems

Uchechukwu Ofoegbu Chapter 2: Combinational Systems Temple University Adapted from Alan Marcovitz s Introduction to Logic and Computer Design Riddle Four switches can be turned on or off. One is the switch

Specifying 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

ELCT201: 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

Philadelphia 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

Literal 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

SWITCHING 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

LSN 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

數位系統 Digital Systems 朝陽科技大學資工系. Speaker: Fuw-Yi Yang 楊伏夷. 伏夷非征番, 道德經察政章 (Chapter 58) 伏者潛藏也道紀章 (Chapter 14) 道無形象, 視之不可見者曰夷

數位系統 Digital Systems Department of Computer Science and Information Engineering, Chaoyang University of Technology 朝陽科技大學資工系 Speaker: Fuw-Yi Yang 楊伏夷 伏夷非征番, 道德經察政章 (Chapter 58) 伏者潛藏也道紀章 (Chapter 14) 道無形象,

Digital Logic Lecture 7 Gate Level Minimization

Digital Logic Lecture 7 Gate Level Minimization By Ghada Al-Mashaqbeh The Hashemite University Computer Engineering Department Outline Introduction. K-map principles. Simplification using K-maps. Don t-care

Simplification 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.

Code 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

Chapter 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

UNIT 2 BOOLEAN ALGEBRA

UNIT 2 BOOLEN LGEBR Spring 2 2 Contents Introduction Basic operations Boolean expressions and truth tables Theorems and laws Basic theorems Commutative, associative, and distributive laws Simplification

Objectives: 1- Bolean Algebra. Eng. Ayman Metwali

Objectives: Chapter 3 : 1- Boolean Algebra Boolean Expressions Boolean Identities Simplification of Boolean Expressions Complements Representing Boolean Functions 2- Logic gates 3- Digital Components 4-

Boolean Algebra and Logic Gates

Boolean Algebra and Logic Gates Binary logic is used in all of today's digital computers and devices Cost of the circuits is an important factor Finding simpler and cheaper but equivalent circuits can

DHANALAKSHMI 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

CS8803: 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

NODIA 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

BOOLEAN ALGEBRA. Logic circuit: 1. From logic circuit to Boolean expression. Derive the Boolean expression for the following circuits.

COURSE / CODE DIGITAL SYSTEMS FUNDAMENTAL (ECE 421) DIGITAL ELECTRONICS FUNDAMENTAL (ECE 422) BOOLEAN ALGEBRA Boolean Logic Boolean logic is a complete system for logical operations. It is used in countless

Lecture 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

Digital 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 =,

Combinational Logic Circuits

Chapter 2 Combinational Logic Circuits J.J. Shann (Slightly trimmed by C.P. Chung) Chapter Overview 2-1 Binary Logic and Gates 2-2 Boolean Algebra 2-3 Standard Forms 2-4 Two-Level Circuit Optimization

2.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

1. 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

EEE130 Digital Electronics I Lecture #4_1

EEE130 Digital Electronics I Lecture #4_1 - Boolean Algebra and Logic Simplification - By Dr. Shahrel A. Suandi 4-6 Standard Forms of Boolean Expressions There are two standard forms: Sum-of-products form

Ch. 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

Combinational Logic & Circuits

Week-I Combinational Logic & Circuits Spring' 232 - Logic Design Page Overview Binary logic operations and gates Switching algebra Algebraic Minimization Standard forms Karnaugh Map Minimization Other

Graduate 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

VALLIAMMAI ENGINEERING COLLEGE. SRM Nagar, Kattankulathur DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING EC6302 DIGITAL ELECTRONICS

VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur-603 203 DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING EC6302 DIGITAL ELECTRONICS YEAR / SEMESTER: II / III ACADEMIC YEAR: 2015-2016 (ODD

Dr. 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 multiple-choice questions starting on page 3. You are responsible for ensuring that your

Chapter 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

Computer 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

Switching 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 12-bit Hamming code word containing 8-bits of data and 4 parity bits is read from memory. What was

Bawar 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

Summary Boolean Addition In Boolean algebra, a variable is a symbol used to represent an action, a condition, or data. A single variable can only have a value of or 0. The complement represents the inverse

Computer Science. Unit-4: Introduction to Boolean Algebra

Unit-4: 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

Switching Circuits & Logic Design

Switching Circuits & Logic Design Jie-Hong Roland Jiang 江介宏 Department of Electrical Engineering National Taiwan University Fall 23 5 Karnaugh Maps K-map Walks and Gray Codes http://asicdigitaldesign.wordpress.com/28/9/26/k-maps-walks-and-gray-codes/

Circuit analysis summary

Boolean Algebra Circuit analysis summary After finding the circuit inputs and outputs, you can come up with either an expression or a truth table to describe what the circuit does. You can easily convert

CS6201-DIGITAL PRINCIPLE AND SYSTEM DESIGN I YEAR/II SEM PART-B UNIT-I BOOLEAN ALGEBRA AND LOGIC GATES.

CS6201-DIGITAL PRINCIPLE AND SYSTEM DESIGN I YEAR/II SEM PART-B UNIT-I BOOLEAN ALGEBRA AND LOGIC GATES. 1) Simplify the boolean function using tabulation method. F = (0, 1, 2, 8, 10, 11, 14, 15) List all

10EC33: 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

DIGITAL CIRCUIT LOGIC UNIT 5: KARNAUGH MAPS (K-MAPS)

DIGITAL CIRCUIT LOGIC UNIT 5: KARNAUGH MAPS (K-MAPS) 1 Learning Objectives 1. Given a function (completely or incompletely specified) of three to five variables, plot it on a Karnaugh map. The function

Module -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 Sum-of-Minterms (SOM) 2.4 Canonical product of sum or Product-of-Maxterms(POM)

Boolean algebra. June 17, Howard Huang 1

Boolean algebra Yesterday we talked about how analog voltages can represent the logical values true and false. We introduced the basic Boolean operations AND, OR and NOT, which can be implemented in hardware

1. Fill in the entries in the truth table below to specify the logic function described by the expression, AB AC A B C Z

CS W3827 05S Solutions for Midterm Exam 3/3/05. Fill in the entries in the truth table below to specify the logic function described by the expression, AB AC A B C Z 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2.

CS470: 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, flip-flops Functional bocks: Combinational, Sequential Instruction

Outcomes. 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

Chapter 4. Combinational Logic. Dr. Abu-Arqoub

Chapter 4 Combinational Logic Introduction N Input Variables Combinational Logic Circuit M Output Variables 2 Design Procedure The problem is stated 2 The number of available input variables & required

Boolean Algebra. BME208 Logic Circuits Yalçın İŞLER

Boolean Algebra BME28 Logic Circuits Yalçın İŞLER islerya@yahoo.com http://me.islerya.com 5 Boolean Algebra /2 A set of elements B There exist at least two elements x, y B s. t. x y Binary operators: +

Digital Logic Design (CEN-120) (3+1)

Digital Logic Design (CEN-120) (3+1) ASSISTANT PROFESSOR Engr. Syed Rizwan Ali, MS(CAAD)UK, PDG(CS)UK, PGD(PM)IR, BS(CE)PK HEC Certified Master Trainer (MT-FPDP) PEC Certified Professional Engineer (COM/2531)

Introduction to Boolean logic and Logical Gates

Introduction to Boolean logic and Logical Gates Institute of Statistics Fall 2014 We saw the importance of the binary number system for data representation in a computer system. We ll see that the construction

LOGIC 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

www.vidyarthiplus.com Question Paper Code : 31298 B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2013. Third Semester Computer Science and Engineering CS 2202/CS 34/EC 1206 A/10144 CS 303/080230012--DIGITAL

DIGITAL ELECTRONICS. P41l 3 HOURS

UNIVERSITY OF SWAZILAND FACUL TY OF SCIENCE AND ENGINEERING DEPARTMENT OF PHYSICS MAIN EXAMINATION 2015/16 TITLE OF PAPER: COURSE NUMBER: TIME ALLOWED: INSTRUCTIONS: DIGITAL ELECTRONICS P41l 3 HOURS ANSWER

Combinational 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

Karnaugh Map (K-Map) Karnaugh Map. Karnaugh Map Examples. Ch. 2.4 Ch. 2.5 Simplification using K-map

Karnaugh Map (K-Map) Ch. 2.4 Ch. 2.5 Simplification using K-map A graphical map method to simplify Boolean function up to 6 variables A diagram made up of squares Each square represents one minterm (or