You are given a series of inputs that get transformed into outputs through hidden rules. Your job is to crack the code and predict what the next output will be. The transformations can involve numbers, words, symbols, or mixed elements
πRule Consistency
The same rule applies to all input-output pairs in a question
2. Step-by-Step Logic: Complex transformations happen in sequential steps
3
πPattern Recognition
Look for arithmetic operations, positional changes, or symbolic replacements
4
πElimination Method
Use given examples to eliminate wrong rule possibilities
Common Transformation Types:
β’ Arithmetic: Addition, subtraction, multiplication, division on numbers
β’ Positional: Rearranging elements based on position rules
β’ Conditional: If-then logic applied to inputs
β’ Symbolic: Replacing elements with predefined symbols or codes
π’
Formula Block
Memorise β at least one formula appears in every paper
For Arithmetic Transformations: Output = Input Β± Constant OR Input Γ Constant
For Positional Changes: New Position = Original Position Β± Step Value
For Sequential Patterns: Next Term = Previous Term + Common Difference (for arithmetic) OR Previous Term Γ Common Ratio (for geometric)
π
Exam Patterns
What examiners ask β read before attempting PYQs
Apply to new input: 24 - 6 = 18
Answer: 18
Worked Example 2:
Input: CAT, DOG, RAT, PIG
Output: TAC, GOD, TAR, GIP
Find: Output for COW
1
Analyze letter positions in CAT β TAC: C-A-T becomes T-A-C
2
Pattern = Reverse the word (last letter first, first letter last, middle stays)
3
Verify with other examples: DOG β GOD β, RAT β TAR β, PIG β GIP β
4
Apply to COW: C-O-W becomes W-O-C
Answer: WOC
Shortcut Trick #3 - The Elimination Strategy: If you can't spot the pattern immediately, use the given examples to test possible rules. Start with simplest operations first
βMost Common Trap Students Make
Assuming the first pattern you notice is correct without verifying it against ALL given examples. Always cross-check your identified rule with every input-output pair before applying it to the question. Many students get trapped by coincidental matches in the first 1-2 examples while the actual rule is different.
A word arrangement machine processes words in a specific pattern. When given the input 'MACHINE LEARNING SYSTEM WORKS', it rearranges them in a particular order. In the first step, it reverses the position of the first and last word. In the second step, it reverses the position of the second and second-last word. This process continues. What will be the arrangement after all steps are complete?
Practice 2easy
A number processing system takes an input and produces an output through these rules: (1) Add 5 to the number, (2) Multiply the result by 2, (3) Subtract 6 from that result. If the final output is 28, what was the original input number?
Practice 3easy
A sorting machine arranges numbers in ascending order through a specific process. It compares adjacent pairs from left to right and swaps them if the left number is greater than the right number. One complete pass through all adjacent pairs is called one 'cycle'. Given the input: 5 3 8 2, how many numbers will be in their final sorted position after exactly 2 complete cycles?
Practice 4easy
A code-breaking system decodes messages using this rule: Each letter is shifted backward in the alphabet by a number equal to its position in the word. For example, in a 3-letter word, the 1st letter shifts back 1 position, the 2nd letter shifts back 2 positions, and the 3rd letter shifts back 3 positions. If the encoded message is 'DOG' (a 3-letter word), what is the original decoded message?
Practice 5medium
A word arrangement machine processes input words through a series of steps. In each step, it rearranges words based on a specific rule.
Input: MOTHER FATHER SISTER BROTHER COUSIN
Step 1: BROTHER COUSIN FATHER MOTHER SISTER
Step 2: BROTHER COUSIN FATHER SISTER MOTHER
Step 3: BROTHER COUSIN SISTER FATHER MOTHER
Step 4: BROTHER SISTER COUSIN FATHER MOTHER
If the same process continues, what will be the arrangement in Step 6?
Practice 6medium
A number processing system transforms input numbers through logical operations.
Input: 24
Step 1: 24 β 12 (divide by 2)
Step 2: 12 β 15 (add 3)
Step 3: 15 β 5 (divide by 3)
Step 4: 5 β 10 (multiply by 2)
Following the same pattern of operations (divide by 2, add 3, divide by 3, multiply by 2, repeat), what will be the output after Step 8 starting with input 48?
Practice 7medium
A machine rearranges letters in words based on alphabetical order within each step.
Input: GARDEN
Step 1: AEGNRD (all letters sorted alphabetically)
Step 2: AEGNRD β AEGDNR (swap positions 4 and 5)
Step 3: AEGDNR β AEDGNR (swap positions 3 and 4)
Step 4: AEDGNR β AEDGNR (no change, process stops)
Applying the same logic, what will be the final arrangement for the word PLANET?
Practice 8medium
A coding machine encodes words using position-based number substitution.
Input: LOGIC
Step 1: L=12, O=15, G=7, I=9, C=3 (each letter's position in alphabet Γ 1.5, rounded down)
Step 2: 12, 15, 7, 9, 3 β 12+15=27, 15+7=22, 7+9=16, 9+3=12 (sum of consecutive pairs)
Step 3: 27, 22, 16, 12 β 27-22=5, 22-16=6, 16-12=4 (difference of consecutive pairs)
Step 4: 5, 6, 4 β 5+6+4=15 (sum of all remaining numbers)
Following the same process, what is the final code for the word SMART?
Practice 9medium
A sequence machine generates outputs based on input numbers and a transformation rule.
Input: 5
Step 1: 5 β 5Γ2+1 = 11
Step 2: 11 β 11Γ2+1 = 23
Step 3: 23 β 23Γ2+1 = 47
Step 4: 47 β 47Γ2+1 = 95
The process stops when the output exceeds 200. Starting with input 3, after how many steps will the process stop?
Practice 10medium
A machine processes input strings through a sequence of operations. Study the pattern:
Input: MACHINE
Step 1: M A C H I N E β Reverse the string β E N I H C A M
Step 2: E N I H C A M β Shift each letter 2 positions forward in alphabet β G P K J E C O
Step 3: G P K J E C O β Rearrange by moving 1st and 3rd and 5th characters to the end β P J C G K E O
Now apply the same three-step process to: BANKING
What is the final output after all three steps?
60-Second Revision β Input-Output
Remember: Always verify identified rules against ALL given examples
Formula: Output = Input Β± Constant for simple arithmetic patterns
Trick: Use Difference Method for quick number pattern identification
Trap: Don't assume first noticed pattern is correct without full verification
Time: Maximum 90 seconds per question, aim for 60 seconds
Strategy: Start with simplest operations, then move to complex patterns
Check: Cross-verify your answer makes logical sense with the established rule