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).
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.
Most relevant Q&A
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 (…
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…
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.
Arithmetic logic circuits
Arithmetic logic circuits are logic circuits that carry out arithmetic operations — addition, subtraction and so on — inside a digital computer.
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…
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…
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.
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 questionsHide questions31 questions
- Example 1Convert \(823_{10}\) to BCDFree
- Example 2Convert \(100000101001_{BCD}\) into decimal.Free
- Example 3Convert \((0011\ 0100)_{BCD}\) to binaryFree
- Example 4Find the 9's complement of \((7825)_{BCD}\)Preview
- Example 5Find the excess-3 code of \((18)_{10}\)Preview
- Example 6convert \((01000111)_{BCD}\) into Excess-3 codePreview
- Example 7Convert \((1001)_2\) into gray code.Preview
- Example 8Convert \((1110)_2\) into gray code using XOR gates.Preview
- Example 9Convert \((1101)_G\) into binary.Preview
- Example 10Convert \((1001)_G\) into binary using X-OR gates.Preview
- Example 11Represent the word PUC in EBCDIC.Preview
- Example 12Convert \(Y = AC + B\overline{C}\) into its canonical SOP formPreview
- Example 13Convert \(Y = (AB + C)\) into its canonical SOP formPreview
- Example 14Convert \(Y = (A + B)(A + C)\) into canonical POS formPreview
- Example 15Convert \(Y = (A + \overline{B})(B + C)\) into canonical POS formPreview
- Example 16Draw the NAND gate equivalent circuit of Half Subtractor.Preview
- Example 17The textbook enters three Boolean expressions in sum-of-products (SOP) form onto their Karnaugh maps. Plot each expression on the appropriat…Preview
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- Example 28Using the four-variable K-map shown below, identify and eliminate the **redundant group**, then write the simplified Boolean equation.Preview
- Example 29Using the four-variable K-map shown below (which contains **don't-care** conditions marked X), simplify the expression first **without** usi…Preview
- 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
- 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 questionsHide questions63 questions
- Q1What is an exclusive OR gate?Free
- Q2Draw the symbol of XOR gate.Free
- Q3Write the Boolean equation of XOR gate.Free
- Q4Write the truth table of XOR gate.Preview
- Q5Draw the symbol of XNOR gate.Preview
- Q6Write the Boolean expression of XNOR gate.Preview
- Q7Write the truth table of XNOR gate.Preview
- Q8Name the universal gates.Preview
- Q9How many two input NAND gates must be used to produce two input OR function?Preview
- Q10How many two input NOR gates must be used to produce two input OR function?Preview
- Q11Why do we use digital codes?Preview
- Q12What is a BCD code?Preview
- Q13What is a gray code?Preview
- Q14Which are weighted codes?Preview
- Q15Which are the non weighted codes?Preview
- Q16Name the self complimenting codes.Preview
- Q17Convert 1101\(_2\) into gray code.Preview
- Q18Name the alpha numeric codes.Preview
- Q19Expand ASCII.Preview
- Q20Expand EBCDIC.Preview
- Q21How many zone bits are there in EBCDIC?Preview
- Q22What is a half adder?Preview
- Q23What is a full adder?Preview
- Q24What is a half subtractor?Preview
- Q25Draw the block diagram of half adder.Preview
- Q26Draw the block diagram of full adder.Preview
- Q27Draw the block diagram of half subtractor.Preview
- Q28Write the Boolean expression for the sum of half adder.Preview
- Q29Write the Boolean expression for the sum of full adder.Preview
- Q30Write the Boolean expression for the carry of half adder.Preview
- Q31Write the Boolean expression for the carry of full adder.Preview
- Q32Write the Boolean expression for the difference of half subtractor.Preview
- Q33Write the Boolean expression for the borrow of the half subractor.Preview
- Q34Define min term.Preview
- Q35Define max term.Preview
- Q36Define SOP.Preview
- Q37Define POS.Preview
- Q38What is canonical SOP equation?Preview
- Q39What is canonical POS equation?Preview
- Q40What is a Karnaugh map?Preview
- Q41What is meant by looping?Preview
- Q42What is a cell in K-map?Preview
- Q43What is meant by redundant group?Preview
- Q44What is a pair?Preview
- Q45What is a quad?Preview
- Q46What is an octet?Preview
- Q47How many variables does the pair eliminate?Preview
- Q48How many variables does the quad eliminate?Preview
- Q49How many variables does an octet eliminate?Preview
- Q50What is a don’t care condition?Preview
- Q51Name the universal gate used to realize AND – OR logic.Preview
- Q52Name the universal gate used to realize OR – AND logic.Preview
- Q53What is a sequential logic circuit?Preview
- Q54What is a flip flop?Preview
- Q55Is the flip flop a bistable device?Preview
- Q56Define a clock pulse.Preview
- Q57Draw the logic circuit of an unclocked SR flip flop.Preview
- Q58Draw the logic diagram of a D flip flop.Preview
- Q59Draw the logic diagram of a JK flip flop.Preview
- Q60Draw the logic diagram of a T flip flop.Preview
- Q61What is a register?Preview
- Q62Which is the line used to transfer data in and out of a PISO shift register?Preview
- Q63What is a counter?Preview
+−Show 35 questionsHide questions35 questions
- Q1What is an XOR gate? Write its truth table.Free
- Q2What is an XNOR gate? Write its truth table.Free
- Q3Draw the pin diagram of IC 7400.Free
- Q4Draw the pin diagram of IC 7402.Preview
- Q5Explain the term “universal gates”.Preview
- Q6Realize XNOR gate using only NOR gates.Preview
- Q7What is the most important characteristic of gray code? Explain.Preview
- Q8Distinguish between excess-3 and BCD codes.Preview
- Q9Convert the gray code 1000 into binary using XOR gates.Preview
- Q10Distinguish between half adder and full adder.Preview
- Q11Write the truth table and draw the timing diagram of a half adder.Preview
- Q12Write the truth table and timing diagram of a full adder.Preview
- Q13Realize the full adder using two half adders and a OR gate.Preview
- Q14Distinguish between SOP and POS equations.Preview
- Q15Convert \(AB + \overline{C}\) into canonical SOP.Preview
- Q16Convert \((A + C)(B + \overline{C})\) into canonical POS.Preview
- Q17Distinguish between min term and max term.Preview
- Q18Write the truth table for 3 variable input with min term designations.Preview
- Q19Explain the necessity of eliminating redundant groups in a K-map.Preview
- Q20Explain don't care condition.Preview
- Q21Distinguish between AND – OR logic and OR – AND logic,Preview
- Q22Draw the 4 variable k-map with min term designations.Preview
- Q23Write the truth table for the expression \(Y = \overline{A}\,\overline{B} + A\overline{B}\).Preview
- Q24Draw the AND-OR logic circuit for the expression \(Y = \overline{AB} + \overline{B}\).Preview
- Q25Draw the logic circuit for the expression \(Y = AC + \overline{C}\) using only basic gates.Preview
- Q26Draw the logic circuit for the expression \(Y = AB + \overline{B}\) by using only the NAND gates.Preview
- Q27Distinguish between combinational and sequential logic circuits.Preview
- Q28Distinguish between SR and JK flip flop.Preview
- Q29What is race around condition? How is it eliminated?Preview
- Q30Mention the types of shift registers.Preview
- Q31Draw the logic diagram of a SISO shift register.Preview
- Q32Draw the logic diagram of a SIPO shift register.Preview
- Q33Draw the logic diagram of a PISO shift register.Preview
- Q34Draw the logic diagram of a PIPO shift register.Preview
- Q35Give a broad classification of counters.Preview
+−Show 17 questionsHide questions17 questions
- Q1What is an X-OR gate? Realize the logic expression Y= A⊕B⊕C using 2 input two X-OR gate.Free
- Q2Construct an X-OR gate using only NAND gates and write the Boolean expression at the output of each gate.Free
- Q3Write the table of 2-4-2-1 code and show that it is a self complimenting code.Free
- Q4Write the ASCII code for the decimal numbers 0 to 9.Preview
- Q5Draw the logic symbol, timing diagram and truth table of half adder/ half subtractor.Preview
- Q6Realize the half adder using only NAND gates and write the Boolean expression at the output of each gate.Preview
- Q7Write the truth table and draw the timing diagram of a full adder.Preview
- Q8Realize the full adder using two X-OR, two AND gates and an OR gate.Preview
- Q9Convert A+BC+ \(\overline{A}B\) into its canonical SOP and write the expression in min term designation.Preview
- 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
- Q11List the different types of flip flops.Preview
- Q12Draw the logic symbol, truth table and timing diagram of a D flip flop.Preview
- Q13Draw the logic symbol, truth table and timing diagram of a T flip flop.Preview
- Q14Mention a few applications of flip flops.Preview
- Q15Write the truth table, timing diagram and logic diagram of SISO register.Preview
- Q16Draw the truth table, timing diagram and logic diagram of PISO register.Preview
- Q17Draw the logic diagram and counting sequence of a four bit synchronous up counter.Preview
+−Show 14 questionsHide questions14 questions
- Q1Explain the universal property of NAND gate and realize the AND, OR, NOT and X-OR gates with their respective truth tables.Free
- Q2What is a half subtractor? Explain its working with a truth table, logic diagram and timing diagram.Free
- 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
- 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
- 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
- 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
- Q7Explain the working of an un-clocked JK flip flop with its logic diagram, truth table and timing diagram.Preview
- Q8Explain the working of SISO shift register with relevant diagrams.Preview
- Q9Explain the working of a four bit synchronous up counter using relevant Diagrams.Preview
- Q10Compare synchronous and asynchronous counters.Preview
- 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
- 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
- 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
- Q14Simplify the Boolean expression Y= \(\Sigma m(1,3,5,6,8,9,11,12)+\Sigma d(0,7,14)\) using K-map.Preview