Study guide

11.2 Operating Systems & System Software

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.2 Operating Systems & System Software

Key Takeaways Explain This Topic AI

Operating Systems manage system hardware through core modules: Process Management, Memory Management, File System Management, and Device I/O Management.

Process state transitions move processes from New to Ready, Running, Waiting (Blocked), and Terminated, managed by CPU scheduling algorithms like Preemptive Shortest Remaining Time First (SRTF) and Round Robin.

Virtual Memory utilizes Paging to translate logical addresses into physical frame addresses using Page Tables, where excessive page swapping triggers system Thrashing.

Real-Time Operating Systems (RTOS) guarantee strict deterministic timing constraints, categorized into Hard RTOS (e.g., ATM transaction processing, flight controls) and Soft RTOS (e.g., video streaming).

System software includes operating systems, device drivers, utilities, and language translators (Compilers translate full source code into object code before execution, whereas Interpreters convert and execute code line-by-line).

Last updated: July 2026

Operating Systems & System Software

An Operating System (OS) is system software that acts as an intermediary interface between computer hardware and user application software. In commercial banking environments, robust operating systems (such as Linux enterprise distributions, AIX, Windows Server, and z/OS mainframes) provide resource virtualization, security isolation, concurrent processing, and fault tolerance for mission-critical core banking systems (CBS).

1. Operating System Architecture & Functions

The operating system kernel is the core component that resides permanently in main memory. OS operations are divided into four fundamental management subsystems:

Process Management: Allocates CPU time to competing threads/processes, handles inter-process communication (IPC), and synchronizes execution.

Memory Management: Allocates and deallocates physical RAM space to active processes, tracks memory maps, and manages Virtual Memory paging.

File System Management: Organizes files into hierarchical directory trees, manages access permissions, and controls physical storage block allocation (e.g., NTFS, FAT32, ext4, APFS).

Device / I/O Management: Provides standardized hardware interfaces via device drivers, buffering, spooling, and interrupt handlers.

Kernel Architecture Models

Kernel Type Architecture Description Advantages Disadvantages Examples

Monolithic Kernel All OS services (file system, IPC, device drivers, virtual memory) run inside a single privileged kernel space. High performance due to direct fast system calls. A crash in any driver can crash the entire OS. Linux, MS-DOS, traditional Unix

Microkernel Only minimal essential services (IPC, basic memory, CPU scheduling) run in kernel space; drivers and file systems run in user space. High stability, modular design, isolated crashes. Performance overhead due to frequent context switching. QNX, Minix, L4, macOS (Mach core)

Hybrid Kernel Combines microkernel modularity with monolithic performance inside kernel space. Balanced trade-off of speed and structure. Complex internal design. Windows NT/10/11, macOS

2. Process Life Cycle & CPU Scheduling Algorithms

A Process is a program in execution containing a program counter, stack, data section, and process control block (PCB).

  • Process State Transition Model +-----------------------------------------------------------------+
  • | PROCESS STATE TRANSITIONS |
  • | |
  • | +-----+ Admitted +-------+ Scheduler +---------+ |
  • | | New |------------->| Ready |------------>| Running | |
  • | +-----+ +-------+ Dispatch +---------+ |
  • | ^ | |
  • | | I/O Completion | I/O or Event |
  • | | or Time Slice | Wait |
  • | | Expired v |
  • | | +---------+ |
  • | +-----------------| Waiting | |
  • | +---------+ |
  • | | |
  • | Exit| |
  • | v |
  • | +------------+ |
  • | | Terminated | |
  • | +------------+ |
  • +-----------------------------------------------------------------+

New: Process is being created.

Ready: Process is loaded into RAM waiting for CPU allocation.

Running: Instructions are actively executing on CPU.

Waiting (Blocked): Process is waiting for an I/O operation or signal completion.

Terminated: Execution has completed; resources are reclaimed.

CPU Scheduling Algorithms

CPU schedulers select processes from the ready queue based on specific criteria:

First-Come, First-Served (FCFS): Non-preemptive. Simple FIFO queue. Subject to the Convoy Effect , where small processes wait behind a massive CPU-bound process.

Shortest Job First (SJF): Selects the process with the shortest next CPU burst time. Optimal for minimal average waiting time, but causes starvation for long tasks.

Shortest Remaining Time First (SRTF): Preemptive version of SJF. If a new process arrives with a shorter burst time than the currently running process, the current process is preempted.

Round Robin (RR): Preemptive scheduler designed for time-sharing systems. Assigns a fixed Time Quantum (e.g., 10 − 50 ms 10 - 50 \text{ ms} 10 − 50 ms ) to each process sequentially in a circular queue.

Priority Scheduling: Assigns a priority rank to each process. High priority processes run first. Prevents starvation using Aging (gradually increasing the priority of long-waiting processes).

3. Memory Management & Virtual Memory Paging

Modern operating systems use Virtual Memory to allow processes to execute even if their total memory code exceeds physical RAM size.

Paging Architecture & Logical-to-Physical Address Translation

Main memory is divided into fixed-size physical blocks called Frames . Virtual process memory is divided into equal-sized logical blocks called Pages .

A logical address generated by the CPU consists of a Page Number ( p p p ) and an Offset ( d d d ) : Logical Address = ( p , d ) \text{Logical Address} = (p, d) Logical Address = ( p , d ) Physical Address = ( f × Frame Size ) + d \text{Physical Address} = (f \times \text{Frame Size}) + d Physical Address = ( f × Frame Size ) + d

where f f f is the Frame Number retrieved from the system Page Table . +-----------------------------------------------------------------+

  • | PAGING ADDRESS TRANSLATION |
  • | |
  • | CPU Logical Address: [ Page (p) | Offset (d) ] |
  • | | | |
  • | v | |
  • | +---------------+ | |
  • | | PAGE TABLE | | |
  • | | Page p -> Frame f | |
  • | +---------------+ | |
  • | | | |
  • | v v |
  • | RAM Physical Address: [ Frame (f) | Offset (d) ] |
  • +-----------------------------------------------------------------+
  • Step-by-Step Worked Paging Calculation

Problem: A virtual memory system uses a page size of 4 KB = 4096 bytes 4 \text{ KB} = 4096 \text{ bytes} 4 KB = 4096 bytes . A CPU generates a logical address of 10000 10 10000_{10} 1000 0 10 ​ . Given that Page 2 2 2 maps to Physical Frame 7 7 7 , compute the exact Physical Memory Address.

  • Step A: Determine Page Number ( p p p ) and Offset ( d d d )
  • Page Number ( p p p ) = floor(Logical Address / Page Size) = floor(10000 / 4096) = 2
  • Offset ( d d d ) = Logical Address mod Page Size = 10000 mod 4096 = 10000 - (2 * 4096) = 10000 - 8192 = 1808
  • Step B: Look up Frame Number ( f f f )

From the Page Table entry for Page 2 2 2 , Frame Number f = 7 f = \mathbf{7} f = 7 .

Step C: Compute Physical Address Physical Address = ( f × Page Size ) + d = ( 7 × 4096 ) + 1808 = 28672 + 1808 = 30480 10 \text{Physical Address} = (f \times \text{Page Size}) + d = (7 \times 4096) + 1808 = 28672 + 1808 = \mathbf{30480_{10}} Physical Address = ( f × Page Size ) + d = ( 7 × 4096 ) + 1808 = 28672 + 1808 = 3048 0 10 ​

Page Faults & Thrashing

Page Fault: Occurs when a process accesses a page not currently loaded into physical RAM. The OS halts the process, fetches the page from disk swap space into an open RAM frame, updates the Page Table, and resumes execution.

Thrashing: Occurs when the system spends more time handling page faults and swapping pages in and out of disk than executing real work. Resolving thrashing requires increasing RAM capacity or terminating heavy processes.

4. Software Classification & Language Translators

Software is broadly divided into System Software (maintains system infrastructure) and Application Software (performs user domain tasks like banking transactions). +-----------------------------------------------------------------+

  • | SOFTWARE CLASSIFICATION |
  • | |
  • | /-------------------\ |
  • | | Computer Software | |
  • | \-------------------/ |
  • | | |
  • | +------------------+------------------+ |
  • | | | |
  • | v v |
  • | +-------------------+ +-------------------+ |
  • | | System Software | | Application Soft. | |
  • | +-------------------+ +-------------------+ |
  • | | - Operating System| | - Banking Systems | |
  • | | - Device Drivers | | (Finacle/BaNCS) | |
  • | | - Utility Programs| | - MS Office Suite | |
  • | | - Translators | | - Web Browsers | |
  • | +-------------------+ +-------------------+ |
  • +-----------------------------------------------------------------+
  • Language Translators: Assembler, Compiler, Interpreter

High-level programming languages (C++, Java, Python) must be translated into binary Machine Code ( 0 0 0 s and 1 1 1 s).

Feature Compiler Interpreter Assembler

Input Language High-Level Code (C, C++, Rust) High-Level Code (Python, Ruby, JavaScript) Assembly Language (mnemonics like MOV, ADD)

Translation Method Scans and translates the entire source code into object code in one pass. Translates and executes source code line-by-line dynamically. Converts Assembly mnemonics directly into binary machine code.

Execution Speed Faster post-compilation (standalone executable created). Slower (requires interpreter execution at runtime). Extremely fast low-level translation.

Debugging / Errors Reports all syntax errors together after full compilation pass. Stops execution immediately at the first encountered error line. Low-level hardware mnemonic error reporting.

Output File Generates standalone Object/Executable file ( .exe , .so ). Does not produce intermediate machine code files. Generates object code module.

Exam Strategies & Common Traps

Preemptive vs. Non-Preemptive Scheduling: FCFS and SJF are non-preemptive by default. Round Robin and SRTF are strictly preemptive. In preemptive scheduling, the OS forcefully removes a process from the CPU when a higher-priority task arrives or time quantum expires.

Compiler vs. Interpreter Output: A Compiler produces an independent binary executable file ( .exe ), whereas an Interpreter executes source code directly on the fly without generating an executable file on disk.

Page Fault Overhead: Remember that page faults involve disk I/O, which is thousands of times slower than RAM operations.