Study guide
2.4 Input-Output (Machine Input) Arrangements
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
2.4 Input-Output (Machine Input) Arrangements
Key Takeaways Explain This Topic AI
Machine input-output sets show an Input line and several Steps, and the rule is found by comparing the Input with Step I and Step I with Step II.
In sorting-type machines, elements that have not yet moved keep their original relative order, so the unarranged part must never be re-sorted.
When a machine places one word-number pair per step, the number of steps equals the number of pairs unless a pair is already in its final place.
For the input '57 bank 32 loan 91 fund 18 cash 64 note', placing words alphabetically with numbers in descending order from the left ends at Step V: 'bank 91 cash 64 fund 57 loan 32 note 18'.
Operation-based machines keep positions fixed and change the values by a rule such as adding digits or squaring.
Last updated: September 2026
2.4 Input-Output (Machine Input) Arrangements
Exam Focus: Machine input-output sets present a line of words and numbers that a "machine" rearranges one step at a time. They have appeared in bank clerk Mains reasoning papers as multi-question sets, and they reward candidates who find the rule from the Input and the first two steps instead of tracing blindly.
How an Input-Output Set Works
A set gives:
An Input line, typically 6 to 10 elements (words, numbers, or both).
Several Steps showing the rearrangement in progress.
A statement that the last step is reached when the rule can no longer change the line.
Questions then ask for a particular step, the position of an element in a step, the number of steps needed, or what a new input looks like after a given step.
The Four Common Machine Types
Type What changes at each step Signal in Step I
Sorting One element moves to an end (left or right) in alphabetical or numerical order; the rest keep their relative order The first word alphabetically, or the largest/smallest number, is now at an end
Pairing A word and a number move together, often word first and number second A pair such as "bank 91" appears at one end
- Shifting (cyclic) Every element moves a fixed number of places The same elements appear in rotated order
- Operation-based Numbers change by an arithmetic rule while positions stay fixed Values change, order does not
Sorting and pairing machines are the most common, so master them first.
The Three-Line Rule-Finding Method
Compare the Input with Step I: Which elements moved, and to which end?
Compare Step I with Step II: Confirm that the same logic repeats (the next word alphabetically, the next largest number).
Check the last step: It shows the finished order and confirms the direction (ascending or descending) and the end being filled.
Important
In sorting and pairing machines, the elements that have not yet moved keep their original relative order . Candidates lose marks by quietly re-sorting the unarranged part.
- Worked Example 1: Word-Number Pairs From the Left
- Input: 57 bank 32 loan 91 fund 18 cash 64 note
Rule found from the steps: At each step, the word that comes first alphabetically among the remaining words moves to the left end of the unarranged part, immediately followed by the largest remaining number .
- Step Arrangement
- Input 57 bank 32 loan 91 fund 18 cash 64 note
- Step I bank 91 57 32 loan fund 18 cash 64 note
- Step II bank 91 cash 64 57 32 loan fund 18 note
- Step III bank 91 cash 64 fund 57 32 loan 18 note
- Step IV bank 91 cash 64 fund 57 loan 32 18 note
- Step V bank 91 cash 64 fund 57 loan 32 note 18
Step V is the last step because every word-number pair is now in place. Notice how, in Step I, the unmoved elements 57 32 loan fund 18 cash 64 note stay in their original order.
Typical Questions on This Set
"How many steps are needed to complete the arrangement?" Five , one for each of the 5 word-number pairs.
"In Step II, which element is 4th from the right end?" Step II reads bank 91 cash 64 57 32 loan fund 18 note . Counting from the right: note (1), 18 (2), fund (3), loan (4) .
"In which step do 'fund' and '57' first appear next to each other?" Step III .
Counting Steps Without Tracing Everything
A machine that places one element per step needs at most as many steps as elements to be placed.
A machine that places a pair per step needs as many steps as there are pairs.
If an element or pair is already in its final position at the start, that step is skipped and the count falls.
- Worked Example 2: An Operation-Based Machine
- Input: 24 37 15 42 59
Step I: 6 10 6 6 14 — each number is replaced by the sum of its digits (2 + 4 = 6, 3 + 7 = 10, 1 + 5 = 6, 4 + 2 = 6, 5 + 9 = 14).
Step II: 36 100 36 36 196 — each Step I value is squared.
Once the two operations are known, any question about a new input is arithmetic: for input 81 , Step I gives 9 and Step II gives 81.
Common Traps
- Trap How to avoid it
- Re-sorting the unarranged part Copy unmoved elements in their original order
Assuming an earlier line can be rebuilt from a later step In sorting machines, many different inputs can produce the same Step III, so "cannot be determined" is often the right answer
Miscounting positions "from the right" Start counting at 1 from the right end
Assuming words and numbers follow the same order Check separately whether words ascend and numbers descend, or the reverse
Forgetting which end is being filled Confirm from Step I whether the arranged block grows from the left or the right