Study guide
3.7 Permutation, Combination & Probability in Banking Exams
SBI PO Probationary Officer
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Introduction & SBI PO Exam Architecture
1.1 SBI PO Exam Structure, Phases & Sectional Timing 1.2 Eligibility, Age Relaxation & Number of Attempts 1.3 Mark Calculation, One-Fourth Negative Marking & Cut-offs 1.4 Descriptive Communication Test (Email, Situation, Report/Précis) 1.5 Phase 3: Psychometric Test, Group Exercise & Interview Preparation 1.6 Recommended Study Plan & Mock Test Strategy
2 Chapter 2: Quantitative Aptitude — Foundation & Speed Math
2.1 Vedic Math, Fast Calculation & Approximation Techniques 2.2 Number Series (Missing & Wrong Number Patterns) 2.3 Quadratic Equations & Quantity Comparisons (Q1 vs Q2) 2.4 Simplification & Order of Operations 2.5 Data Sufficiency in Quantitative Aptitude
3 Chapter 3: Arithmetic & Applied Problem Solving
3.1 Percentages, Profit, Loss & Discount Calculations 3.2 Simple Interest & Compound Interest (Compounding Cycles & Differences) 3.3 Ratio & Proportion, Partnerships & Ages 3.4 Averages, Mixtures & Alligations 3.5 Time, Work, Efficiency & Pipes & Cisterns 3.6 Speed, Distance, Time, Trains & Boats/Streams 3.7 Permutation, Combination & Probability in Banking Exams
4 Chapter 4: Advanced Data Analysis & Data Interpretation (DI)
4.1 Table & Line Graph Data Interpretation 4.2 Bar Chart & Pie Chart Data Interpretation 4.3 Caselet Data Interpretation (Paragraph-based DI & Venn Caselets) 4.4 Missing Data DI & Radar/Spider Graph Interpretation 4.5 Arithmetic-based DI (Profit-Loss, Time-Work, TSD) & Funnel/Scatter DI
5 Chapter 5: Analytical Reasoning
5.1 Syllogisms (Only a few, Some not & Reverse Syllogism) 5.2 Coded & Mathematical Inequalities 5.3 Coding-Decoding (Coded Statements & Mains Patterns) 5.4 Blood Relations & Direction Sense 5.5 Input-Output Machine Rearrangement
6 Chapter 6: Puzzles & Seating Arrangement
6.1 Linear & Circular Seating Arrangement (Single/Parallel Rows & Variable Binding) 6.2 Floor & Box Puzzles (Multi-story, Vacant floor & Stacking Order) 6.3 Matrix & Category Puzzles (Department/Profession Allocation & Constraint Elimination) 6.4 Scheduling Puzzles (Day-Month-Year combinations & Time Slots)
7 Chapter 7: Critical Reasoning
7.1 Statement & Implicit Assumptions 7.2 Statement & Conclusions vs Strong/Weak Arguments 7.3 Statement & Course of Action 7.4 Cause & Effect Analysis 7.5 Critical Reasoning Passages (Strengthen/Weaken & Paradox Resolution)
8 Chapter 8: English Language
8.1 Reading Comprehension: Tone, Inference, Main Idea & Vocab in Context 8.2 Cloze Test & Double/Triple Fillers 8.3 Para Jumbles & Sentence Rearrangement 8.4 Error Spotting & Phrase Replacement (Grammar Rules) 8.5 Word Usage, Synonyms/Antonyms & Contextual Meaning 8.6 Match the Columns & Sentence Connectors/Starters
9 Chapter 9: Banking & Financial Awareness
9.1 Reserve Bank of India (RBI): History, Structure & Functions 9.2 Monetary Policy Framework: MPC, Repo Rate, SDF, MSF, CRR, SLR & Inflation Targeting 9.3 Indian Financial System: Commercial Banks, Small Finance Banks, Payment Banks & NBFCs 9.4 Financial Inclusion & Government Banking Schemes (PMJDY, PMSBY, PMJJBY, APY, MUDRA, KCC) 9.5 Banking Current Affairs & Financial News Dynamics
10 Chapter 10: General & Banking Awareness — Indian Economy, Financial Markets & Regulations
10.1 Economic Indicators: GDP, NNP, WPI, CPI, IIP & National Income 10.2 Forex & International Trade: Balance of Payments, LRS, NEER/REER & World Bank/IMF 10.3 Union Budget & Economic Survey: Fiscal Deficit, CapEx & Revenue Receipts 10.4 Money Market vs Capital Market: T-Bills, Commercial Paper, CD, Stocks, Bonds & SEBI 10.5 Priority Sector Lending (PSL), Non-Performing Assets (NPAs), SARFAESI, IBC & Basel III
11 Chapter 11: Computer Aptitude
11.1 Computer Fundamentals & Hardware Architecture 11.2 Operating Systems & System Software 11.3 Networking Concepts & Internet Protocols 11.4 Cybersecurity & Banking IT Security 11.5 Database Management Systems (DBMS) & MS Office Suite
3.7 Permutation, Combination & Probability in Banking Exams
Key Takeaways Explain This Topic AI
Permutation (nPr) counts ordered arrangements where position matters, whereas Combination (nCr) counts unordered selections of items.
The String Method treats items that must remain together as a single unit, whereas the Gap Method places restricted items into gaps between unrestricted items.
Probability P(E) measures favorable outcomes divided by total sample space outcomes, bounded between 0 (impossible) and 1 (certain).
Independent events satisfy P(A ∩ B) = P(A) × P(B), while mutually exclusive events satisfy P(A ∪ B) = P(A) + P(B).
Complementary probability P(At least one) = 1 - P(None) provides a massive computational shortcut in multi-item selection problems.
Last updated: July 2026
Permutation, Combination & Probability in Banking Exams
Combinatorics and Probability constitute essential Quantitative Aptitude topics in SBI PO Prelims & Mains. Questions test systematic counting, constrained word arrangements, committee selection, card drawing, and complementary event shortcuts.
- 1. Counting Principles, Permutations & Combinations
- Fundamental Principles of Counting
Multiplication Rule (AND): If event A can occur in m m m ways and event B can occur independently in n n n ways, both events can occur together in m × n m \times n m × n ways.
Addition Rule (OR): If event A can occur in m m m ways and event B can occur in n n n ways (mutually exclusive), either event can occur in m + n m + n m + n ways.
Permutations vs Combinations Formulas
Concept Core Formula Key Condition / Application
Permutation ( n P r ^n P_r n P r ) n P r = n ! ( n − r ) ! ^n P_r = \frac{n!}{(n - r)!} n P r = ( n − r )! n ! Order MATTERS (arrangements, words, digits, ranks)
Combination ( n C r ^n C_r n C r ) n C r = n ! r ! ( n − r ) ! ^n C_r = \frac{n!}{r!(n - r)!} n C r = r ! ( n − r )! n ! Order DOES NOT MATTER (selections, committees, teams)
Repeated Items Arrangement n ! p ! × q ! × r ! \frac{n!}{p! \times q! \times r!} p ! × q ! × r ! n ! Arranging words with repeated letters
Circular Permutation ( n − 1 ) ! (n - 1)! ( n − 1 )! Seating n n n persons around a circular table
Useful Combination Properties: n C r = n C n − r ^n C_r = ^n C_{n-r} n C r = n C n − r , n C 0 = 1 ^n C_0 = 1 n C 0 = 1 , n C n = 1 ^n C_n = 1 n C n = 1 , n C 1 = n ^n C_1 = n n C 1 = n .
- 2. Advanced Arrangement Techniques
- The String Method (Items Together)
When specific items must ALWAYS sit or stand together, tie them into a single virtual object. Calculate arrangements of virtual objects, then multiply by internal arrangements of tied items.
The Gap Method (Items Never Together)
When specific items must NEVER sit together, arrange the unrestricted items first. Count the available gaps created between unrestricted items, and select gaps for restricted items.
3. Probability Foundations & Axioms Probability of Event E = P ( E ) = Number of Favorable Outcomes ∣ E ∣ Total Sample Space Outcomes ∣ S ∣ \text{Probability of Event } E = P(E) = \frac{\text{Number of Favorable Outcomes } |E|}{\text{Total Sample Space Outcomes } |S|} Probability of Event E = P ( E ) = Total Sample Space Outcomes ∣ S ∣ Number of Favorable Outcomes ∣ E ∣
Range: 0 ≤ P ( E ) ≤ 1 0 \le P(E) \le 1 0 ≤ P ( E ) ≤ 1 .
Complementary Probability Rule: P ( E ) + P ( E ′ ) = 1 ⟹ P ( At least one ) = 1 − P ( None ) P(E) + P(E') = 1 \implies P(\text{At least one}) = 1 - P(\text{None}) P ( E ) + P ( E ′ ) = 1 ⟹ P ( At least one ) = 1 − P ( None )
Addition Theorem: P ( A ∪ B ) = P ( A ) + P ( B ) − P ( A ∩ B ) P(A \cup B) = P(A) + P(B) - P(A \cap B) P ( A ∪ B ) = P ( A ) + P ( B ) − P ( A ∩ B )
Independent Events: Two events A and B are independent if P ( A ∩ B ) = P ( A ) × P ( B ) P(A \cap B) = P(A) \times P(B) P ( A ∩ B ) = P ( A ) × P ( B ) .
- 4. Step-by-Step Worked Math Examples
- Worked Example 1: Committee Selection with Constraints
Problem: Out of 6 men and 4 women, a committee of 5 people is to be formed. In how many ways can this be done such that the committee contains at least 3 men?
Step-by-Step Solution:
"At least 3 men" in a 5-member committee gives 3 mutually exclusive cases:
- Case 1: 3 Men AND 2 Women
- Case 2: 4 Men AND 1 Woman
- Case 3: 5 Men AND 0 Women
Compute combinations for each case:
Case 1: 6 C 3 × 4 C 2 = ( 6 × 5 × 4 3 × 2 × 1 ) × ( 4 × 3 2 × 1 ) = 20 × 6 = 120 ^6 C_3 \times ^4 C_2 = \left(\frac{6 \times 5 \times 4}{3 \times 2 \times 1}\right) \times \left(\frac{4 \times 3}{2 \times 1}\right) = 20 \times 6 = 120 6 C 3 × 4 C 2 = ( 3 × 2 × 1 6 × 5 × 4 ) × ( 2 × 1 4 × 3 ) = 20 × 6 = 120 .
Case 2: 6 C 4 × 4 C 1 = 6 C 2 × 4 = 15 × 4 = 60 ^6 C_4 \times ^4 C_1 = ^6 C_2 \times 4 = 15 \times 4 = 60 6 C 4 × 4 C 1 = 6 C 2 × 4 = 15 × 4 = 60 .
Case 3: 6 C 5 × 4 C 0 = 6 × 1 = 6 ^6 C_5 \times ^4 C_0 = 6 \times 1 = 6 6 C 5 × 4 C 0 = 6 × 1 = 6 .
Sum all mutually exclusive cases: Total Ways = 120 + 60 + 6 = 186 ways = 120 + 60 + 6 = 186 \text{ ways} = 120 + 60 + 6 = 186 ways .
Worked Example 2: String & Gap Method Word Arrangements
Problem: In how many different ways can the letters of the word 'LEADING' be arranged such that the vowels always come together?
Step-by-Step Solution:
Word = LEADING (7 total letters: L, E, A, D, I, N, G).
Identify vowels: E, A, I (3 vowels). Consonants: L, D, N, G (4 consonants).
Tie the vowels (E, A, I) into 1 single unit string: [EAI] .
Total items to arrange = 4 consonants + 1 tied unit = 5 items = 4 \text{ consonants} + 1 \text{ tied unit} = 5 \text{ items} = 4 consonants + 1 tied unit = 5 items .
5 items can be arranged in 5 ! = 120 ways 5! = 120 \text{ ways} 5 ! = 120 ways .
The 3 vowels inside the unit can be arranged among themselves in 3 ! = 6 ways 3! = 6 \text{ ways} 3 ! = 6 ways .
Total arrangements = 5 ! × 3 ! = 120 × 6 = 720 ways = 5! \times 3! = 120 \times 6 = 720 \text{ ways} = 5 ! × 3 ! = 120 × 6 = 720 ways .
Worked Example 3: Complementary Probability Shortcut
Problem: An urn contains 5 red, 4 blue, and 3 green balls. If 3 balls are drawn at random simultaneously, what is the probability that at least one red ball is drawn?
Step-by-Step Solution:
Total balls = 5 + 4 + 3 = 12 = 5 + 4 + 3 = 12 = 5 + 4 + 3 = 12 balls. Drawing 3 balls gives total sample space ∣ S ∣ = 12 C 3 |S| = ^{12} C_3 ∣ S ∣ = 12 C 3 . 12 C 3 = 12 × 11 × 10 3 × 2 × 1 = 220 ^{12} C_3 = \frac{12 \times 11 \times 10}{3 \times 2 \times 1} = 220 12 C 3 = 3 × 2 × 1 12 × 11 × 10 = 220
Use Complementary Rule: P ( At least 1 Red ) = 1 − P ( No Red Ball ) P(\text{At least 1 Red}) = 1 - P(\text{No Red Ball}) P ( At least 1 Red ) = 1 − P ( No Red Ball ) .
"No Red Ball" means all 3 balls are drawn from the remaining non-red balls (4 blue + 3 green = 7 = 7 = 7 non-red balls).
Favorable outcomes for zero red balls = 7 C 3 = 7 × 6 × 5 3 × 2 × 1 = 35 = ^7 C_3 = \frac{7 \times 6 \times 5}{3 \times 2 \times 1} = 35 = 7 C 3 = 3 × 2 × 1 7 × 6 × 5 = 35 .
P ( No Red Ball ) = 35 220 = 7 44 P(\text{No Red Ball}) = \frac{35}{220} = \frac{7}{44} P ( No Red Ball ) = 220 35 = 44 7 .
P ( At least 1 Red ) = 1 − 7 44 = 37 44 P(\text{At least 1 Red}) = 1 - \frac{7}{44} = \frac{37}{44} P ( At least 1 Red ) = 1 − 44 7 = 44 37 .
5. Common Pitfalls in Banking Probability
Confusing Permutations and Combinations: Always check if order creates distinct outcomes. For example, selecting 2 captains from 10 players requires n C r ^n C_r n C r if roles are identical, but n P r ^n P_r n P r if one is Captain and one is Vice-Captain.
Without Replacement Probability: When drawing items sequentially without replacement, adjust sample space size for subsequent draws ( 12 → 11 → 10 12 \to 11 \to 10 12 → 11 → 10 ).