PART 1: COMPLETE REVISION NOTES
1. Computer Organization and Architecture
Computer Architecture describes the features visible to a programmer, such as instruction sets, addressing modes and data types.
Computer Organization describes how hardware components are connected and implemented.
| Component | Function |
|---|---|
| CPU | Executes instructions |
| ALU | Arithmetic and logical operations |
| CU | Controls instruction execution |
| Registers | High-speed temporary storage |
| Memory | Stores data and instructions |
| I/O Devices | Communicate with external devices |
Important CPU Registers
| Register | Function |
|---|---|
| PC | Address of next instruction |
| IR | Current instruction |
| MAR | Memory address |
| MDR | Data transferred to/from memory |
| ACC | Intermediate arithmetic results |
| SP | Top of stack |
2. System Bus
A bus is a communication pathway connecting computer components.
| Bus | Function |
|---|---|
| Data Bus | Transfers data |
| Address Bus | Carries addresses |
| Control Bus | Carries control signals |
Example: A system has a 16-bit address bus.
216 = 65,536 distinct locations in a byte-addressable system.
PCI: Peripheral Component Interconnect is a standard for connecting peripheral devices to a computer system.
3. Computer Memory Organization
| Memory | Key Property |
|---|---|
| SRAM | Fast; commonly used in cache |
| DRAM | Requires refreshing; commonly used as main memory |
| ROM | Non-volatile |
| PROM | Programmable once |
| EPROM | Erased using ultraviolet light |
| EEPROM | Electrically erasable |
| Flash | Electrically erasable in blocks |
Memory Hierarchy:
Registers
↓
Cache Memory
↓
Main Memory (RAM)
↓
Secondary Storage
Example: 80 cache hits out of 100 accesses.
Hit Ratio = 80/100 = 80%
Miss Ratio = 20%
4. Advanced DRAM Organization
- DRAM: Stores bits using capacitors and requires periodic refreshing.
- SDRAM: Synchronous DRAM, operates in synchronization with a clock.
- DDR SDRAM: Transfers data on both rising and falling clock edges.
- Memory Banks: Divide memory into independently accessible sections.
- Memory Interleaving: Organizes memory access across multiple banks to improve throughput.
5. Input/Output Organization
| Method | Working |
|---|---|
| Programmed I/O | CPU repeatedly checks device status |
| Interrupt-driven I/O | Device interrupts CPU when attention is required |
| DMA | Transfers data between I/O and memory with reduced CPU involvement |
| I/O Channel | Specialized processor/control mechanism for I/O operations |
6. Computer Arithmetic
Unsigned 8-bit range:
Two's Complement 8-bit range:
Example: Represent −12 in 8-bit two's complement.
Binary of 12: 00001100 Invert bits: 11110011 Add 1: 11110100 Answer: 11110100
IEEE 754 Floating-Point Representation
| Format | Sign | Exponent | Fraction |
|---|---|---|---|
| Single (32-bit) | 1 bit | 8 bits | 23 bits |
| Double (64-bit) | 1 bit | 11 bits | 52 bits |
Exponent Bias:
- Single precision = 127
- Double precision = 1023
7. Instruction Sets
An instruction set is the collection of machine instructions supported by a processor.
| Concept | Meaning |
|---|---|
| Opcode | Specifies operation |
| Operand | Data or its location |
| Instruction Format | Arrangement of instruction bits |
| Addressing Mode | Method of locating an operand |
| ISA | Instruction Set Architecture |
Addressing Modes
| Mode | Key Concept |
|---|---|
| Immediate | Value is inside instruction |
| Direct | Address is specified directly |
| Indirect | Address is obtained indirectly |
| Register | Operand is in register |
| Register Indirect | Register contains memory address |
| Indexed | Base address + index |
| Relative | PC + displacement |
Instruction Cycle
1. FETCH
↓
2. DECODE
↓
3. EXECUTE
↓
4. STORE / WRITE BACK
Instruction Pipelining
| Stage | Meaning |
|---|---|
| IF | Instruction Fetch |
| ID | Instruction Decode |
| EX | Execute |
| MEM | Memory Access |
| WB | Write Back |
Pipeline Hazards:
- Structural Hazard – Hardware resource conflict.
- Data Hazard – Dependency between instructions.
- Control Hazard – Branch or jump changes instruction flow.
PART 2: IMPORTANT FORMULA SHEET
| Topic | Formula |
|---|---|
| Addressable locations | 2n |
| Unsigned n-bit maximum | 2n − 1 |
| Two's complement minimum | −2n−1 |
| Two's complement maximum | 2n−1 − 1 |
| Cache hit ratio | Hits / Total Accesses |
| Cache miss ratio | 1 − Hit Ratio |
| Indexed address | Base + Index |
| Relative address | PC + Displacement |
| Actual exponent | Stored Exponent − Bias |
PART 3: MOCK TEST – 25 MCQs
- Total Questions: 25
- Total Marks: 25
- Each question carries 1 mark.
- Select one correct answer.
- Click Submit Test to see your score and explanations.
PART 4: NUMERICAL PRACTICE
Try solving these five questions yourself. Click the button to reveal the answer and explanation.
212 = 4096.
210 − 1 = 1023.
Miss Ratio = 100% − 95% = 5%.
EA = Base + Index = 1500 + 75 = 1575.
Actual Exponent = 135 − 127 = 8.
PART 5: SELF-ASSESSMENT
Tick the topics you can explain without looking at your notes.
Completed: 0/10
LESSON COMPLETED
You have revised:
- Computer Organization and Architecture
- System Buses and PCI
- Internal Memory and Cache
- Advanced DRAM Organization
- Input/Output Organization
- Computer Arithmetic
- Instruction Sets and Pipelining
Next Lesson: Day 2 – Operating System Overview.