Course Outcomes

 

 
At the end of the course, students will be able to
 

-           Boolean algebra

-           simplification using algebraic, K-map, or QM method

-      digital circuits - combinatorial and sequential

-          designing adder, register, and counter

-          memory hierarchy

-          cache memory design

-          main memory types

-          design of memory module

-          Hamming code for single-error correction

-          disk organization and RAID

-          programmed i/o

-           interrupt-driven i/o 

-          direct memory access

-          process management

-          memory management

-          integer and floating-point representation

-          big- and little-endian

-          addition and multiplication

-          instruction set design

-          the usage of stacks

-          addressing mode

-          the internal structure of the CPU – ALU, registers, control unit

-          instruction pipelining

-          micro-operations

-      micro-programmed control

-          parallel processor organizations

-          shared-memory versus distributed-memory architecture