Conditional Assertion

Conditional Assertion problems apply transformation rules that are conditional on properties of letters (vowel/consonant, position, etc.). For example, 'if vowel, replace with next letter; if consonant, replace with previous letter'. These problems test your ability to apply conditional logic to alphabet transformations.

10Worksheets
200+Practice Questions
AdvancedDifficulty
3-4 hoursHours to Master

Introduction to Conditional Assertion

Conditional Assertion problems apply transformation rules that are conditional on properties of letters (vowel/consonant, position, etc.). For example, 'if vowel, replace with next letter; if consonant, replace with previous letter'. These problems test your ability to apply conditional logic to alphabet transformations.

Prerequisites

Vowel/consonant classification Alphabet positions Conditional logic Letter transformations
Why This Matters: Conditional Assertion problems appear in 1-2 questions in SSC CGL and Banking PO exams. They test logical reasoning applied to alphabet operations.

How to Solve Conditional Assertion Problems

1

Step 1: Identify the condition(s) in the assertion

2

Step 2: Identify the transformation rule for each condition

3

Step 3: For each letter in the word, check which condition applies

4

Step 4: Apply the corresponding transformation to that letter

5

Step 5: Handle multiple conditions carefully (nested or sequential)

6

Step 6: Write the transformed word letter by letter

7

Step 7: Verify the transformation for each letter

8

Step 8: Present the final transformed word

Pro Strategy: Evaluate each letter independently against the condition. Apply the transformation, then move to the next letter. Keep track of whether conditions are mutually exclusive or can both apply.

Example Problem

Example 1: If a letter is a vowel, replace with next letter; if consonant, replace with previous letter. Apply to 'CAT'. Solution: Step 1: C is consonant → previous letter = B Step 2: A is vowel → next letter = B Step 3: T is consonant → previous letter = S Step 4: Result: B B S Answer: BBS Example 2: If letter position is odd, add 1; if even, subtract 1. Apply to 'BED'. Solution: Step 1: B=2 (even) → subtract 1 → 1=A Step 2: E=5 (odd) → add 1 → 6=F Step 3: D=4 (even) → subtract 1 → 3=C Step 4: Result: A F C Answer: AFC

Pro Tips & Tricks

  • Identify vowels: A, E, I, O, U (sometimes Y)
  • Consonants are all other letters
  • Conditions can be based on: vowel/consonant, odd/even position, prime position, etc.
  • Transformations can include: next letter, previous letter, mirror, skip, etc.
  • For nested conditions, apply the innermost condition first
  • Always check the condition for each letter individually

Shortcut Methods to Solve Faster

Vowel condition: apply transformation to vowels only
Consonant condition: apply transformation to consonants only
Position parity: even/odd positions refer to letter's position in the word or alphabet?

Common Mistakes to Avoid

Applying the wrong transformation to a letter
Confusing word position with alphabet position
Forgetting that Y is sometimes considered a vowel
Applying transformation to the whole word instead of per letter

Exam Importance

Conditional Assertion is an important topic for various competitive exams. Here's how frequently it appears:

SSC CGL
1-2 questions
BANKING PO
1-2 questions
RAILWAYS RRB
1-2 questions

Ready to Master Conditional Assertion?

Start with Worksheet 1 and work your way up to expert level! Each worksheet includes:

20 practice questions
Detailed solutions
Step-by-step explanations
Start Practicing Now