Study guide

11.1 Computer Fundamentals & Hardware Architecture

SBI PO Probationary Officer

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Introduction & SBI PO Exam Architecture

1.1 SBI PO Exam Structure, Phases & Sectional Timing 1.2 Eligibility, Age Relaxation & Number of Attempts 1.3 Mark Calculation, One-Fourth Negative Marking & Cut-offs 1.4 Descriptive Communication Test (Email, Situation, Report/Précis) 1.5 Phase 3: Psychometric Test, Group Exercise & Interview Preparation 1.6 Recommended Study Plan & Mock Test Strategy

2 Chapter 2: Quantitative Aptitude — Foundation & Speed Math

2.1 Vedic Math, Fast Calculation & Approximation Techniques 2.2 Number Series (Missing & Wrong Number Patterns) 2.3 Quadratic Equations & Quantity Comparisons (Q1 vs Q2) 2.4 Simplification & Order of Operations 2.5 Data Sufficiency in Quantitative Aptitude

3 Chapter 3: Arithmetic & Applied Problem Solving

3.1 Percentages, Profit, Loss & Discount Calculations 3.2 Simple Interest & Compound Interest (Compounding Cycles & Differences) 3.3 Ratio & Proportion, Partnerships & Ages 3.4 Averages, Mixtures & Alligations 3.5 Time, Work, Efficiency & Pipes & Cisterns 3.6 Speed, Distance, Time, Trains & Boats/Streams 3.7 Permutation, Combination & Probability in Banking Exams

4 Chapter 4: Advanced Data Analysis & Data Interpretation (DI)

4.1 Table & Line Graph Data Interpretation 4.2 Bar Chart & Pie Chart Data Interpretation 4.3 Caselet Data Interpretation (Paragraph-based DI & Venn Caselets) 4.4 Missing Data DI & Radar/Spider Graph Interpretation 4.5 Arithmetic-based DI (Profit-Loss, Time-Work, TSD) & Funnel/Scatter DI

5 Chapter 5: Analytical Reasoning

5.1 Syllogisms (Only a few, Some not & Reverse Syllogism) 5.2 Coded & Mathematical Inequalities 5.3 Coding-Decoding (Coded Statements & Mains Patterns) 5.4 Blood Relations & Direction Sense 5.5 Input-Output Machine Rearrangement

6 Chapter 6: Puzzles & Seating Arrangement

6.1 Linear & Circular Seating Arrangement (Single/Parallel Rows & Variable Binding) 6.2 Floor & Box Puzzles (Multi-story, Vacant floor & Stacking Order) 6.3 Matrix & Category Puzzles (Department/Profession Allocation & Constraint Elimination) 6.4 Scheduling Puzzles (Day-Month-Year combinations & Time Slots)

7 Chapter 7: Critical Reasoning

7.1 Statement & Implicit Assumptions 7.2 Statement & Conclusions vs Strong/Weak Arguments 7.3 Statement & Course of Action 7.4 Cause & Effect Analysis 7.5 Critical Reasoning Passages (Strengthen/Weaken & Paradox Resolution)

8 Chapter 8: English Language

8.1 Reading Comprehension: Tone, Inference, Main Idea & Vocab in Context 8.2 Cloze Test & Double/Triple Fillers 8.3 Para Jumbles & Sentence Rearrangement 8.4 Error Spotting & Phrase Replacement (Grammar Rules) 8.5 Word Usage, Synonyms/Antonyms & Contextual Meaning 8.6 Match the Columns & Sentence Connectors/Starters

9 Chapter 9: Banking & Financial Awareness

9.1 Reserve Bank of India (RBI): History, Structure & Functions 9.2 Monetary Policy Framework: MPC, Repo Rate, SDF, MSF, CRR, SLR & Inflation Targeting 9.3 Indian Financial System: Commercial Banks, Small Finance Banks, Payment Banks & NBFCs 9.4 Financial Inclusion & Government Banking Schemes (PMJDY, PMSBY, PMJJBY, APY, MUDRA, KCC) 9.5 Banking Current Affairs & Financial News Dynamics

10 Chapter 10: General & Banking Awareness — Indian Economy, Financial Markets & Regulations

10.1 Economic Indicators: GDP, NNP, WPI, CPI, IIP & National Income 10.2 Forex & International Trade: Balance of Payments, LRS, NEER/REER & World Bank/IMF 10.3 Union Budget & Economic Survey: Fiscal Deficit, CapEx & Revenue Receipts 10.4 Money Market vs Capital Market: T-Bills, Commercial Paper, CD, Stocks, Bonds & SEBI 10.5 Priority Sector Lending (PSL), Non-Performing Assets (NPAs), SARFAESI, IBC & Basel III

11 Chapter 11: Computer Aptitude

11.1 Computer Fundamentals & Hardware Architecture 11.2 Operating Systems & System Software 11.3 Networking Concepts & Internet Protocols 11.4 Cybersecurity & Banking IT Security 11.5 Database Management Systems (DBMS) & MS Office Suite

11.1 Computer Fundamentals & Hardware Architecture

Key Takeaways Explain This Topic AI

The CPU consists of the Control Unit (CU), Arithmetic Logic Unit (ALU), and high-speed Registers working together through the Fetch-Decode-Execute instruction cycle.

Von Neumann architecture uses a shared memory and bus system for both data and instructions, giving rise to the Von Neumann bottleneck, unlike Harvard architecture which separates instruction and data memory.

Memory hierarchy spans from ultra-fast CPU registers and SRAM-based cache (L1, L2, L3) to DRAM main memory and non-volatile secondary storage (SSDs, HDDs).

Data representation converts decimal numbers into binary, octal, and hexadecimal formats, using 2's complement notation for signed integers.

System bus architecture consists of the Data Bus (bidirectional), Address Bus (unidirectional), and Control Bus, where an N-bit address bus can address up to 2^N unique memory locations.

Last updated: July 2026

Computer Fundamentals & Hardware Architecture

In modern electronic banking systems, core banking platforms, automated teller machines (ATMs), and payment gateways rely on high-performance computing hardware. A thorough understanding of computer organization, central processing unit (CPU) architecture, memory hierarchy, and digital data representation is essential for solving high-level Computer Aptitude problems in the SBI PO Main examination.

1. Computer Organization & Architecture Models

Computer architecture defines the conceptual design and fundamental operational structure of a computer system. The two primary architectural models encountered in system design are the Von Neumann Architecture and the Harvard Architecture .

Von Neumann vs. Harvard Architecture

Feature Von Neumann Architecture Harvard Architecture

Memory Structure Shared single memory space for both data and instructions Separate physical memories for instructions and data

Bus System Single shared bus for data transfers and instruction fetches Separate data bus and instruction bus

Execution Speed Slower (sequential access due to bus sharing) Faster (pipelined parallel access to code and data)

Complexity & Cost Simpler hardware design, lower cost Complex hardware design, higher manufacturing cost

Primary Application General-purpose personal computers, servers, workstations Digital Signal Processors (DSPs), microcontrollers, CPU cache +-----------------------------------------------------------------------+

  • | VON NEUMANN ARCHITECTURE |
  • | |
  • | +-------------------+ Control Bus +-----------------------+ |
  • | | Central |<=================>| Main Memory | |
  • | | Processing Unit | | (RAM - Stores Code | |
  • | | (CPU) |==== Address Bus =>| and Data Jointly) | |
  • | | [ALU, CU, Regs] |<== Data Bus =====>| | |
  • | +-------------------+ +-----------------------+ |
  • +-----------------------------------------------------------------------+
  • The Von Neumann Bottleneck

In Von Neumann systems, because the CPU and memory share a single data bus, the CPU cannot read an instruction and read/write user data at the exact same instant. This throughput limitation is called the Von Neumann Bottleneck . System designers mitigate this bottleneck by implementing high-speed CPU Cache Memory between the processor and main memory.

2. CPU Internal Components & Instruction Cycle

The Central Processing Unit (CPU) acts as the computational engine of the computer. It executes instructions stored in main memory through three primary sub-components:

Control Unit (CU): Directs the operation of the processor. It fetches instructions from main memory, decodes them, and coordinates data flow between the ALU, registers, and external peripherals by generating timing and control signals.

Arithmetic Logic Unit (ALU): Performs basic arithmetic calculations (addition, subtraction, multiplication) and logical operations (AND, OR, NOT, bitwise shifts, comparison of numerical values).

Processor Registers: Ultra-fast, internal high-speed storage locations situated directly inside the CPU package.

Key CPU Registers & Functions

Program Counter (PC): Holds the memory address of the next instruction to be fetched and executed. It increments automatically after an instruction fetch.

Instruction Register (IR): Holds the instruction currently being decoded and executed.

Memory Address Register (MAR): Holds the physical RAM memory address currently being accessed for a read or write operation.

Memory Data Register (MDR) / Memory Buffer Register (MBR): Holds the actual data payload read from memory or waiting to be written into memory.

Accumulator (ACC): Holds intermediate arithmetic and logic results generated by the ALU.

Stack Pointer (SP): Stores the address of the top of the stack frame in memory.

The Fetch-Decode-Execute Cycle

Every machine instruction is processed in a continuous sequence known as the Instruction Cycle : Fetch ⟶ Decode ⟶ Execute ⟶ Store Result \text{Fetch} \longrightarrow \text{Decode} \longrightarrow \text{Execute} \longrightarrow \text{Store Result} Fetch ⟶ Decode ⟶ Execute ⟶ Store Result

Fetch: The Control Unit reads the instruction residing at the memory address specified by the Program Counter (PC) and loads it into the Instruction Register (IR). The PC is then incremented.

Decode: The Control Unit decodes the binary opcode in the IR to determine the operation and identify any required operands.

Execute: The ALU executes the operation on the specified operands (e.g., adding two numbers stored in registers).

Store Result: The final output is written back to the Accumulator register or main memory.

3. Memory Hierarchy & Characteristics

Computer memory is arranged in a multi-level hierarchy balancing speed, capacity, and cost per bit. Speed decreases while storage capacity increases as you move down the hierarchy.

Memory Type Technology Volatility Access Time Relative Cost Location / Purpose

CPU Registers Flip-Flops / Transistors Volatile < 1 nanosecond Extremely High Inside CPU core; active operation

Level 1 (L1) Cache Static RAM (SRAM) Volatile 1 - 2 nanoseconds Very High Dedicated per CPU core; instructions/data

Level 2 (L2) Cache Static RAM (SRAM) Volatile 3 - 10 nanoseconds High Core-level or shared CPU cache

Level 3 (L3) Cache Static RAM (SRAM) Volatile 10 - 20 nanoseconds Medium-High Shared across all CPU cores on chip

Main Memory (RAM) Dynamic RAM (DRAM) Volatile 50 - 100 nanoseconds Medium System board; active running programs

Solid-State Drive (SSD) Flash Memory (NAND) Non-Volatile 50 - 100 microseconds Low Internal secondary storage; NVMe / SATA

Hard Disk Drive (HDD) Magnetic Disks Non-Volatile 5 - 15 milliseconds Very Low Mass secondary storage; mechanical platter

Optical / Tape Storage Laser / Magnetic Tape Non-Volatile Seconds to Minutes Extremely Low Cold storage archiving and disaster recovery

RAM Technologies: SRAM vs. DRAM

Static RAM (SRAM): Uses 6-transistor (6T) flip-flop circuits per bit. Does not require periodic electrical refreshing. It is extremely fast, highly expensive, and power-hungry; used exclusively for CPU cache.

Dynamic RAM (DRAM): Uses a single transistor and capacitor per bit. Capacitors leak electrical charge and must be refreshed thousands of times per second (refresh cycles). It offers high density and low cost; used for primary system RAM.

ROM Types (Non-Volatile System Firmware)

ROM (Read-Only Memory): Factory programmed; cannot be altered.

PROM (Programmable ROM): Blank chip that can be written to once using a specialized high-voltage programmer.

EPROM (Erasable PROM): Data erased by exposing the chip to intense Ultraviolet (UV) light through a quartz window.

EEPROM (Electrically Erasable PROM): Data erased electrically in blocks; forms the technical foundation for modern Flash memory and system BIOS/UEFI.

4. Number Systems & Data Representation

Digital computers process data using binary logic levels ( 0 0 0 and 1 1 1 ). Banking aptitude tests frequently evaluate numerical conversions between Binary (Base 2), Octal (Base 8), Decimal (Base 10), and Hexadecimal (Base 16).

  • Number Base Summary
  • Binary (Base 2): Digits {0, 1}
  • Octal (Base 8): Digits {0, 1, 2, 3, 4, 5, 6, 7}
  • Decimal (Base 10): Digits {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}
  • Hexadecimal (Base 16): Digits {0-9, A=10, B=11, C=12, D=13, E=14, F=15}
  • Step-by-Step Worked Conversion Example

Problem: Convert the Decimal integer 156 10 156_{10} 15 6 10 ​ into its Binary and Hexadecimal equivalents, and find its 8-bit 2's Complement representation for − 156 10 -156_{10} − 15 6 10 ​ (or − 28 10 -28_{10} − 2 8 10 ​ for 8-bit signed range).

Step A: Convert 156 10 156_{10} 15 6 10 ​ to Binary

Divide 156 156 156 successively by 2 2 2 and record the remainders from bottom to top:

  • 156 ÷ 2 = 78 156 \div 2 = 78 156 ÷ 2 = 78 remainder 0
  • 78 ÷ 2 = 39 78 \div 2 = 39 78 ÷ 2 = 39 remainder 0
  • 39 ÷ 2 = 19 39 \div 2 = 19 39 ÷ 2 = 19 remainder 1
  • 19 ÷ 2 = 9 19 \div 2 = 9 19 ÷ 2 = 9 remainder 1
  • 9 ÷ 2 = 4 9 \div 2 = 4 9 ÷ 2 = 4 remainder 1
  • 4 ÷ 2 = 2 4 \div 2 = 2 4 ÷ 2 = 2 remainder 0
  • 2 ÷ 2 = 1 2 \div 2 = 1 2 ÷ 2 = 1 remainder 0
  • 1 ÷ 2 = 0 1 \div 2 = 0 1 ÷ 2 = 0 remainder 1

Reading remainders bottom to top gives: 10011100 2 10011100_2 1001110 0 2 ​ .

Step B: Convert Binary 10011100 2 10011100_2 1001110 0 2 ​ to Hexadecimal

Group the binary bits into 4-bit nibbles from right to left:

Left Nibble: 1001 2 = 8 + 0 + 0 + 1 = 9 16 1001_2 = 8 + 0 + 0 + 1 = 9_{16} 100 1 2 ​ = 8 + 0 + 0 + 1 = 9 16 ​

Right Nibble: 1100 2 = 8 + 4 + 0 + 0 = 12 10 = C 16 1100_2 = 8 + 4 + 0 + 0 = 12_{10} = \text{C}_{16} 110 0 2 ​ = 8 + 4 + 0 + 0 = 1 2 10 ​ = C 16 ​

Hexadecimal result: 9 C 16 9\text{C}_{16} 9 C 16 ​ .

Step C: 2's Complement Representation of − 28 10 -28_{10} − 2 8 10 ​ (8-bit)

To represent negative signed integers in hardware:

  • Positive + 28 10 +28_{10} + 2 8 10 ​ in 8-bit binary: 00011100 2 00011100_2 0001110 0 2 ​
  • Take 1's Complement (invert all bits): 11100011 2 11100011_2 1110001 1 2 ​

Add 1 1 1 to get 2's Complement: 11100011 + 1 = 11100100 2 11100011 + 1 = 11100100_2 11100011 + 1 = 1110010 0 2 ​

Therefore, − 28 10 = 11100100 2 -28_{10} = 11100100_2 − 2 8 10 ​ = 1110010 0 2 ​ .

5. System Bus Architecture & Memory Addressing

A Bus is a shared collection of parallel electrical conductor lines transferring signals between computer hardware components. +-----------------------------------------------------------------+

  • | SYSTEM BUS ARCHITECTURE |
  • | |
  • | +-------------------------------+ |
  • | | Control Bus (Control/Status) | |
  • | +-------------------------------+ |
  • | +-------------------------------------------------+ |
  • | | CPU |<===>| Address Bus (Unidirectional) |===>| RAM/ |
  • | | |<===>| Data Bus (Bidirectional) |<==>| Periph|
  • | +-------------------------------------------------+ |
  • +-----------------------------------------------------------------+
  • Bus Types

Address Bus: Unidirectional bus carrying physical memory addresses generated by the CPU to RAM and I/O devices. The width of the address bus determines the maximum addressable memory capacity.

Data Bus: Bidirectional bus transferring actual data bytes between CPU registers, memory, and peripheral controllers.

Control Bus: Transfers command signals (Read/Write, Interrupt Request, Bus Ack, Clock Signals) from the Control Unit.

Memory Addressability Formula

If an address bus has N N N parallel lines, it can directly address 2 N 2^N 2 N unique byte locations: Addressable RAM Capacity = 2 N bytes \text{Addressable RAM Capacity} = 2^N \text{ bytes} Addressable RAM Capacity = 2 N bytes

Calculation Example: A system with a 32-bit address bus can address: 2 32 bytes = 4 , 294 , 967 , 296 bytes = 4 Gigabytes (GB) 2^{32} \text{ bytes} = 4,294,967,296 \text{ bytes} = 4 \text{ Gigabytes (GB)} 2 32 bytes = 4 , 294 , 967 , 296 bytes = 4 Gigabytes (GB)

A 64-bit address bus can theoretically address 2 64 bytes = 16 Exabytes (EB) 2^{64} \text{ bytes} = 16 \text{ Exabytes (EB)} 2 64 bytes = 16 Exabytes (EB) .

Exam Strategies & Common Traps

Address Bus vs. Data Bus Directionality: Remember that the Address Bus is strictly unidirectional (CPU to Memory/Peripherals), whereas the Data Bus is bidirectional .

Bit vs. Byte Distinction: Network transfer speeds are given in bits per second (e.g., 100 Mbps = 12.5 MB/s 100 \text{ Mbps} = 12.5 \text{ MB/s} 100 Mbps = 12.5 MB/s ), while storage sizes are given in bytes ( 1 Byte = 8 Bits 1 \text{ Byte} = 8 \text{ Bits} 1 Byte = 8 Bits ).

Refresh Requirement Trap: SRAM does not need refreshing; DRAM does need periodic refreshing. Do not confuse their speed and density profiles!