π’ Digital Logic BCA 103 | Semester I/I
π Course Description
This course covers fundamental concepts of digital systems including number systems, Boolean algebra, logic gates, combinational and sequential logic design. Students will learn to analyze, simplify and implement digital circuits using K-maps, Quine-McCluskey method, flip-flops, counters, and registers. The course emphasizes hands-on design using logic gates, trainers, and simulators to build a strong foundation for computer organization and embedded systems.
π― Course Objectives
- Understand number systems, binary arithmetic, and codes
- Apply Boolean algebra and simplification techniques (K-map, tabular method)
- Design combinational logic circuits (adders, subtractors, multiplexers, decoders)
- Analyze sequential circuits, latches & flip-flops (RS, D, JK, T, Master-Slave)
- Implement synchronous/asynchronous counters and shift registers
- Use programmable logic devices (ROM, PAL, PLA) concepts
- Build practical digital circuits using trainer kits and simulation tools
| π Key Topics | π Details / Focus Area |
|---|---|
| Number Systems & Codes | Binary, Octal, Decimal, Hex, signed numbers, complements, BCD, ASCII, Gray, Error detection |
| Boolean Algebra & Minimization | Postulates, SOP/POS, K-map (up to 5 var), Quine-McCluskey, universal gates |
| Combinational Logic | Adder/Subtractor, multiplexer, demultiplexer, encoder, decoder, comparator, code converters |
| Sequential Logic | Latches, flip-flops (RS, D, JK, T, Master-Slave), state diagrams, state reduction |
| Counters & Registers | Asynchronous/Synchronous counters, ripple/ring counter, modulus counters, shift registers (SISO, PIPO, SIPO, PISO) |
π Syllabus Breakdown
- Analog vs digital signals & systems
- Number system representation & conversion (Binary, Octal, Decimal, Hexadecimal)
- Representation of signed numbers, floating point numbers
- rβs complement and (r-1)βs complement (base 2 & 10)
- Binary arithmetic (addition, subtraction using complements)
- Representation: BCD, ASCII, Excess-3, Gray code, Error detection codes
- Basic logic gates: AND, OR, NOT; Universal gates: NAND, NOR
- Derived gates: Ex-OR, Ex-NOR
- Boolean postulates & theorems, Canonical forms (SOP, POS)
- Simplification using Boolean laws
- Karnaugh Map (K-map) simplification for SOP & POS (up to 5 variables)
- Quine-McCluskey Tabular minimization technique (up to 5 variables)
- Half adder & Full adder, Half subtractor & Full subtractor
- Encoders & Decoders, Multiplexers & Demultiplexers
- Parallel binary adder, Magnitude comparator (2-bit & 4-bit)
- Code converters, Parity generator & checker
- Introduction to Programmable Logic: ROM, PAL, PLA
- State concept and state diagrams, state reduction techniques
- Triggering methods (level, edge)
- Latches and Flip-Flops: RS, D, T, JK, Master-Slave JK
- Asynchronous (ripple) counters, synchronous counters
- Ring counter, Modulus 10 counter, Modulus counters (5,7,11)
- Synchronous design of above counters
- Registers: SISO, SIPO, PISO, PIPO, bidirectional shift registers
π¬ Laboratory Work (48 Hrs | Logic Trainer Kit + Simulator)
Practical Tasks: hands-on experiments using digital trainer boards, breadboards, ICs (74xx series), and simulation software (Logisim / Multisim).
π Tools: Digital Logic Trainer Kit, Breadboard, 7400 series ICs, Simulation: Logisim / Digital Works.
π Required Textbooks & References
- Floyd, T. L. (2011) β Digital Fundamentals, Pearson
- Mano, M. (2018) β Digital Design, Pearson
- Tocci, R.J. β Digital Systems: Principles & Applications, Pearson
π Additional resources: Data sheets of logic ICs, online simulator tutorials, and lab manuals.
π Assessment Scheme (Typical): Theory examination evaluates number systems, Boolean minimization, circuit design & sequential logic. Practical exam includes circuit implementation on trainer kit, viva, and simulation tasks. Internal evaluation through lab reports & assignments.