About This Set
All 35 questions in this set are real SSC CGL Tier 1 coding–decoding questions, printed with their options in the order the paper gave them. Most give two coded words and ask for a third. Others code whole sentences word by word, turn letters into digits, or turn a word into a single number.
What comes up most
Many of the letter codes take two steps. A word may be written backwards and then shifted, cut into two halves that are each turned round, or swapped in pairs before the letters move. If the shifts look random when you put a word over its code, try the word written backwards before anything else. Some shifts change from letter to letter: +1 and −1 in turn, +4, +3, +2, +1, or vowels moving one step while consonants move two. Watch for opposite letters too (A ↔ Z, B ↔ Y …), whose positions add up to 27.
The number codes come in two kinds. In one, every letter gets its own number, written side by side or with dashes: its position plus 2, its reverse position (A = 26 … Z = 1), its position doubled, or its position with only the vowels doubled. In the other, the whole word becomes one number: the sum of positions, the sum of reverse positions, the sum times 4, or the cube of the number of letters. Test plain positions first, then reverse positions. One sentence code counts letters, so each word becomes its number of letters.
For sentence codes and digit codes, match what the examples share. A word found in two sentences takes the code found in both, and a letter found in two words takes the digit found in both codes.
Timing
Plan for about 40 seconds a question, which puts the set at about 23 minutes. In the exam the Reasoning section has its own 15-minute clock for 25 questions, so a plain +3 shift should take you about 25–30 seconds, and a two-sentence code a little longer. That leaves time for the two-step codes.
About the wording
Most questions open with "In a certain code language," and ask "How will 'COURSE' be written in that language?" or "How is 'chair' coded in the given language?". A digit code asks "What is the code for 'N' in that language?". Two sentence codes add the line "(All the codes are two-letter codes only.)", and one offers an answer of the form "either 'sh' or 'ko'", which is right when the examples cannot separate two words. A few stems are worded a little differently, such as "What will be the code for 'BLANKET'?" or "In a certain code language, if 'EAR' is written as …, how will 'DIG' be written in the same code language?". The method does not change.