Switching Theory & Logic Design/Digital Logic Design Question Bank


 Tracey Angelina Henry
 3 years ago
 Views:
Transcription
1 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 the original 8bit data word that was written in to memory if 12bit words read out is as follows? [4 4 = 16] (a) (b) (RR,R05,Nov 08SET II,III) (c) (d) RR,R05 Nov 06,mar06,R05 Nov 08) SET I,IV 2. Convert the following to Decimal and then to Hexadecimal. (a) 7448 (b) (c) (d) (e) (f) [ ] (Nov 05,Mar 06,SET II,IV) 3. (a) Perform the following using BCD arithmetic. [2 4 = 8] i ii (b) Convert the following. [4 2 = 8] i. AB16 = ( )10 ii = ( )10 iii = ( )10 iv = ( )16 (RR,R07,Nov 09SET IiI,IV) 4. Convert the following to Decimal and then to Octal. (a) (b) 12EF16 (c) (d) (e) (f) [ ] R07(MAY 10)SET I, II 5. Convert the following to Decimal and then to Binary. (a) (b) ABCD16 (c) (d) (e) (f) [ ] R07(MAY 10)SET III, IV 6. Convert the following to Decimal and then to Binary:(a) (b) A44D16 (c) (d) (e) f) [ ] (Aug2008,S1,4) 7. Convert the following to Decimal and then to Octal. a) (b) 125F16 (c) (d) (e) (f) [ ]. Nov 06 SET2 8. a) What are Hamming Codes? Explain. b) Convert into 2 s complement c) What are signed bits explain with a example. [4+8+4] (RR,R07,MAY10SET IiI,IV) 9. a) What is meant by parity. b) Explain the concept of Error Correcting & Detecting Codes. [5+5] 10 a) find the 2 s complement of the numbers: (i) (ii) b) represent (17)10 in (i) sign magnitude (ii) one s complement (iii) two s complement 11.Perform the following operation using 2 s complement operation. (i) 48, (23) (ii) 23, (48) (iii) (23), (48). 12. a)convert ( ) 8 into its equivalent decimal number. b) Convert ( ) 10 in to octal 13. Convert the following binary numbers to octal numbers a) b) c) Add (23) 8 and (67) 8 15 a) what are the different types of codes. b) write the various binary codes from 0 to 15 in decimal.
2 16 Given a = and b = Find i) a+b ii) ab iii) a.b iv)b+a v)ba 17. a) What is gray code? What are the rules to construct Grey code? Develop the 4 bit gray code for the decimal 0 to 15. b) What is the advantage of 1 s and 2 s complement in computers. Represent +45 and 45 in signmagnitude, sign1 s complement and sign2 s complement representation. [8+8] 18.(a) Construct an even parity seven bit code to transmit the data (b) Find the 10 th element in the base 3 number system. [8+8] (NR)Nov (a) Generate Hamming code for the given 11 bit message and re write the entire message with Hamming code. [8] ( b) The binary numbers listed have a sign bit in the left most position and, if negative numbers are in 2 s complement form. Perform the arithmetic operations indicated and verify the answers. [4 2 = 8] i ii iii iv (a) Write the following binary numbers in signed 1 s complement form and signed 2 s complement form using 16 bit registers. i ii iii iv (b) Perform N1+N2, N1+(N2) for the following 8 bit numbers expressed in a 2 s complement representation. Verify your answers by using decimal addition and subtraction i. N1= , N2= ii. N1= , N2= [10+6] 21 a) What is the necessity of Binary Codes in Computers? b) Convert (2AC5.D) to Binary and then to octal. 22. What are the rules for excess 3 addition? Add two decimal numbers 123 and 658 in XS Write short notes on different types and properties of four bit codes with the aid of suitable example. 24. Perform the subtraction with the following unsigned binary numbers by taking the 2 s complement of the subtrahend. A) B) C) D) The binary numbers listed have a sign bit in the left most position and if negative, are in 1 s complement form. Perform the arithmetic operations indicated and verify the answers. 26. Given the 8bit data word , generate the 12 bit composite word for the hamming code that corrects and detects single errors. 27.Generate hamming code for a 4bit excess3 message to detect and correct single bit errors. BOOLEAN ALGEBRA AND SWITCHING FUNCTIONS: (a) Find the minimal expression for the function f(w,x,y,z)=p(0,2,5,9,15) +Pd (6,7,8,10,12,13) using Karnaughsmap. (b) i. Determine the Canonical sumofproducts form for T(x, y, z) = xy + z + xyz ii. Minimize the function f(x, y, z,w) = x + xyz + wx + xy + wx + xyz. [8+4+4] (R05,NOV 07,SET I) 2. (a) Simplify the following Boolean expressions. [8] i. A C + ABC + AC to three literals ii. (x y + z) + z + xy + wz to three literals iii. A B(D + C D) + B(A +A CD) to one literal iv. (A + C)(A + C )(A + B + C D) to four literals (b) Obtain the complement of the following Boolean expressions. [8] i. B C D + (B + C + D) + B C D E ii. AB + (AC) + (AB + C) iii. A B C + A?BC + AB C + ABC iv. AB + (AC) + AB C (R05,R07,RR,NOV 07,SET I,II) 3. (a) Simplify the function using Karnaugh map method F (A,B,C,D) = P(4,5,7,12,14,15)+ Pd(3,8,10). (b) Give three possible ways to express the function
3 F = A B D + A B C D + ABD + ABCD with eight or less literals. [8+8] 4. (a) Reduce the following Boolean Expressions [8] (R05,NOV 06) i. AB + A(B + C) + B (B + D) ii. A +B + A B C iii. A B + A BC + A BCD + A BC D E iv. ABEF + AB(EF) + (AB) EF (b) Obtain the Dual of the following Boolean expressions. [8] i. x yz + x yz + xy z + xy z ii. x yz + xy z + xyz + xyz iii. x z + x y + xy z + yz iv. x y z + x yz + xy z + xy z + xyz R05(NOV 06,SET I,IV) 5. (a) i. Simplify the Boolean Expression X[Y+Z[(XY + XZ)]. ii. Obtain the simplified expression in SOP form of x z + y z + yz + xyz. (b) Obtain the simplified expression in product of sums F(A, B, C,D) =P (5, 6, 7, 8, 9, 12, 13, 14,).[4+4+8] 6. i. Determine the Canonical sumofproducts form for T(x, y, z) = xy + z + xyz ii. Minimize the function f(x, y, z,w) = x + xyz + wx + xy + wx + xyz. [8+4+4] (R05,NOV 07,SET I) 7. (a) Simplify the following Boolean expressions. [8] i. A C + ABC + AC to three literals ii. (x y + z) + z + xy + wz to three literals iii. A B(D + C D) + B(A +A CD) to one literal iv. (A + C)(A + C )(A + B + C D) to four literals (b) Obtain the complement of the following Boolean expressions. [8] i. B C D + (B + C + D) + B C D E ii. AB + (AC) + (AB + C) iii. A B C + A?BC + AB C + ABC iv. AB + (AC) + AB C (R05,R07,RR,NOV 07,SET I,II) 8. (a) Simplify the function using Karnaugh map method F (A,B,C,D) = P(4,5,7,12,14,15)+ Pd(3,8,10). (b) Give three possible ways to express the function F = A B D + A B C D + ABD + ABCD with eight or less literals. [8+8] 9. (a) Reduce the following Boolean Expressions [8] (R05,NOV 06) i. AB + A(B + C) + B (B + D) ii. A +B + A B C iii. A B + A BC + A BCD + A BC D E iv. ABEF + AB(EF) + (AB) EF (b) Obtain the Dual of the following Boolean expressions. [8] i. x yz + x yz + xy z + xy z ii. x yz + xy z + xyz + xyz iii. x z + x y + xy z + yz iv. x y z + x yz + xy z + xy z + xyz 10. (a) i. Simplify the Boolean Expression X[Y+Z[(XY + XZ)]. ii. Obtain the simplified expression in SOP form of x z + y z + yz + xyz. (b) Obtain the simplified expression in product of sums F(A, B, C,D) =P (5, 6, 7, 8, 9, 12, 13, 14,).[4+4+8] (R 05,Nov 07,set I) 11. (a) For the given function find the min term designation and max term designation F = A'BC + ABC' + ABC + A'B'C (b) Write the Min terms and Max terms for the following functions F1= Σ(1,4,6,7,9) F2 = Π(3,5,7,11,14) [8+8 (R 05,Nov 07,set I) (NOV 06,SET I,IV) 12. Map the following function and simplify using KMap (a) F = (A+B+C) (A+B'+C) (A+B'+C') (A'+B+C) (b) F = (A'BC'D' + A'BC'D + AB'CD + AB'CD' + ABCD + A'B'C'D') [16 (R05,Nov 08,set I) 13. (a) Simplify the following Boolean expressions. [8] i. A C + ABC + AC to three literals ii. (x y + z) + z + xy + wz to three literals iii. A B(D + C D) + B(A +A CD) to one literal iv. (A + C)(A + C )(A + B + C D) to four literals (b) Obtain the complement of the following Boolean expressions. [8] i. B C D + (B + C + D) + B C D E ii. AB + (AC) + (AB + C)
4 iii. A B C + A?BC + AB C + ABC iv. AB + (AC) + AB C (R07,Nov10,set III) 14. (a) Find the complement of the following and show that F.F?=0 and F+F =1. [8] i. F=xy +x y ii. F=(x+y +z)(x +z )(x+y) (b) Obtain the Dual of the following Boolean expressions. [8] i. B C D+(B+C+D) +B C D E ii. AB+(AC) +(AB+C) iii. A B C +A BC +AB C +ABC iv. AB+(AC) +AB C (RR,Nov 06,SET I) 15. (a) i. Simplify the Boolean Expression X[Y+Z[(XY + XZ)]. ii. Obtain the simplified expression in SOP form of x z + y z + yz + xyz. (b) Obtain the simplified expression in product of sums F(A, B, C,D) =P (5, 6, 7, 8, 9, 12, 13, 14,)[4+4+8] (R05,Nov08,set III) 16. (a) Reduce the following Boolean Expressions [8] i. AB + A(B + C) + B (B + D) ii. A +B + A B C iii. A B + A BC + A BCD + A BC D E iv. ABEF + AB(EF) + (AB) EF (b) Obtain the Dual of the following Boolean expressions. [8] i. x yz + x yz + xy z + xy z ii. x yz + xy z + xyz + xyz iii. x z + x y + xy z + yz iv. x y z + x yz + xy z + xy z + xyz 17. a) Simplify the following Boolean functions to minimum number of literals. i) XYXYZ ++ ii) A BAB b) State Duality theorem. List Boolean laws and their duals. [8+8] 18. a)obtain the simplified expression in product of sums F(A, B, C,D) =P (5, 6, 7, 8, 9, 12, 13, 14,). [16] b)obtain the simplified expression in SOP form of x z + y z + yz + xyz.[8] 19. Obtain the complement of the following Boolean expression. a) B C D + (B+C+D) +B C D E b) AB+(AC) +(AB+C) c) A B C+A BC +AB C+ABC. 20. Realize the following circuits using AND, OR, NOT gates. 21. simplify the following Boolean functions to minimum number of literals. (i) F = ABC+ABC +A B (ii) F= y(w(z +z)+xy (iii) F = A B C+ A BC+AB C+ABC. 22. Implement the following Boolean function using only NAND gates. (i) B+ACD+BC (ii) F = A B +A C+B C. 23. Simplify the following Boolean expression (i) A C +ABC+AC to THREE literals (ii) A B(D +C D)+B(A+A CD) to ONE literal. 24. State duality theorem. List Boolean laws and their duals. 25.state and prove the following Boolean laws: i) Commutative ii) Associative iii) Distributive. 26. a) Realize XOR gate using minimum number of NAND gates. b) Prove that ANDOR network is equivalent to NANDNAND network. UNIT II MINIMIZATION OF SWITCHING FUNCTIONS 1. Using Kmap Simplify f(x1, x2, x3, x4, x5, x6) = Pm (0, 3, 4, 5, 7, 8, 12, 13, 20, 21, 28, 29, 31, 34,35, 38, 39,42, 45, 46, 50, 54, 58, 61, 62, 63) [16m] R05 NOV 07,08,,SET I
5 2. Apply Branching method to simplify the following function F (A, B, C, D) =QM(0, 1, 4, 5, 9, 11, 13, 15, 16, 17, 25, 27, 28, 29, 31)d(20, 21, 22, 30). [ [16]R07 May10,Set Map the following function and simplify using KMap (a) F = (A+B+C) (A+B'+C) (A+B'+C') (A'+B+C) (b) F = (A'BC'D' + A'BC'D + AB'CD + AB'CD' + ABCD + A'B'C'D') [16] RR NOV06,SET II 4. Use tabular procedure to simplify the given expression f(v,w,x,y,z) =Pm(0,4,12,16,19,24,27,28,29,31) in SOP form and draw the circuit using only NAND gates. [16]R05 NOV 06,SET I 5. (a) Simplify the Boolean expression using Kmap F= (ABC D)+(A)+(AB D)+(D )( A B C ). [8] (b) Reduce the following function using K map and identify the prime implicant and non prime implicant.f= Pm(2, 3, 6, 7, 10, 11, 12). [8] NR NOV 05 6.(a) Implement the following function using only NOR gates F=a.(b+ c.d) + (b. c) (b) Implement the following function using only NAND gates G=(a + b). (c. d+ e ) (c) Give the minimum twolevel SOP realization of the following switching function using only NAND gates. F(x,y,z) = P m (0,3,4,5,7) [4+4+8]NR NOV 02 SET I 7. Derive the implicant chart for the given expression Is the primeimplicant chart cyclic? Apply the suitable method to find the minimal expression. NR NOV 02 SET II 8. a) Use a Karnaughs map to minimize. _ F = A B C D + A B C D + AB C D + A BCD + ABD + B CD + A B C D NR NOV 02 SET III 9. (i)simplify the logic function f = AB + A C + C + AD + A B C + ABC ii)simplify Boolean function F = A C + A B + AB C + BC 10. (i)find the Complement of the function Y=(A+BC) (B+CA) in its POS form ii)minimise the function using Karnaugh s map method m 11. Determine the canonical Product of sum form for the function and simplify using kmap (a) Y(x,y,z) = x(y'+z) (b) Y(a,b,c) = ab' + bc (c) Y(w,x,y,z) = wxy' + x(y'+z) (d) Y(a,b,c) = (ab + c')(ac + b') NR NOV 02 SETIV 09 R05 [16 ] MAY 07 R05 12.(a) Design a logic circuit to provide an output when any two or three or four switches are closed. (b) Minimize the following Boolean function using Kmap F = Π (2, 7, 8, 9, 10, 12). [8+8] NOV07 R07 6. Design a combinational logic circuit with 4 inputs A, B, C, D. The output Y goes HIGH if and only if B and C inputs go HIGH. Draw the Truth table. Minimize the Boolean function using Kmap. Draw the circuit diagram. [16]JAN 03 OR 13. Explain the type of Hazard if any in the EXCLUSIVE  OR circuit made by five NAND gates and the EXCLUSIVE?OR circuit made by four NAND gates as shown in figure BELOW. [ 16]NOV 09, MECH R09, III/I SEM. 14.a) State Duality theorem. List Boolean laws and their Duals. b) Simplify the following Boolean functions to minimum number of literals: a) xy + xy b) (x + y)(x+y ). c) Realize XOR gate using minimum number of NAND gates. [8+4+4] NOV 07 R07 15.a) State the purpose of reducing the switching functions to minimal form. b) Write the Dual of i) (A+BC +AB) ii) (AB+B C+CD)
6 c) Give the truth table for the Boolean expression (X +Y) [4+8+4] JAN 10 RR 16. (a) Derive Boolean expression for a 2 input ExNOR gate realized with two input NOR gates, without using complemented variables and draw the circuit. (b) Redraw the given circuit (_gure5b) after simpli_cation. [8+8] APR 08,R05 17.(a) For the given function find the min term designation and max term designation F = A'BC + ABC' + ABC + A'B'C (b) Write the Min terms and Max terms for the following functions F1= Σ(1,4,6,7,9) F2 = Π(3,5,7,11,14) [8+8] NOV R09 MECH 18. Apply Branching method to simplify the following function [16] F (A, B, C, D) =QM(0, 1, 4, 5, 9, 11, 13, 15, 16, 17, 25, 27, 28, 29, 31)d(20, 21, 22, 30). MAY 10 R Minimize the the following multiple output functions. f1 = Pm(0, 2, 6, 10, 11, 12, 13) + d(3, 4, 5, 14, 15) f2 = Pm(1, 2, 6, 7, 8, 13, 14, 15) + d(3, 5, 12). [16]NOV 09 RR 20. Give three possible ways to express the function F = A B D + A B C D + ABD + ABCD with eight or less literals. [16]MAY 03 RR ECE, EIE 21 a) Determine the minimal sum of product form of [8+8] i) f(w, x, y, z) = Σm(4, 5, 7, 12, 14, 15) + Ø(3, 8, 10). ii) f(a, B, C, D) = πm(0, 3, 5, 6, 8, 12, 15). JAN 03 OR 22 a) Simplify the following Boolean functions to minimum number of literals. (i) X +Y +XYZ (ii) (A+B) (A+B) b) State Duality theorem. List Boolean laws and their duals. [8+8] 23.a) Draw a logic diagram using only twoinput NAND gates to implement the following expression: (AB + A'B') (CD' + C'D) [8+8] b)derive the circuits for a threebit parity generator and fourbit parity checker using odd parity bit. 24..Simplify the following Boolean expressions and implement by using only NAND gates. (i) Y AABAB ( )( B ) [8+8] (ii) Z ( ABACB () () C ) 25.State the basic laws of Boolean algebra and explain. [16] Unit III COMBINATIONAL LOGIC DESIGN 1. a) Differentiate synchronous and asynchronous circuits. ( R07,R05 JUN2010, Set2),RR SET II,IV b) Design a 2 to 4 decoder using NAND gates. [8+8]( R05 JUN2010, Set2) 2.a) What is Encoder? Design decimal to BCD Encoder. b) Explain how a decoder can be converted in to a demultiplexer with relevant block diagrams and truth tables. [10+6] RR JUN10 SET 4 3. a) What is decoder? Construct 3*8 decoder using logic gates and truth table. b) Implement full adder using decoder and OR gates. [8+8]RR,R05,R07 JUN 07,MAY a) Design a converter circuit which converts 8,4,2,1 code to 8,4,2,1 code b) Implement a Full adder using decoder and logic gates [8+8]RR,R05 JUN,05,10 SET 1,4 5.List the applications of Multiplexer and Demultiplexer. [8]RR,R05 NOV,05,06, SET 6.Write short notes on any Three: SOP and POS forms. PLA and PAL. RAM, ROM, EPROM and E 2 PROM. Multiplexer and decoder Nov 09 R05 MECH,EIE
7 8.a) List the advantages of synchronous counters over ripple counters. b)using a shift register and a combinational logic circuit, design a sequence generator which will generate the binary seque RO7 MAY 10 OR APR 04 9.a)Draw the block diagram of BCD Adder and explain its operation. b)explain the construction of a Johnson counter. R05 APR 08,OR,NR MAY 02, Implement Full adder circuit using ROM and Verify the working. (i) (JUN2010, Set2) Unit IV SEQUENTIAL CIRCUITSI (ii) (JUN2010, Set2) (iii) (JUN2010, Set2) (iv) (JUN2010, Set4) (v) (JUN2010, Set4) (R 07 JUN2010, Set1) 6. a) Differentiate Latch and flipflop. Explain the construction of SR Latch. b) Construct a DLatch and explain its operation. [8+8] (R 07 JUN2010, Set2) 7. a) Differentiate edge triggering, Level triggering and Pulse triggering. b) Design a clocked JK flip flop. Explain its operation with the help of characteristic table and characteristic equation. Give the symbol of edge triggered JK flipflop. [8+8]
8 (RRJUN05, Set2) 8. a) Design a 4bit Bidirectional Shift Register. b) Convert D flip op to T flip flop. [8+8] (RR JUN 10) 9.a) Explain the operation of a masterslave JK flip flop in each clock cycle over a period of six consecutive clocks. b) Explain the operation of a Johnson counter with neat diagram. [16] 10. a) Draw the logic, diagram of a JK flip flop and using excitation table, explain its operation. b) Explain the operations of a 4bit synchronous binary counter with neat diagram. [8+8] 11 a) Give the excitation tables of all flip flops and explain. b) Convert D flip flop in to T, JK and SR flip flop. [8+8] 12 a) What is the basic difference between a pulse mode and level mode circuits. b) Draw a neat circuit diagram of positive edge trigged JK flip flop and explain. [8+8] 13. (a) Compare synchronous & Asynchronous circuits (b) Design a Mod6 synchronous counter using JK flip flops. [6+10] (R07 JUN2010, Set2) 14.a) Define state diagram. Explain the procedure to reduce the state diagram. b) For the state diagram shown, obtain the state table and design the circuit using minimum number of JK Flip Flops. (R05 APR 08) 15.a) Design a BCD counter with JK flip flops. b) Draw the diagram of a 4bit Binary ripple counter using flip flops that trigger on the positive edge.16] Unit V : PROGRAMMABLE LOGIC DEVICES 1.Give the circuit implementation of a 4bit carry look aheader carry? b) Give the implementation of a 2bit magnitude comparator? c)bring out the differences among PAL and PLA? 2.a) Write in detail about types of Read only memories. b) Write in detail to program a ROM to implement Boolean functions. [8+8] ( R07 JUN2010, Set2,4) 3.Write about Programmable Array Logic. Mention the advantages of Programmable Array logic. Represent the conventional symbol and array logic symbol of PAL. Give the internal connections of PAL. [16](R07JUN2010 Set4] 4. Implement the following functions using PAL and PLA F1 = m (2,3,4,7,8,11) Σ F2 = m (1,3,5,7,9,11,13,15) [16]MAY 03 (ECE & EIE) 5. a) Generate a PLA program table to design a BCD to excess 3 code converter. b) Write brief note o n multi gate synthesis of threshold logic. [8+8] RR JUN 10,R05 JUN 10,RR NOV 09,R05 NOV a) Write a note on PROM, PAL and PLA architecture. b) Implement a full sub tractor using ROM[8+8] RR JUN 10,R05 JUN 10,RR,R05 NOV Derive the PLA programming table for the combinational circuit that squaresa 3 bit number. [16]
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,
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 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 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 informationwww.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/080230012DIGITAL
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 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 informationR10. 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
More informationR 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 demorgan laws c) Implement two input EXOR gate from 2 to 1 multiplexer (3M) d) Write the demerits of PROM (3M) e) What
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 informationInjntu.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 Kmap? Name it advantages and disadvantages. (3M) c) Distinguish between a halfadder
More informationSUBJECT 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
More informationR07. 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
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 informationCOLLEGE 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
More informationUNIT I BOOLEAN ALGEBRA AND COMBINATIONAL CIRCUITS PARTA (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.
More informationHANSABA 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)
More informationVALLIAMMAI 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
More informationINSTITUTE 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
More informationPART B. 3. Minimize the following function using Kmap 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 (PartA
More informationENDTERM EXAMINATION
(Please Write your Exam Roll No. immediately) ENDTERM EXAMINATION DECEMBER 2006 Exam. Roll No... Exam Series code: 100919DEC06200963 Paper Code: MCA103 Subject: Digital Electronics Time: 3 Hours Maximum
More informationR07
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
More informationVALLIAMMAI ENGINEERING COLLEGE
VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur 603 203 DEPARTMENT OF INFORMATION TECHNOLOGY QUESTION BANK Academic Year 2018 19 III SEMESTER CS8351DIGITAL PRINCIPLES AND SYSTEM DESIGN Regulation
More informationII/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
More informationINSTITUTE 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
More informationNADAR SARASWATHI COLLEGE OF ENGINEERING AND TECHNOLOGY Vadapudupatti, Theni
NADAR SARASWATHI COLLEGE OF ENGINEERING AND TECHNOLOGY Vadapudupatti, Theni625531 Question Bank for the Units I to V SEMESTER BRANCH SUB CODE 3rd Semester B.E. / B.Tech. Electrical and Electronics Engineering
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 informationSIR 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.201718 INSTRUCTOR: Sri A.M.K.KANNA
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 informationKINGS 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
More informationHours / 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)
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 informationDigital 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
More informationPrinciples 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)
More information(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
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 informationSHRI 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
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 informationCONTENTS 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...
More informationMGUBCA205 Second Sem Core VI Fundamentals of Digital Systems MCQ s. 2. Why the decimal number system is also called as positional number system?
MGUBCA205 Second Sem Core VI Fundamentals of Digital Systems MCQ s Unit1 Number Systems 1. What does a decimal number represents? A. Quality B. Quantity C. Position D. None of the above 2. Why the
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 informationDE 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
More informationCS/IT DIGITAL LOGIC DESIGN
CS/IT 214 (CR) Total No. of Questions :09] [Total No. of Pages : 02 II/IV B.Tech. DEGREE EXAMINATIONS, DECEMBER 2016 First Semester CS/IT DIGITAL LOGIC DESIGN Time: Three Hours 1. a) FlipFlop Answer
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 informationScheme G. Sample Test PaperI
Sample Test PaperI 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
More informationENGINEERS 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 informationPhiladelphia University Student Name: Student Number:
Philadelphia University Student Name: Student Number: Faculty of Engineering Serial Number: Final Exam, First Semester: 2018/2019 Dept. of Computer Engineering Course Title: Logic Circuits Date: 03/01/2019
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 information2. (a) Compare the characteristics of a floppy disk and a hard disk. (b) Discuss in detail memory interleaving. [8+7]
Code No: A109211202 R09 Set No. 2 1. (a) Explain the purpose of the following registers: i. IR ii. PC iii. MDR iv. MAR. (b) Explain with an example the steps in subtraction of two ndigit unsigned numbers.
More informationCOPYRIGHTED MATERIAL INDEX
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
More informationUPY14602DIGITAL ELECTRONICS AND MICROPROCESSORS Lesson Plan
UPY14602DIGITAL ELECTRONICS AND MICROPROCESSORS Lesson Plan UNIT I  NUMBER SYSTEMS AND LOGIC GATES Introduction to decimal Binary Octal Hexadecimal number systemsinter conversionsbcd code Excess
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 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 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 informationDIGITAL 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
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 informationAPPENDIX 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
More informationKING 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:0011:50AM Class
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 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 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 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 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 informationGATE CSE. GATE CSE Book. November 2016 GATE CSE
GATE CSE GATE CSE Book November 2016 GATE CSE Preface This book is made thanks to the effort of GATE CSE members and Praneeth who made most of the latex notes for GATE CSE. Remaining work of completing
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 informationDIRECTORATE 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
More information6.1 Combinational Circuits. George Boole ( ) Claude Shannon ( )
6. Combinational Circuits George Boole (85 864) Claude Shannon (96 2) Signals and Wires Digital signals Binary (or logical ) values: or, on or off, high or low voltage Wires. Propagate digital signals
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 informationii) Do the following conversions: output is. (a) (101.10) 10 = (?) 2 i) Define XNOR gate. (b) (10101) 2 = (?) Gray (2) /030832/31034
No. of Printed Pages : 4 Roll No.... rd 3 Sem. / ECE Subject : Digital Electronics  I SECTIONA Note: Very Short Answer type questions. Attempt any 15 parts. (15x2=30) Q.1 a) Define analog signal. b)
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 information3. 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
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 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 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 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 information1. Draw general diagram of computer showing different logical components (3)
Tutorial 1 1. Draw general diagram of computer showing different logical components (3) 2. List at least three input devices (1.5) 3. List any three output devices (1.5) 4. Fill the blank cells of the
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 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 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 informationNH 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
More informationHours / 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,
More informationLogic 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
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 informationELCT 501: Digital System Design
ELCT 501: Digital System Lecture 4: CAD tools (Continued) Dr. Mohamed Abd El Ghany, Basic VHDL Concept Via an Example Problem: write VHDL code for 1bit adder 4bit adder 2 1bit adder Inputs: A (1 bit)
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 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 informationThis 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
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 informationQuestion 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,
More informationComputer 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
More informationFinal Exam Solution Sunday, December 15, 10:0512:05 PM
Last (family) name: First (given) name: Student I.D. #: Circle section: Kim Hu Department of Electrical and Computer Engineering University of Wisconsin  Madison ECE/CS 352 Digital System Fundamentals
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 informationDigital Logic Design Exercises. Assignment 1
Assignment 1 For Exercises 15, match the following numbers with their definition A Number Natural number C Integer number D Negative number E Rational number 1 A unit of an abstract mathematical system
More informationEE 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
More informationCombinational 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
More informationDigital Logic Design And Computer Organization
Digital Logic Design And Computer Organization UNITI Computer Types Computer: Computer is a fast electronic calculating machine that accepts digitized input information,processes it according to a list
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 informationCOMBINATIONAL 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
More information