Study guide
15.3 Ranking, People Between & Position Interchanges
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.3 Ranking, People Between & Position Interchanges
Key Takeaways Explain This Topic AI
For one fixed seat, total row size equals left rank plus right rank minus one.
Convert two distinct people to the same end before subtracting positions.
A swap changes occupants but preserves seats; the direction of the rank change matters.
Last updated: October 2026
Order and Ranking Mechanics
Order-ranking problems assess positions in a linear hierarchy (seniority lists, arrival queues, platform track allocations).
1. Fundamental Positional Formulas
For a single linear row of items or persons: Total Persons ( N ) = Rank from Left ( L ) + Rank from Right ( R ) − 1 \text{Total Persons } (N) = \text{Rank from Left } (L) + \text{Rank from Right } (R) - 1 Total Persons ( N ) = Rank from Left ( L ) + Rank from Right ( R ) − 1
Why subtract 1? The focal individual is counted twice—once in the leftward tally and once in the rightward tally.
Derived Formula for Rank from Opposite End: R = N − L + 1 , L = N − R + 1 R = N - L + 1, \quad L = N - R + 1 R = N − L + 1 , L = N − R + 1
2. Number of Persons Between Two Individuals
Given two individuals A A A (rank L A L_A L A from left) and B B B (rank R B R_B R B from right) in a cohort of size N N N :
Convert B to left position L B = N − R B + 1 L_B=N-R_B+1 L B = N − R B + 1 . For distinct A and B: Persons between = ∣ L A − L B ∣ − 1 \text{Persons between}=|L_A-L_B|-1 Persons between = ∣ L A − L B ∣ − 1
Adjacent positions give zero. Equal positions cannot represent two distinct people in a strictly ordered row. This formula handles either order and avoids missing the adjacency boundary case.
3. Position Interchange Problems
When two individuals A A A and B B B swap positions, individual A A A moves into individual B B B 's original seat: Total Cohort ( N ) = New Rank of A + Original Rank of B from other end − 1 \text{Total Cohort } (N) = \text{New Rank of } A + \text{Original Rank of } B \text{ from other end} - 1 Total Cohort ( N ) = New Rank of A + Original Rank of B from other end − 1 Shift Distance Δ = ∣ New Rank of A − Old Rank of A ∣ \text{Shift Distance } \Delta = |\text{New Rank of } A - \text{Old Rank of } A| Shift Distance Δ = ∣ New Rank of A − Old Rank of A ∣
Use the original seat of A and convert its rank to the requested end after swapping.
Worked Example 2: Position Interchange in Seniority Roster
Problem: In a divisional seniority list of Section Controllers arranged in a single row, Manoj is 17th from the left end, and Rajesh is 22nd from the right end. When they swap places, Manoj becomes 29th from the left end. Find: (a) the total number of controllers in the roster, and (b) Rajesh's new position from the right end.
Step 1: Identify Seat Invariance: After swapping, Manoj occupies Rajesh's former seat. Manoj is now 29th from the left end, while that exact seat was originally known to be 22nd from the right end.
Step 2: Compute Total Controllers ( N N N ): N = Rank Left + Rank Right − 1 = 29 + 22 − 1 = 50 N = \text{Rank}_{\text{Left}} + \text{Rank}_{\text{Right}} - 1 = 29 + 22 - 1 = 50 N = Rank Left + Rank Right − 1 = 29 + 22 − 1 = 50
Step 3: Compute Rajesh's New Rank from Right: Rajesh now occupies Manoj's original seat, which was 17th from the left end. Rank Right = N − Rank Left + 1 = 50 − 17 + 1 = 34 \text{Rank}_{\text{Right}} = N - \text{Rank}_{\text{Left}} + 1 = 50 - 17 + 1 = 34 Rank Right = N − Rank Left + 1 = 50 − 17 + 1 = 34
Alternatively, Manoj shifted right by 29 − 17 = 12 29 - 17 = 12 29 − 17 = 12 places. Rajesh must shift left by the identical 12 12 12 places: 22 + 12 = 34 22 + 12 = 34 22 + 12 = 34 th from the right end.
Convert every rank to one end
The most reliable way to count people between two positions is to express both positions from the same end. If A is L places from the left and B is R places from the right in a row of N distinct people, B's left position is N minus R plus one. For different people, the number between them is the absolute difference of their left positions minus one. This covers both orders without memorizing overlapping cases.
For example, in a row of 40, A is 12th from the left and B is 9th from the right. B is 32nd from the left, so 19 people are between positions 12 and 32. In the same row, if B were 35th from the right, B would be 6th from the left and five people would be between them. Reversing their order does not make the count negative.
If both descriptions identify the same person, the positions coincide and the distinct-person formula is inapplicable. Check whether the problem guarantees two different individuals. Likewise, a ranking with ties is not automatically a row of distinct consecutive positions; use the tie convention actually specified.
During a swap, seats stay fixed while occupants exchange. Draw the two original seat numbers, then move the names. A person's rank from a given end can increase or decrease depending on the direction of movement. The two people move equal distances in opposite directions; there is no universal rule that both new ranks equal old rank plus the shift.
Do not infer total group size from one person's rank at only one end. A person 17th from the left could be in many different row sizes. A left/right pair for the same fixed seat, or another independent constraint, is needed to determine N uniquely.
Test whether the rank information is possible
In a row of 25 distinct people, a person 10th from the left is 16th from the right, because 25 - 10 + 1 = 16. A claim that the same person is also 18th from the right contradicts the fixed row size: 10 + 18 - 1 would require 27 people. Do not average conflicting ranks.
If two different people are each described as 10th from the left in the same strictly ordered row, the clues are inconsistent unless a tie or shared-position convention is supplied. Ranking arithmetic relies on the meaning of positions as well as numerical operations. Identify impossible data rather than forcing an answer from whichever formula uses the most numbers.