Computer Engineering is coming soon
We're still writing and reviewing the notes for every subject, and we'll open it when every subject is ready. Meanwhile you can practise aptitude, ask Aria about any subject, or see the branches that are ready.
Computer Engineering
Computer Organization and Microprocessor
Computer arithmetic, memory and cache, the 8086, interrupts, parallel organization.
Your progress in this subject0 of 19 · 0%
- 1Computer history and the von Neumann architectureHistory of computing up to the stored-program idea and a careful, exam-ready explanation of the von Neumann architecture, its components, the instruction (fetch-decode-execute) cycle, and common pitfalls.
- 2Computer components and bus interconnectionComponents of a computer (CPU, memory, I/O) connect over a system bus (data, address, control); this note explains bus structure, protocols, timing, arbitration, address decoding and practical calculations for throughput and chip select.
- 3Designing for performanceDesigning for performance explains how to measure processor and system speed, the math behind optimizations (CPI, clock, Amdahl's law, AMAT), and practical ways to evaluate trade-offs when improving parts of a computer system.
- 4Fast adders and carry look-aheadCarry look-ahead (fast) adders speed up multi-bit binary addition by computing carry bits in parallel using generate/propagate signals and group logic, reducing worst-case delay from O(n) to O(log n) for large n.
- 5Multiplication and Booth's algorithmBooth's algorithm is a shift-and-add method for multiplying two's-complement signed integers efficiently by scanning adjacent bits of the multiplier to decide add/subtract or do-nothing, reducing the number of arithmetic operations for runs of 1s.
- 6The memory hierarchyMemory hierarchy organises storage levels (registers, caches, main memory, storage) to balance speed, cost and capacity so processors see fast accesses while backing data on slower, cheaper media.
- 7Cache memory and mapping functionsCache memory mapping functions: direct-mapped, fully associative and set-associative mapping, how to compute tag/index/offset bits, and performance metrics (hit/miss, AMAT) with worked examples.
- 8Cache replacement and write policiesCache replacement policies (LRU, FIFO, Random, LFU) decide which cache block to evict; write policies (write-through/write-back and write-allocate/no-write-allocate) decide when and where writes go — both affect performance measured by hit time, miss rate and miss penalty, and together determine ave
- 9Hard disks and RAIDBasics of magnetic hard disks (geometry, timings, throughput) and RAID (levels, capacity, reliability, parity) with formulas, derivations, worked numerical examples, common exam mistakes and quick checks.
- 108086 architecture and registersClear, exam-focused notes on the Intel 8086 microprocessor architecture and its registers, covering segmentation, addressing, register roles, flags, addressing modes, worked examples, common mistakes and likely exam questions.
- 118086 addressing modesClear, exam-focused notes on 8086 addressing modes: definitions, exact rules for effective and physical addresses, syntax to remember, worked examples (EA and physical address calculations), common student mistakes, and exam-style question guidance.
- 128086 instruction setConcise notes on the 8086 instruction set: instruction classes, encoding (opcode + ModR/M + displacement + immediate), common opcodes, addressing interpretation and worked encodings for exam practice.
- 138086 memory segmentationCompact, exam-focused notes on 8086 memory segmentation: how segment:offset addresses translate to 20-bit physical addresses, rules, examples and common exam traps.
- 14Address decoding and memory-mapped I/OHow address decoding maps CPU addresses to memory and devices, and how to design logic that generates chip-select (CS) for memory-mapped I/O.
- 158086 interrupts and the interrupt vector tableClear, exam-focused notes on 8086 interrupts and the Interrupt Vector Table (IVT): what interrupts are, how the 8086 uses the IVT to find ISRs, stack effects, vector layout and worked examples.
- 168259 programmable interrupt controllerStudy notes on the Intel 8259 Programmable Interrupt Controller (PIC): what it does, how it is programmed (ICWs/OCWs), cascading masters/slaves, vector mapping and typical x86 initialization examples.
- 17Multiprocessors and Flynn's taxonomyFlynn's taxonomy classifies computer architectures by number of instruction and data streams (SISD, SIMD, MISD, MIMD); this note explains each class, how multiprocessors fit, key performance formulas (speedup, efficiency, Amdahl-related ideas), and exam-style examples and questions.
- 18SMP, UMA and NUMASMP, UMA and NUMA are memory-architecture designs for multiprocessor systems that decide whether all processors see equal memory access cost (UMA) or unequal costs (NUMA); understanding them is essential for designing and optimising parallel programs and hardware.
- 19RISC, CISC and pipeliningRISC vs CISC and pipelining: why designs differ, how pipelining improves throughput, hazards and their mitigation, with worked numerical examples a student can expect in exams.
Coming next in Computer Organization and Microprocessor
- Addition and subtraction of signed numbers· notes coming
- Semiconductor main memory and DRAM· notes coming
- Number systems and conversions· notes coming
- Sign-magnitude, 1's and 2's complement· notes coming
- Logic gates· notes coming
- Restoring and non-restoring division· notes coming
- IEEE 754 floating-point representation· notes coming
- Instruction formats and the instruction cycle· notes coming
- Hardwired and microprogrammed control units· notes coming
- Virtual memory: paging and segmentation· notes coming
- Cache coherence· notes coming
- Interleaved and associative memory· notes coming
- Bus arbitration· notes coming
- I/O modules and channels· notes coming
- Programmed I/O, interrupt-driven I/O and DMA· notes coming
- 80386 real, protected and virtual modes· notes coming
- Pipeline hazards and their mitigation· notes coming
- Superscalar architecture· notes coming
- Amdahl's law· notes coming
- CPU structure and function· notes coming
- Addressing modes and types of operands· notes coming
- Floating-point arithmetic· notes coming
- Optical memory and magnetic tape· notes coming
- Micro-operations and microinstruction sequencing· notes coming
- Computer buses: PCI and USB· notes coming
- 8086 assembler directives· notes coming
- Parallel programming models· notes coming
- Parallel languages and optimising compilers· notes coming
- Instruction-level parallelism and compiler techniques· notes coming
- Branch prediction· notes coming
- Dynamic scheduling and hardware speculation· notes coming
- Directory-based cache coherence· notes coming
- Multicore processors and hardware multithreading· notes coming