Module1:Number systems and Boolean Algebra

____________________________________

•Binary arithmetic: Addition, Subtraction, Concepts of 1’s and 2’s

complement, 1’s and 2’s complement addition.

•Logic Gates: AND, OR, NOT, NOR, NAND, XOR, XNOR,

Universal Property of NAND and NOR gates

•Boolean algebra: Boolean operations, laws and rules, Demorgan’s

theorem

•Boolean Expression Simplification using K Map up to 4 variables 

Module2:Combinational and Sequential Logic Circuits

_____________________________________

• Combinational Circuits: Half Adder, Full Adder, Ripple Carry Adder 1

•Combinational Circuits: Encoder and Decoder (Basic Circuit Only) 1

•Combinational Circuits: Multiplexer and Demultiplexer (Basic

Circuit Only)

• Concepts of Latches and Flipflops, Types of Flipflops (SR, D, JK,T): Truth Table and Circuit

 •Sequential Circuits: Synchronous and Asynchronous Counters 4

•Johnsons and Ring counter, Shift Registers

Module3:Basic Computer Organization and Micro Programmed Control 

_____________________________________•Instruction codes, Registers and Common Bus system 2

• Computer Instructions 1

• Timing and Control: Concepts of hardwired and microprogrammed

control

•Instruction Cycle 1

•Microprogrammed Control: Control memory & Address Sequencing

•Micro Instruction Format and Symbolic Micro Instruction 

Module4:Processor, Memory and I/O Organization 

_________________________________

•Processor Organisation: General Register organization and stack

organization, Instruction formats and addressing modes

•Processor Organisation: RISC vs CISC, Parallel Processing 

• Pipelining: General Considerations, Arithmetic Pipeline, Instruction

Pipeline

• Memory Organisation: Memory Hierarchy, Main Memory 1

•Associative Memory, Cache Memory Mapping

•Organisation: Modes of transfer: programmed IO, Interrupt

initiated IO, DMA (Concepts Only)

module5:Open Ended Module: Computer Arithmetic & Types of Instruction 

• Computer Arithmetic: Addition and Subtraction, Multiplication

Algorithms, Division Algorithms

 •Examples for Memory Reference, Register Reference, Input Output

Instructions, Data Transfer Instructions, Data Manipulation

Instructions, Arithmetic Instructions, Logical and Bit Manipulation

Instructions, Shift Instructions, Program Control Instruction,

Conditional Branch Instructions

Subroutine Call and Retur