BACHELOR OF COMPUTER APPLICATION (B.C.A.) – THIRD SEMESTER PAPER CODE: C-301 | DIGITAL ELECTRONICS
DR. BHIMRAO AMBEDKAR UNIVERSITY, AGRA
BACHELOR OF COMPUTER APPLICATION (B.C.A.) – THIRD SEMESTER
PAPER CODE: C-301 | DIGITAL ELECTRONICS
QUESTION PAPER – SET 1
|
Time: 3 Hours |
Maximum Marks: 75 |
Note: Attempt all questions as per instructions. All questions carry equal marks (7.5 marks each). Draw neat and clean logic diagrams wherever necessary.
1. (Unit-I) Convert the following numbers as
directed:
(a) (110110.101)₂ to Decimal and Hexadecimal
(b) (756)₈ to Binary and BCD
(c) Subtract (10110)₂ from (11001)₂ using 2’s complement method.
2. (Unit-I) State and prove De-Morgan’s Theorems using truth tables. Explain how NAND and NOR gates are called Universal Gates by implementing basic gates (AND, OR, NOT) using only NAND gates.
3. (Unit-I) Simplify the following Boolean
expression using Karnaugh Map (K-Map) and draw the logic diagram using basic
gates:
F(A, B, C, D) = Σm(0, 1, 2, 5, 8, 9, 10) + d(3, 7, 11)
4. (Unit-II) What is a Half Adder and a Full Adder? Design a Full Adder circuit using two Half Adders and an OR gate with complete truth table and Boolean expressions.
5. (Unit-II) Explain the working of a 4×1 Multiplexer with block diagram, truth table, and logic circuit. How can a 8×1 Multiplexer be implemented using 4×1 Multiplexers?
6. (Unit-II) Design a 2-Bit Magnitude Comparator. Write its truth table, simplify the outputs (A>B, A=B, A<B) using K-Map, and draw the logic circuit.
7. (Unit-III) Differentiate between Combinational and Sequential circuits. Explain the working of a clocked SR Flip-Flop and JK Flip-Flop along with their characteristic tables and excitation tables.
8. (Unit-III) What is the Race-Around Condition in JK Flip-Flop? Explain how a Master-Slave JK Flip-Flop eliminates this problem with a neat logic diagram.
9. (Unit-IV) Define a Register and classify different types of Shift Registers. Explain the working of a 4-bit Bidirectional Shift Register with Parallel Load.
10. (Unit-V) Differentiate between Synchronous and Asynchronous (Ripple) Counters. Design a 3-bit Synchronous Binary Up-Counter using JK Flip-Flops.
DR. BHIMRAO AMBEDKAR UNIVERSITY, AGRA
BACHELOR OF COMPUTER APPLICATION (B.C.A.) – THIRD SEMESTER
PAPER CODE: C-301 | DIGITAL ELECTRONICS
QUESTION PAPER – SET 2
|
Time: 3 Hours |
Maximum Marks: 75 |
Note: Attempt all questions as per instructions. All questions carry equal marks (7.5 marks each). Draw neat and clean logic diagrams wherever necessary.
1. (Unit-I) Explain Weighted and Non-Weighted binary codes with examples. Convert binary number (101101)₂ into Gray Code and Excess-3 Code.
2. (Unit-I) What is Hamming Code? Construct an even-parity 7-bit Hamming Code for the 4-bit data word 1011.
3. (Unit-I) Minimize the following Boolean
function in Product of Sums (POS) form using K-Map:
F(A, B, C, D) = ΠM(1, 3, 5, 7, 9, 11, 13, 15) · d(0, 2, 4)
4. (Unit-II) Design a Full Subtractor circuit. Write its truth table, derive the Boolean expressions for Difference and Borrow, and draw its logic diagram.
5. (Unit-II) Define Decoder and Encoder. Explain the working of a 3-to-8 Line Decoder with truth table and logic diagram.
6. (Unit-II) What is a De-Multiplexer? Explain a 1×8 De-Multiplexer with block diagram, truth table, and applications.
7. (Unit-III) Explain the difference between Level Triggering and Edge Triggering. Explain D Flip-Flop and T Flip-Flop with their truth tables, characteristic equations, and excitation tables.
8. (Unit-III) Explain the concepts of State Table, State Diagram, and State Reduction in sequential circuits with a suitable example.
9. (Unit-IV) Explain the working of a 4-bit Register with Parallel Load. How does it prevent unwanted data changes during clock pulses?
10. (Unit-V) Explain the working of a 4-bit Asynchronous (Ripple) Up-Counter with timing diagrams. Mention its propagation delay limitation.
DR. BHIMRAO AMBEDKAR UNIVERSITY, AGRA
BACHELOR OF COMPUTER APPLICATION (B.C.A.) – THIRD SEMESTER
PAPER CODE: C-301 | DIGITAL ELECTRONICS
QUESTION PAPER – SET 3
|
Time: 3 Hours |
Maximum Marks: 75 |
Note: Attempt all questions as per instructions. All questions carry equal marks (7.5 marks each). Draw neat and clean logic diagrams wherever necessary.
1. (Unit-I) Perform the following conversions and
arithmetic operations:
(a) (3FA.8)₁₆ to Octal and Binary
(b) (432)₁₀ to Excess-3 and BCD
(c) Subtract (28)₁₀ from (15)₁₀ in binary using 1’s complement method.
2. (Unit-I) State all basic Boolean Postulates
and Laws. Simplify the following expression algebraically:
Y = A’B’C’ + A’BC’ + AB’C’ + ABC’
3. (Unit-I) Implement the Boolean function F(A,
B, C, D) = Σm(0, 2, 4, 5, 6, 8, 10, 12, 14) using:
(a) Only NAND gates
(b) Only NOR gates
4. (Unit-II) Explain a 4-bit Parallel Binary Adder with a neat block diagram. Explain the concept of carry propagation in binary adders.
5. (Unit-II) Design a 3-Bit Magnitude Comparator. Write the Boolean expressions for A=B, A>B, and A<B.
6. (Unit-II) Implement the following Boolean
function using an 8×1 Multiplexer:
F(A, B, C, D) = Σm(0, 1, 3, 4, 8, 9, 15)
7. (Unit-III) Convert an SR Flip-Flop into a JK Flip-Flop and a D Flip-Flop into a T Flip-Flop showing excitation tables and logic diagrams.
8. (Unit-III) Write the complete step-by-step procedure for the Design of Clocked Sequential Circuits.
9. (Unit-IV) Explain Serial-In Serial-Out (SISO) and Serial-In Parallel-Out (SIPO) shift registers with neat diagrams and timing waveforms.
10. (Unit-V) Design a Synchronous Decade (BCD) Counter using JK Flip-Flops. Draw its state diagram and logic circuit.
DR. BHIMRAO AMBEDKAR UNIVERSITY, AGRA
BACHELOR OF COMPUTER APPLICATION (B.C.A.) – THIRD SEMESTER
PAPER CODE: C-301 | DIGITAL ELECTRONICS
QUESTION PAPER – SET 4
|
Time: 3 Hours |
Maximum Marks: 75 |
Note: Attempt all questions as per instructions. All questions carry equal marks (7.5 marks each). Draw neat and clean logic diagrams wherever necessary.
1. (Unit-I) What are Cyclic Codes? Explain Gray Code in detail and write the steps to convert a Gray code number into Binary with an example.
2. (Unit-I) Explain XOR and XNOR gates with their truth tables, symbols, and algebraic expressions. Show how an XOR gate can be constructed using basic gates.
3. (Unit-I) Simplify the following Boolean
expression using K-Map and realize it using NOR gates only:
F(W, X, Y, Z) = Σm(1, 3, 4, 5, 6, 7, 9, 12, 13)
4. (Unit-II) Compare Half Subtractor and Full Subtractor. Implement a Full Subtractor using two Half Subtractors and an OR gate.
5. (Unit-II) Explain a Decimal-to-BCD Encoder (10-to-4 line encoder) with truth table and logic circuit.
6. (Unit-II) Explain how a 4×1 Multiplexer can be used as a universal logic generator to implement any 3-variable Boolean function.
7. (Unit-III) Explain the working of an SR Latch using NAND gates and NOR gates. Highlight the invalid/forbidden state in each case.
8. (Unit-III) Design a sequential circuit for the following state diagram: transitions 00 → 01 → 11 → 10 → 00 when input X=1, and holds state when X=0 (use D flip-flops).
9. (Unit-IV) Explain Parallel-In Serial-Out (PISO) and Parallel-In Parallel-Out (PIPO) shift registers with circuit diagrams.
10. (Unit-V) Explain the working of a 4-bit Ring Counter and a 4-bit Johnson (Twisted Ring) Counter with state tables and timing diagrams.
DR. BHIMRAO AMBEDKAR UNIVERSITY, AGRA
BACHELOR OF COMPUTER APPLICATION (B.C.A.) – THIRD SEMESTER
PAPER CODE: C-301 | DIGITAL ELECTRONICS
QUESTION PAPER – SET 5
|
Time: 3 Hours |
Maximum Marks: 75 |
Note: Attempt all questions as per instructions. All questions carry equal marks (7.5 marks each). Draw neat and clean logic diagrams wherever necessary.
1. (Unit-I) Explain Binary Arithmetic rules for addition, subtraction, multiplication, and division with suitable examples.
2. (Unit-I) Distinguish between Sum of Products (SOP) and Product of Sums (POS) forms. Convert F(A, B, C) = A + B’C into canonical SOP and canonical POS forms.
3. (Unit-I) What is Error Detection and Correction? Explain how a single-bit error is detected and corrected at the receiver end using Hamming Code.
4. (Unit-II) Design a Combinational Circuit that accepts a 4-bit BCD digit and generates its 9’s complement.
5. (Unit-II) Explain the working of a 2-to-4 Line Decoder with Enable input. Show how two 2-to-4 decoders can be cascaded to form a 3-to-8 decoder.
6. (Unit-II) Compare Multiplexer and De-Multiplexer on the basis of inputs, outputs, select lines, and applications.
7. (Unit-III) Derive the Characteristic Equations of SR, JK, D, and T Flip-Flops using their respective characteristic tables and K-Maps.
8. (Unit-III) Explain State Reduction technique with a neat state table example to minimize the number of flip-flops required.
9. (Unit-IV) Draw and explain the logic diagram of a 4-bit Universal Shift Register capable of performing shift-left, shift-right, and parallel load operations.
10. (Unit-V) Explain a 4-bit Binary Counter with Parallel Load. Draw its logic diagram and explain its function table (Clear, Load, Count).
DR. BHIMRAO AMBEDKAR UNIVERSITY, AGRA
BACHELOR OF COMPUTER APPLICATION (B.C.A.) – THIRD SEMESTER
PAPER CODE: C-301 | DIGITAL ELECTRONICS
QUESTION PAPER – SET 6
|
Time: 3 Hours |
Maximum Marks: 75 |
Note: Attempt all questions as per instructions. All questions carry equal marks (7.5 marks each). Draw neat and clean logic diagrams wherever necessary.
1. (Unit-I) Convert the following:
(a) (65.45)₁₀ to Binary, Octal, and Hexadecimal
(b) Gray code (11011) to Binary
(c) Excess-3 code (1001 1010) to Decimal
2. (Unit-I) Simplify the Boolean function using
K-Map:
F(A, B, C, D) = Σm(2, 3, 6, 7, 12, 13, 14) + d(0, 1, 10, 11)
3. (Unit-I) Explain the universality of the NOR gate by implementing NOT, AND, OR, and XOR gates using only NOR gates.
4. (Unit-II) What is a Binary Adder-Subtractor? Explain a 4-bit Binary Adder-Subtractor circuit using XOR gates and Full Adders.
5. (Unit-II) Explain Priority Encoder. Design a 4-input Priority Encoder with truth table and Boolean expressions.
6. (Unit-II) Design a 1-Bit Magnitude Comparator and extend the concept to explain a 2-Bit Magnitude Comparator.
7. (Unit-III) What is Clock Skew and Setup/Hold time in flip-flops? Differentiate between Asynchronous (Preset/Clear) inputs and Synchronous inputs of a flip-flop.
8. (Unit-III) Analyze the given clocked sequential circuit consisting of two D flip-flops A and B, input X, and output Y where DA = A·X + B·X, DB = A’·X, and Y = (A + B)·X’.
9. (Unit-IV) What are the applications of Shift Registers? Explain how a shift register can be used for serial data transfer and time delay generation.
10. (Unit-V) Design a Mod-6 Asynchronous Counter using JK Flip-Flops. Draw its logic circuit and output waveforms.
DR. BHIMRAO AMBEDKAR UNIVERSITY, AGRA
BACHELOR OF COMPUTER APPLICATION (B.C.A.) – THIRD SEMESTER
PAPER CODE: C-301 | DIGITAL ELECTRONICS
QUESTION PAPER – SET 7
|
Time: 3 Hours |
Maximum Marks: 75 |
Note: Attempt all questions as per instructions. All questions carry equal marks (7.5 marks each). Draw neat and clean logic diagrams wherever necessary.
1. (Unit-I) Compare 1’s complement and 2’s complement representation of signed binary numbers. Perform (-35)₁₀ + (+22)₁₀ using 8-bit 2’s complement arithmetic.
2. (Unit-I) Prove the following Boolean
identities algebraically:
(a) A + A’B = A + B
(b) (A + B)(A + C) = A + BC
(c) AB + A’C + BC = AB + A’C
3. (Unit-I) Explain SOP and POS minimization using K-Map for 4 variables. What are Don’t Care conditions and how do they help in circuit simplification?
4. (Unit-II) Design a Half Adder using only NAND gates (minimum number of gates). Also draw a Full Adder using two Half Adders.
5. (Unit-II) Implement a Full Adder circuit using a 3-to-8 Decoder and two OR gates.
6. (Unit-II) Design an 8×1 Multiplexer using two 4×1 Multiplexers and one 2×1 Multiplexer.
7. (Unit-III) Explain Master-Slave SR Flip-Flop and Master-Slave JK Flip-Flop. Why is pulse-triggered operation important in Master-Slave configuration?
8. (Unit-III) Design a Synchronous Mod-5 Counter using T Flip-Flops. Write its excitation table, state table, and logic diagram.
9. (Unit-IV) Explain the classification of Registers based on data input and data output modes (SISO, SIPO, PISO, PIPO).
10. (Unit-V) Compare Ring Counter and Johnson Counter in terms of number of states, decoding logic, and feedback connection for an n-bit register.
DR. BHIMRAO AMBEDKAR UNIVERSITY, AGRA
BACHELOR OF COMPUTER APPLICATION (B.C.A.) – THIRD SEMESTER
PAPER CODE: C-301 | DIGITAL ELECTRONICS
QUESTION PAPER – SET 8
|
Time: 3 Hours |
Maximum Marks: 75 |
Note: Attempt all questions as per instructions. All questions carry equal marks (7.5 marks each). Draw neat and clean logic diagrams wherever necessary.
1. (Unit-I) Write short notes on:
(a) Octal and Hexadecimal Number Systems
(b) BCD (8421) vs Excess-3 Code
(c) Cyclic Codes
2. (Unit-I) Find the minimal SOP expression using
K-Map:
F(A, B, C, D) = Σm(0, 1, 4, 5, 6, 8, 9, 12, 13, 14)
3. (Unit-I) Draw the symbols, truth tables, and Boolean expressions for all 7 Logic Gates (AND, OR, NOT, NAND, NOR, XOR, XNOR).
4. (Unit-II) Explain the working of a 3-Bit Magnitude Comparator with complete logic diagram and truth table conditions.
5. (Unit-II) What is a Combinational Circuit? Explain the design procedure of combinational logic circuits by designing a Binary-to-Gray code converter.
6. (Unit-II) Explain a 1×4 De-Multiplexer and show how it can be used as a 2-to-4 Line Decoder.
7. (Unit-III) Write the Excitation Tables of SR, JK, D, and T Flip-Flops. Explain how excitation tables are used in sequential circuit design.
8. (Unit-III) Explain Edge Triggering (Positive and Negative edge triggering) in flip-flops with clock pulse diagrams.
9. (Unit-IV) Design a 4-bit Bidirectional Shift Register with Parallel Load and explain its mode control table.
10. (Unit-V) Design a 3-bit Synchronous Down-Counter using JK Flip-Flops. Show state table, K-Map simplification, and circuit diagram.
DR. BHIMRAO AMBEDKAR UNIVERSITY, AGRA
BACHELOR OF COMPUTER APPLICATION (B.C.A.) – THIRD SEMESTER
PAPER CODE: C-301 | DIGITAL ELECTRONICS
QUESTION PAPER – SET 9
|
Time: 3 Hours |
Maximum Marks: 75 |
Note: Attempt all questions as per instructions. All questions carry equal marks (7.5 marks each). Draw neat and clean logic diagrams wherever necessary.
1. (Unit-I) Perform the following operations:
(a) Convert (10111011.1101)₂ to Octal and Hexadecimal
(b) Add (47)₁₀ and (38)₁₀ in BCD
(c) Find 1’s and 2’s complement of (10100100)₂
2. (Unit-I) Use K-Map to simplify the Boolean
function in both SOP and POS forms:
F(A, B, C, D) = Σm(0, 2, 5, 7, 8, 10, 13, 15)
3. (Unit-I) Implement the expression Y = (A + B)(C + D)E using only NOR gates.
4. (Unit-II) Design a Gray-to-Binary Code Converter for 4-bit numbers using XOR gates.
5. (Unit-II) Explain a 4×1 Multiplexer using AND-OR-NOT gates. Implement F(A, B, C) = Σm(1, 2, 4, 7) using a 4×1 Multiplexer.
6. (Unit-II) Explain Octal-to-Binary Encoder (8-to-3 line encoder) with truth table and logic diagram.
7. (Unit-III) Explain the working of a JK Flip-Flop using NAND gates. Write its truth table, characteristic table, and state diagram.
8. (Unit-III) Design a Sequence Detector using D Flip-Flops that detects the overlapping sequence '101'.
9. (Unit-IV) Explain how a Register with Parallel Load works using D Flip-Flops and 2×1 Multiplexers.
10. (Unit-V) Explain Asynchronous Ripple BCD Counter (Mod-10 Ripple Counter) with logic diagram and reset logic.
DR. BHIMRAO AMBEDKAR UNIVERSITY, AGRA
BACHELOR OF COMPUTER APPLICATION (B.C.A.) – THIRD SEMESTER
PAPER CODE: C-301 | DIGITAL ELECTRONICS
QUESTION PAPER – SET 10
|
Time: 3 Hours |
Maximum Marks: 75 |
Note: Attempt all questions as per instructions. All questions carry equal marks (7.5 marks each). Draw neat and clean logic diagrams wherever necessary.
1. (Unit-I) Explain the concept of Radix/Base in number systems. Convert (245)₆ into base-10 and base-8.
2. (Unit-I) Check whether the received 7-bit even-parity Hamming code 1011011 has any error. If yes, find the exact bit position and correct it.
3. (Unit-I) Simplify F(A, B, C, D) = ΠM(0, 2, 4, 6, 8, 10, 12, 14) using K-Map and implement the simplified expression using basic logic gates.
4. (Unit-II) Differentiate between Half Adder, Full Adder, Half Subtractor, and Full Subtractor with their respective Boolean equations.
5. (Unit-II) Design a 2-Bit Magnitude Comparator using basic gates and write its complete truth table (16 combinations).
6. (Unit-II) Explain 8×1 Multiplexer and 1×8 De-Multiplexer with their truth tables and select line configurations.
7. (Unit-III) Compare SR, JK, D, and T Flip-Flops in tabular form covering inputs, next-state equations, advantages, and drawbacks.
8. (Unit-III) Explain Mealy and Moore models of Clocked Sequential Circuits with block diagrams.
9. (Unit-IV) Draw the logic diagram of a 4-bit Shift Left / Shift Right Register and explain its operation with a truth table.
10. (Unit-V) Design a Synchronous Up/Down Counter (2-bit) using JK Flip-Flops with a Mode control input M (M=0 for Up, M=1 for Down).
Comments
Post a Comment