DSSSB TGT Computer Science – Computer Systems Architecture Complete Revision + 25 MCQ Mock Test


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.

ComponentFunction
CPUExecutes instructions
ALUArithmetic and logical operations
CUControls instruction execution
RegistersHigh-speed temporary storage
MemoryStores data and instructions
I/O DevicesCommunicate with external devices

Important CPU Registers

RegisterFunction
PCAddress of next instruction
IRCurrent instruction
MARMemory address
MDRData transferred to/from memory
ACCIntermediate arithmetic results
SPTop of stack

2. System Bus

A bus is a communication pathway connecting computer components.

BusFunction
Data BusTransfers data
Address BusCarries addresses
Control BusCarries control signals
Number of addressable locations = 2n

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

MemoryKey Property
SRAMFast; commonly used in cache
DRAMRequires refreshing; commonly used as main memory
ROMNon-volatile
PROMProgrammable once
EPROMErased using ultraviolet light
EEPROMElectrically erasable
FlashElectrically erasable in blocks

Memory Hierarchy:

Registers
    ↓
Cache Memory
    ↓
Main Memory (RAM)
    ↓
Secondary Storage
Cache Hit Ratio = Cache Hits / Total Accesses
Cache Miss Ratio = 1 − Hit Ratio

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

MethodWorking
Programmed I/OCPU repeatedly checks device status
Interrupt-driven I/ODevice interrupts CPU when attention is required
DMATransfers data between I/O and memory with reduced CPU involvement
I/O ChannelSpecialized processor/control mechanism for I/O operations
Exam Point: DMA stands for Direct Memory Access.

6. Computer Arithmetic

Unsigned 8-bit range:

0 to 28 − 1 = 0 to 255

Two's Complement 8-bit range:

−128 to +127

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

FormatSignExponentFraction
Single (32-bit)1 bit8 bits23 bits
Double (64-bit)1 bit11 bits52 bits

Exponent Bias:

  • Single precision = 127
  • Double precision = 1023
Actual Exponent = Stored Exponent − Bias

7. Instruction Sets

An instruction set is the collection of machine instructions supported by a processor.

ConceptMeaning
OpcodeSpecifies operation
OperandData or its location
Instruction FormatArrangement of instruction bits
Addressing ModeMethod of locating an operand
ISAInstruction Set Architecture

Addressing Modes

ModeKey Concept
ImmediateValue is inside instruction
DirectAddress is specified directly
IndirectAddress is obtained indirectly
RegisterOperand is in register
Register IndirectRegister contains memory address
IndexedBase address + index
RelativePC + displacement

Instruction Cycle

1. FETCH
     ↓
2. DECODE
     ↓
3. EXECUTE
     ↓
4. STORE / WRITE BACK

Instruction Pipelining

StageMeaning
IFInstruction Fetch
IDInstruction Decode
EXExecute
MEMMemory Access
WBWrite Back

Pipeline Hazards:

  1. Structural Hazard – Hardware resource conflict.
  2. Data Hazard – Dependency between instructions.
  3. Control Hazard – Branch or jump changes instruction flow.

PART 2: IMPORTANT FORMULA SHEET

TopicFormula
Addressable locations2n
Unsigned n-bit maximum2n − 1
Two's complement minimum−2n−1
Two's complement maximum2n−1 − 1
Cache hit ratioHits / Total Accesses
Cache miss ratio1 − Hit Ratio
Indexed addressBase + Index
Relative addressPC + Displacement
Actual exponentStored Exponent − Bias

PART 3: MOCK TEST – 25 MCQs

Instructions:
  • Total Questions: 25
  • Total Marks: 25
  • Each question carries 1 mark.
  • Select one correct answer.
  • Click Submit Test to see your score and explanations.
Attempted: 0/25
Your Result

PART 4: NUMERICAL PRACTICE

Try solving these five questions yourself. Click the button to reveal the answer and explanation.

1. A computer has a 12-bit address bus. How many locations can it address?
Answer: 4096 locations

212 = 4096.

2. Find the unsigned maximum value of a 10-bit number.
Answer: 1023

210 − 1 = 1023.

3. Calculate the cache miss ratio if the hit ratio is 95%.
Answer: 5%

Miss Ratio = 100% − 95% = 5%.

4. Find the effective address if base = 1500 and index = 75.
Answer: 1575

EA = Base + Index = 1500 + 75 = 1575.

5. In IEEE 754 single precision, find the actual exponent if the stored exponent is 135.
Answer: 8

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

Day 1 – Computer Systems Architecture Revision 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.