# GATE CSE. GATE CSE Book. November 2016 GATE CSE

Size: px
Start display at page:

Transcription

1 GATE CSE GATE CSE Book November 2016 GATE CSE

2

4 Contents 1 FAQs 1 2 Digital Logic Syllabus Syllabus Detailed Boolean algebra Combinational and Sequential Circuits Sequential circuit Counters Error Correcting Code Asynchronous Sequential Circuits Number Representations Computer Arithmetic Real Number representations and computer arithmetic (fixed and floating point Booth Algorithm Web Links Exercise Solutions Conclusion 15 References 19 VI

5 1 FAQs What is the most important subject for GATE? Answer. Who makes GATE question paper? Answer. What is the minimum bachelor percentage to get to IITs? Answer. What should be my preparation strategy? Answer. Which test series to follow for GATE? Answer. How to improve my accuracy during exam? Answer.

6

7 2 Digital Logic 2.1 Syllabus Boolean algebra Combinational and sequential circuits Minimization Number representations and computer arithmetic (fixed and floating point) Booth s Algorithm 2.2 Syllabus Detailed Types of Questions asked and what to focus more given in boxes Using Mano [1] as reference. NPTEL - Recommended Video 1. Boolean algebra - Boolean Functions, Canonical Forms. Chapter 2, sections 1-5. No. of Boolean functions possible, simplification of Boolean functions 2. Combinational circuits - Half/Full adder, Half/Full Subtractor, Code Conversion, Binary Parallel Adder, MUX, DEMUX, Encoder, Decoder, ROM, PLA. Chapters 4-5. Determine the output of circuit, propagation delay of adder, 3. Sequential circuits - SR FlipFlop, JK FlipFlop, T FlipFlop, D FlipFlop, Counters, Synchronous Counters, carry-look-ahead Ripple Counters. Asynchronous Sequential Circuits- Hazards. Chapters 6, 7, 9. generation, minimum no. of NAND/NOR gates required, 4. Minimization - K-MAP, SOP, POS, Prime Implicants. Chapter 3. static hazard Flip-flops given and modulus of counter asked, for sequential circuit output after t cycles, counters using flipflops, static hazard Minimization asked a lot, minimization with don t cares

8 4 2 Digital Logic As of now IEEE 754 representation is mostly asked and previous representations not required, range, precision, difference between 2 s complement and 2 s complement representation 5. Number representations and computer arithmetic - fixed and floating point, 1 s complement, 2 s complement, sign magnitude format for negative numbers, IEEE 754 Floating Point Representation for single/double precision, IEEE 754 Single Precision Ranges. Partly covered in Chapters 1, 8 and in Computer Organization. Also see Section 2.3 which details this beautifully Boolean algebra Definition 2.1 (Duality Principle). A Boolean expression remains valid if the operators ( and ) and the identity elements (0 and 1) are interchanged. Hence, to show a Boolean expression as valid, it is enough to show for its dual. Precedence of Boolean Operators () > NOT > AND > OR Definition 2.2 (Literal). A literal is a primed or unprimed variable. These corresponds to inputs when a logic circuit is made from the Boolean expression. Minimizing the literals and terms in the expression can reduce the cost of the circuit. Both may not be simultaneously possible. Minimizing literals can be done by algebraic simplification - but there is no definite algorithm for this. Only cut-and-try procedure works. Boolean Functions Each variable in a Boolean expression - formed with (),,, and = is mapped to {0, 1}. On the RHS it is either 0 or 1. i.e, each Boolean function is a mapping from the set of all combination of binary values possible for the input variables to either 0 or 1. Set of all possible combinations for n binary variables is 2 n and hence Theorem 2.3. The total number of Boolean functions over n variables is 2 2n. Theorem 2.4. DeMorgan s Theorem 1. (A + B + C + D + E + F ) = A.B.C.D.E.F 2. (A.B.C.D.E.F ) = A + B + C + D + E + F i.e., complement of a Boolean expression is equal to the expression with each literal being complemented and AND and OR interchanged i.e., take the dual and complement each literal. Canonical Forms Min Term or Standard Product - 2 n minterms possible for n variables. For 3 variables x, y, z the minterms are x y z, x y z, x yz, x yz, xy z, xy z, xyz, xyz and are denoted by m 0, m 1... m 7 and similarly for n variables. Max Term or Standard Sum - 2 n maxterms possible for n variables For 3 variables x, y, z the maxterms are x + y + z, x + y + z, x + y + z, x + y + z, x + y + z, x + y + z, x + y + z, x + y + z denoted by M 0, M 1... M 7 and similarly for n variables. Any Boolean function can be expresses as: 1. Sum of minterms 2. Product of maxterms Note 2.5. The complement of a Boolean function equals the minterms missing from the sum of minterms expression for the function.

9 2.2 Syllabus Detailed 5 Standard Forms Canonical forms are not practically usable as each term must have all the literals present (either prime or unprime). Practically usable are 1. Sum of Products - ORing of product terms 2. Product of Sums - ANDing of sum terms forms where each term can have any number of literals. These two form the standard forms. A Boolean expression having a mix of the two is not in standard form. Minimization - Karnaugh s Map Is a table of boxes. Each box represents a minterm. It presents all possible ways a Boolean function can be represented in standard form. Gives "Minimal" Sum of Products expression as well as Product of Sum expression where minimal is with respect to the number of literals. Both of these need not necessarily unique. Definition 2.6 (Prime Implicants). Is a product term obtained by combining maximum number of adjacent squares possible in the K-map Definition 2.7 (Essential Prime Implicants). Is a minterm in a square that is covered by only one prime implicant in K-map Hence, an essential prime implicant will be part of any minimal sum of products expression but a prime implicant need not always be. From K-map we can get both minimal sum of product form as well as minimal product of sum form. To get minimal sum of product expression, we combine the 1 s and then write down the corresponding minterms and sum them. To get minimal product of sums form, we combine the 0 s (empty squares marked by 0 s) and get the minimal sum of product form of the complement function. Then we take its dual and complement each literal and this will give the minimal product of sum form. NAND/NOR GATE Steps to realize a Boolean circuit for a Boolean expression are as follows: 1. Convert to minimal sum of product form (K-map) 2. Draw a NAND gate for each term that has at least 2 literals which forms a set of first level NAND gates 3. Draw a single second level NAND gate 4. A term with a single literal requires an inverter in the first level or can be complemented and given as input to the second level NAND gate For NOR gate realization we do the same procedure except that we use minimal product of sums form. Examples should be worked out as this has been asked many times for GATE. Tabulation Method 1. A systematic approach which guarantees to give a minimal standard form expression for a Boolean function K-map is a trial-and-error method and becomes tedious with more number of variables 2. Also known as Quine-McCluskey method 3. Consists of 2 steps- first search for all terms that are candidates for inclusion in minimal form and then choose the ones which gives the minimal form 4. Is tedious for humans

10 6 2 Digital Logic Combinational and Sequential Circuits Note 2.8. In combinational circuit, output depends only on the current input whereas in a sequential circuit output depends not only on the current input but also on previous inputs (memory element) Half Adder 1. Sum=A B 2. Carry=AB Full Adder 1. Sum=A B C 2. Carry=AB + BC + CA Half Subtractor 1. Difference=A B 2. Borrow=A B Full Subtractor 1. Difference=A B C 2. Borrow=(A B) C Decoder Decoder is a combinational circuit that converts binary information from n input lines to a maximum of 2 n (less in case of dont-cares) unique output lines. Demultiplexer A decoder with an enable input can function as a demultiplexer. A demultiplexer is a circuit that receives information on a single line and transmits this information on one of 2 n possible output lines. Encoder Inverse of a decoder. Has 2 n (or fewer) input lines and n output lines. Multiplexer Is a combinational circuit that selects binary information from one of many input lines and directs it to a single output line. For two select lines A and B and four inputs I 0, I 1, I 2, I 3 the output is given by For all the above, one need to know to determine the outputs when put in a circuit with other components 1. f(a, B) = A B I 0 + A BI 1 + AB I 2 + ABI 3

11 2.2 Syllabus Detailed 7 ROM Any Boolean function can be expressed as a sum-of-products form. Now, for each minterm we have an output. By removing the links of the terms not included in a function, we can make a ROM represent the Boolean function of one of the output variables in the combinational circuit. For n input m output combinational circuit ROM must be 2 n m. In short we store m outputs in ROM and selects them based on n inputs. Types of ROMs 1. Programmable ROM (PROM)- Can be written only once 2. Erasable PROM (EPROM) - Can be erased using ultra-violet rays and reprogrammed 3. Electrically Erasable PROM (RPOM) - Can be erased using electrical signals and reprogrammed ROMs are used to implement combinational circuit directly from their truth tables.. They are used in binary code conversions and in the design of control units of digital systems. Definition 2.9 (Microprogrammed Control Unit). - A control unit that utlizes ROM to store binary control information. Code Conversion To facilitate the usage of output of one system as input of another. BCD, Excess-3 Gray codes are some common binary codes Sequential circuit Flip-Flops 1. S-R Flip-Flop - Q n = S + R Q. Gets to indeterminate state when S = R = JK Flip-Flop - Q n = JQ + K Q. No indeterminate state. Can be made by cross coupling either NAND gates or NOR gates 3. D Flip-Flop - Q n = Q. 4. T Flip-Flop - Q n = Q The size of ROM needed for circuits like multipliers have been asked in GATE Examples have been asked in GATE Edge/Level Triggering Questions have been asked previously based on timing diagram. State diagram Construction - if you know Automata nothing new here but see previous year questions Excitation Table: Tells the flipflop input condition which can cause a change from present state to new one Counters An n bit counter can count from 0 to 2 n 1 and consists of n flipflops. The counting sequence need not be the same as binary numbers. 1. Synchronous Counter - A Clock Pulse is applied to all flipflops which triggers them. Ring Counter: A circular shift register with only 1 flipflop being set at any time. The number of flip-flops required is the mod of the counter. Johnson Counter : Is a k bit switch tail (complement output of last flipflop given as input to the first) ring counter that can provide outputs for 2k timing signals with 2k decoder gates. Only 2 input gates are required. The number of flip-flops required is one half the number of timing signals. 2. Asynchronous(Ripple) Counter - Output of one or more flipflops triggers other flipflops. No common clock. For n bit binary ripple counter required n flip-flops. Definition 2.10 (RAM). Memory cells can be accessed for information transfer to or from any desired random location and hence called Random Access Memory.

12 8 2 Digital Logic Error Correcting Code Please see text book for creation and detection of error using Hamming Code Please see text book Hamming Code - In the Hamming code k parity bits are added to n data bits to get a code of n + k bits. Can detect and correct only a single error. By adding an extra parity bit, Hamming code can detect double errors and correct a single one. 1. Parity bit Generator 2. Parity bit checker Asynchronous Sequential Circuits 1. The memory elements are unclocked FFs or time delay elements. 2. Similar to a combinatorial circuit with feedback 3. Are faster than synchronous sequential circuits 4. For proper operation, inputs must be allowed to change only after the system has reached a stable state Definition 2.11 (Race Condition). Happens in an asynchronous sequential circuit when two or more binary state variables change their value in response to change in an input variable. Definition 2.12 (Hazards). Are unwanted switching transients that may appear at the output of a circuit because different paths exhibit different propagation delays. 1. Happens in combinational circuit whenever the circuit moves from one minterm to another causing the output to be momentarily 0 2. Static 0 Hazard - Output going to 1 when it should remain 0 3. Static 1 Hazard - Output going to 0 when it should remain 1 4. Dynamic Hazard - Output changing 3 or more times when it should change from 0 to 1 or vice verse. 5. Avoided by adding redundant gates often by combining the minterms and getting a new minterm A problem asked in GATE Number Representations Conversion of numbers(binary to octal, octal to binary, binary to gray, gray to binary, Excess 3 code conversion) One example for converting between Hexadecimal to Octal. Let input be 0xAB72 1. Convert to binary by taking each hex-digit and writing its binary: Starting from right group the digits by pairs of 3 adding 0 s to left if required) Please see text and previous GATE questions for more examples and other conversions 3. Convert each of the 3 bits to octal digit And we are done. 125, 562

13 2.2 Syllabus Detailed 9 Complements Used for simplifying subtraction. Two types: 1. (r 1) s complement: For a given number N in base r having n digits, (r 1) s complement is (r n 1) N. 9 s complement of = = s complement of = = r s complement: For a given number N in base r having n digits, r s complement is (r n ) N, if N 0 and 0 if N = 0. Can be obtained by adding 1 to the (r 1) s complement 10 s complement of = = s complement of = = (Reverse all bits before the right most 1) Signed Numbers Represented in 1. Sign Magnitude Form - leading bit is sign bit. 0 for positive and 1 for negative s complement Form - negative numbers represented in 1 s complement form (swapping 0 s and 1 s) 3. 2 s complement - negative numbers represented in 2 s complement form (1 s complement + 1) Note In all the above forms positive numbers are represented as it is. i.e., say for 11, 1 s complement representation = 2 s complement representation = sign magnitude representation = Note Both 1 s complement and sign magnitude forms have 2 representations for 0 Important!!! Binary Codes Are used to represent decimal digits. Different codes can be used as shown in the following table. Decimal Digit BCD (8421) Excess Biquinary ( ) Note Binary equivalent of a decimal number and binary code of a decimal number are different. For decimal digits from 0 to 9, these are the same for BCD code. But for 10, binary value is 1010 whereas binary code is BCD is the most commonly used code. But it is not self-complementing where as Excess-3, and 2421 are self complementing codes. i.e., in order to obtain the 9 s complement of a number we can simply exchange 0 s and 1 s in the binary codes. The biquinary code is a 7-bit binary code with error detection capability. Each decimal digit consists of five 0 s and two 1 s. If less than 2 or more than 2, 1 bits are detected by the receiver, it signals an error.

14 10 2 Digital Logic Error Detection Codes Definition 2.16 (Parity Bit). Is an extra bit included with the message to make the total number of 1 s transmitted either even or odd. GRAY code - Advantage of GRAY code over binary is that only 1 bit changes when a number is incremented by 1. A typical application is when analog signals are used to represent the continuous movement of shaft position. ASCII - Used to represent characters and commonly used in most systems. Is of 7 bits allowing 128 characters (extended ASCII has 8 bits). A-Z are from 65-90, a-z are from and 0-9 are from Computer Arithmetic Carry and Overflow condition Carry and Overflow are two very similar term in digital logic. But we should not be confused between two. Carry is useful when we add or subtract two binary digits which are in unsigned format. Overflow is used when we add or subtract two terms which are in signed format. But usually both flags are in place in the architecture and the required one is used based on the types of the operands (compiler generates code based on this). Carry flag is set when there is a carry from the most significant bit position this is why it is useful for unsigned numbers only. The condition for overflow, C out C n 1 = 1 (Carry out of the MSB XORed with carry in to the MSB). This is same as saying MSB of both the numbers to be added are 1 and that of the sum is 0, or MSB bits of both the numbers are 0 and that of the sum is 1. Overflow is an error in 2 s complement arithmetic for signed numbers and ignored for unsigned numbers Real Number representations and computer arithmetic (fixed and floating point 1. Real Numbers can be represented in fixed and floating point numbers. See 2.3 for fixed point representation. Floating point number representation consists of three parts a) Sign bit - 1 bit is enough b) Exponent c) Mantissa 2. single precision floating point number represented in 32 bits 3. double precision floating point number represented in 64 bits As of now the most widely used floating point representation is IEEE 754. It has a single precision representation using 32 bits and a double precision one using 64 bits. Some of the most important features are (assuming single precision) 1 sign bit to the left most Followed by 8 exponent bits Followed by 23 mantissa bits IEEE 754 assumes normalized representation if exponent is non-zero (when exponent is 0, number is considered denormalized). Normalized means the number starts like 1.xx. Now, since for a normalized representation 1 is always there at left position IEEE 754 ignores it and does not represent this in the mantissa bits. This allows it to have a precision of 24 bits even though only 23 mantissa bits are there. Only issue being implicit 1 restricts the smallest positive (or largest negative) number that can be represented. Exponent is of 8 bits. So, the number of exponent values is 256. In order to represent negative exponent values, a bias "127" is used and the exponent value is always subtracted by this. i.e., 0 becomes -127 and 255 becomes But these two values have special meanings (see 2.3), and normal exponent range is from -126 to +254.

15 2.2 Syllabus Detailed 11 So, a 32 bit number represented in IEEE 754 as xzy is ( 1) x 1.y 2 z 127 where the mantissa bits y are appended to "1." and z is the decimal value corresponding to the exponent bits. Example for IEEE 754 Representation Consider the floating point number Binary value = Normalized value = So, mantissa = 0.1 (Leading 1 implied for normalized numbers) Exponent = = 126 Sign bit = 0 So, the value represented will be 0 }{{} sign }{{} exponent }{{} mantissa When we convert a decimal number to binary and the value cannot be exactly represented within 24 bits, we loose precision. If numbers can be exactly represented as the example above, we have no loss in precision Booth Algorithm Consider an example: which in decimal is = 154. Usually if we do normal multiplication we add the multiplicand as Partial Product corresponding to each 1 in the multiplier. Thus for the given example we have 3 ADD operations. Booth Algorithm can better this by considering "groups of 1s" as to individual 1 s. It can be shown by the following steps for the given example. Multiplicand (M): 01011, Multiplier (m): bits each, Product can be up to 10 bits. 2 s complement of M = Initialize Product = Multiplier and top 5 bits as 0 s. Also assume P ( 1) = 0 P = For i = 0 to 4 do steps 3 and 4 3. P U = P U + P 0 P ( 1), P U denoting the upper 5 bits of P. 4. Arithmetic Shift Right P one bit (Leftmost bit replaced by carry bit, P ( 1) = P 0). For i = 0, P ( 1) P 0 = 0, no ADD, ASR one bit P = For i = 1, P ( 1) P 0 = 1, SUB M (adds 2 s complement) from left half of P ASR one bit For i = 2, P ( 1) P 0 = 0, no ADD, ASR one bit P = P = P = For i = 3, P ( 1) P 0 = 0, no ADD, ASR one bit P =

16 12 2 Digital Logic For i = 4, P ( 1) P 0 = 1, ADD M to left half of P ASR one bit P = P = The final P is the required result which equals 154. We got result in 2 ADD operations (considering SUB as ADD of 2 s complement) m i m i 1 Operation m i 1 m i 0 0 Do nothing Add M Subtract M Do nothing 0 Note Worst case of Booth s algorithm happens for alternate sequence of 1 s and 0 s in which case we require b/2 ADD operations and b/2 SUB operations for b bit multiplication. Radix-4 Booth Recoding Asked in GATE 2006 IT This is a modification to Booth algorithm where we look at 3 bits at a time instead of 2 in normal Booth s algorithm. m i+1 m i m i 1 Partial Product * Multiplicand * Multiplicand * Multiplicand * Multiplicand * Multiplicand * Multiplicand We need some adjustments here before doing multiplication compared to previous case. We need to make the multiplicand even no. of bits by extending the sign bit to left if required. Multiplicand (M): , Multiplier (m): bits each, Product can be up to 12 bits. 2 s complement of M = Initialize Product = Multiplier and top 6 bits as 0 s. Also assume P ( 1) = 0 P = For i = 0 to 2 do steps 3 and 4 3. P U = P U + P P, P U denoting the upper 5 bits of P and P P corresponding to the partial product given be the least 3 bits (including -1 position). 4. Arithmetic Shift Right P two bits (Leftmost 2 bits replaced by carry bit, P ( 1) = P 0). In our case: For i = 0, P 1P 0P ( 1) = 100, P P = 2 M, P = ASR two bits For i = 1, P 1P 0P ( 1) = 111,P P = 0 ASR two bits P =

17 2.4 Exercise Solutions 13 For i = 2, P 1P 0P ( 1) = 001,P P = 1 M P = ASR two bits P = P = The final P is the required result which equals 154. We got result in 2 ADD operations (considering SUB as ADD of 2 s complement) Here, we got the same number of ADD operations as the normal Booth s algorithm. But even in worst case, Booth recoding gets us the result in b/2 ADD/SUB operations as compared to b in the case of normal Booth algorithm. 2.3 Web Links 1. Webpage for Digital Logic 2. Previous GATE Questions in Digital Logic 3. GATECSE Discussion lead by Praveen Saini and Ravi Singh NPTEL - Recommended Video 4. IEEE Must see 5. Multipliers 6. Number Representation 7. Fixed Point Representation Important Problems beautiful question Exercise Solutions

18

19 3 Conclusion I always thought something was fundamentally wrong with the teaching system in India. So why not change it.

20

21 FAQs What is the most important subject for GATE? Who makes GATE question paper? What is the minimum bachelor percentage to get to IITs? What should be my preparation strategy? Which test series to follow for GATE? How to improve my accuracy during exam?

22

23 References [1] M. Morris Mano. Digital Logic and Computer Design. Prentice Hall PTR, Upper Saddle River, NJ, USA, 1st edition, ISBN

### 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

### 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

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

### 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

### SUBJECT CODE: IT T35 DIGITAL SYSTEM DESIGN YEAR / SEM : 2 / 3

UNIT - I PART A (2 Marks) 1. Using Demorgan s theorem convert the following Boolean expression to an equivalent expression that has only OR and complement operations. Show the function can be implemented

### R10. II B. Tech I Semester, Supplementary Examinations, May

SET - 1 1. a) Convert the following decimal numbers into an equivalent binary numbers. i) 53.625 ii) 4097.188 iii) 167 iv) 0.4475 b) Add the following numbers using 2 s complement method. i) -48 and +31

### 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

### COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING QUESTION BANK SUBJECT CODE & NAME: EC 1312 DIGITAL LOGIC CIRCUITS UNIT I

KINGS COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING QUESTION BANK SUBJECT CODE & NAME: EC 1312 DIGITAL LOGIC CIRCUITS YEAR / SEM: III / V UNIT I NUMBER SYSTEM & BOOLEAN ALGEBRA

### END-TERM EXAMINATION

(Please Write your Exam Roll No. immediately) END-TERM EXAMINATION DECEMBER 2006 Exam. Roll No... Exam Series code: 100919DEC06200963 Paper Code: MCA-103 Subject: Digital Electronics Time: 3 Hours Maximum

### VALLIAMMAI ENGINEERING COLLEGE

VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur 603 203 DEPARTMENT OF INFORMATION TECHNOLOGY & COMPUTER SCIENCE AND ENGINEERING QUESTION BANK II SEMESTER CS6201- DIGITAL PRINCIPLE AND SYSTEM DESIGN

### MGU-BCA-205- Second Sem- Core VI- Fundamentals of Digital Systems- MCQ s. 2. Why the decimal number system is also called as positional number system?

MGU-BCA-205- Second Sem- Core VI- Fundamentals of Digital Systems- MCQ s Unit-1 Number Systems 1. What does a decimal number represents? A. Quality B. Quantity C. Position D. None of the above 2. Why the

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

### Injntu.com Injntu.com Injntu.com R16

1. a) What are the three methods of obtaining the 2 s complement of a given binary (3M) number? b) What do you mean by K-map? Name it advantages and disadvantages. (3M) c) Distinguish between a half-adder

### 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

### 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

### D I G I T A L C I R C U I T S E E

D I G I T A L C I R C U I T S E E Digital Circuits Basic Scope and Introduction This book covers theory solved examples and previous year gate question for following topics: Number system, Boolean algebra,

### VALLIAMMAI ENGINEERING COLLEGE

VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur 603 203 DEPARTMENT OF INFORMATION TECHNOLOGY QUESTION BANK Academic Year 2018 19 III SEMESTER CS8351-DIGITAL PRINCIPLES AND SYSTEM DESIGN Regulation

Get Free notes at Module-I 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)

### 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

### KING FAHD UNIVERSITY OF PETROLEUM & MINERALS COMPUTER ENGINEERING DEPARTMENT

KING FAHD UNIVERSITY OF PETROLEUM & MINERALS COMPUTER ENGINEERING DEPARTMENT COE 202: Digital Logic Design Term 162 (Spring 2017) Instructor: Dr. Abdulaziz Barnawi Class time: U.T.R.: 11:00-11:50AM Class

INDEX Absorption law, 31, 38 Acyclic graph, 35 tree, 36 Addition operators, in VHDL (VHSIC hardware description language), 192 Algebraic division, 105 AND gate, 48 49 Antisymmetric, 34 Applicable input

### CONTENTS CHAPTER 1: NUMBER SYSTEM. Foreword...(vii) Preface... (ix) Acknowledgement... (xi) About the Author...(xxiii)

CONTENTS Foreword...(vii) Preface... (ix) Acknowledgement... (xi) About the Author...(xxiii) CHAPTER 1: NUMBER SYSTEM 1.1 Digital Electronics... 1 1.1.1 Introduction... 1 1.1.2 Advantages of Digital Systems...

### II/IV B.Tech (Regular/Supplementary) DEGREE EXAMINATION. Answer ONE question from each unit.

Hall Ticket Number: 14CS IT303 November, 2017 Third Semester Time: Three Hours Answer Question No.1 compulsorily. II/IV B.Tech (Regular/Supplementary) DEGREE EXAMINATION Common for CSE & IT Digital Logic

### UNIT I BOOLEAN ALGEBRA AND COMBINATIONAL CIRCUITS PART-A (2 MARKS)

SUBJECT NAME: DIGITAL LOGIC CIRCUITS YEAR / SEM : II / III DEPARTMENT : EEE UNIT I BOOLEAN ALGEBRA AND COMBINATIONAL CIRCUITS 1. What is variable mapping? 2. Name the two canonical forms for Boolean algebra.

### DIRECTORATE OF TECHNICAL EDUCATION DIPLOMA IN ELECTRICAL AND ELECTRONICS ENGINEERING II YEAR M SCHEME IV SEMESTER.

DIRECTORATE OF TECHNICAL EDUCATION DIPLOMA IN ELECTRICAL AND ELECTRONICS ENGINEERING II YEAR M SCHEME IV SEMESTER 2015 2016 onwards DIGITAL ELECTRONICS CURRICULUM DEVELOPMENT CENTRE Curriculum Development

### BHARATHIDASAN 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

### INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad - 500 043 COMPUTER SCIENCE AND ENGINEERING TUTORIAL QUESTION BANK Name : DIGITAL LOGIC DESISN Code : AEC020 Class : B Tech III Semester

### SHRI ANGALAMMAN COLLEGE OF ENGINEERING. (An ISO 9001:2008 Certified Institution) SIRUGANOOR, TIRUCHIRAPPALLI

SHRI ANGALAMMAN COLLEGE OF ENGINEERING AND TECHNOLOGY (An ISO 9001:2008 Certified Institution) SIRUGANOOR, TIRUCHIRAPPALLI 621 105 DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING EC1201 DIGITAL

### Digital logic fundamentals. Question Bank. Unit I

Digital logic fundamentals Question Bank Subject Name : Digital Logic Fundamentals Subject code: CA102T Staff Name: R.Roseline Unit I 1. What is Number system? 2. Define binary logic. 3. Show how negative

### Principles of Digital Techniques PDT (17320) Assignment No State advantages of digital system over analog system.

Assignment No. 1 1. State advantages of digital system over analog system. 2. Convert following numbers a. (138.56) 10 = (?) 2 = (?) 8 = (?) 16 b. (1110011.011) 2 = (?) 10 = (?) 8 = (?) 16 c. (3004.06)

### HANSABA COLLEGE OF ENGINEERING & TECHNOLOGY (098) SUBJECT: DIGITAL ELECTRONICS ( ) Assignment

Assignment 1. What is multiplexer? With logic circuit and function table explain the working of 4 to 1 line multiplexer. 2. Implement following Boolean function using 8: 1 multiplexer. F(A,B,C,D) = (2,3,5,7,8,9,12,13,14,15)

### R a) Simplify the logic functions from binary to seven segment display code converter (8M) b) Simplify the following using Tabular method

SET - 1 1. a) Convert the decimal number 250.5 to base 3, base 4 b) Write and prove de-morgan laws c) Implement two input EX-OR gate from 2 to 1 multiplexer (3M) d) Write the demerits of PROM (3M) e) What

### 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

NADAR SARASWATHI COLLEGE OF ENGINEERING AND TECHNOLOGY Vadapudupatti, Theni-625531 Question Bank for the Units I to V SEMESTER BRANCH SUB CODE 3rd Semester B.E. / B.Tech. Electrical and Electronics Engineering

### R07. Code No: V0423. II B. Tech II Semester, Supplementary Examinations, April

SET - 1 II B. Tech II Semester, Supplementary Examinations, April - 2012 SWITCHING THEORY AND LOGIC DESIGN (Electronics and Communications Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions

### KINGS COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING QUESTION BANK NAME OF THE SUBJECT: EE 2255 DIGITAL LOGIC CIRCUITS

KINGS COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING QUESTION BANK NAME OF THE SUBJECT: EE 2255 DIGITAL LOGIC CIRCUITS YEAR / SEM: II / IV UNIT I BOOLEAN ALGEBRA AND COMBINATIONAL

### R07

www..com www..com SET - 1 II B. Tech I Semester Supplementary Examinations May 2013 SWITCHING THEORY AND LOGIC DESIGN (Com. to EEE, EIE, BME, ECC) Time: 3 hours Max. Marks: 80 Answer any FIVE Questions

### INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad - 500043 Course Name : DIGITAL LOGIC DESISN Course Code : AEC020 Class : B Tech III Semester Branch : CSE Academic Year : 2018 2019

### SIR C.R.REDDY COLLEGE OF ENGINEERING, ELURU DEPARTMENT OF INFORMATION TECHNOLOGY LESSON PLAN

SIR C.R.REDDY COLLEGE OF ENGINEERING, ELURU DEPARTMENT OF INFORMATION TECHNOLOGY LESSON PLAN SUBJECT: CSE 2.1.6 DIGITAL LOGIC DESIGN CLASS: 2/4 B.Tech., I SEMESTER, A.Y.2017-18 INSTRUCTOR: Sri A.M.K.KANNA

### 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

### CHW 261: Logic Design

CHW 261: Logic Design Instructors: Prof. Hala Zayed Dr. Ahmed Shalaby http://www.bu.edu.eg/staff/halazayed14 http://bu.edu.eg/staff/ahmedshalaby14# Slide 1 Slide 2 Slide 3 Digital Fundamentals CHAPTER

### (ii) Simplify and implement the following SOP function using NOR gates:

DHANALAKSHMI COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING EE6301 DIGITAL LOGIC CIRCUITS UNIT I NUMBER SYSTEMS AND DIGITAL LOGIC FAMILIES PART A 1. How can an OR gate be

### 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

### PART B. 3. Minimize the following function using K-map and also verify through tabulation method. F (A, B, C, D) = +d (0, 3, 6, 10).

II B. Tech II Semester Regular Examinations, May/June 2015 SWITCHING THEORY AND LOGIC DESIGN (Com. to EEE, ECE, ECC, EIE.) Time: 3 hours Max. Marks: 70 Note: 1. Question Paper consists of two parts (Part-A

### UPY14602-DIGITAL ELECTRONICS AND MICROPROCESSORS Lesson Plan

UPY14602-DIGITAL ELECTRONICS AND MICROPROCESSORS Lesson Plan UNIT I - NUMBER SYSTEMS AND LOGIC GATES Introduction to decimal- Binary- Octal- Hexadecimal number systems-inter conversions-bcd code- Excess

### Combinational Circuits

Combinational Circuits Combinational circuit consists of an interconnection of logic gates They react to their inputs and produce their outputs by transforming binary information n input binary variables

### Logic design Ibn Al Haitham collage /Computer science Eng. Sameer

DEMORGAN'S THEOREMS One of DeMorgan's theorems stated as follows: The complement of a product of variables is equal to the sum of the complements of the variables. DeMorgan's second theorem is stated as

### 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

### Digital Fundamentals

Digital Fundamentals Tenth Edition Floyd Chapter 2 2009 Pearson Education, Upper 2008 Pearson Saddle River, Education NJ 07458. All Rights Reserved Decimal Numbers The position of each digit in a weighted

### 3. The high voltage level of a digital signal in positive logic is : a) 1 b) 0 c) either 1 or 0

1. The number of level in a digital signal is: a) one b) two c) four d) ten 2. A pure sine wave is : a) a digital signal b) analog signal c) can be digital or analog signal d) neither digital nor analog

### NH 67, Karur Trichy Highways, Puliyur C.F, Karur District DEPARTMENT OF INFORMATION TECHNOLOGY CS 2202 DIGITAL PRINCIPLES AND SYSTEM DESIGN

NH 67, Karur Trichy Highways, Puliyur C.F, 639 114 Karur District DEPARTMENT OF INFORMATION TECHNOLOGY CS 2202 DIGITAL PRINCIPLES AND SYSTEM DESIGN UNIT 1 BOOLEAN ALGEBRA AND LOGIC GATES Review of binary

### DIGITAL ELECTRONICS. Vayu Education of India

DIGITAL ELECTRONICS ARUN RANA Assistant Professor Department of Electronics & Communication Engineering Doon Valley Institute of Engineering & Technology Karnal, Haryana (An ISO 9001:2008 ) Vayu Education

### Scheme G. Sample Test Paper-I

Sample Test Paper-I Marks : 25 Times:1 Hour 1. All questions are compulsory. 2. Illustrate your answers with neat sketches wherever necessary. 3. Figures to the right indicate full marks. 4. Assume suitable

### Chapter 4. Combinational Logic

Chapter 4. Combinational Logic Tong In Oh 1 4.1 Introduction Combinational logic: Logic gates Output determined from only the present combination of inputs Specified by a set of Boolean functions Sequential

### LOGIC DESIGN. Dr. Mahmoud Abo_elfetouh

LOGIC DESIGN Dr. Mahmoud Abo_elfetouh Course objectives This course provides you with a basic understanding of what digital devices are, how they operate, and how they can be designed to perform useful

### 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

### DLD VIDYA SAGAR P. potharajuvidyasagar.wordpress.com. Vignana Bharathi Institute of Technology UNIT 3 DLD P VIDYA SAGAR

DLD UNIT III Combinational Circuits (CC), Analysis procedure, Design Procedure, Combinational circuit for different code converters and other problems, Binary Adder- Subtractor, Decimal Adder, Binary Multiplier,

### 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

### 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

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

### 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

### EECS150 Homework 2 Solutions Fall ) CLD2 problem 2.2. Page 1 of 15

1.) CLD2 problem 2.2 We are allowed to use AND gates, OR gates, and inverters. Note that all of the Boolean expression are already conveniently expressed in terms of AND's, OR's, and inversions. Thus,

### 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

### Midterm Exam Review. CS 2420 :: Fall 2016 Molly O'Neil

Midterm Exam Review CS 2420 :: Fall 2016 Molly O'Neil Midterm Exam Thursday, October 20 In class, pencil & paper exam Closed book, closed notes, no cell phones or calculators, clean desk 20% of your final

### Model EXAM Question Bank

VELAMMAL COLLEGE OF ENGINEERING AND TECHNOLOGY, MADURAI Department of Information Technology Model Exam -1 1. List the main difference between PLA and PAL. PLA: Both AND and OR arrays are programmable

### APPENDIX A SHORT QUESTIONS AND ANSWERS

APPENDIX A SHORT QUESTIONS AND ANSWERS Unit I Boolean Algebra and Logic Gates Part - A 1. Define binary logic? Binary logic consists of binary variables and logical operations. The variables are designated

### 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

### 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

### Hours / 100 Marks Seat No.

17320 21718 3 Hours / 100 Seat No. Instructions (1) All Questions are Compulsory. (2) Answer each next main Question on a new page. (3) Figures to the right indicate full marks. (4) Assume suitable data,

### 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

### FUNDAMENTALS OF DIGITAL CIRCUITS

FUNDAMENTALS OF DIGITAL CIRCUITS THIRD EDITION A. Anand Kumar Principal K.L. University College of Engineering K.L. University Green Fields, Vaddeswaram Guntur District Andhra Pradesh Delhi-110092 2014

### Question Total Possible Test Score Total 100

Computer Engineering 2210 Final Name 11 problems, 100 points. Closed books, closed notes, no calculators. You would be wise to read all problems before beginning, note point values and difficulty of problems,

### NH 67, Karur Trichy Highways, Puliyur C.F, Karur District UNIT-II COMBINATIONAL CIRCUITS

NH 67, Karur Trichy Highways, Puliyur C.F, 639 114 Karur District DEPARTMENT OF ELETRONICS AND COMMUNICATION ENGINEERING COURSE NOTES SUBJECT: DIGITAL ELECTRONICS CLASS: II YEAR ECE SUBJECT CODE: EC2203

### UNIT- V COMBINATIONAL LOGIC DESIGN

UNIT- V COMBINATIONAL LOGIC DESIGN NOTE: This is UNIT-V in JNTUK and UNIT-III and HALF PART OF UNIT-IV in JNTUA SYLLABUS (JNTUK)UNIT-V: Combinational Logic Design: Adders & Subtractors, Ripple Adder, Look

### Department of Electrical and Computer Engineering University of Wisconsin - Madison. ECE/CS 352 Digital System Fundamentals.

Department of Electrical and Computer Engineering University of Wisconsin - Madison ECE/C 352 Digital ystem Fundamentals Quiz #2 Thursday, March 7, 22, 7:15--8:3PM 1. (15 points) (a) (5 points) NAND, NOR

### 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

### TEACHING & EXAMINATION SCHEME For the Examination COMPUTER SCIENCE. B.Sc. Part-I

TEACHING & EXAMINATION SCHEME For the Examination -2015 COMPUTER SCIENCE THEORY B.Sc. Part-I CS.101 Paper I Computer Oriented Numerical Methods and FORTRAN Pd/W Exam. Max. (45mts.) Hours Marks 150 2 3

### 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

### Hours / 100 Marks Seat No.

17333 13141 3 Hours / 100 Seat No. Instructions (1) All Questions are Compulsory. (2) Answer each next main Question on a new page. (3) Illustrate your answers with neat sketches wherever necessary. (4)

### BHARATHIDASAN ENGINEERING COLLEGE

BHARATHIDASAN ENGINEERING COLLEGE CS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN (FOR COMMON TO 2 SEM CSE & IT) Lecturer notes Prepared by L.Gopinath M.tech Assistant professor UNIT 1 BOOLEAN ALGEBRS AND

### Digital Design. Verilo. and. Fundamentals. fit HDL. Joseph Cavanagh. CRC Press Taylor & Francis Group Boca Raton London New York

Digital Design and Verilo fit HDL Fundamentals Joseph Cavanagh Santa Clara University California, USA CRC Press Taylor & Francis Group Boca Raton London New York CRC Press is an imprint of the Taylor &

### SRM ARTS AND SCIENCE COLLEGE SRM NAGAR, KATTANKULATHUR

SRM ARTS AND SCIENCE COLLEGE SRM NAGAR, KATTANKULATHUR 603203 DEPARTMENT OF COMPUTER SCIENCE & APPLICATIONS LESSON PLAN (207-208) Course / Branch : B.Sc CS Total Hours : 50 Subject Name : Digital Electronics

### DE Solution Set QP Code : 00904

DE Solution Set QP Code : 00904 1. Attempt any three of the following: 15 a. Define digital signal. (1M) With respect to digital signal explain the terms digits and bits.(2m) Also discuss active high and

### This tutorial gives a complete understanding on Computer Logical Organization starting from basic computer overview till its advanced architecture.

About the Tutorial Computer Logical Organization refers to the level of abstraction above the digital logic level, but below the operating system level. At this level, the major components are functional

### Computer Logical Organization Tutorial

Computer Logical Organization Tutorial COMPUTER LOGICAL ORGANIZATION TUTORIAL Simply Easy Learning by tutorialspoint.com tutorialspoint.com i ABOUT THE TUTORIAL Computer Logical Organization Tutorial Computer

### Written exam for IE1204/5 Digital Design Thursday 29/

Written exam for IE1204/5 Digital Design Thursday 29/10 2015 9.00-13.00 General Information Examiner: Ingo Sander. Teacher: William Sandqvist phone 08-7904487 Exam text does not have to be returned when

### 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

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

### CPE300: Digital System Architecture and Design

CPE300: Digital System Architecture and Design Fall 2011 MW 17:30-18:45 CBC C316 Arithmetic Unit 10122011 http://www.egr.unlv.edu/~b1morris/cpe300/ 2 Outline Recap Fixed Point Arithmetic Addition/Subtraction

### ECE 2030D Computer Engineering Spring problems, 5 pages Exam Two 8 March 2012

Instructions: This is a closed book, closed note exam. Calculators are not permitted. If you have a question, raise your hand and I will come to you. Please work the exam in pencil and do not separate

### Contents. Chapter 3 Combinational Circuits Page 1 of 34

Chapter 3 Combinational Circuits Page of 34 Contents Contents... 3 Combinational Circuits... 2 3. Analysis of Combinational Circuits... 2 3.. Using a Truth Table... 2 3..2 Using a Boolean unction... 4

### COMBINATIONAL LOGIC CIRCUITS

COMBINATIONAL LOGIC CIRCUITS 4.1 INTRODUCTION The digital system consists of two types of circuits, namely: (i) Combinational circuits and (ii) Sequential circuits A combinational circuit consists of logic

### 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

### TWO-LEVEL COMBINATIONAL LOGIC

TWO-LEVEL COMBINATIONAL LOGIC OVERVIEW Canonical forms To-level simplification Boolean cubes Karnaugh maps Quine-McClusky (Tabulation) Method Don't care terms Canonical and Standard Forms Minterms and

### EE 8351 Digital Logic Circuits Ms.J.Jayaudhaya, ASP/EEE

EE 8351 Digital Logic Circuits Ms.J.Jayaudhaya, ASP/EEE 1 Logic circuits for digital systems may be combinational or sequential. A combinational circuit consists of input variables, logic gates, and output

### ECE 2030B 1:00pm Computer Engineering Spring problems, 5 pages Exam Two 10 March 2010

Instructions: This is a closed book, closed note exam. Calculators are not permitted. If you have a question, raise your hand and I will come to you. Please work the exam in pencil and do not separate

### 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

### (Refer Slide Time 6:48)

Digital Circuits and Systems Prof. S. Srinivasan Department of Electrical Engineering Indian Institute of Technology Madras Lecture - 8 Karnaugh Map Minimization using Maxterms We have been taking about