📝 Paragraph & Word Coding (Chinese Coding)
Master paragraph-based substitution coding (Chinese Coding) — compare sentences to find word-code mappings for banking exam reasoning sections
Paragraph & Word Coding (Chinese Coding)
Paragraph coding — also called Chinese Coding or Substitution Coding — is one of the most frequently tested coding types in banking exams. In this pattern, you are given 3-5 sentences where each word is replaced by a code word. The codes are scrambled (not in the same order as the words), so you must deduce which code maps to which word by comparing sentences.
This type carries 3-5 marks in IBPS PO/Clerk, SBI PO, and RRB exams and is considered moderate difficulty. With the right approach, these questions can be solved in 2-3 minutes for the entire set.
The Core Principle
Each English word maps to exactly one code word, and each code word maps to exactly one English word. The mapping is consistent across all sentences.
Your job: Compare sentences to find common and unique words, then match them with common and unique codes.
Pro Content Locked
Upgrade to Pro to access this lesson and all other premium content.
₹99 charged monthly · Cancel anytime
- All Agriculture & Banking Courses
- AI Lesson Questions (100/day)
- AI Doubt Solver (50/day)
- Glows & Grows Feedback (30/day)
- AI Section Quiz (20/day)
- 22-Language Translation (100/day)
- Recall Questions (20/day)
- AI Quiz (15/day)
- AI Quiz Paper Analysis (100/day)
- AI Step-by-Step Explanations (100/day)
- Spaced Repetition Recall (FSRS)
- AI Tutor
- Immersive Text Questions
- Audio Lessons — Hindi & English
- Mock Tests & Previous Year Papers
- Summary & Mind Maps
- XP, Levels, Leaderboard & Badges
- Generate New Classrooms
- Voice AI Teacher (AgriDots Live)
- AI Revision Assistant
- Knowledge Gap Analysis
- Interactive Revision (LangGraph)
🔒 Secure via Razorpay · Cancel anytime · No hidden fees
Paragraph & Word Coding (Chinese Coding)
Paragraph coding — also called Chinese Coding or Substitution Coding — is one of the most frequently tested coding types in banking exams. In this pattern, you are given 3-5 sentences where each word is replaced by a code word. The codes are scrambled (not in the same order as the words), so you must deduce which code maps to which word by comparing sentences.
This type carries 3-5 marks in IBPS PO/Clerk, SBI PO, and RRB exams and is considered moderate difficulty. With the right approach, these questions can be solved in 2-3 minutes for the entire set.
The Core Principle
Each English word maps to exactly one code word, and each code word maps to exactly one English word. The mapping is consistent across all sentences.
Your job: Compare sentences to find common and unique words, then match them with common and unique codes.
The Three-Step Approach
Step 1: Find Common Words Across Sentences
Look for words that appear in two or more sentences. The code for that word must appear in the coded versions of all those sentences.
Step 2: Isolate by Elimination
If two sentences share exactly one common word, and their coded versions share exactly one common code, that code = that word.
Step 3: Chain the Deductions
Once you know one word-code pair, substitute it back into all sentences and repeat Steps 1-2 with the remaining unknowns.
Solved Example 1: Investment & Policy
Given:
| Sentence | Code |
|---|---|
| (I) "Investment policy Regular Return" | ex wd zk ad |
| (II) "Money Must Investment policy" | rd zk pm ad |
| (III) "policy Market Risk Free" | zk gt xt yz |
| (IV) "Mature Plan Profit Money Return" | ut sb ex xa rd |
Step 1: Find "policy"
"policy" appears in sentences I, II, and III. The code must be common across all three coded sentences.
- Sentence I codes: {ex, wd, zk, ad}
- Sentence II codes: {rd, zk, pm, ad}
- Sentence III codes: {zk, gt, xt, yz}
Common to all three: zk
Therefore: policy = zk
Step 2: Find "Investment"
"Investment" appears in sentences I and II. Common codes (after removing policy=zk):
- Sentence I remaining: {ex, wd, ad}
- Sentence II remaining: {rd, pm, ad}
Common: ad
Therefore: Investment = ad
Step 3: Find "Return"
"Return" appears in sentences I and IV. Common codes (after removing known mappings):
- Sentence I remaining: {ex, wd} (removed zk and ad)
- Sentence IV codes: {ut, sb, ex, xa, rd}
Common: ex
Therefore: Return = ex
Step 4: Find "Money"
"Money" appears in sentences II and IV. Common codes (after removing known mappings):
- Sentence II remaining: {rd, pm} (removed zk and ad)
- Sentence IV remaining: {ut, sb, xa, rd} (removed ex)
Common: rd
Therefore: Money = rd
Step 5: Deduce remaining words
From Sentence I: "Regular" is the only word left, and "wd" is the only code left. Therefore: Regular = wd
From Sentence II: "Must" is the only word left, and "pm" is the only code left. Therefore: Must = pm
From Sentence III: Remove policy(zk). Remaining words: Market, Risk, Free. Remaining codes: gt, xt, yz. (These cannot be individually determined without more information.)
From Sentence IV: Remove Return(ex) and Money(rd). Remaining words: Mature, Plan, Profit. Remaining codes: ut, sb, xa.
Final Mapping (confirmed):
| Word | Code |
|---|---|
| policy | zk |
| Investment | ad |
| Return | ex |
| Money | rd |
| Regular | wd |
| Must | pm |
Remaining (unresolved from given sentences): Market, Risk, Free = {gt, xt, yz} in some order. Mature, Plan, Profit = {ut, sb, xa} in some order.
Question: Which of the following statement(s) is/are sufficient to find the code for "Market"?
(i) "Risk Free Investment Plan" is coded as "ad xt yz sb" (ii) "Mature Money Market Must" is coded as "rd ut pm gt"
(a) Only (ii) alone (b) Both (i) and (ii) (c) Only (i) alone (d) Either (i) or (ii) alone (e) Neither
Analysis:
From statement (ii): "Mature Money Market Must" = "rd ut pm gt"
- Money = rd (known)
- Must = pm (known)
- Remove these: Mature, Market = ut, gt
- From Sentence IV we know Mature is one of {ut, sb, xa}. Statement (ii) tells us Mature is either ut or gt.
- Since gt comes from Sentence III (where it maps to one of Market/Risk/Free), and ut comes from Sentence IV (where it maps to one of Mature/Plan/Profit):
- Mature = ut and Market = gt
Statement (ii) alone is sufficient.
From statement (i): "Risk Free Investment Plan" = "ad xt yz sb"
- Investment = ad (known). Remove it.
- Plan = sb (since sb is from Sentence IV's set and Plan is the only Sentence IV word here). Remove it.
- Remaining: Risk, Free = xt, yz. This tells us which is which, but does NOT tell us Market's code.
Statement (i) alone does NOT give us Market.
Answer: (a) Only (ii) alone
Solved Example 2: Colors and Nature
Given:
| Sentence | Code |
|---|---|
| (I) "Blue Sky Bright Morning" | ka ta pa ra |
| (II) "Bright Green Leaves Nature" | ra sa na da |
| (III) "Morning Walk Green Park" | na fa ta sa |
| (IV) "Blue Park Nature Beautiful" | da ka ha fa |
Step-by-step deduction:
Find "Bright": Appears in I and II.
- I codes: {ka, ta, pa, ra}
- II codes: {ra, sa, na, da}
- Common: ra
- Bright = ra
Find "Blue": Appears in I and IV.
- I remaining: {ka, ta, pa}
- IV codes: {da, ka, ha, fa}
- Common: ka
- Blue = ka
Find "Morning": Appears in I and III.
- I remaining: {ta, pa}
- III codes: {na, fa, ta, sa}
- Common: ta
- Morning = ta
From Sentence I: Only "Sky" left, only "pa" left.
- Sky = pa
Find "Green": Appears in II and III.
- II remaining: {sa, na, da} (removed ra)
- III remaining: {na, fa, sa} (removed ta)
- Common: na and sa — two common codes! We also have "Green" as the only common word. So we need another approach.
Wait — both na and sa appear in II and III. But "Green" is the only common word between II and III (after removing known words). Actually, let me list remaining words:
- Sentence II remaining (after Bright=ra): Green, Leaves, Nature = {sa, na, da}
- Sentence III remaining (after Morning=ta): Walk, Green, Park = {na, fa, sa}
Common words: Green. Common codes: na, sa. Two common codes for one common word — this means one of na/sa is Green, and we need more info.
Find "Nature": Appears in II and IV.
- II remaining: {sa, na, da}
- IV remaining: {da, ha, fa} (removed ka)
- Common: da
- Nature = da
Find "Park": Appears in III and IV.
- III remaining: {na, fa, sa} (removed ta)
- IV remaining: {ha, fa} (removed ka, da)
- Common: fa
- Park = fa
Now back to Sentence II remaining: Green, Leaves = {sa, na} (removed ra, da). Sentence III remaining: Walk, Green = {na, sa} (removed ta, fa).
Common word Green must map to a code common to both remaining sets. Both have {sa, na}. We need to use one more sentence comparison.
From Sentence III: Walk and Green = {na, sa}. We have no other sentence with Walk. From Sentence II: Leaves and Green = {sa, na}. We have no other sentence with Leaves.
Without additional information, Green = sa or na, and correspondingly Walk and Leaves get the other codes.
Typical exam question: "What is the code for 'Beautiful'?"
From Sentence IV remaining: Beautiful = ha (only word and code left after Blue=ka, Park=fa, Nature=da).
Beautiful = ha
Solved Example 3: Five Sentences
Given:
| Sentence | Code |
|---|---|
| (I) "Happy New Year Celebration" | mn pq rs tu |
| (II) "New Rules Apply Today" | vw pq xy za |
| (III) "Today Happy Golden Moment" | mn bc za de |
| (IV) "Apply Golden Standard Rules" | vw de fg xy |
| (V) "Standard Year Moment Celebration" | bc fg rs tu |
Step-by-step:
"Happy": Sentences I and III.
- I: {mn, pq, rs, tu}
- III: {mn, bc, za, de}
- Common: mn
- Happy = mn
"New": Sentences I and II.
- I remaining: {pq, rs, tu}
- II: {vw, pq, xy, za}
- Common: pq
- New = pq
"Year": Sentences I and V.
- I remaining: {rs, tu}
- V: {bc, fg, rs, tu}
- Common: rs, tu — two matches! But "Celebration" also appears in both I and V.
So "Year" and "Celebration" map to {rs, tu} in some order. We need another sentence with either word.
"Celebration": Appears in I and V only. Same situation.
"Today": Sentences II and III.
- II remaining: {vw, xy, za}
- III remaining: {bc, za, de}
- Common: za
- Today = za
"Apply": Sentences II and IV.
- II remaining: {vw, xy}
- IV: {vw, de, fg, xy}
- Common: vw, xy — two matches. "Rules" also appears in both.
"Rules": Same pair II and IV.
"Golden": Sentences III and IV.
- III remaining: {bc, de}
- IV remaining: {de, fg, xy} (wait, let me recount)
Sentence IV: "Apply Golden Standard Rules" = {vw, de, fg, xy} Sentence III remaining (after Happy=mn, Today=za): "Golden Moment" = {bc, de} Sentence IV remaining: needs analysis.
Common between III remaining {bc, de} and IV {vw, de, fg, xy}: de
- Golden = de
From Sentence III remaining: "Moment" = bc
- Moment = bc
"Standard": Sentences IV and V.
- IV remaining (after Golden=de): Apply, Standard, Rules = {vw, fg, xy}
- V remaining (after Moment=bc): Standard, Year, Celebration = {fg, rs, tu}
- Common: fg
- Standard = fg
From Sentence V remaining: Year, Celebration = {rs, tu}. From Sentence I remaining: Year, Celebration = {rs, tu}. Still need one more link.
"Apply" and "Rules": From Sentence II (after New=pq, Today=za): Apply, Rules = {vw, xy}. From Sentence IV (after Golden=de, Standard=fg): Apply, Rules = {vw, xy}. Same pair in both sentences — cannot distinguish without more info.
Typical exam question: "What is the code for 'Standard Golden'?"
Standard = fg, Golden = de. Answer: fg de (or de fg since order may vary).
Strategy for 5-Question Sets
In exams, paragraph coding is given as a set of 5 questions based on the same sentences. Here is the optimal order to solve:
| Step | Action | Time |
|---|---|---|
| 1 | Read all sentences and codes | 30 sec |
| 2 | Find the word appearing in the MOST sentences — start there | 15 sec |
| 3 | Chain deductions (common words, elimination) | 60-90 sec |
| 4 | Answer all 5 questions using your mapping table | 30-60 sec |
| Total | 2-3 min |
Creating the Mapping Table
Always draw a mapping table on your rough sheet as you deduce each pair:
| Word | Code | Found From |
|---|---|---|
| policy | zk | I, II, III (common to all 3) |
| Investment | ad | I, II (after removing zk) |
| Return | ex | I, IV (after removing zk, ad) |
| ... | ... | ... |
This table becomes your answer key for all 5 questions in the set.
Types of Questions Asked
Paragraph coding sets typically ask these types of questions:
| Question Type | Example | Approach |
|---|---|---|
| Direct code | "What is the code for 'Market'?" | Look up your mapping table |
| Direct decode | "What does 'zk' mean?" | Reverse lookup in mapping |
| Combination code | "What is 'Market Risk' coded as?" | Look up both words, combine |
| Sufficiency | "Which statement is needed to find X?" | Check if extra info resolves ambiguity |
| Cannot be determined | "Which word's code cannot be determined?" | Identify unresolved pairs |
Speed Tips for Paragraph Coding
- Start with the most repeated word: The word appearing in the most sentences is easiest to find — its code will be common across all those coded sentences
- Use elimination aggressively: Once you know a word-code pair, mentally cross it out in ALL sentences before looking for the next match
- Draw the table immediately: Do not try to hold mappings in your head. Write them down. This prevents confusion and speeds up answering
- Handle ambiguous pairs last: If two words in the same sentence remain unresolved (like Year/Celebration), skip them and come back only if a question asks about them
- Read all 5 questions before solving: Sometimes a question gives away information (e.g., "If 'Risk Free Plan' is coded as...") that helps you solve the main puzzle faster
Common Traps
- Codes are scrambled: The codes in the coded sentence are NOT in the same order as the words. "Blue Sky" coded as "ta ka" does NOT mean Blue=ta. Blue could be ka
- Two common codes: If two sentences share two common words, you get two common codes but cannot assign them individually without a third sentence
- Overlooking a word: Sometimes a common word like "is" or "the" is hidden in the sentences. Check if small words are included or excluded
- Assuming order matters: Never assume the first code corresponds to the first word. Codes are always scrambled in paragraph coding
- Not verifying with all sentences: After deducing a mapping, verify it works in every sentence where that word appears. One mismatch means your deduction is wrong