Unit 10

Coded Language Cipher

About this unit

Decode secret messages, identify substitution rules, and crack symbol-based identification puzzles. This unit tests your ability to detect patterns in encoded data and apply discovered rules to decode new information.

What types of questions will you face?

  • 1Caesar-style letter shift: given example words encoded by shifting letters by N places, decode a ciphertext
  • 2Multi-step transformation: a word is reversed AND each letter shifted — identify the double rule and apply it
  • 3Secret language: four speakers use word-for-word replacements — cross-reference to build the complete vocabulary mapping
  • 4Symbol-attribute identification: items (potions, robots, keycards) each have two-symbol tags — use given examples to decode which symbol means which attribute
  • 5Rule-based letter transformation: each position in the word applies a different rule (first stays, second shifts back 1, etc.)

Skills you will build

  • Identifying a shift cipher by comparing encoded and decoded letter pairs
  • Applying multi-step transformations systematically (reverse, then shift)
  • Building a vocabulary mapping table from limited cross-reference examples
  • Using process of elimination with symbol-attribute pairs
  • Checking proposed rules against all given examples before committing

By the end of this unit, you will be able to

  • Crack any single-rule or double-rule cipher by reverse-engineering from examples
  • Build a complete word-to-code mapping from a set of example phrases
  • Decode symbol-based identification puzzles with logical elimination
  • Apply discovered rules consistently and accurately to new encoded data

Difficulty profile

Medium difficulty (avg 3.00). Shift ciphers are Easy-Medium; the secret language and symbol-attribute puzzles are Medium-Difficult and require careful cross-referencing.

Exam tip: Coded Language Cipher

For shift ciphers: find the shift by comparing the first letter of an example pair (e.g. A→D means +3). Then verify with a second letter. For secret languages: isolate words that appear in two sentences and match by elimination.

Sample Questions

Lesson 1 of 3Coded Language CipherEasy

Cipher questions reward one habit: find the fixed letter shift from the examples, then apply it letter-by-letter to the target word.

Substitution codes appear regularly on Selective TS — often as a mid-paper puzzle when you compare two known words to lock the rule.

The examiner checks whether you can infer a consistent +N (or −N) shift from paired plaintext/ciphertext and apply it without mixing letters.

Two encoded words are given with their originals. You encode or decode a third word using the same shift, watching wrap-around at A–Z.

Best approach: Align letters of one pair and count the shift (e.g. A→D is +3). Apply that shift to every letter of the new word. Verify with the second example before picking an option.

Question

In a secret code, each letter of the alphabet is replaced by another letter using the same rule throughout.

  • APPLE is written as DSSOH
  • CAKE is written as FDNH

Using the same code, what would MANGO be written as?

Using the same code, what would MANGO be written as?

  1. APDQJR
  2. BNBOHP
  3. COCPIQ
  4. DQERKS

Decided on your answer? Check how you went below.

Lesson 2 of 3Coded Language CipherEasy

Symbol puzzles look busy, but they almost always use the same two moves: spot the new symbol, then use the shared symbol to lock both attributes.

Two-icon container questions sit in the harder band of Selective ciphers — fast marks if you know newcomer + link, slow traps if you guess.

You must deduce which attribute each symbol represents when two full containers are known and a third shares one symbol and introduces one new symbol.

Six items = 3×3 grid on two attributes (e.g. size × tool). Each crate shows two symbols. Find which robot/card the mystery crate holds.

Best approach: Newcomer → fills the only empty slot on its attribute axis. Shared symbol → must mean the same attribute in both crates; cross-check the known crate to assign Gold/Level etc.

Question

There are six specialised robots in a factory. There are 3 Tall robots and 3 Short robots. For each size, there is one robot equipped with a Laser, one with a Shield, and one with a Claw.

Each robot is stored in a crate. Every crate has two symbols stamped on it. One symbol represents the size of the robot and the other represents its equipment, but they can appear in any order.

Clues:
- The crate for the Tall robot with a Laser has the symbols # and @.
- The crate for the Short robot with a Shield has the symbols % and &.
- A third crate has the symbols # and %.

Which robot could be stored in the third crate?

  1. AThe Tall robot with a Shield.
  2. BThe Tall robot with a Laser.
  3. CThe Short robot with a Shield.
  4. DThe Short robot with a Claw.

Decided on your answer? Check how you went below.

Lesson 3 of 3Coded Language CipherIntermediate

Jody replies to Todd's question in a unique-symbol code. The reply has six symbols, all different. Two seasons are eliminated because a known letter (T = Λ) doesn't match the code. A third is eliminated because Summer has two M's but the code has no repeated symbols. Only Spring survives.

'Unique-symbol substitution with elimination' is a medium-difficulty cipher variant on NSW Selective TS. Unlike Caesar-shift questions, you don't decode every symbol — you use two short-cut rules (known mappings + uniqueness) to eliminate three options and confirm the fourth.

The examiner tests whether students can (a) extract known letter-symbol pairs from the examples, (b) check each candidate word at the position where a known letter appears, (c) apply the uniqueness rule to eliminate Summer (M repeated but symbols differ), and (d) confirm Spring as the only consistent answer.

Two known coded words give some letter-symbol pairs. A third coded word (often 4–6 symbols long) must be identified from four candidate words. Not all symbols are decodable — the question is solved by ruling out three candidates via contradiction.

Best approach: Step 1: List every known letter-symbol pair from the examples. Step 2: For each candidate word, find positions of known letters and check the code symbol at that position. Mismatch = eliminate. Step 3: Check each candidate for repeated letters. If a letter repeats but the code symbols at those positions differ, eliminate. Step 4: The surviving candidate is the answer.

Question

Jody and Todd frequently message each other in code. They always use the same code, in which each letter of the alphabet is always represented by a unique symbol. For example, Jody is $!@= and Todd is Λ!@@.

When Todd asked Jody to name her favourite season of the year, she replied:

Δ?#>&÷

What is Jody's favourite season of the year?

  1. ASpring
  2. BSummer
  3. CAutumn
  4. DWinter

Decided on your answer? Check how you went below.

Give Your Child the Best Chance at Selective Entry

Join NSW families preparing their children for the Selective Schools Placement Test with the most realistic online Selective practice tests available. First tests free—no credit card required.

Claim Your Free Selective Practice Tests