RTMNU · Final Year B.Tech Artificial Intelligence & Machine Learning · CBCS
Switching Theory
BTAI&ML704T-3 · Elective III · Semester VII · 3 credits · College 30 + university 70
One of the Elective III options.
Unit 1: Number Systems, Boolean Algebra and Switching Functions
Number systems and complements; binary, BCD, unit-distance and error-detecting and correcting codes; Boolean theorems, switching functions in canonical and standard form, algebraic simplification, XOR properties, universal gates and multilevel NAND/NOR realisation.
Examined in the 70-mark end-semester paper
- Number systems and conversions
- Signed numbers and complements
- Codes: BCD, Gray and Excess-3
- Error-detecting and error-correcting codes
- Boolean algebra and universal gates
- SOP and POS forms of logic functions
Unit 2: Minimisation and Combinational Design
Minimising switching functions by theorems, Karnaugh maps up to five variables with don't-cares and the tabular method; designing adders, subtractors, comparators, multiplexers, demultiplexers, decoders, encoders and code converters; hazards and hazard-free realisations.
Examined in the 70-mark end-semester paper
- K-map minimisation
- Quine–McCluskey tabular method
- Adders and subtractors
- Magnitude comparator
- Multiplexers and demultiplexers
- Decoders and encoders
- Code converters
- Hazards in combinational circuits
Unit 3: Sequential Machine Fundamentals
Combinational versus sequential circuits, the binary cell; latches and SR, JK (race-around, master–slave), D and T flip-flops, excitation tables, timing, clock skew and flip-flop conversion; shift registers and their uses, ring and twisted-ring counters, asynchronous and synchronous counters.
Examined in the 70-mark end-semester paper
- Latches and the SR flip-flop
- Flip-flops and excitation tables
- Shift registers
- Ring and Johnson counters
- Synchronous and asynchronous counters
Unit 4: Sequential Circuits I
State diagrams and the analysis and synthesis of synchronous sequential circuits; serial binary adders, sequence detectors, parity-bit generators, and asynchronous and synchronous modulo-N counters.
Examined in the 70-mark end-semester paper
- State diagrams, state tables and state reduction
- Sequence detector design
- Parity generators and checkers
Unit 5: Sequential Circuits II
The capabilities and limits of finite state machines; Mealy and Moore models; minimising completely and incompletely specified machines by partition and merger-chart methods and the minimal cover table.
Examined in the 70-mark end-semester paper
- Moore and Mealy machines
- Minimising incompletely specified machines: merger charts
Unit contents are summarised from the official RTMNU syllabus . AiCanCode.org is not affiliated with Rashtrasant Tukadoji Maharaj Nagpur University (RTMNU).