Study guide

2.2 Coding-Decoding Techniques

SBI Clerk Junior Associate

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Exam Structure, Eligibility, Selection & Winning Strategy

1.1 SBI Clerk Overview, Eligibility & Two-Stage Selection 1.2 Exam Pattern, Sectional Timing & Negative Marking Mechanics 1.3 Time Allocation, Question Selection & Cutoff Strategy 1.4 Final Selection, Local Language Proficiency Test & Joining Formalities

2 Chapter 2: Reasoning — Coding, Series, Relations & Input-Output

2.1 Alphanumeric, Symbol & Number Sequences 2.2 Coding-Decoding Techniques 2.3 Blood Relations 2.4 Input-Output (Machine Input) Arrangements

3 Chapter 3: Reasoning — Direction, Ranking, Inequalities & Miscellaneous

3.1 Direction Sense & Distance 3.2 Order, Ranking & Comparison Tests 3.3 Coded and Direct Inequalities 3.4 Alphabet Test, Word Formation, Calendar & Clock

4 Chapter 4: Reasoning — Syllogisms, Critical Deduction & Data Sufficiency

4.1 Standard Syllogisms & Venn Diagram Foundations 4.2 Advanced Syllogism Cases: Only a Few & Possibility Models 4.3 Critical Reasoning for Mains Examination 4.4 Reasoning Data Sufficiency

5 Chapter 5: Reasoning — Seating Arrangements

5.1 Linear Seating Arrangements 5.2 Parallel Row Seating Arrangements 5.3 Circular & Square/Rectangular Seating Arrangements

6 Chapter 6: Reasoning — Puzzles & Complex Enigmas

6.1 Floor and Flat-Based Puzzles 6.2 Box-Based Puzzles & Vertical Stacks 6.3 Scheduling, Month-Date & Multi-Variable Matrix Puzzles

7 Chapter 7: Quantitative Aptitude: Speed Math & Number Foundations

7.1 Speed Math, Vedic Shortcuts & BODMAS Simplification 7.2 Approximation Strategies for High-Speed Calculations 7.3 Missing and Wrong Number Series

8 Chapter 8: Quantitative Aptitude: Equations & Percentage Mathematics

8.1 Quadratic Equations & Root Comparison 8.2 Percentages, Base Conversions & Successive Changes 8.3 Profit, Loss, Marked Price, Discount & Dishonest Seller Traps

9 Chapter 9: Quantitative Aptitude: Interest, Ratio & Partnership

9.1 Simple & Compound Interest Mechanics 9.2 Ratio, Proportion & Variation Techniques 9.3 Partnership Mathematics

10 Chapter 10: Quantitative Aptitude: Averages, Mixtures & Time-Work

10.1 Averages, Weighted Averages & Age Problems 10.2 Alligation Method & Solution Replacement Problems 10.3 Time & Work, Efficiency Ratios & Pipes and Cisterns

11 Chapter 11: Quantitative Aptitude: Speed, Motion & Applied Mathematics

11.1 Speed, Time & Distance Principles 11.2 Problems on Trains, Platforms, and Boats & Streams 11.3 2D/3D Mensuration & Banking Permutation, Combination, Probability

12 Chapter 12: Quantitative Aptitude: Data Interpretation & Sufficiency

12.1 Tabular, Bar & Line Graph Data Interpretation 12.2 Pie Charts & Paragraph-Based Caselet DI 12.3 Advanced Mains DI & Quantitative Data Sufficiency

13 Chapter 13: English Language: Grammar & Usage

13.1 Core Grammar Rules for Banking Exams 13.2 Tenses, Prepositional Usages & Conditional Clauses 13.3 Error Spotting & Sentence Correction Strategies

14 Chapter 14: English Language: Comprehension, Vocabulary, Idioms & Discourse

14.1 Phrase Replacement, Single/Double Fillers & Sentence Improvement 14.2 Reading Comprehension Mastery 14.3 Cloze Tests, Para Jumbles & Discourse Connectors 14.4 Vocabulary: Synonyms, Antonyms, One-Word Substitution & Word Usage 14.5 Idioms, Phrasal Verbs, Spelling & Odd Sentence Out

15 Chapter 15: General & Financial Awareness: Banking System, RBI & Capital Regulation

15.1 Structure of the Indian Banking System 15.2 Reserve Bank of India & Monetary Policy Framework 15.3 Banking Operations, Negotiable Instruments & KYC/AML 15.4 Basel III Capital Framework, Prompt Corrective Action & D-SIBs

16 Chapter 16: General & Financial Awareness: Digital Banking & Financial Inclusion

16.1 Payment Systems, NPCI & Digital Banking 16.2 Priority Sector Lending & Financial Inclusion Initiatives 16.3 Non-Performing Assets & Debt Recovery Mechanisms

17 Chapter 17: General & Financial Awareness: Financial Markets, Economy, Schemes & Current Affairs

17.1 Money Market & Capital Market Instruments 17.2 Flagship Government Social Security Schemes & Union Budget 17.3 Static Banking GK, Financial Regulators & Current Affairs Mastery 17.4 Indian Economy Essentials: National Income, Inflation, Fiscal Indicators, GST & External Sector

18 Chapter 18: Computer Aptitude

18.1 Computer Fundamentals: Hardware Architecture, Memory & OS 18.2 Networking Protocols, Cybersecurity & Microsoft Office 18.3 Number Systems, Logic Gates, Flowcharts & Computer Basics

2.2 Coding-Decoding Techniques

Key Takeaways Explain This Topic AI

Substitutional (Chinese) coding in Prelims is most efficiently solved on-demand by locating specific query words across sentences, avoiding the time penalty of translating the entire vocabulary.

The 27-Sum Rule provides an instant mathematical validation for reverse alphabet pairs (e.g., A=1 and Z=26; G=7 and T=20), where the sum of forward and reverse letter ranks equals 27.

Letter-shifting patterns in banking exams adhere to systematic operations including arithmetic progressions (+1, +2, +3), alternating signs (+2, -1, +2, -1), or vowel/consonant split rules.

Advanced Mains-level conditional coding matrices require strict top-to-bottom rule evaluation, where candidates must test each condition in listed sequence and apply only the qualifying transformation.

Last updated: September 2026

2.2 Coding-Decoding Techniques

Exam Focus: Coding-Decoding constitutes a reliable 5-mark block in SBI Clerk Prelims through substitutional sentence coding, and 4 to 6 marks in Mains through multi-condition data transformation tables and high-level analytical symbol-letter-number ciphers.

Evolution of Coding Patterns in Banking Exams

Historically, banking exams relied on elementary letter shifts (e.g., + 1 +1 + 1 or + 2 +2 + 2 ). Today, the SBI Clerk examination deploys three distinct tiers of coding:

Substitutional / Sentence Coding (Prelims): A cluster of 4 sentences coded into artificial words, solved by set-intersection elimination.

Letter-Shift & Reverse-Pair Ciphers (Prelims & Mains): Direct word transformations based on alphabetical positional values and symmetry.

Coded Conditional Operations & Matrix Transformations (Mains): Algorithmic transformation of alphanumeric strings governed by hierarchical condition sets.

Substitutional / "Chinese" Sentence Coding (The Prelims Staple)

In substitutional coding, 3 to 4 statements containing standard English banking terminology are paired with pseudo-language codes. The position of each code word does not correspond to the position of the English word; codes are determined purely through logical cross-referencing.

Baseline Problem Set

Consider the following four statements:

  • Statement 1: reserve bank credit window → \rightarrow → ka la pe zi
  • Statement 2: credit growth digital policy → \rightarrow → pe ro ma tu
  • Statement 3: bank digital security reserve → \rightarrow → zi ma no ka
  • Statement 4: monetary policy credit reserve → \rightarrow → tu pe ka bi
  • Step-by-Step Matrix Elimination Methodology

To decode systematically without writing excessive rough notes:

Identify High-Frequency Anchor Words: Find words appearing in 3 or 4 statements first.

Compare Statements 1, 2, and 4: The common English word across all three is credit . The common code across all three is pe . c r e d i t = p e \mathbf{credit = pe} credit = pe

Compare Statements 1, 3, and 4: The common English word is reserve . The common code is ka . r e s e r v e = k a \mathbf{reserve = ka} reserve = ka

Identify Two-Statement Intersections:

Compare Statements 1 and 3: The remaining common word is bank (since reserve is already accounted for). The remaining common code is zi . b a n k = z i \mathbf{bank = zi} bank = zi

Isolate Statement 1 remainder: Only the word window remains. Its corresponding code must be la . w i n d o w = l a \mathbf{window = la} window = la

Compare Statements 2 and 3: The common word is digital . The common code is ma . d i g i t a l = m a \mathbf{digital = ma} digital = ma

Compare Statements 2 and 4: The common word is policy . The common code is tu . p o l i c y = t u \mathbf{policy = tu} policy = tu

Isolate Unique Terminal Words:

In Statement 2: The only unassigned word is growth . The unassigned code is ro . g r o w t h = r o \mathbf{growth = ro} growth = ro

In Statement 3: The only unassigned word is security . The unassigned code is no . s e c u r i t y = n o \mathbf{security = no} security = no

In Statement 4: The only unassigned word is monetary . The unassigned code is bi . m o n e t a r y = b i \mathbf{monetary = bi} monetary = bi

Complete Decoded Lexicon

  • English Banking Term Assigned Code Method of Deduction
  • credit pe Common to Statements 1, 2, 4
  • reserve ka Common to Statements 1, 3, 4
  • bank zi Common to Statements 1, 3 (after eliminating reserve)
  • window la Sole remainder in Statement 1
  • digital ma Common to Statements 2, 3
  • policy tu Common to Statements 2, 4
  • growth ro Sole remainder in Statement 2
  • security no Sole remainder in Statement 3
  • monetary bi Sole remainder in Statement 4

Pro-Tip: "Solve on Demand" Strategy: In the actual exam, do not decode all 9 words upfront. Look at the specific questions asked. If the questions only ask for the codes for security , growth , and reserve bank , decode only those specific terms. This saves 35 to 45 seconds.

Letter-Shifting Mechanics & The 27-Sum Rule

Single-word coding problems require candidates to manipulate the alphabetical sequence rapidly.

The EJOTY Reference Anchor

Memorize alphabetical numerical positions using 5-interval anchors: E = 5 , J = 10 , O = 15 , T = 20 , Y = 25 \mathbf{E = 5,\quad J = 10,\quad O = 15,\quad T = 20,\quad Y = 25} E = 5 , J = 10 , O = 15 , T = 20 , Y = 25

The 27-Sum Rule for Reverse (Opposite) Pairs

In the English alphabet, two letters are opposite pairs if their forward rank and backward rank are identical. Mathematically, the sum of their numerical forward positions always equals 27 : Position ( X ) + Position ( Opposite of X ) = 27 \text{Position}(X) + \text{Position}(\text{Opposite of } X) = 27 Position ( X ) + Position ( Opposite of X ) = 27

For example, to find the opposite of H H H (Rank 8): 27 − 8 = 19 ⟹ S 27 - 8 = 19 \implies S 27 − 8 = 19 ⟹ S .

  • Pair Forward Ranks Memory Mnemonic Note
  • A – Z 1 + 26 = 27 1 + 26 = 27 1 + 26 = 27 A to Z Extreme ends
  • B – Y 2 + 25 = 27 2 + 25 = 27 2 + 25 = 27 B o Y Second pair
  • C – X 3 + 24 = 27 3 + 24 = 27 3 + 24 = 27 C ru X Third pair
  • D – W 4 + 23 = 27 4 + 23 = 27 4 + 23 = 27 D e W Fourth pair
  • E – V 5 + 22 = 27 5 + 22 = 27 5 + 22 = 27 EV ening Vowel E pairs with consonant V
  • F – U 6 + 21 = 27 6 + 21 = 27 6 + 21 = 27 FU n Consonant F pairs with vowel U
  • G – T 7 + 20 = 27 7 + 20 = 27 7 + 20 = 27 GT Road Seventh pair
  • H – S 8 + 19 = 27 8 + 19 = 27 8 + 19 = 27 H igh S chool Eighth pair
  • I – R 9 + 18 = 27 9 + 18 = 27 9 + 18 = 27 I ndian R ailways Vowel I pairs with consonant R
  • J – Q 10 + 17 = 27 10 + 17 = 27 10 + 17 = 27 J ack- Q ueen Tenth pair
  • K – P 11 + 16 = 27 11 + 16 = 27 11 + 16 = 27 K urta P ajama Eleventh pair
  • L – O 12 + 15 = 27 12 + 15 = 27 12 + 15 = 27 LO ve Consonant L pairs with vowel O
  • M – N 13 + 14 = 27 13 + 14 = 27 13 + 14 = 27 M a N Central midpoint pair
  • Common Letter Shift Architectures

Constant Shift: Every letter moves by + k +k + k or − k -k − k (e.g., B A N K → E D Q N BANK \rightarrow EDQN B A N K → E D QN with + 3 +3 + 3 ).

Progressive Shift: Shifts increase linearly: + 1 , + 2 , + 3 , + 4 , + 5 +1, +2, +3, +4, +5 + 1 , + 2 , + 3 , + 4 , + 5 .

Reverse-Pair Inversion: Each letter is replaced by its 27-sum opposite pair.

Cross-Over (Split-Halves) Shift: The first half and second half are inverted or cross-shifted.

Advanced Mains-Level Coded Conditional Operations

In SBI Clerk Mains, Coding-Decoding features a tabular matrix of symbols and numbers with predefined letter codes, supplemented by a set of sequential conditions.

The Mains Reference Matrix

  • Element 4 # 7 @ 2 % 9 $ 6 8 & 3 5
  • Code M K R D T B W F P L J H N
  • The Operational Conditions

Condition (i): If the first element is a symbol and the last element is an even number, their codes are interchanged.

Condition (ii): If an odd number is immediately preceded and immediately followed by a symbol, that odd number is coded as X .

Condition (iii): If both the first and last elements are odd numbers, both are to be coded as the code for the first element.

Condition (iv): If an even number is immediately followed by a symbol, the even number is coded as Z .

Evaluation Protocol: Test conditions in strict numerical order. Unless stated otherwise, apply only the primary matching rule, or follow compound instructions if rules apply to distinct positions.

  • Step-by-Step Worked Walkthrough
  • Problem: Code the input string @ 7 # 6 8

Check Condition (i): First element is @ (Symbol), last element is 8 (Even number). Condition (i) applies!

Check Condition (ii) for internal elements: Odd number surrounded by symbols? 7 is preceded by @ (symbol) and followed by # (symbol). Condition (ii) applies to 7!

Check Condition (iv): Even number immediately followed by a symbol? 6 is followed by 8 (number, not symbol). Does not apply.

Apply transformations:

Interchange first ( @ ) and last ( 8 ):

Normal code for @ is D ; normal code for 8 is L .

First element @ receives code L .

Last element 8 receives code D .

Apply Condition (ii) to 7 : Code as X .

Remaining elements coded normally: # is K , 6 is P .

  • Assemble resulting code string: L X K P D \mathbf{L \quad X \quad K \quad P \quad D} L X K P D
  • Mains Pattern Discovery: Symbol-Number-Letter Triads

In some Mains sets, each word is coded as a symbol-number-letter triad, and you must discover the rule from examples. Suppose:

"GROWTH IN BANKING" → \rightarrow → %6T #2R $7Y

Decode each component separately and test it on every word:

Number: GROWTH has 6 letters, IN has 2 and BANKING has 7, so the number is the word length.

Letter: G becomes T, I becomes R and B becomes Y. Each is the 27-sum opposite of the word's first letter (G = 7 and T = 20; I = 9 and R = 18; B = 2 and Y = 25).

Symbol: With only one example per symbol, the symbol's rule cannot be fixed yet. Look for another coded statement in the set that repeats a symbol before relying on a guess.

Applying the two confirmed rules, NOTE would carry the number 4 and the letter M (N = 14, and 27 − 14 = 13 = M).

Critical Exam Pitfalls to Avoid

The Premature Assignment Fallacy: In substitutional coding, never assume that because growth and policy appear in two sentences, the first code belongs to growth . Always cross-verify against a third sentence.

Ignoring "Either / Or" Options: When two words (e.g., rate hike ) appear together in two statements and nowhere else, their codes cannot be separated. The answer must be marked as "Either A or B".

Overriding Condition Priorities: In conditional coding, check whether the instructions state "If more than one condition applies, apply only Condition 1" or "Apply all conditions simultaneously" .

Loading diagram... Coding-Decoding Problem Classification and Resolution Pipeline