Loading...
Loading...
The IBPS SO IT Officer syllabus is divided into two fundamentally different parts: Prelims (which tests general banking aptitude) and Mains (which tests advanced IT and Computer Science knowledge). Understanding this split is the starting point for every effective preparation plan. Candidates who over-invest in Prelims aptitude preparation while neglecting the Mains technical subjects consistently underperform because only Mains + Interview scores determine the final merit.
The Mains Professional Knowledge paper is where the selection is actually decided. The Mains marks carry 80% weightage in the final merit formula, with Interview carrying the remaining 20%. Prelims is qualifying only.
This page covers the complete official syllabus for both stages with topic-level detail, the exam pattern with marking scheme, PYQ-based topic weightage for the Mains technical paper, preparation priorities, and a structured study framework.
| Section Questions Marks Time | |||
| Reasoning | 50 | 50 | 40 minutes |
| English Language | 25 | 25 | 40 minutes |
| Quantitative Aptitude | 50 | 50 | 40 minutes |
| Total | 125 | 125 | 120 minutes |
Key rules:
| Section Questions Marks Time | |||
| Professional Knowledge (IT) | 60 | 60 | 45 minutes |
Key rules:
| Component Weightage | |
| Mains Professional Knowledge | 80% |
| Interview | 20% |
| Final Score | 100% |
| Topic Sub-types | |
| Puzzles and Seating Arrangement | Linear (single/double row), Circular, Floor-based, Box-based, Scheduling, Hybrid multi-variable |
| Syllogism | Two-premise and three-premise; possibility-based |
| Coded Inequalities | Symbol-based inequality; chain inequalities |
| Blood Relations | Family tree, coded blood relations |
| Direction Sense | Multi-step direction and distance |
| Coding-Decoding | Letter shifting, number coding, symbol-based |
| Input-Output | Machine-input step sequences |
| Data Sufficiency | Two-statement sufficiency |
| Alphanumeric Series | Letter-number pattern series |
| Logical Reasoning | Statement-Conclusion, Statement-Argument, Critical Reasoning |
| Order and Ranking | Position-based ranking from clues |
| Classification | Odd one out (verbal and figural) |
| Topic Average Questions per Shift Priority | ||
| Puzzles and Seating Arrangement | 20 to 25 (dominant; 4-5 sets) | Non-negotiable |
| Syllogism | 3 to 5 | Very High |
| Coded Inequalities | 3 to 5 | Very High |
| Coding-Decoding | 3 to 4 | High |
| Input-Output | 3 to 5 | High |
| Blood Relations | 2 to 3 | High |
| Direction Sense | 2 to 3 | Medium |
| Data Sufficiency | 2 to 3 | Medium |
| Alphanumeric Series | 2 to 3 | Medium |
| Logical Reasoning | 3 to 5 | Medium |
Puzzles and Seating Arrangement dominate the Reasoning section at 40-50% of questions. Candidates who cannot solve 3-4 complex puzzle sets in 25-28 minutes will not complete the section effectively.
| Topic Sub-topics | |
| Data Interpretation | Tables, Bar Graphs, Pie Charts, Line Graphs, Mixed/Combination DI, Caselet DI |
| Number Series | Missing term, wrong number in series |
| Simplification and Approximation | BODMAS, percentage-based approximation |
| Quadratic Equations | Comparing roots of two equations |
| Arithmetic | Percentage, Profit/Loss/Discount, SI/CI, Time and Work, Pipes and Cisterns, Speed/Distance/Time, Trains, Boats and Streams, Ratio and Proportion, Average, Mixture and Alligation, Partnership |
| Probability | Basic probability |
| Permutation and Combination | Counting problems |
| Mensuration | Area, perimeter, volume problems |
| Data Sufficiency | Quantitative two-statement problems |
| Topic Average Questions per Shift Priority | ||
| Data Interpretation (2-3 sets) | 15 to 20 | Non-negotiable |
| Arithmetic (all topics) | 12 to 18 | Non-negotiable |
| Number Series | 4 to 6 | Very High |
| Simplification/Approximation | 3 to 5 | High |
| Quadratic Equations | 3 to 5 | High |
| Probability, P&C | 2 to 4 | Medium |
| Mensuration | 1 to 2 | Lower |
DI and Arithmetic together account for 65-75% of the QA section. These are the highest-priority topics for Prelims QA preparation.
| Topic Sub-types | |
| Reading Comprehension | 1-2 passages; inference, vocabulary-in-context, direct questions |
| Cloze Test | Fill multiple blanks in a connected passage |
| Fill in the Blanks | Single and double fillers |
| Error Spotting | Identify grammatically incorrect part of a sentence |
| Para Jumbles | Arrange jumbled sentences into coherent paragraph |
| Sentence Improvement/Correction | Choose better phrasing |
| Vocabulary | Synonyms, Antonyms, Word Usage |
| Sentence Completion | Complete the sentence with appropriate option |
| Topic Average Questions per Shift Priority | ||
| Reading Comprehension | 5 to 8 | Non-negotiable |
| Cloze Test | 4 to 6 | Very High |
| Fill in the Blanks | 3 to 5 | Very High |
| Error Spotting | 3 to 4 | High |
| Para Jumbles | 2 to 3 | High |
| Sentence Improvement | 2 to 3 | Medium |
| Vocabulary | 1 to 3 | Medium |
This is the most important section of the entire IBPS SO IT Officer preparation. The 7 core technical subjects tested are:
| Topic Coverage | |
| Process Management | Process states, PCB, threads vs processes, context switching |
| CPU Scheduling | FCFS, SJF, Round Robin, Priority, MLFQ scheduling; preemptive vs non-preemptive |
| Process Synchronisation | Critical section, mutex, semaphore, monitors, deadlock (detection, prevention, avoidance, recovery) |
| Memory Management | Logical vs physical address, paging, segmentation, page replacement algorithms (FIFO, LRU, OPT), thrashing |
| Virtual Memory | Demand paging, page fault, working set model |
| File System | File allocation methods (contiguous, linked, indexed), directory structure, disk scheduling (FCFS, SSTF, SCAN, C-SCAN) |
| I/O Management | Device drivers, interrupts, DMA, I/O buffering |
| OS Types | Batch, time-sharing, real-time, distributed OS; Unix/Linux architecture; Windows architecture basics |
| System Calls | Types and purpose; system call interface |
High-frequency OS topics in IBPS SO IT PYQs: CPU scheduling algorithms (expected completion times), page replacement algorithms, deadlock conditions (Coffman's conditions), semaphore problems.
| Topic Coverage | |
| Relational Model | Relations, attributes, tuples, keys (primary, foreign, candidate, super), referential integrity |
| SQL | DDL (CREATE, ALTER, DROP), DML (SELECT, INSERT, UPDATE, DELETE), DCL (GRANT, REVOKE), TCL (COMMIT, ROLLBACK); complex queries with JOIN, GROUP BY, HAVING, subqueries |
| Normalization | Functional dependencies, 1NF, 2NF, 3NF, BCNF, 4NF, 5NF; decomposition |
| Transaction Management | ACID properties, transaction states, serializability, conflict and view serializability |
| Concurrency Control | Locking protocols (2PL, strict 2PL), timestamp ordering, optimistic concurrency control |
| Recovery | Log-based recovery, checkpoints, ARIES protocol |
| Indexing and Hashing | B-tree, B+ tree, primary and secondary index, dense and sparse index, hashing techniques |
| Entity-Relationship (ER) Model | Entities, attributes, relationships, cardinality, ER to relational mapping |
| NoSQL | Types (document, key-value, columnar, graph), use cases, CAP theorem |
| Distributed Databases | Fragmentation, replication, distributed transactions |
High-frequency DBMS topics: SQL JOIN queries, normalization forms (up to BCNF), B+ tree operations, transaction serializability, ACID properties.
| Topic Coverage | |
| Network Models | OSI model (7 layers, functions, protocols at each layer), TCP/IP model (4 layers) |
| Physical Layer | Transmission media, bandwidth, modulation techniques, multiplexing (FDM, TDM, WDM) |
| Data Link Layer | Framing, error detection (CRC, parity, checksum), error correction (Hamming), flow control (Stop-and-wait, sliding window), MAC protocols (CSMA/CD, CSMA/CA), Ethernet |
| Network Layer | IP addressing (IPv4, IPv6), subnetting, CIDR, routing protocols (OSPF, BGP, RIP), ARP, RARP, ICMP, NAT |
| Transport Layer | TCP (three-way handshake, connection management, congestion control), UDP, port numbers, socket programming basics |
| Application Layer | HTTP/HTTPS, FTP, SMTP, DNS, DHCP, SNMP, telnet, SSH |
| Network Security | Symmetric encryption (AES, DES), asymmetric encryption (RSA), SSL/TLS, digital signatures, firewalls, IDS/IPS, VPN, PKI |
| Network Devices | Hub, switch, router, gateway, repeater, bridge, modem |
| Wireless Networks | Wi-Fi (802.11 standards), Bluetooth, cellular networks (3G, 4G, 5G basics) |
| Cloud Networking | SDN, NFV, cloud networking concepts |
High-frequency Networking topics: OSI layers (functions and protocols), IP addressing and subnetting, TCP handshake, routing protocols comparison, SSL/TLS mechanism.
| Topic Coverage | |
| Arrays | Operations, 2D arrays, matrix operations |
| Linked Lists | Singly, doubly, circular; insertion, deletion, reversal |
| Stacks and Queues | Operations, applications (expression evaluation, BFS), priority queue |
| Trees | Binary tree, BST, AVL tree (rotations), B-tree, B+ tree, heap (min/max), tree traversals (inorder, preorder, postorder, level-order) |
| Graphs | Representation (adjacency matrix, list), BFS, DFS, shortest path (Dijkstra, Bellman-Ford, Floyd-Warshall), minimum spanning tree (Kruskal, Prim), topological sort |
| Hashing | Hash functions, collision resolution (chaining, open addressing), load factor |
| Sorting Algorithms | Bubble, Selection, Insertion, Merge, Quick, Heap, Counting, Radix sort; time and space complexity |
| Searching | Linear search, binary search, search in BST |
| Algorithm Design | Divide and conquer, Dynamic Programming (DP), Greedy algorithms, Backtracking |
| Complexity | Big-O notation, time and space complexity analysis, P vs NP basics |
High-frequency DSA topics: Sorting algorithm time complexities, tree traversals, graph algorithms (BFS/DFS, Dijkstra), hashing, BST operations.
| Topic Coverage | |
| Number Systems | Binary, octal, hexadecimal conversion; 1's and 2's complement; BCD, IEEE 754 floating point |
| Digital Logic | Boolean algebra, logic gates, Karnaugh maps, combinational circuits (adder, MUX, encoder/decoder), sequential circuits (flip-flops, registers, counters) |
| CPU Architecture | ALU, control unit, registers, instruction cycle (fetch-decode-execute), pipelining, hazards |
| Memory Hierarchy | Registers, cache (direct-mapped, set-associative, fully associative), RAM, ROM, secondary storage; memory access time calculation |
| Instruction Set Architecture | RISC vs CISC, addressing modes |
| Input/Output | I/O interfaces, interrupt-driven I/O, DMA, I/O channels |
| Microprocessors | 8085/8086 basics, register set, instruction types, addressing modes |
| Topic Coverage | |
| SDLC Models | Waterfall, Prototype, Incremental, Spiral, RAD, Agile (Scrum, Kanban), V-model |
| Requirements Engineering | Functional vs non-functional requirements, use case diagrams, SRS |
| Software Design | Coupling and cohesion, design patterns (Creational, Structural, Behavioural), UML diagrams (class, sequence, activity, use case) |
| Software Testing | Unit testing, integration testing, system testing, acceptance testing, black-box vs white-box, regression testing |
| Software Metrics | LOC, function points, cyclomatic complexity, code coverage |
| Project Management | Estimation techniques (COCOMO, function points), Gantt charts, PERT, critical path method |
| Software Quality | ISO 9001, CMMI levels, software quality attributes |
| Version Control | Git basics (commit, branch, merge, pull request) |
| Topic Coverage | |
| OOP Concepts | Classes and objects, encapsulation, inheritance (single, multiple, multilevel, hierarchical), polymorphism (compile-time and run-time), abstraction |
| Java Specifics | JVM architecture, data types, control structures, arrays, strings, exception handling (try-catch-finally), packages, interfaces vs abstract classes, collections framework basics |
| C++ Specifics | Pointers and references, operator overloading, templates, STL (vector, map, set), destructors |
| Design Principles | SOLID principles, DRY, KISS |
| Advanced OOP | Generic programming, lambda expressions, inner classes |
| Priority Subject Key Topics | ||
| Non-negotiable | DBMS | SQL, Normalization, B+ Trees, Transactions |
| Non-negotiable | Networking | OSI/TCP layers, IP/Subnetting, TCP, Security |
| Non-negotiable | OS | CPU Scheduling, Memory Management, Deadlocks |
| Non-negotiable | DSA | Sorting complexity, Trees, Graphs, Hashing |
| Very High | OOP | Java/C++ core concepts, Inheritance, Polymorphism |
| High | Software Engineering | SDLC models, Testing types, UML |
| High | Computer Organization | Number systems, Pipelining, Memory hierarchy |
| Medium | Cybersecurity | CIA triad, Encryption, Banking-specific IT security |
| Medium | Cloud Computing | IaaS/PaaS/SaaS, Virtualisation |
Build Reasoning (Puzzles focus), QA (DI and Arithmetic), and English skills to a level that comfortably clears the Prelims cutoff. Target 65-75 out of 125 in full mock tests.
Begin Mains technical preparation immediately — do not wait for Prelims. The DBMS, Networking, OS, and DSA subjects require significant study time. Study one subject per week, covering all subtopics.
Take full Prelims mock tests 3x per week. Take full Mains Professional Knowledge mock tests daily. Review every wrong Mains answer by returning to the specific concept in the textbook.
What is the most important subject for IBPS SO IT Officer Mains? DBMS, Networking, and Operating Systems collectively account for approximately 45-55% of Professional Knowledge questions in most cycles. These three subjects are the highest priority.
Is the Prelims pattern the same as IBPS PO Prelims? No. IBPS SO IT Officer Prelims has 125 questions (vs IBPS PO's 100), includes 50 QA questions (vs 35), and has 40-minute sectional timers for each section. The Reasoning and QA are slightly harder than IBPS PO Prelims.
Can GATE preparation help for IBPS SO IT Officer Mains? Yes significantly. GATE Computer Science covers OS, DBMS, Networking, DSA, and Computer Organisation at the same depth as IBPS SO IT Mains. GATE-level preparation for these subjects provides strong Mains readiness.