Study guide
15.1 Letter Shifts, Reversal & Numerical Codes
RRB Section Controller 2026: Free Written CBT Study Guide Exam
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Exam Overview & Operational Profile
1.1 Written CBT Pattern, Scoring & Selection 1.2 Eligibility, Documents & A-2 Medical Requirements
2 Chapter 2: Number Systems & Arithmetic Foundations
2.1 Number Systems, Divisibility Rules, Prime Factorization & Remainder Theorem 2.2 Unit Digits, Cyclicity Rules & Power Modulo Calculations 2.3 HCF and LCM Properties, Prime Factorization & Practical Word Problems 2.4 Fractions, Decimals, Surds, Indices & BODMAS Simplification
3 Chapter 3: Commercial Arithmetic: Percentages, Profit & Rates
3.1 Percentages, Fractional Equivalents, Successive Variations & Population Formulas 3.2 Cost Price, Selling Price, Profit/Loss Percentage, Dishonest Dealer & Discount Schemes 3.3 Simple Interest, Compound Interest Formulas, Annual/Semi-Annual Compounding & Difference Traps
4 Chapter 4: Ratios, Proportions, Mixtures & Partnerships
4.1 Ratios, Duplicate/Sub-Duplicate Ratios, Direct and Inverse Variations & Proportional Sharing 4.2 Averages, Change in Average, Batsman/Bowling Averages & Replacement Problems 4.3 Rule of Alligation, Removal-Replacement Mixtures & Partnership Capital-Time Sharing
5 Chapter 5: Motion Dynamics, Time, Distance & Train Logistics
5.1 Time, Speed, Distance Relations, Average Speed & Unit Conversions 5.2 Train Problems: Passing Poles, Platforms, Moving Objects & Relative Speed in Opposite/Same Directions 5.3 Upstream, Downstream Boat Velocity, Still Water Speed & Circular Track Races
6 Chapter 6: Work Efficiency, Pipes & Operational Scheduling
6.1 Individual and Group Work, Efficiency Ratios, Work Equivalences & Mandays Formula 6.2 Alternate Day Working, Negative Work & Wage Distribution Based on Work Done 6.3 Inlet and Outlet Pipes, Net Filling Rate, Alternating Flow & Tank Leakage Problems
7 Chapter 7: Algebra, Linear Equations & Progressions
7.1 Algebraic Identities, Polynomial Factorization & Systems of Linear Equations in Two Variables 7.2 Quadratic Equations, Nature of Roots, Discriminant Analysis & Maximum/Minimum Values 7.3 Arithmetic Progressions (AP), General Term, Sum of n Terms & Sequence Modeling
8 Chapter 8: Mensuration: 2D Areas & 3D Solids
8.1 Lines, Angles, Triangle Theorems, Congruence/Similarity & Circle Tangent Properties 8.2 Perimeter and Area of Quadrilaterals, Polygons, Circles & Shaded Region Problems 8.3 Surface Area and Volume of Cubes, Cuboids, Cylinders, Cones, Spheres & Melting-Recasting Solids
9 Chapter 9: Statistics, Probability & Data Interpretation
9.1 Mean, Median, Mode, Range, Mean Deviation & Standard Deviation 9.2 Permutations, Combinations, Classical Probability, Independent Events & Odds 9.3 Tabular Data Interpretation, Bar Charts, Grouped Graphs & Percentage Calculation Shortcuts 9.4 Pie Charts (Angle vs Percentage), Line Trend Graphs & Quantitative Data Sufficiency
10 Chapter 10: Multi-Source & Graphical Analysis
10.1 Multi-Source Analysis, Set Data & Arrangement 10.2 Scatter Plots, Histograms & Distribution Curves
11 Chapter 11: Deductive Logic, Statements & Binary Puzzles
11.1 Syllogisms, Sets & Possibility Conclusions 11.2 Critical Reasoning: Implicit Assumptions, Strong vs Weak Arguments & Course of Action 11.3 Binary Logic: Truth-Tellers, Liars, Alternators & Matrix Logic Deductions
12 Chapter 12: Relational, Directional, Clock & Calendar Reasoning
12.1 Direct Family Relations, Coded Blood Relations & Family Tree Tree-Mapping Methods 12.2 Cardinal & Ordinal Directions, Multi-Step Turn Paths, Pythagorean Distance & Shadow Timing 12.3 Clock Hands Angular Speed, Angle Between Hands at Given Time, Coincidence & Faulty Clocks 12.4 Odd Days Concept, Reference Date Calculations, Leap Year Rules & Repeating Calendar Years
13 Chapter 13: English Reading Comprehension
13.1 English Comprehension: Main Idea, Support & Inference 13.2 English Comprehension: Application, Structure & Style
14 Chapter 14: Mental Reasoning: Analogies & Series
14.1 Semantic, Letter & Number Analogies 14.2 Number Series: Differences, Powers & Missing Terms 14.3 Interleaved, Recursive & Wrong-Term Series
15 Chapter 15: Mental Reasoning: Coding & Ranking
15.1 Letter Shifts, Reversal & Numerical Codes 15.2 Message Intersections & Conditional Coding Tables 15.3 Ranking, People Between & Position Interchanges
16 Chapter 16: Mental Reasoning: Seating Arrangements
16.1 Linear Seating & Parallel Rows 16.2 Circular Seating, Facing & Rotational Symmetry
15.1 Letter Shifts, Reversal & Numerical Codes
Key Takeaways Explain This Topic AI
A forward-three shift maps CABIN to FDELQ.
Cyclic alphabet positions wrap after Z; a zero remainder must be interpreted consistently.
Reverse-rank sum equals 27 times word length minus forward-rank sum.
Last updated: October 2026
- Letter Shifts, Reversal & Numerical Codes
- 1. Letter Coding Transformations
Letter coding substitutes letters in a word according to a fixed geometric or numerical rule.
Direct Positional Shift: Every letter shifts forward or backward by a constant k k k :
If k = + 3 k = +3 k = + 3 : CABIN → FDELQ \text{CABIN} \to \text{FDELQ} CABIN → FDELQ ( C + 3 = F , A + 3 = D , B + 3 = E … C+3=F, A+3=D, B+3=E\dots C + 3 = F , A + 3 = D , B + 3 = E … )
Cross-Pattern (Partition) Shifting: Words are bisected into symmetrical halves and reversed:
For an even 6-letter word divided into two 3-letter blocks ( 1 − 2 − 3 ) (1-2-3) ( 1 − 2 − 3 ) and ( 4 − 5 − 6 ) (4-5-6) ( 4 − 5 − 6 ) :
- Block 1 is reversed and shifted ( 3 − 2 − 1 3-2-1 3 − 2 − 1 )
- Block 2 is reversed and shifted ( 6 − 5 − 4 6-5-4 6 − 5 − 4 )
Example: In a + 1 +1 + 1 cross-reversal of SIGNAL \text{SIGNAL} SIGNAL (partitioned SIG ∣ NAL \text{SIG} | \text{NAL} SIG ∣ NAL ):
- SIG → G-I-S → + 1 H-J-T \text{SIG} \to \text{G-I-S} \xrightarrow{+1} \text{H-J-T} SIG → G-I-S + 1 H-J-T
- NAL → L-A-N → + 1 M-B-O \text{NAL} \to \text{L-A-N} \xrightarrow{+1} \text{M-B-O} NAL → L-A-N + 1 M-B-O
- Result: HJTMBO \text{HJTMBO} HJTMBO
Alternating Reverse Substitution: Odd-positioned letters shift + k +k + k , while even-positioned letters are replaced by their reverse opposite letters ( 27 − Rank 27 - \text{Rank} 27 − Rank ).
2. Numerical and Value Coding
Words are transformed into numerical values using alphabetical ranks:
Positional Summation: Adding the forward alphabetical ranks of each letter:
- CAB = 3 + 1 + 2 = 6 \text{CAB} = 3 + 1 + 2 = 6 CAB = 3 + 1 + 2 = 6
- RAIL = 18 + 1 + 9 + 12 = 40 \text{RAIL} = 18 + 1 + 9 + 12 = 40 RAIL = 18 + 1 + 9 + 12 = 40
Reverse Positional Summation: Adding backward ranks ( 27 − Rank 27 - \text{Rank} 27 − Rank ):
For CAB \text{CAB} CAB : ( 27 − 3 ) + ( 27 − 1 ) + ( 27 − 2 ) = 24 + 26 + 25 = 75 (27-3) + (27-1) + (27-2) = 24 + 26 + 25 = 75 ( 27 − 3 ) + ( 27 − 1 ) + ( 27 − 2 ) = 24 + 26 + 25 = 75 .
Shortcut: Reverse Sum = 27 × ( Number of Letters ) − ( Forward Sum ) \text{Reverse Sum} = 27 \times (\text{Number of Letters}) - (\text{Forward Sum}) Reverse Sum = 27 × ( Number of Letters ) − ( Forward Sum ) . Reverse Sum ( CAB ) = 27 × 3 − 6 = 81 − 6 = 75 \text{Reverse Sum}(\text{CAB}) = 27 \times 3 - 6 = 81 - 6 = 75 Reverse Sum ( CAB ) = 27 × 3 − 6 = 81 − 6 = 75
Vowel/Consonant Partition Coding: Vowels are numbered by their sequence index ( A = 1 , E = 2 , I = 3 , O = 4 , U = 5 A=1, E=2, I=3, O=4, U=5 A = 1 , E = 2 , I = 3 , O = 4 , U = 5 ) while consonants retain standard alphabetical ranks.
Use positions and modular wraparound
Coding is a rule-following task. Assign A = 1 through Z = 26 and check whether a transformation changes positions, reverses order, substitutes complements or combines operations. Record these operations separately. A code that happens to produce a familiar word is not evidence that the rule is correct.
For a forward shift by three, CABIN becomes FDELQ: C becomes F, A becomes D, B becomes E, I becomes L and N becomes Q. A shift must be applied to every position consistently. The incorrect string FDFLQ changes B by four and fails its own rule. For wraparound, X shifted forward by five becomes C, since the positions after X are Y, Z, A, B, C.
A general wrapped position is one plus the remainder after dividing old position minus one plus the shift by 26. The subtraction and addition of one preserve the one-based alphabet. Without them, a remainder of zero can be mistaken for a nonexistent letter instead of Z. For backward shifts, count cyclically or use a nonnegative remainder.
Distinguish reversal from complementary substitution
Reversing RAIL gives LIAR because the original letters change order. Complementing each letter gives IZRO because each original position p is replaced by 27 minus p. These are different operations. If a question says first reverse and then shift, carry out both in that order and test the supplied example.
For a compound illustration, split SIGNAL into SIG and NAL, reverse each block to GIS and LAN, then shift every letter forward by one. The result is HJT and MBO, producing HJTMBO. The middle boundary stays fixed throughout. Reversing the entire six-letter word would produce another output and would not follow the stipulated rule.
Numerical codes and sufficiency
When a word is coded as a number, test whether the rule uses letter sum, product, first/last positions or a stated weighting. CAB has rank sum 6, while its reverse-rank sum is 75: three times 27 minus 6. This does not imply that every three-letter word with sum 6 must be coded uniquely unless the rule is explicitly the sum. Different words can share the same numerical code.
An example alone can be underdetermined. CAB becoming FDE is consistent with a forward-three shift, but many contrived mappings could fit it. Use additional examples and the question's constraints to test the intended simple rule. Do not claim to have proved a unique encryption system from one short pair. In a timed item, consistency across all letters and examples is the practical verification standard.
Check an alternating rule
If odd-position letters shift forward by one and even-position letters shift backward by one, RAIL becomes SZJK: R to S, A to Z with wraparound, I to J and L to K. Apply the odd/even rule to positions, not to whether a letter is a vowel. Decoding reverses each position’s operation: the odd positions move backward one and even positions forward one. A successful round trip reconstructs RAIL and provides an independent check.
Test decoding without changing the rule
Under a forward-three code, ZOO becomes CRR: Z wraps through A and B to C, while each O becomes R. To decode CRR, move every position backward three. C returns to Z and each R returns to O. If a proposed decoding returns ARR, it has handled wraparound incorrectly or failed to reverse the operation.
Repeated input letters receive repeated output letters under a fixed position-independent shift. They need not do so under a position-dependent rule, such as alternating forward and backward shifts. Determine which kind of rule is supplied before treating repeated letters as an invariant.