THEORY: Minimization Techniques: Boolean postulates and laws – De-Morgan’s Theorem - Minimization of Boolean expressions - Minterm – Maxterm - Sum of Products (SOP) – Product of Sums (POS) – Karnaugh map Minimization – Don’t care conditions. Tabulation method. Logic Gates: AND, OR, NOT, NAND, NOR, Exclusive-OR and Exclusive- NOR PRACTICAL: Implementation of Logic Gates - AND, OR, NOT, NAND, NOR, Exclusive-OR and Exclusive- NOR

THEORY: Half Adder – Full Adder – Half Subtractor – Full Subtractor –Multiplexer/ Demultiplexer – Decoder /Encoder – Parity checker – Parity generators – Code converters: Binary to Gray and Gray to binary- Magnitude Comparator. PRACTICAL: 1. Design and implementation of Adder and Subtractor using logic gates. 2. Design and implementation of code converters using logic gates 3. Design and implementation of encoder and decoder. 4. Design and implementation of Multiplexer and Demultiplexer

THEORY: Flip flops: SR, JK, T, D– Register, Shift registers-SISO, SIPO, PISO, PIPO ,Moore and Mealy, Design of synchronous sequential circuits, State diagram, State table, State minimization, State assignment- Counters – 3 bit synchronous counter PRACTICAL: Implementation of SISO, SIPO, PISO and PIPO shift registers using Flip- flops.

THEORY: Functional Units of a Digital Computer: Von Neumann Architecture – Operation and Operands of Computer Hardware Instruction – Instruction Set Architecture (ISA): Memory Location, Address and Operation – Instruction and Instruction Sequencing – Addressing Modes, Encoding of Machine Instruction – Interaction between Assembly and High Level Language. PRACTICAL: Simulator based study of Computer Architecture

THEORY: Instruction Execution – Building a Data Path – Designing a Control Unit – Hardwired Control, Microprogrammed Control – Pipelining – Data Hazard – Control Hazards. Memory Concepts and Hierarchy – Memory Management – Cache Memories: Mapping and Replacement Techniques – Virtual Memory – DMA