Unit 1: Simplification of Boolean Function using K-map method (upto 5 variables) and Quine-Mc Clusky method. Nand and Nor Implementation.
Combinational Logic: Introduction, Analysis & Design Procedure, Binary Adder & Subtractor, Decimal Adder, Binary Multiplier, Magnitude Comparator, Decoders, Encoders, Multiplexers, De-MJultiplexers, code conversion. Introduction to HDL description of combinational logic circuits.Unit 2: Sequential Logic: Introduction, Types of Sequential circuits, Basic storage elements (Latch and Flip-flops), Characteristic equations & tables, excitation table, Flip-flop conversion, Register, Universal Shift register.
Unit 3: Counters: Ripple & Synchronous binary counters, BCD counter, mod-n counter, ring & Johnson counter. Mealy and Moore model. Design and analysis of synchronous sequential circuit. State diagram and state table.
Unit 4: Introduction to Computer Organization & Architecture, Von Neumann and Harvard Architecture, RISC and CISC machines, Basic measures of computer performance, Amdahl’s Law, Little’s Law. Computer Arithmetic (Integer and Floating Point): Representation, Addition, Subtraction, Multiplication and Division. Processor structure and operation, Instruction Cycle, Basic concept of pipelining: Arithmetic, instruction, and processor level. Control unit operation and microprogrammed control.
Unit 5: Basic concept of Memory, Memory Addressability: Big-endian and Little-endian method, Memory hierarchy: Locality and performance, Cache memory: Principles and elements of design (Replacement algorithm, Effective Access Time, Hit Rate, and Miss penalty), I/O interface: External devices, I/O modules, Programmed I/O, Interrupt driven I/O, Direct Memory Access, Bus arbitration.
Introduction to alternative architectures (Flynn Taxonomy).
- Teacher: Hemant Singh Pokhariya