Computer Architecture
Subject Overview
Computer Architecture gives BCA students the digital-logic and hardware-organization foundation beneath every layer of software they'll write — logic gates and Boolean algebra, combinational circuits (adders, multiplexers, encoders/decoders), sequential circuits (flip-flops), and an introduction to computer organization covering the Von Neumann and Harvard architectures, RISC vs CISC, register transfer, instruction formats and bus systems. A 4-credit core paper combining theory with practical.
Unit-wise Syllabus
4 units — click WhatsApp below to get the full notes for each
Unit 1: Logic gates and Boolean algebra
AND, OR, NOT, NAND, NOR, XOR, XNOR gates, NAND/NOR as universal gates, logic gate applications, Boolean algebra theorems, simplification of Boolean expressions, SOP and POS forms, realization using gates, K-maps and K-map simplification
Unit 2: Combinational logic circuits
Half adder/subtractor, full adder/subtractor, parallel binary adder, binary adder/subtractor, multiplexers and demultiplexers, implementing Boolean equations using MUX/DEMUX, encoders and decoders
Unit 3: Sequential logic circuits
Latches, flip-flops — R-S, J-K (including race-around condition and its removal), Master-Slave J-K, D flip-flop, T flip-flop, applications of flip-flops
Unit 4: Computer organization
Introduction to computer and CPU organization, stored program concept, Von Neumann and Harvard architectures, RISC and CISC architecture, register transfer and micro-operations, instruction formats (memory reference, register reference, I/O instructions), common bus system — data, control and address buses