Coding-Decoding is one of the most predictable topics in Agniveer Army CEE. The question always hands you a worked example — "WORD is coded as XXXX" — and asks you to apply the same rule to a new word. Your job is to crack the rule from the example, then execute it cleanly on the target word.
Think of it like a spy cipher. The person sending the message and the person receiving it both know the "key" — a specific transformation applied to each letter or number. Your task in the exam is to reverse-engineer that key from one example, then apply it forward.
Here is what makes coding-decoding different from other reasoning topics: the answer is always mechanically derivable. There is no judgment call, no ambiguity. If you find the right rule, the answer falls out. If two options look similar, you are likely making a shift-counting error — slow down by one step and recheck.
The transformations used in Agniveer papers cluster tightly around three types:
+n or -n positions in the alphabet (e.g., +2 means A→C, B→D, and so on).The vast majority of Agniveer CEE coding questions fall into type 1 or type 2. Type 3 appears occasionally and is usually signalled by a longer source word where a pure uniform shift doesn't work.
One more thing to internalize before you go deeper: the alphabet has 26 letters. When a shift takes you past Z, you wrap around (Z+1 = A, Z+2 = B). This wrap-around is where most wrong answers are manufactured. Keep that in mind throughout.
The most common pattern in Agniveer CEE. Every letter in the source word is moved a fixed number of positions forward or backward.
How to find the shift in 10 seconds:
Take the first letter of the coded word and the first letter of the original word. Count how many steps separate them in the alphabet.
Example: GUARD → IWCTF
Now apply +2 to every letter of the target word. That is the entire method.
Alphabet positions you must know cold:
| A=1 | B=2 | C=3 | D=4 | E=5 | F=6 | G=7 | H=8 | I=9 | J=10 | K=11 | L=12 | M=13 | |-----|-----|-----|-----|-----|-----|-----|-----|-----|------|------|------|------| | N=14 | O=15 | P=16 | Q=17 | R=18 | S=19 | T=20 | U=21 | V=22 | W=23 | X=24 | Y=25 | Z=26 |
Do not look these up during the exam. Burn them in now.
Sometimes odd-positioned letters get one shift and even-positioned letters get another. Or the shift itself increases by 1 with each position (+1, +2, +3...).
How to detect it: Apply a uniform shift to the first two letters. If the second pair gives a different shift number, you have a non-uniform pattern. Now check if the shifts follow an arithmetic progression or an odd/even split.
Example: DEMOCRAT → FCOMEPCR (from a real Agniveer 2025 paper)
Look — the pattern alternates +2 and -2. Odd-position letters: +2. Even-position letters: -2.
Once you spot this, applying it to MONARCHY is straightforward:
Result: OMPYTAJW. That is option B — and the correct answer.
The rule here is simple: replace each letter with its position number in the alphabet. A=1, B=2, ..., Z=26.
The trap is distractor options that differ by exactly 1 on one position. Check every letter; don't stop after the first match.
Sometimes the question adds an operation — each position number is multiplied by 2, or increased by 3. Check the given example carefully. If PEACE = 16-5-1-3-5, that is raw position values (P=16, E=5, A=1, C=3, E=5). No arithmetic on top.
Less common in Agniveer CEE. Here, an arbitrary symbol or another letter is substituted for each letter, with no systematic shift. The only reliable method is to build a partial lookup table from the examples given and use elimination on the answer choices.
After you get an answer, spend 5 seconds verifying the last letter of the decoded word. Most careless errors happen at the final letter. This habit alone will save you one question per paper.
Letters that sum to 27 are mirror pairs in the alphabet: A(1)+Z(26)=27, B(2)+Y(25)=27, C(3)+X(24)=27... all the way to M(13)+N(14)=27.
Use this for -n shifts near the start of the alphabet. If a question asks you to shift A back by 3, instead of counting backwards, recall that A's mirror is Z. Z-2 = X. So A-3 = X. One mental step instead of three counting steps.
Standard approach (counting backwards from A): 4 mental steps. Mirror method: 1 calculation. For wrap-around letters, this cuts solving time by roughly 10 seconds per wrap-around instance.
Memorize five anchor positions: E=5, J=10, O=15, T=20, Y=25. The mnemonic is the word "EJOTY" itself.
When you need to find a letter's position quickly, start from the nearest anchor. Example: you need the position of R. R is 3 letters after O(15), so R=18. No counting from A required.
Standard method (count from A to R): 18 steps. EJOTY method: identify nearest anchor O=15, count 3 forward. 3 steps. Speed gain: roughly 8-10 seconds per position lookup.
Never confirm your shift rule from just the first letter pair. Always verify on the second pair before proceeding.
Why: Distractors in Agniveer papers are designed so that a +2 rule and a +3 rule both work on the first letter (because the first letter in the example happens to be 1 step away from a distractor's first letter). If you verify on two letters, the wrong shift becomes obvious immediately.
This costs 5 extra seconds upfront and saves you from choosing a wrong option that would take 2+ minutes to recover from. Net saving: 1.5-2 minutes per question where you'd otherwise second-guess after marking.
When applying a +n shift, ask yourself before writing the coded letter: "Is the original letter within n positions of Z?" If yes, you wrap around.
Quick formula for wrap-around: coded position = (original position + shift - 26).
Example: Y(25) + 2 = 27. 27 - 26 = 1 = A. So Y+2 = A.
Without this formula, students count forward past Z and land on incorrect positions. This is the single biggest source of errors in letter-shift coding. Internalizing this formula reduces wrap-around errors to near zero — cutting wrong answers on these questions from roughly 1 in 3 to 1 in 20.
In any letter-coding question, all answer options have the same length. But the first and last letters of the correct answer are almost always uniquely determined by your rule.
Compute just the first and last coded letters of the target word. In most Agniveer CEE questions, this eliminates 2-3 of the 4 options immediately, leaving you to verify only 1-2 middle letters.
Standard method (code all letters, compare all options): 60-90 seconds. First-Last elimination method: 20-30 seconds. Speed gain: 30-60 seconds per question.
When you see a coding-decoding question in the exam hall, run this decision tree:
Step 1 — Identify the coding type. Is the code made of letters? → Letter coding. Is it made of numbers? → Number coding. Mixed? → Read both examples carefully before proceeding.
Step 2 — Find the rule on the first two letters. Compute the shift (or position value) for letter 1 and letter 2 of the given example. Do they match? → Uniform shift confirmed, proceed. Do they differ? → Check if the pattern alternates (odd/even positions) or follows a progression (+1, +2, +3...).
Step 3 — Apply the rule to the target word.
Work left to right. Handle wrap-arounds with the formula: coded position = (original + shift - 26) when the sum exceeds 26.
Step 4 — Eliminate first, confirm last. Check your first and last coded letters against all four options. Usually 2-3 options are eliminated. Verify middle letters only against the survivors.
Step 5 — Reverse-check one letter. Pick any letter from your answer and decode it back. If it matches the original, mark and move on.
Total time target: under 60 seconds for uniform-shift questions. Under 90 seconds for alternating-shift questions.
Why this question: Tests your ability to detect alternating (+2/-2) shifts rather than a simple uniform shift. This is the pattern most candidates miss, making it a high-discrimination question.
Solving path: Check D→F (+2) and E→C (-2). Pattern is +2 for odd positions, -2 for even positions. Apply to MONARCHY: M(+2)=O, O(-2)=M, N(+2)=P, A(-2)=Y, R(+2)=T, C(-2)=A, H(+2)=J, Y(-2)=W. Result: OMPYTAJW.
Why this question: The cleanest uniform +2 shift question. Establishes your baseline — if you miss this, recheck your alphabet position recall.
Solving path: G(7)→I(9): +2. Confirm U(21)→W(23): +2. Apply to WATCH: W(23)→Y(25), A(1)→C(3), T(20)→V(22), C(3)→E(5), H(8)→J(10). Answer: YCVEJ.
Why this question: Tests number coding — direct alphabetical position values with no arithmetic twist. The distractor options differ by exactly 1 on one position (N=14 vs 15, I=9 vs 8). You must check every letter.
Solving path: Verify PEACE: P=16, E=5, A=1, C=3, E=5. Confirmed raw positions. Apply to UNITY: U=21, N=14, I=9, T=20, Y=25. Answer: 21-14-9-20-25.
Why this question: Another +2 uniform shift but the explanation in the original paper notes some intermediate steps in a confusing way. This question trains you to trust your shift calculation over the worked explanation.
Solving path: B(2)→D(4): +2. R(18)→T(20): +2. Confirmed uniform +2. Apply to HONOR: H(8)→J(10), O(15)→Q(17), N(14)→P(16), O(15)→Q(17), R(18)→T(20). Answer: JQPQT.
Why this question: +3 uniform shift. High value because Y+3 wraps around to B, testing your wrap-around handling.
Solving path: The shift is +3 throughout. Apply to SECURITY: S(19)→V(22), E(5)→H(8), C(3)→F(6), U(21)→X(24), R(18)→U(21), I(9)→L(12), T(20)→W(23), Y(25)→B(2) [25+3=28, 28-26=2=B]. Answer: VHFXULWB.
Counting the shift including the start letter. When you shift G by 2, the answer is I — not H. G→H is 1 step, G→I is 2 steps. Many candidates count G as step 1, land on H, and lose the mark.
Forgetting to check the second letter before committing to a shift. One letter pair is not enough to confirm a uniform shift. If you only check the first pair, alternating-shift patterns (like +2/-2) will fool you every time.
Ignoring wrap-around at Z. Y+2 is not A+1=B. Y(25)+2=27, 27-26=1=A. Wrap-around produces A, not B. This is the most common source of wrong final letters.
Assuming alphabetical position starts at 0. A=1, not A=0. This off-by-one error affects every number-coding question and typically shows up as the "21-15-9-20-25" distractor (N listed as 15 instead of 14).
Rushing through number-coding without verifying the example word fully. Some number-coding questions add a constant offset or reverse the number sequence. If you assume raw positions without checking, you will apply the wrong rule to the target word.
Misreading similar-looking options under time pressure. Agniveer CEE options are deliberately designed with one-letter differences (e.g., OMPYTAJW vs OMPYUAJW). Always identify which position differs between the surviving options and check only that letter — don't re-derive everything.