BHARATHIDASAN ENGINEERING COLLEGE Degree / Branch : B.E./ECE Year / Sem : II/ III Sub.Code / Name : EC6302/DIGITAL ELECTRONICS


 Emerald Stafford
 3 years ago
 Views:
Transcription
1 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 Part A 1. Apply DeMorgan s theorem to simplify A+BC. (MAY 2013) 2. Define the term prime implicants and Essential prime implicants. (MAY 2013) 3. Draw the XOR logic using only NAND gates. (NOV 2013) 4. Implement the following Boolean function with NOR NOR logic F = Π(0,2, 4,5,6) (NOV 2013) 5. Implement Y= AB+A+(B+C) using NAND gate only. (MAY 2014) 6. Define minterm & Maxterm. Give examples. (MAY 2014) 7. Simplify the given Boolean Expression F= x +xy+xz +xy z. (NOV 2014) 8. State Demorgan s theorem. (NOV 2014) 9. Simplify the following Boolean function. (MAY 2015) i) x(x +y) ii) xy+x z+yz 10. Show that A+A B=A+B using the theorems of Boolean algebra. (MAY 2015) 11. Realize F = A B+AB using minimum universal gates. (NOV 2015) 12. Convert Y= A+BC'+AB+A'BC into canonical form. (NOV 2015) 13. Write down fanin & fanout of a standard TTL IC. (MAY 2016) 14. Prove that AB+A C+BC = AB + A C (MAY 2016) 15. Implement the following Boolean function with NAND NAND logic F = (0,1, 3, 5) 16. What are don t care terms?
2 17. Define noise margin. 18. Convert the following function into sum of product form (AB+C)(B+C D). 19. Define the term (i). Propagation delay (ii). Power dissipation 20. Define canonical form. Express F=BC +AC in a canonical SOP form. 21. Simplify the following expression X.Y+X(Y+Z)+Y(Y+Z). NOV Why totem pole outputs cannot be connected together. NOV Name the universal gates? Why are they called so. MAY Simplify F=xy+xy. MAY 2017 PARTB 1. i). Simplify the following function using K map, (MAY 2014) f=abcd+ab C D +AB C+AB & realize the SOP using only NAND gates and POS using only NOR gates (10) ii) Show that if all the gate in a twolevel ORAND gate network are replaced by NOR gate, the output function does not change. (6) 2. i). Using Quine McCluskey method, examine the given function. F(A,B,C,D)= m(1,2,3,7,8,9,1011,14,15). (10) ii). Explain the operation of 3 input TTL NAND gate with required diagram & truth table. (6) (MAY 2014) 3. (i) Use QM method to simply the Boolean expression (NOV 2015) (x1,x2,x3,x4,x5)=σ(0,1,4,5,16,17,21,25,29) (10) ii). Draw the circuits of 2 input NAND & 2 input NOR gate using CMOS. (6) 4. i). Using Quine McCluskey method Simplify the Boolean expression (NOV 2015) F(v,w,x,y,z) = Σ (4,5,9,11,12,14,15,27,30) +Σd(1,17,25,26,31) (10) ii). Explain the working of a basic totempole TTL 2 input NAND gate. (6) 5. i).find a minimal SOP representation for (MAY 2015) f(a,b,c,d,e) = Σm(1,4,6,10,20,22,24,26) + d(0,11,16,27) using Kmap method. Draw the circuit of the minimal expression using only NAND. (12) ii). Obtain 3 level NOR NOR implementation of f = [ab + cd] ef (4) 6. (i) Explain Tristate TTL inverter circuit diagram and its operation. (ii) How would you express the Boolean function using Kmap and draw the logic diagram. F(w,x,y,z)= m(0,1,2,4,5,6,8,9,12,13,14) (MAY 2015) 7. Find a minimal SOP representation for (NOV 2015) f(a,b,c,d,e)=σm(1,4,6,10,20,22,24,26)+ d(0,11,16,27) using Kmap method. Draw the circuit of the minimal expression using only NAND. (ii) Express the Boolean function F=XY+X Z in product of maxterm. (4) 8. (i) Design the given function using Quine McCluskey method and Verify your result using Kmap. F= m(0,1,2,4,5,6,8,9,12,13,14)
3 (ii) Draw the schematic and explain the operation of a CMOS inverter. Also explain its characteristics. (NOV 2015) 9. Simplify the 5 variable switching function using Karnaugh map (MAY 2016) F(A,B,C,D,E)=Σm(3,5,6,8,9,12,13,14,19,22,24,25,30). (10) (ii) Implement the expression Y (A, B, C) = ΠM (0, 2, 4, 5, 6,) using only NORNOR logic. (6) 10. (i) Analyze the basic rules (laws) that are used in Boolean expressions with example. (MAY 2016) (ii) Simplify using Kmap to obtain minimum POS expression(a +B +C+D) (A+B +C+D) (A+B+C+D ) (A+B+C +D ) (A +B+C+D ) (A+B+C +D). (8) 11.(i) Find the MSOP representation for F(A,B,C,D,E) = m(1,4,6,10,20,22,24,26)+d(0,11,16,27) using Kmap method. Draw the circuit of the minimal expression using only NAND gates. (7) (NOV 16) (ii) With neat circuit diagram, explain the function of 3input TTL NAND gate. (6) 12. What are advantages of using tabulation method? Determine the Minimal sum of products for the Boolean expressions F= Σm(1,2,3,7,8,9,10,11,14,15) using tabulation method. (13) (NOV 16) 13. (i) Express F=A+B C in a sum of minterms. (6) (MAY 2017) (ii) Using Quine McCluskey method minimize the function F= Σm(0,5,7,8,9,10,11,14,15). (10) (MAY 2017) 14. Simplify the logic function F= Σm(10,11,14,15) and implement using NAND gates. (10) (MAY 2017) UNIT 2 COMBINATIONAL CIRCUITS 2 marks 1. Define half adder and full adder. (MAY 2013) 2. Define half subtractor and full subtractor. (MAY 2013) 3. What is a combinational circuit? Give an example. (NOV 2013) 4. Write an expression for borrow and difference in a full subtractor circuit. (NOV 2013) 5. List the advantage of look ahead carry? When should it be used? (MAY 2014) 6. Distinguish between Decoder and Demultiplexer. (MAY 2014) 7. Write down the truth table of a half subtractor. (NOV 2014) 8. Convert gray code into its binary equivalent. (NOV 2014) 9. Define magnitude comparator. (MAY 2015)
4 10. Compare the serial and parallel adder. (MAY 2015) 11. Define look ahead carry addition. (NOV 2015) 12. Relate carry generate, carry propagate, sum and carryout of a Carry look ahead adder. (NOV 2015) 13. Build a 4:1 mux using only 2:1 mux. (MAY 2016) 14. Draw the circuit of 2 bit even and odd parity checker and generator. (MAY 2016) 15. What is a decoder? 16. What do you mean by encoder? 17. What is a priority encoder? 18. What is a multiplexer? 19. Give applications of multiplexer? 20. Design a Half subtractor using gates. 21. Draw a full adder using two half adders and an OR gate. 22. Draw the logic diagram of 4bit parallel adder/subtractor. 23. Design a full subtractor using gates. 24. Write about the design procedure for combinational circuits. (NOV 2016) 25. Draw the logic diagram and truth table of Full adder. (NOV 2016) 26. Write the truth table for half subtractor. MAY Convert a decoder into a demultiplexer. MAY MARK QUESTIONS 1. (i) Design a Binary to Gray code converter. (MAY 2014) (ii) Design a half adder and full adder circuits. 2. (i) Explain the concept of carry look ahead adder with neat logic diagram. (ii) Implement full subtractor using Demultiplexer. (MAY 2014) 3. (i) Design a 4bit Magnitude Comparator with 3 outputs; A>B,A=B,A<B. (ii) Explain even parity checker and generator. (NOV 2015) 4. (i) Design a BCD to Gray code converter. Use don t cares.
5 (ii) Design a half subractor and design a subractor. (NOV 2015) 5. Design a 4bit binary to BCD code converter. (MAY 2015) 6. Design a combinational circuit to convert Excess3 code to BCD code. (MAY 2015) 7. i) Design an 8X1 MUX using only 4 X1 MUX. (8) (NOV 2015) ii) Realize F(w,x,y,z)=S(1,4,6,7,8,9,10,15) using 4 to 1 Mux (8) 8. Design a BCD adder to add two BCD digits. (NOV 2015) 10. Design a combinational logic circuit to compare two 2 bit binary numbers A and B and to Generate the outputs A<B,A=B and A>B (MAY 2016) 11. (i) Design and implement the conversion circuit for BCD to Excess 3 code (10) (MAY 2016) (ii) Draw & explain the block diagram of a 4bit parallel adder / Subtractor (6) 12. (i) Design a BCD adder and explain its working with necessary circuit diagram. (ii) Draw & explain the block diagram of a 4bit serial adder to add contents of two registers. 13. (i) Design and explain 1 of 8 demultiplexer. (8) (NOV 16) (ii) What is parity checker? (5) 14. Describe the operation of 3bit magnitude comparator. (13) (NOV 16) 15. (i) Explain the carry look ahead adder with a diagram. (10) (MAY 2017) (ii) Implement the function y=ab and y=a+b using 2:1 MUX. (6) 16. Implement BCD to 7 segment code converter. (16) (MAY 2017) UNIT III SEQUENTIAL CIRCUITS Part A 1. Compare Asynchronous and Synchronous sequential logic. (MAY 2013) 2. Draw the state diagram and characteristics equation of a D FF. (MAY 2013) 3. What is latch? What is the difference between latch and flip flop? (NOV 2013)
6 4. Realize T Flip Flop using SR Flip Flop. (NOV 2013) 5. How does the JK FF differ from an SR FF in its basic equation? (MAY 2014) 6. Define Synchronous counter. (MAY 2014) 8. What is the condition on JK FF to work as D FF? (NOV 2014) 9. What is race around condition? How do you eliminate it? (NOV 2014) 10. Mention any two differences between the edge triggering and level triggering. (MAY 2015) 11. Draw the state diagram of MOD 10 counters. (MAY 2015) 12. What is sequential circuit? Give some example. (NOV 2015) 13. Draw a NAND based logic diagram of Master Slave JK FF. (NOV 2015) 14. Convert Transparent flip flop into a JK flip flop. (MAY 2016) 16. Define the terms State table and State Assignment. (MAY 2016) 18. Draw the state table and excitation table of T flip flop. 19. How many Flip Flops are required to build a binary counter that counts from 0 to Name the different types of shift registers. 21. What is a sequential circuit? 22. Distinguish between latch and flipflop. 23. Write the flipflop excitation tables for JK and T FF. 24. What is counter? 25. What is a shift register? 26.Derive the characteristic equation of T flip flop 27.What is the minimum of Flip flops required to build a counter of modulus 8 28.Draw the logic diagram for T flip flop. 29. What is modulo n counter? 30. How many states are there in a 3 bit ring counter? What are they? 31. Define race around condition in flip flop. NOV Draw Dlatch with truth table. NOV Give some basic applications of flip flops. MAY What is meant by modulus of a counter? MAY 2017
7 16 MARK QUESTIONS 1. i) Draw a 4 bit serial in parallel out (SIPO) and explain its operation. (8) (MAY 2014) ii) Explain the operation universal shift register with neat block diagram (8) (MAY 2014) 2. With a neat state diagram and logic diagram,design and explain the sequence of states of BCD counter (16) (MAY 2014) 3. (i) Draw the circuit and explain the working operation of JK Master Slave flipflop. (ii) Provide the characteristic table, characteristic equation and excitation table of D flip flop And JK flip flop. (NOV 2015) 4. Using JK flipflops, design a synchronous counter which counts in the sequence 000, 111, 101, 110, 001, 010, 000 (NOV 2015) 5. Design a binary counter using T flipflops to count pulses in the following sequence (i) 000, 001, 010, 011, 100, 101, 110, 111, 000 (8) (ii) 000, 100, 111, 010, 011, 000 (8) (MAY 2015) 6. (i) Design and explain the working of a MOD11 counter. (MAY 2015) (ii) Design and explain the working of a updown ripple counter 7. (i) Design a Mod 5 Asynchronous counter draw the wave forms. (8marks) (NOV 2015) (ii) How can a D flip flop converted into a T flip flop. (8marks) 8. Using JK flipflops, design a synchronous counter which counts in the sequence 2,6,1,7,5,4 and repeat. (NOV 2015) 9. (i) Using RS flipflops, design a Parallel counter which counts in the sequence 000, 111, 101, 110, 001, 010, 000 (MAY 2016) ii) Draw the four bit Johnson counter and explain the operation (8) (MAY 2016) 10. (i) Draw a 4bit SISO SIPO, PIPO and PISO shift register and draw its waveforms. (ii) Design a counter to count the sequence 0, 1, 2, 4, 5, 6,...using SR FF s.
8 11. (i) Explain the operation of JK flipflop with neat diagram. (6) (NOV 16) (ii) Explain the operation of SerialinSerialout shift register. (7) 12. Design synchronous MOD6 counter. (13) (NOV 16) 13. (i) Write the characteristic table, equation and excitation table of a JK flip flop and T flip flop. (6) (ii) Design a mod6 synchronous counter using TFFs. (10) (MAY 2017) 14. (i) What is a serial adder? Explain. (8) (MAY 2017) (ii) With Truth table and timing diagram explain the operation of 4 bit ring counter. (8) UNIT IV MEMORY DEVICES Part A 1. How the memories are classified. (MAY 2013) 2. What is an EPROM? (MAY 2013) 3. Compare and contrast static RAM and dynamic RAM. (NOV 2013) 4. What is PLD? List their types. (NOV 2013) 5. Distinguish between PAL and PLA. (MAY 2014) 6. Which memory is called volatile? Why? (MAY 2014) 7. Write the advantages of EPROM over a PROM. (NOV 2014) 8. Compare the features of PROM, PAL and PLA. (NOV 2014) 10. What is PLA? How does it differ from PAL and PROM? (MAY 2015) 11. What is memory decoding? (MAY 2015) 12. Implement the ExclusiveOR function using PROM. (NOV 2015) 13. Write the advantages of E2PROM over an EPROM. (NOV 2015) 14. Implement the function F1= (0, 1, 2, 5, 7) and F2 = (1, 2, 4, 6) using PROM. (MAY 2016) 15. Draw the static and dynamic RAM cells. (MAY 2016) 16. Implement a 2bit multiplier using ROM.
9 17. What is meant by memory expansion? Mention its limit. 18. Compare PLD s with FPGA. 19. Draw the equivalent logic circuit of a binary memory cell that stores one bit of information. 20. What is volatile and Nonvolatile memory? 21. Briefly explain about EEPROM. NOV What is programmable logic array? How it differs from ROM? NOV What is the disadvantages of dynamic RAM cell? MAY How PAL differs from ROM? MAY 2017 Part B 1. i). Give the classification of semiconductor memories (8) ii). Implement the following function using PLA F1= (2, 4, 5, 10, 12, 13, 14) and F2 = (2, 9, 10, 11,13, 14, 15). (MAY 2014) 2. i). Realized BCD to Excess3 code using PROM array. ii). A combinational circuit is defined as the functionf1 = AB C +AB C+ABC and F2 = A BC+AB C+ABC. Implement the digital circuit with a PLA having 3 inputs, 3 product terms and 2 outputs. (8) (MAY 2014) 3. i). Write short note on RAM, types of ROMs (10) (NOV 2015) ii). Implement the following function using PLA F1= (0, 1, 2, 4) and F2 = (0, 5, 6, 7). (6) 4. i). Realize the following function using PAL F1(x, y, z) = (1, 2, 4, 5, 7), F2(x, y, z) = m(0, 1, 3, 5, 7) (8) ii). Write a note on FPGA with neat diagram. (8) (NOV 2015) 5. i).write short notes on PLD, types of PLDs. (8) ii). Implement the following Boolean function using PLA, F1(x, y, z) = (0, 1,3, 5) and F2(x, y, z) = (3, 5, 7) (8) (MAY 2015) 6. (i) Design using PAL the following Boolean functions W(A,B,C,D) = (2, 12, 13) X(A,B,C,D) = (7, 8, 9, 10, 11, 12, 13, 14, 15) Y(A,B,C,D) = (0, 2,3, 4, 5, 6, 7, 8, 10, 11, 15) Z(A,B,C,D) = (1, 2, 8, 12, 13) ii). Describe the RAM organization. (8) (MAY 2015) 7. i). Explain the principle of operation of Bipolar SRAM cell. (8) (NOV 2015)
10 ii). Write short notes on EPROM and EEPROM. (8) 8. Implement the following Boolean functions using PAL (16) (NOV 2015) i. W(A, B, C, D) = (0, 2, 6, 7, 8, 9, 12, 13) ii. X (A, B, C, D) = (0, 2, 6, 7, 8, 9, 12, 13, 14). iii. Y(A, B, C, D) = ( 2, 3, 8, 9, 10, 12, 13) iv. Z(A, B, C, D) = (1, 3, 4, 6, 9, 12, 14) 9. (i)a combinational circuit is defined by the functions (8) (MAY 2016) F1(A,B,C)=Σ(3,5,6,7) F2(A,B,C)=Σ(0,2,4,7) implement the circuit with a PLA. (ii) A combinational circuit is defined by the functions F1 = m(1,3,5),f2 = m(5,6,7). Implement the circuit with a PLA having 3 inputs, 3 product terms and two outputs. (8) 10. Differentiate static and dynamic RAM. Draw the circuits of one cell of each and explain its working principle. (13) (NOV 16) 11. Write short notes on: (13) (NOV 16) (i) PAL (ii) FPGA. 12. (i) Describe the RAM organization and explain the write and read operations. (10) (ii) Discuss on various types of ROM. (6) (MAY 2017) 13. (i)implement the functions A(x,y,z)= m(1,2,4,6) and B=(x,y,z)= m(0,1,6,7) using (1) ROM (2) PLA (8) (ii) Outline the features of various programmable logic devices. (8) (MAY 2017)
11 UNIT V SYNCHRONOUS AND AYNCHRONOUS SEQUENTIAL CIRCUITS 1. Define asynchronous sequential circuit. (MAY 2013) 2. State the difference between the synchronous and asynchronous sequential circuits. (MAY 2013) 3. What is a fundamental mode asynchronous sequential circuits. (NOV 2013) 4. What is a critical race? Why should it be avoided? (NOV 2013) 5. Define cycle. (MAY 2014) 6. Define Hazard. (MAY 2014) 7. Define race, critical race and noncritical race. (NOV 2014) 8. Define a primitive flow table. (NOV 2014) 9. What is Static 1 Hazard? (MAY 2015) 10. Define static Hazard. (MAY 2015) 11. Define Glitch. (NOV 2015) 12. What is a dynamic hazard? (NOV 2015) 13. What is essential hazard? (MAY 2016) 14. What are Mealy and Moore machines? (MAY 2016) 15. What is a race? 16. What is a cycle? 17. What is shared row state assignment? 18. Mention any advantage and disadvantage of asynchronous sequential circuits. 19. Define static 0hazard,static 1hazard and dynamic hazard. 20. What is the difference between Mealy machine and Moore machine 21.Explain the procedure for state minimization. 22. What is pulse mode circuit? 23. What are the types of Hazards? 24.What are the assumptions made for pulse mode circuit? 25. What are the assumptions made for fundamental mode circuit? 26. Define Critical race and Non Critical race. NOV 2016
12 27. What is hazard and give it types? NOV Compare mealy and moore machine. MAY List the effects due to hazards in logic circuits. MAY MARK QUESTIONS 1. i)give examples for critical race and cycle and explain. (MAY 2014) ii) Describe the hazards with neat circuit diagram. 2. Give the hazard free realization for the following functions. (MAY 2014) f(a, b, c, d) = m (0, 2, 6, 7, 8, 10, 12) 3.Design an asynchronous sequential circuit that has two inputs X2 and X1 and one output z. When x1 = 0, the output Z is 0. The first change in X2 that occurs while X1 is 1 will cause output Z to be 1. The output Z will remain 1 until X1 returns to zero. (NOV 2015) 4. An asynchronous sequential circuit has two internal states and one output. The excitation and output function describing the circuit are as follows. Y1 = x1x2 + x1y2 + x2y1 Y2 = x2 + x1y1y2 + x1y1 Z = x2 + y1 (NOV 2015) 5. i) Give hazardfree realization for the following Boolean function F(A,B,C,D)=Σm(1,3,6,7,13,15) (MAY 2015) ii) Summarize the design procedure for asynchronous sequential circuit. 6. An asynchronous sequential circuit is described by the following excitation and output function. map. Y=X1X2+(X1+X2)Y i) Draw the logic diagram. ii) Derive the transition table and output iii) Describe the behavior of the circuit. (MAY 2015) 7. An asynchronous circuit described by the following excitation and output function Y=X1.X2+(X1+X2).Y Z=Y Draw the logic diagram of the circuit. Derive the transition table and output map. Describe the behavior of the circuit. (NOV 2015) 8. What are the problems in asynchronous circuits and what are essential hazards and static hazards how it can be eliminated. (NOV 2015) 9.(i).Give the hazard free realization for the following functions. (MAY 2016)
13 f(a, b, c, d) = m (1,3,6,7,13,15) (8marks) (ii) Summarize the design procedure for asynchronous sequential circuit. ( 8marks ) 10.Explain essential, static and dynamic Hazards in Digital circuit. Give the hazard free realization for the following functions. F(I,J,K,L) = m (1,3,4,5,6,7,9,11,15) (MAY 2016) 11. i) Differentiate critical races from noncritical races. (6) NOV 2010 ii) Explain the steps involved in the reduction of state table. (10) 12. Explain the steps involved in the design of asynchronous sequential circuit. (13) (NOV 16) 13. Design an asynchronous circuit that will output only the second pulse received and ignore any other pulse. (13) (NOV 16) 14. (i) Draw the general model of a sequential circuit and explain. (6) (MAY 2017) (ii) List out the steps involved in the design of synchronous sequential circuit. (10)
VALLIAMMAI 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationCode No: R Set No. 1
Code No: R059210504 Set No. 1 II B.Tech I Semester Supplementary Examinations, February 2007 DIGITAL LOGIC DESIGN ( Common to Computer Science & Engineering, Information Technology and Computer Science
More informationR 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 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 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 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 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 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 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 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 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 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 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 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 informationCode No: 07A3EC03 Set No. 1
Code No: 07A3EC03 Set No. 1 II B.Tech I Semester Regular Examinations, November 2008 SWITCHING THEORY AND LOGIC DESIGN ( Common to Electrical & Electronic Engineering, Electronics & Instrumentation Engineering,
More 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 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 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 informationSwitching Theory & Logic Design/Digital Logic Design Question Bank
Switching Theory & Logic Design/Digital Logic Design Question Bank UNIT I NUMBER SYSTEMS AND CODES 1. A 12bit Hamming code word containing 8bits of data and 4 parity bits is read from memory. What was
More 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 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 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 informationDIGITAL 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
More informationModel 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
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 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 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 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 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 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 information1. Mark the correct statement(s)
1. Mark the correct statement(s) 1.1 A theorem in Boolean algebra: a) Can easily be proved by e.g. logic induction b) Is a logical statement that is assumed to be true, c) Can be contradicted by another
More informationDigital Design Using Digilent FPGA Boards  Verilog / ActiveHDL Edition
Digital Design Using Digilent FPGA Boards  Verilog / ActiveHDL Edition Table of Contents 1. Introduction to Digital Logic 1 1.1 Background 1 1.2 Digital Logic 5 1.3 Verilog 8 2. Basic Logic Gates 9
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 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 informationFinal Examination (Open Katz, asynchronous & test notes only, Calculators OK, 3 hours)
Your Name: UNIVERSITY OF CALIFORNIA AT BERKELEY BERKELEY DAVIS IRVINE LOS ANGELES RIVERSIDE SAN DIEGO SAN FRANCISCO Department of Electrical Engineering and Computer Sciences SANTA BARBARA SANTA CRUZ CS
More informationCourse Batch Semester Subject Code Subject Name. B.EMarine Engineering B.E ME16 III UBEE307 Integrated Circuits
Course Batch Semester Subject Code Subject Name B.EMarine Engineering B.E ME16 III UBEE307 Integrated Circuits PartA 1 Define DeMorgan's theorem. 2 Convert the following hexadecimal number to decimal
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 informationPROGRAMMABLE LOGIC DEVICES
PROGRAMMABLE LOGIC DEVICES Programmable logic devices (PLDs) are used for designing logic circuits. PLDs can be configured by the user to perform specific functions. The different types of PLDs available
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 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 informationDKT 122/3 DIGITAL SYSTEM 1
Company LOGO DKT 122/3 DIGITAL SYSTEM 1 BOOLEAN ALGEBRA (PART 2) Boolean Algebra Contents Boolean Operations & Expression Laws & Rules of Boolean algebra DeMorgan s Theorems Boolean analysis of logic circuits
More informationPhiladelphia University 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 informationProgrammable Logic Devices
Programmable Logic Devices Programmable Logic Devices Fig. (1) General structure of PLDs Programmable Logic Device (PLD): is an integrated circuit with internal logic gates and/or connections that can
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 informationPresentation 4: Programmable Combinational Devices
Presentation 4: Programmable Combinational Devices Asst. Prof Dr. Ahmet ÖZKURT DEUEEE Based on the Presentation by Prof. Kim, Young Ho Dept. of Information Computer Engineering Email : yhkim@hyowon.cs.pusan.ac.kr
More informationCS470: Computer Architecture. AMD Quad Core
CS470: Computer Architecture Yashwant K. Malaiya, Professor malaiya@cs.colostate.edu AMD Quad Core 1 Architecture Layers Building blocks Gates, flipflops Functional bocks: Combinational, Sequential Instruction
More informationWritten exam for IE1204/5 Digital Design Thursday 29/
Written exam for IE1204/5 Digital Design Thursday 29/10 2015 9.0013.00 General Information Examiner: Ingo Sander. Teacher: William Sandqvist phone 087904487 Exam text does not have to be returned when
More informationScheme I. Sample Question Paper
Sample Question Paper Marks : 70 Time:3 Hrs. Q.1) Attempt any FIVE of the following : 10 Marks (5X2) (a) Draw the symbol and write the truth table of Universal Gates. (b) In a 3 variable K Map if there
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 informationUNIT V COMBINATIONAL LOGIC DESIGN
UNIT V COMBINATIONAL LOGIC DESIGN NOTE: This is UNITV in JNTUK and UNITIII and HALF PART OF UNITIV in JNTUA SYLLABUS (JNTUK)UNITV: Combinational Logic Design: Adders & Subtractors, Ripple Adder, Look
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 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 informationSt.MARTIN S ENGINEERING COLLEGE Dhulapally, Secunderabad
St.MARTIN S ENGINEERING COLLEGE Dhulapally, Secunderabad500 014 Subject: Digital Design Using Verilog Hdl Class : ECEII Group A (Short Answer Questions) UNITI 1 Define verilog HDL? 2 List levels of
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 informationDepartment of Computer Science & Engineering. Lab Manual DIGITAL LAB. Class: 2nd yr, 3rd sem SYLLABUS
Department of Computer Science & Engineering Lab Manual 435 DIGITAL LAB Class: 2nd yr, 3rd sem SYLLABUS. Verification of Boolean theorems using digital logic gates. 2. Design and implementation of code
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 informationQUESTION BANK (DESCRIPTIVE) UNIT I Binary Systems, Boolean Alegebra & Logic Gates. 1. What are the characteristics of Digital Systems.
SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY :: PUTTUR Siddharth Nagar, Narayanavanam Road 517583 QUESTION BANK (DESCRIPTIVE) Subject with Code : Digital Logic Design(18CS502 ) Year & Sem: IB.Tech
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 informationBHARATHIDASAN 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
More informationDepartment 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:158:3PM 1. (15 points) (a) (5 points) NAND, NOR
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 informationCHAPTER  2 : DESIGN OF ARITHMETIC CIRCUITS
Contents i SYLLABUS osmania university UNIT  I CHAPTER  1 : BASIC VERILOG HDL Introduction to HDLs, Overview of Digital Design With Verilog HDL, Basic Concepts, Data Types, System Tasks and Compiler
More informationDIGITAL CIRCUIT LOGIC UNIT 9: MULTIPLEXERS, DECODERS, AND PROGRAMMABLE LOGIC DEVICES
DIGITAL CIRCUIT LOGIC UNIT 9: MULTIPLEXERS, DECODERS, AND PROGRAMMABLE LOGIC DEVICES 1 Learning Objectives 1. Explain the function of a multiplexer. Implement a multiplexer using gates. 2. Explain the
More informationDigital System Design with SystemVerilog
Digital System Design with SystemVerilog Mark Zwolinski AAddisonWesley Upper Saddle River, NJ Boston Indianapolis San Francisco New York Toronto Montreal London Munich Paris Madrid Capetown Sydney Tokyo
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 informationUnit 6 1.Random Access Memory (RAM) Chapter 3 Combinational Logic Design 2.Programmable Logic
EE 200: Digital Logic Circuit Design Dr Radwan E AbdelAal, COE Unit 6.Random Access Memory (RAM) Chapter 3 Combinational Logic Design 2. Logic Logic and Computer Design Fundamentals Part Implementation
More informationTopics. Midterm Finish Chapter 7
Lecture 9 Topics Midterm Finish Chapter 7 ROM (review) Memory device in which permanent binary information is stored. Example: 32 x 8 ROM Five input lines (2 5 = 32) 32 outputs, each representing a memory
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 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 information2.6 BOOLEAN FUNCTIONS
2.6 BOOLEAN FUNCTIONS Binary variables have two values, either 0 or 1. A Boolean function is an expression formed with binary variables, the two binary operators AND and OR, one unary operator NOT, parentheses
More 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 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 informationIncompletely Specified Functions with Don t Cares 2Level Transformation Review Boolean Cube KarnaughMap Representation and Methods Examples
Lecture B: Logic Minimization Incompletely Specified Functions with Don t Cares 2Level Transformation Review Boolean Cube KarnaughMap Representation and Methods Examples Incompletely specified functions
More informationReview. EECS Components and Design Techniques for Digital Systems. Lec 05 Boolean Logic 9/404. Seq. Circuit Behavior. Outline.
Review EECS 150  Components and Design Techniques for Digital Systems Lec 05 Boolean Logic 9404 David Culler Electrical Engineering and Computer Sciences University of California, Berkeley Design flow
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 informationII/IV B.Tech (Regular/Supplementary) DEGREE EXAMINATION. Discrete Mathematical Structures. Answer ONE question from each unit.
14CS IT302 November,2016 II/IV B.Tech (Regular/Supplementary) DEGREE EXAMINATION Common for CSE & IT Discrete Mathematical Structures (4X12=48 Marks) 1. Answer all questions (1X12=12 Marks) a (Pv~P) is
More informationCHAPTER 9 MULTIPLEXERS, DECODERS, AND PROGRAMMABLE LOGIC DEVICES
CHAPTER 9 MULTIPLEXERS, DECODERS, AND PROGRAMMABLE LOGIC DEVICES This chapter in the book includes: Objectives Study Guide 9.1 Introduction 9.2 Multiplexers 9.3 ThreeState Buffers 9.4 Decoders and Encoders
More informationSECTIONA
M.Sc(CS) ( First Semester) Examination,2013 Digital Electronics Paper: Fifth  SECTIONA I) An electronics circuit/ device
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 information