BCASemester 22024-25Digital ElectronicsBBC201

Digital Electronics (BBC201) - AKTU Question Paper 2024-25

BCA · Semester 2 · Free PDF Download

This is the official AKTU Digital Electronics Previous Year Question Paper for BCA Semester 2, academic session 2024-25. Published by Dr. A.P.J. Abdul Kalam Technical University (AKTU/UPTU), Lucknow. Free PDF download — no login required.

Course:BCA
Semester:Semester 2
Session:2024-25
University:AKTU / UPTU

Rate this paper

Questions Asked in 2024-25

Digital Electronics (BBC201) — complete question paper · 70 marks · 3 Hours

Section A
  • a
    Define digital system. What is the key difference between a di gital and an analog system?
  • b
    What are canonical forms? Diffe rentiate between SOP and POS form
  • c
    Explain don’t care condition
  • d
    Use a 2-variable K-map to simplify the Boolean function F(A, B ) = Σm (0,4)
  • e
    Differentiate between multiple xer and demultiplexer
  • f
    What is a combinational circuit? How is it different from a sequential circuit?
  • g
    What are a counters?
Section B
  • a
    Explain the process of converting a number from:  (a) Hexadecimal to Decimal  (b) Octal to Decimal Use examples and show positional value calculations for clarity
  • b
    State and prove the following basic theorems of Boolean algebra using truth tables:  Commutative Law  Associative Law  Distributive Law
  • c
    Compare the Karnaugh Map method and the Tabulation method fo r Boolean minimization. List the advantag es and limitations of each. In w hich scenarios is tabulation preferred over K-map
  • d
    What is the decoder ? Draw th e logic diagram of 2 to 4 binary decoder
  • e
    Explain how the JK flip Flop can be converted into D flip flop
Section C
  • a
    Define the following number systems with suitable examples:  Binary  Octal  Decimal  Hexadecimal Explain why binary is preferred in digital computers
  • b
    Explain 1’s complement and 2’s complement of binary numbers. Perform subtraction using 2’s complement method: Show all steps, including binary conversion, complement, and addition. 4.Attempt any one part of the following: 07 x 1 = 07
  • a
    For the Boolean function
  • a
    Write its canonical SOP form
  • b
    Simplify it using a Karnaugh Map (K-map
  • b
    Explain how other logic operations like NAND, NOR, XOR, and XNOR are derived from basic gates. Prove with truth tables that:  NAND and NOR are universal gates 5.Attempt any one part of the following: 07 x 1 = 07
  • a
    Explain the tabulation met hod for minimizing Boolean functions. Demonstrate each step using the function
  • b
    Simplify F(A, B, C, D) = Σm (0,1,2,4,5,8,10) 3 K3 6.Attempt any one part of the following: 07 x 1 = 07
  • a
    Define half adder and full adder
  • b
    What is multiplexer? Draw the 8 to 1 multiplexer and explain. 4 K3 7.Attempt any one part of the following: 07 x 1 = 07
  • a
    Explain the operation of universal shift register. 5
  • b
    Define synchronous counter? Ex plain 4-bit synchronous counter. 5

Question text is extracted from the official AKTU question paper PDF above. Hindi translations are omitted — every question is printed in English in the original paper. Last verified: 2026-08-23.