Study guide

3.2 Order, Ranking & Comparison Tests

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

3.2 Order, Ranking & Comparison Tests

Key Takeaways Explain This Topic AI

The fundamental single-row ranking equation is Total = (Rank from Left + Rank from Right) - 1, where 1 is subtracted because the individual is counted twice.

To find an individual's rank from the opposite end when total row strength T and current rank R are known, use the reciprocal formula: Opposite Rank = (T - R) + 1.

A queue is non-overlapping when Total ≥ (Left Rank + Right Rank), whereas an overlapping queue occurs when Total < (Left Rank + Right Rank - 1), yielding the minimum queue strength formula: Total = Left + Right - Between - 2.

When two individuals swap positions, the magnitude of shift for Person A exactly equals the shift for Person B, and the total strength equals the new rank of Person A plus the original rank of Person B minus 1.

Vertical ranking arranges candidates along qualitative comparative attributes (sanctions, speed, deposits) by chaining definite binary inequalities into a unified transitive descending sequence.

Last updated: September 2026

3.2 Order, Ranking & Comparison Tests

Order and Ranking is an indispensable component of the Reasoning Ability section in the SBI Clerk examination. Questions appear in two distinct varieties: linear ranking problems involving positions of individuals in a line or queue (e.g., customers at a cash counter or candidates in a merit list), and comparison tests (vertical ranking) where entities are sequenced according to comparative metrics such as transaction processing speed, loan sanctions, or account balances.

Linear Ranking Fundamentals

Linear ranking problems depend upon precise algebraic relationships between an individual's rank from one terminal end, their rank from the opposing terminal end, and the total count of individuals in the sequence.

The Fundamental Single-Row Ranking Formula

When the position of a single individual P P P is known from both ends of a linear row: Total Persons ( T ) = ( Rank from Left [ L ] + Rank from Right [ R ] ) − 1 \text{Total Persons } (T) = (\text{Rank from Left } [L] + \text{Rank from Right } [R]) - 1 Total Persons ( T ) = ( Rank from Left [ L ] + Rank from Right [ R ]) − 1

Why the ' − 1 - 1 − 1 ' is mandatory : When you count from the left end up to Person P P P , Person P P P is counted once. When you count from the right end down to Person P P P , Person P P P is counted a second time. Subtracting 1 eliminates this duplicate enumeration.

Calculating Rank from Opposite Ends

When the total number of persons T T T is fixed and an individual's rank from one end is given, the position from the opposite end is derived by transposing the core formula: Rank from Left ( L ) = ( T − Rank from Right [ R ] ) + 1 \text{Rank from Left } (L) = (T - \text{Rank from Right } [R]) + 1 Rank from Left ( L ) = ( T − Rank from Right [ R ]) + 1 Rank from Right ( R ) = ( T − Rank from Left [ L ] ) + 1 \text{Rank from Right } (R) = (T - \text{Rank from Left } [L]) + 1 Rank from Right ( R ) = ( T − Rank from Left [ L ]) + 1

Note

Beginners frequently make the mistake of calculating T − R T - R T − R . If 30 candidates are seated in a row and Rohan is 10th from the left, his rank from the right is not 30 − 10 = 20 30 - 10 = 20 30 − 10 = 20 ; it is ( 30 − 10 ) + 1 = 21 st (30 - 10) + 1 = 21\text{st} ( 30 − 10 ) + 1 = 21 st . There are 20 candidates seated to his right, making Rohan the 21st person from the right.

Mathematical Ranking Formula Reference Table

Variable to Determine Required Inputs Exact Formula

Total Persons ( T T T ) Ranks of one person from both ends ( L , R L, R L , R ) T = L + R − 1 T = L + R - 1 T = L + R − 1

Rank from Left ( L L L ) Total persons ( T T T ) and Rank from Right ( R R R ) L = T − R + 1 L = T - R + 1 L = T − R + 1

Rank from Right ( R R R ) Total persons ( T T T ) and Rank from Left ( L L L ) R = T − L + 1 R = T - L + 1 R = T − L + 1

Persons Between ( B B B ) [Simple / Non-Overlapping] Total ( T T T ), Person A from Left ( L L L ), Person B from Right ( R R R ) B = T − ( L + R ) B = T - (L + R) B = T − ( L + R )

Persons Between ( B B B ) [Overlapping Case] Total ( T T T ), Person A from Left ( L L L ), Person B from Right ( R R R ) B = ( L + R ) − T − 2 B = (L + R) - T - 2 B = ( L + R ) − T − 2

Minimum Total ( T min ⁡ T_{\min} T m i n ​ ) [Overlapping Row] Person A from Left ( L L L ), Person B from Right ( R R R ), Persons Between ( B B B ) T min ⁡ = L + R − B − 2 T_{\min} = L + R - B - 2 T m i n ​ = L + R − B − 2

Maximum Total ( T max ⁡ T_{\max} T m a x ​ ) [Non-Overlapping Row] Person A from Left ( L L L ), Person B from Right ( R R R ), Persons Between ( B B B ) T max ⁡ = L + R + B T_{\max} = L + R + B T m a x ​ = L + R + B

Non-Overlapping vs. Overlapping Queues

When a question specifies the positions of two distinct individuals (Person A at rank L L L from the left, Person B at rank R R R from the right) along with the number of persons standing between them ( B B B ), two mutually exclusive physical configurations are possible: non-overlapping and overlapping.

The Non-Overlapping Condition (Maximum Row Strength)

In a non-overlapping queue, Person A (from the left) and Person B (from the right) have not crossed each other. A sits strictly to the left of B:

  • Condition: T ≥ L + R T \ge L + R T ≥ L + R
  • Formula for Persons Between: B = T − ( L + R ) B = T - (L + R) B = T − ( L + R )
  • Formula for Total Persons: T = L + R + B T = L + R + B T = L + R + B
  • The Overlapping Condition (Minimum Row Strength)

In an overlapping queue, Person A (counted from the left) and Person B (counted from the right) have crossed paths. Person B is situated closer to the left end than Person A:

  • Condition: T < ( L + R − 1 ) T < (L + R - 1) T < ( L + R − 1 )
  • Inequality Check: ( L + R ) > ( T + 1 ) (L + R) > (T + 1) ( L + R ) > ( T + 1 )
  • Formula for Persons Between: B = ( L + R ) − T − 2 B = (L + R) - T - 2 B = ( L + R ) − T − 2
  • Formula for Minimum Total Persons: T = L + R − B − 2 T = L + R - B - 2 T = L + R − B − 2
  • Proof of the ' − 2 - 2 − 2 ' Deduction in Overlap

Why does the overlapping formula subtract 2? When you sum the rank of Person A from the left ( L L L ) and Person B from the right ( R R R ):

All persons standing strictly between Person A and Person B are counted twice (once during the left-to-right pass, and once during the right-to-left pass).

Both Person A and Person B are themselves counted twice (each is included in their own rank, and also included as an antecedent in the opposing person's traversal).

Therefore: L + R = T + B + 2 L + R = T + B + 2 L + R = T + B + 2 . Transposing for T T T yields T = L + R − B − 2 T = L + R - B - 2 T = L + R − B − 2 .

Overlap Feasibility Condition

For an overlapping queue to physically exist, the number of persons between them must satisfy: B ≤ min ⁡ ( L , R ) − 2 B \le \min(L, R) - 2 B ≤ min ( L , R ) − 2

If B > min ⁡ ( L , R ) − 2 B > \min(L, R) - 2 B > min ( L , R ) − 2 , an overlapping configuration is physically impossible, and only the non-overlapping calculation can be valid.

Worked Example: Customer Token Queue at SBI Branch

Scenario : In an SBI branch pension disbursement queue, Ananya ranks 18th from the front (left) counter, while Brijesh ranks 24th from the rear (right) exit. There are 8 pensioners standing between Ananya and Brijesh. Find (1) the maximum possible number of pensioners in the queue, and (2) the minimum possible number of pensioners in the queue.

Step-by-Step Solution :

Check Overlap Feasibility : min ⁡ ( L , R ) − 2 = min ⁡ ( 18 , 24 ) − 2 = 18 − 2 = 16 \min(L, R) - 2 = \min(18, 24) - 2 = 18 - 2 = 16 min ( L , R ) − 2 = min ( 18 , 24 ) − 2 = 18 − 2 = 16 . Because B = 8 ≤ 16 B = 8 \le 16 B = 8 ≤ 16 , both non-overlapping and overlapping configurations are valid.

Maximum Case (Non-Overlapping) : T max ⁡ = L + R + B = 18 + 24 + 8 = 50 pensioners T_{\max} = L + R + B = 18 + 24 + 8 = 50\text{ pensioners} T m a x ​ = L + R + B = 18 + 24 + 8 = 50 pensioners

Minimum Case (Overlapping) : T min ⁡ = L + R − B − 2 = 18 + 24 − 8 − 2 = 42 − 10 = 32 pensioners T_{\min} = L + R - B - 2 = 18 + 24 - 8 - 2 = 42 - 10 = 32\text{ pensioners} T m i n ​ = L + R − B − 2 = 18 + 24 − 8 − 2 = 42 − 10 = 32 pensioners

Loading diagram... Architectural Comparison: Non-Overlapping vs Overlapping Queues

Rank Interchange Problems

Rank interchange scenarios involve two individuals swapping physical seats in a row. These questions appear frequently in SBI Clerk Prelims and can be solved in under 30 seconds once their algebraic properties are understood.

Mechanics of Position Swapping

Suppose Person A is originally L 1 L_1 L 1 ​ from the left, and Person B is originally R 1 R_1 R 1 ​ from the right. When they swap positions, Person A occupies Person B's former seat, and Person B occupies Person A's former seat.

If the problem states that after swapping, Person A's new rank from the left becomes L 2 L_2 L 2 ​ :

Calculate the Positional Shift ( Δ \Delta Δ ) : The number of positions Person A shifted is Δ = ∣ L 2 − L 1 ∣ \Delta = |L_2 - L_1| Δ = ∣ L 2 ​ − L 1 ​ ∣ .

Determine Persons Standing Between Them : The number of persons seated between their original positions is strictly: B = Δ − 1 = ∣ L 2 − L 1 ∣ − 1 B = \Delta - 1 = |L_2 - L_1| - 1 B = Δ − 1 = ∣ L 2 ​ − L 1 ​ ∣ − 1

Calculate Total Persons in the Row ( T T T ) : Because Person A now occupies Person B's original seat, that specific physical seat has two known ranks: L 2 L_2 L 2 ​ from the left, and R 1 R_1 R 1 ​ from the right. Applying the single-seat total formula: T = L 2 + R 1 − 1 T = L_2 + R_1 - 1 T = L 2 ​ + R 1 ​ − 1

Calculate Person B's New Rank ( R 2 R_2 R 2 ​ ) : Because the physical separation between their seats is constant, Person B must undergo the exact same numerical shift from the opposing end: R 2 = R 1 + ( L 2 − L 1 ) R_2 = R_1 + (L_2 - L_1) R 2 ​ = R 1 ​ + ( L 2 ​ − L 1 ​ )

Worked Example: Newly Recruited Junior Associates in Training

Scenario : In an SBI induction hall, Ramesh is seated 14th from the left end, while Sneha is seated 21st from the right end. Upon interchanging their seats, Ramesh becomes 26th from the left end. Find: (1) Sneha's new position from the right end, and (2) the total number of associates in the row.

Step-by-Step Solution :

Compute Ramesh's Shift : Δ = 26 − 14 = 12 \Delta = 26 - 14 = 12 Δ = 26 − 14 = 12 places to the right.

Find Associates Between Ramesh and Sneha : B = 12 − 1 = 11 B = 12 - 1 = 11 B = 12 − 1 = 11 associates.

Compute Total Associates : Sum Ramesh's new left rank with Sneha's original right rank: T = 26 + 21 − 1 = 46 associates T = 26 + 21 - 1 = 46\text{ associates} T = 26 + 21 − 1 = 46 associates

Compute Sneha's New Position from Right : Sneha moves 12 places from her original position: R 2 = 21 + 12 = 33 rd from the right end R_2 = 21 + 12 = 33\text{rd from the right end} R 2 ​ = 21 + 12 = 33 rd from the right end Verification : T = L 1 + R 2 − 1 = 14 + 33 − 1 = 46 T = L_1 + R_2 - 1 = 14 + 33 - 1 = 46 T = L 1 ​ + R 2 ​ − 1 = 14 + 33 − 1 = 46 . The total is perfectly consistent.

Vertical Ranking & Comparison Deductions

Comparison test puzzles provide fragmented binary inequality statements concerning 5 to 7 individuals ranked by an attribute such as transaction volume, monthly deposit mobilization, or customer service ratings.

Sequential Attribute Chaining

To solve vertical ranking efficiently:

Use Strict Relational Notations : Write " A > B A > B A > B " for A A A sanctioned more than B B B . Never use ambiguous dashes.

Anchor Extreme and Quantified Clues :

Clues like " P P P processed more than only Q Q Q " establish that Q Q Q is strictly the lowest (last position) and P P P is immediately above Q Q Q (second from bottom).

Clues like "Only two persons scored higher than M M M " establish that M M M is fixed in exactly the 3rd position from the top.

Form a Unified Transitive Chain : Chain overlapping segments ( X > Y X > Y X > Y and Y > Z ⟹ X > Y > Z Y > Z \implies X > Y > Z Y > Z ⟹ X > Y > Z ).

Worked Example: Branch Manager Housing Loan Portfolios

Scenario : Six SBI Branch Managers (P, Q, R, S, T, U) sanctioned varying amounts of home loans in a quarter:

R sanctioned more than T but less than P ( P > R > T P > R > T P > R > T ).

S sanctioned more than U but less than T ( T > S > U T > S > U T > S > U ).

Q sanctioned more than P ( Q > P Q > P Q > P ).

The manager who sanctioned the second-highest amount sanctioned ₹45 Crore, while the manager who sanctioned the third-lowest amount sanctioned ₹28 Crore.

Deduction Protocol :

Combine the inequality statements into a single chain: Q > P > R > T > S > U Q > P > R > T > S > U Q > P > R > T > S > U .

Identify specific ranks:

  • 1st (Highest): Q
  • 2nd (Second-Highest = ₹45 Crore): P
  • 3rd: R
  • 4th (Third-Lowest = ₹28 Crore): T
  • 5th: S
  • 6th (Lowest): U

Answering questions: If asked for the possible loan value of R, R must fall strictly between ₹45 Crore (P) and ₹28 Crore (T).