Skip to content
← Electronics

Electronics · 2nd Puc Science

Ch 10Digital Electronics — 2nd PUC Electronics, concept-first.

Almost every modern electronic system — a calculator, a mobile phone, a computer, a digital watch — works internally not with smoothly varying voltages but with just two levels, usually written as 1 (HIGH) and 0 (LOW).

Exam weightage:1m × 32m × 13m × 15m × 2

160

Q&A

15

Concepts

18m

Exam weightage

Start learning — read this chapter →

Key concepts

Hover a concept to preview it and jump to its most relevant Q&A.

BCD and Excess-3 Codes

The 8-4-2-1 BCD code represents each decimal digit by its 4-bit binary value, and the Excess-3 code adds 0011 to each BCD group to give a non-weighted, self-complementing code.

Start with this concept →

Chapter contents

The NCERT structure, section by section. Open a section to see its questions, then read the concept-first solution.

Introduction

Almost every modern electronic system — a calculator, a mobile phone, a computer, a digital watch — works internally not with smoothly varying voltages but with just two levels, usually written as 1 (…

10.1

Logic gates

A logic gate is an electronic circuit that operates on the rules of Boolean algebra to carry out one particular logic function; gates are the basic elements from which every digital system is assemble…

10.2

Digital codes

Computers and electronic devices need a systematic, precise way to represent information so that every character, letter, digit and symbol is unique and distinguishable.

10.3

Arithmetic logic circuits

Arithmetic logic circuits are logic circuits that carry out arithmetic operations — addition, subtraction and so on — inside a digital computer.

10.4

Simplification of Boolean Expressions

A Boolean expression is the starting point for designing a combinational logic circuit. Before the circuit is built the expression is simplified so that it uses the minimum number of inputs and gates…

10.5

Sequential Logic Circuits

Logic circuits fall into two broad families. Combinational logic circuits produce an output that depends only on the input levels present at that same instant, so they keep no record of what came befo…

10.6

Registers

A register is a group of flip-flops used together to store binary data. Its storage capacity is simply the number of bits (0s and 1s) it can hold, so an (n)-flip-flop register stores (n) bits.

10.7

Counters

A counter is a logic circuit that counts pulses. It is a set of flip-flops whose combined state advances through a fixed sequence as pulses arrive at its input.

Chapter Summary

Chapter 10 — Digital Electronics develops digital circuits in two halves. The combinational half (covered in the earlier parts of the chapter) deals with logic gates — including the XOR and XNOR gates…

More questions

160 Q
+Show 31 questions31 questions
  1. Example 1Convert \(823_{10}\) to BCDFree
  2. Example 2Convert \(100000101001_{BCD}\) into decimal.Free
  3. Example 3Convert \((0011\ 0100)_{BCD}\) to binaryFree
  4. Example 4Find the 9's complement of \((7825)_{BCD}\)Preview
  5. Example 5Find the excess-3 code of \((18)_{10}\)Preview
  6. Example 6convert \((01000111)_{BCD}\) into Excess-3 codePreview
  7. Example 7Convert \((1001)_2\) into gray code.Preview
  8. Example 8Convert \((1110)_2\) into gray code using XOR gates.Preview
  9. Example 9Convert \((1101)_G\) into binary.Preview
  10. Example 10Convert \((1001)_G\) into binary using X-OR gates.Preview
  11. Example 11Represent the word PUC in EBCDIC.Preview
  12. Example 12Convert \(Y = AC + B\overline{C}\) into its canonical SOP formPreview
  13. Example 13Convert \(Y = (AB + C)\) into its canonical SOP formPreview
  14. Example 14Convert \(Y = (A + B)(A + C)\) into canonical POS formPreview
  15. Example 15Convert \(Y = (A + \overline{B})(B + C)\) into canonical POS formPreview
  16. Example 16Draw the NAND gate equivalent circuit of Half Subtractor.Preview
  17. Example 17The textbook enters three Boolean expressions in sum-of-products (SOP) form onto their Karnaugh maps. Plot each expression on the appropriat…Preview
  18. Example 18Plot the given two-variable truth table on a Karnaugh map. The inputs are \(A,B\) and the output is \(Y\): \(00\to1,\;01\to0,\;10\to1,\;11\t…Preview
  19. Example 19Plot the given three-variable truth table on a Karnaugh map. The inputs are \(A,B,C\) and the output \(Y\) is: \(000\to0,\;001\to0,\;010\to0…Preview
  20. Example 20Plot the given four-variable truth table on a Karnaugh map. The inputs are \(A,B,C,D\) and the output \(Y\) is 1 for the input rows \(0001,\…Preview
  21. Example 21The three-variable Karnaugh map shown has a vertical pair of adjacent 1s in the \(BC\) column: the upper 1 is \(\overline{A}BC\) and the low…Preview
  22. Example 22The four-variable Karnaugh map shown has a horizontal quad of four adjacent 1s running across the \(\overline{A}B\) row (\(\overline{A}B\ove…Preview
  23. Example 23The four-variable Karnaugh map shown has an octet of eight adjacent 1s occupying the first two columns (\(\overline{C}\,\overline{D}\) and \…Preview
  24. Example 24Using the four-variable K-map shown below, simplify the expression and show how encircling **overlapping groups** (allowing a 1 to be used i…Preview
  25. Example 25Using the four-variable K-map shown below, simplify the expression by **rolling** the map so that the top edge and the bottom edge touch, fo…Preview
  26. Example 26Using the four-variable K-map shown below, simplify the expression by **rolling** the map so that the left edge and the right edge touch, fo…Preview
  27. Example 27Using the four-variable K-map shown below, simplify the expression by **rolling** the map so that all four corners touch, forming a quad.Preview
  28. Example 28Using the four-variable K-map shown below, identify and eliminate the **redundant group**, then write the simplified Boolean equation.Preview
  29. Example 29Using the four-variable K-map shown below (which contains **don't-care** conditions marked X), simplify the expression first **without** usi…Preview
  30. Example 30**Example 1:** Simplify the Boolean expression \(Y = \sum m(0,1,4,13,15) + \sum d(2,5,7)\) and then draw the logic diagram using only basic…Preview
  31. Example 31**Example 2:** Simplify the Boolean expression \(Y = \overline{A}\,\overline{B}\,\overline{C} + \overline{A}\,\overline{B}C + \overline{A}B\…Preview
+Show 63 questions63 questions
  1. Q1What is an exclusive OR gate?Free
  2. Q2Draw the symbol of XOR gate.Free
  3. Q3Write the Boolean equation of XOR gate.Free
  4. Q4Write the truth table of XOR gate.Preview
  5. Q5Draw the symbol of XNOR gate.Preview
  6. Q6Write the Boolean expression of XNOR gate.Preview
  7. Q7Write the truth table of XNOR gate.Preview
  8. Q8Name the universal gates.Preview
  9. Q9How many two input NAND gates must be used to produce two input OR function?Preview
  10. Q10How many two input NOR gates must be used to produce two input OR function?Preview
  11. Q11Why do we use digital codes?Preview
  12. Q12What is a BCD code?Preview
  13. Q13What is a gray code?Preview
  14. Q14Which are weighted codes?Preview
  15. Q15Which are the non weighted codes?Preview
  16. Q16Name the self complimenting codes.Preview
  17. Q17Convert 1101\(_2\) into gray code.Preview
  18. Q18Name the alpha numeric codes.Preview
  19. Q19Expand ASCII.Preview
  20. Q20Expand EBCDIC.Preview
  21. Q21How many zone bits are there in EBCDIC?Preview
  22. Q22What is a half adder?Preview
  23. Q23What is a full adder?Preview
  24. Q24What is a half subtractor?Preview
  25. Q25Draw the block diagram of half adder.Preview
  26. Q26Draw the block diagram of full adder.Preview
  27. Q27Draw the block diagram of half subtractor.Preview
  28. Q28Write the Boolean expression for the sum of half adder.Preview
  29. Q29Write the Boolean expression for the sum of full adder.Preview
  30. Q30Write the Boolean expression for the carry of half adder.Preview
  31. Q31Write the Boolean expression for the carry of full adder.Preview
  32. Q32Write the Boolean expression for the difference of half subtractor.Preview
  33. Q33Write the Boolean expression for the borrow of the half subractor.Preview
  34. Q34Define min term.Preview
  35. Q35Define max term.Preview
  36. Q36Define SOP.Preview
  37. Q37Define POS.Preview
  38. Q38What is canonical SOP equation?Preview
  39. Q39What is canonical POS equation?Preview
  40. Q40What is a Karnaugh map?Preview
  41. Q41What is meant by looping?Preview
  42. Q42What is a cell in K-map?Preview
  43. Q43What is meant by redundant group?Preview
  44. Q44What is a pair?Preview
  45. Q45What is a quad?Preview
  46. Q46What is an octet?Preview
  47. Q47How many variables does the pair eliminate?Preview
  48. Q48How many variables does the quad eliminate?Preview
  49. Q49How many variables does an octet eliminate?Preview
  50. Q50What is a don’t care condition?Preview
  51. Q51Name the universal gate used to realize AND – OR logic.Preview
  52. Q52Name the universal gate used to realize OR – AND logic.Preview
  53. Q53What is a sequential logic circuit?Preview
  54. Q54What is a flip flop?Preview
  55. Q55Is the flip flop a bistable device?Preview
  56. Q56Define a clock pulse.Preview
  57. Q57Draw the logic circuit of an unclocked SR flip flop.Preview
  58. Q58Draw the logic diagram of a D flip flop.Preview
  59. Q59Draw the logic diagram of a JK flip flop.Preview
  60. Q60Draw the logic diagram of a T flip flop.Preview
  61. Q61What is a register?Preview
  62. Q62Which is the line used to transfer data in and out of a PISO shift register?Preview
  63. Q63What is a counter?Preview
+Show 35 questions35 questions
  1. Q1What is an XOR gate? Write its truth table.Free
  2. Q2What is an XNOR gate? Write its truth table.Free
  3. Q3Draw the pin diagram of IC 7400.Free
  4. Q4Draw the pin diagram of IC 7402.Preview
  5. Q5Explain the term “universal gates”.Preview
  6. Q6Realize XNOR gate using only NOR gates.Preview
  7. Q7What is the most important characteristic of gray code? Explain.Preview
  8. Q8Distinguish between excess-3 and BCD codes.Preview
  9. Q9Convert the gray code 1000 into binary using XOR gates.Preview
  10. Q10Distinguish between half adder and full adder.Preview
  11. Q11Write the truth table and draw the timing diagram of a half adder.Preview
  12. Q12Write the truth table and timing diagram of a full adder.Preview
  13. Q13Realize the full adder using two half adders and a OR gate.Preview
  14. Q14Distinguish between SOP and POS equations.Preview
  15. Q15Convert \(AB + \overline{C}\) into canonical SOP.Preview
  16. Q16Convert \((A + C)(B + \overline{C})\) into canonical POS.Preview
  17. Q17Distinguish between min term and max term.Preview
  18. Q18Write the truth table for 3 variable input with min term designations.Preview
  19. Q19Explain the necessity of eliminating redundant groups in a K-map.Preview
  20. Q20Explain don't care condition.Preview
  21. Q21Distinguish between AND – OR logic and OR – AND logic,Preview
  22. Q22Draw the 4 variable k-map with min term designations.Preview
  23. Q23Write the truth table for the expression \(Y = \overline{A}\,\overline{B} + A\overline{B}\).Preview
  24. Q24Draw the AND-OR logic circuit for the expression \(Y = \overline{AB} + \overline{B}\).Preview
  25. Q25Draw the logic circuit for the expression \(Y = AC + \overline{C}\) using only basic gates.Preview
  26. Q26Draw the logic circuit for the expression \(Y = AB + \overline{B}\) by using only the NAND gates.Preview
  27. Q27Distinguish between combinational and sequential logic circuits.Preview
  28. Q28Distinguish between SR and JK flip flop.Preview
  29. Q29What is race around condition? How is it eliminated?Preview
  30. Q30Mention the types of shift registers.Preview
  31. Q31Draw the logic diagram of a SISO shift register.Preview
  32. Q32Draw the logic diagram of a SIPO shift register.Preview
  33. Q33Draw the logic diagram of a PISO shift register.Preview
  34. Q34Draw the logic diagram of a PIPO shift register.Preview
  35. Q35Give a broad classification of counters.Preview
+Show 17 questions17 questions
  1. Q1What is an X-OR gate? Realize the logic expression Y= A⊕B⊕C using 2 input two X-OR gate.Free
  2. Q2Construct an X-OR gate using only NAND gates and write the Boolean expression at the output of each gate.Free
  3. Q3Write the table of 2-4-2-1 code and show that it is a self complimenting code.Free
  4. Q4Write the ASCII code for the decimal numbers 0 to 9.Preview
  5. Q5Draw the logic symbol, timing diagram and truth table of half adder/ half subtractor.Preview
  6. Q6Realize the half adder using only NAND gates and write the Boolean expression at the output of each gate.Preview
  7. Q7Write the truth table and draw the timing diagram of a full adder.Preview
  8. Q8Realize the full adder using two X-OR, two AND gates and an OR gate.Preview
  9. Q9Convert A+BC+ \(\overline{A}B\) into its canonical SOP and write the expression in min term designation.Preview
  10. Q10Simplify the Boolean expression Y= \(\Sigma m(0,2,4,6,8,10,11,12,14,15)+\Sigma d(9,13)\) using K-map.Preview
  11. Q11List the different types of flip flops.Preview
  12. Q12Draw the logic symbol, truth table and timing diagram of a D flip flop.Preview
  13. Q13Draw the logic symbol, truth table and timing diagram of a T flip flop.Preview
  14. Q14Mention a few applications of flip flops.Preview
  15. Q15Write the truth table, timing diagram and logic diagram of SISO register.Preview
  16. Q16Draw the truth table, timing diagram and logic diagram of PISO register.Preview
  17. Q17Draw the logic diagram and counting sequence of a four bit synchronous up counter.Preview
+Show 14 questions14 questions
  1. Q1Explain the universal property of NAND gate and realize the AND, OR, NOT and X-OR gates with their respective truth tables.Free
  2. Q2What is a half subtractor? Explain its working with a truth table, logic diagram and timing diagram.Free
  3. Q3What is a full adder? Explain its working with respect to three input X-OR gate and basic gates with the help of truth table and Boolean exp…Free
  4. Q4Simplify the Boolean expression Y = \(\Sigma m (0, 4, 5, 7)\) using K-map. Realize the simplified expression by using both AND-OR logic and…Preview
  5. Q5Convert Y = \(A\overline{B} + BC + B\overline{D}\) into its canonical SOP form and write the truth table for the corresponding min term desi…Preview
  6. Q6With a logic circuit, explain the working of un-clocked S R flip flop built using NAND gates. Draw its timing diagram and truth table.Preview
  7. Q7Explain the working of an un-clocked JK flip flop with its logic diagram, truth table and timing diagram.Preview
  8. Q8Explain the working of SISO shift register with relevant diagrams.Preview
  9. Q9Explain the working of a four bit synchronous up counter using relevant Diagrams.Preview
  10. Q10Compare synchronous and asynchronous counters.Preview
  11. Q11Simplify the Boolean expression Y= \(\Sigma m(0,2,4,8,10)+\Sigma d(12,14)\) using K-map. Draw the NAND gate equivalent circuit to realize th…Preview
  12. Q12Simplify the Boolean expression Y= \(\Sigma m(4,5,7,9,11,12,13,15)+\Sigma d(1,3,8)\) using K-map. Draw the NAND gate equivalent circuit to r…Preview
  13. Q13Simplify the Boolean expression Y= \(\Sigma m(0,2,6,8,10,12,14)+\Sigma d(4,9,13)\) using K-map. Draw the NAND gate equivalent circuit to rea…Preview
  14. Q14Simplify the Boolean expression Y= \(\Sigma m(1,3,5,6,8,9,11,12)+\Sigma d(0,7,14)\) using K-map.Preview