Symbol Coding

In symbol coding, each letter (or word) is replaced by a symbol — such as @, #, $, %, *, &, or a shape. The question gives you one or two coded words as examples so you can build a symbol-to-letter map. Once you have the map, you can encode a new word or decode a symbol string. Symbol coding tests careful pattern matching rather than arithmetic.

1. List each coded example given in the question.
2. Match letters to symbols one by one: if CAT = @#$and BAT =$, then T=$ and A=# must be shared; comparing gives C=@ and B=%.
3. Build a key table: Letter → Symbol.
4. Use the key to decode the asked symbol string or encode the asked word.
5. Double-check each symbol against your key — do not guess for symbols that were not given.

Example 1: In a code, PEN = !@# and NET = #@. Decode !#.

• From PEN: P=!, E=@, N=#.
• From NET: N=#, E=@, T=*. (Consistent with PEN coding.)
• Decode !*#: ! = P, * = T, # = N.
• Answer: PTN.

Example 2: In a code, BOOK = %^^& and COOK = @^^&. What is the code for COOL?

• B=%, C=@, O=^, K=&.
• COOL: C=@, O=^, O=^, L=?
• L was not given — the question would provide it or ask only for decodable letters.
• If L=* is given elsewhere: COOL = @^^*.

• Assuming a symbol always maps to the same letter across different questions — each question has its own key.
• Getting confused when the same letter appears twice in a word (OO in BOOK = ^^, confirming O=^).
• Missing a symbol because it looks like punctuation — treat every character in the coded word as a symbol.

1. In a code, SUN = #@% and NUT = %@. What does #@ decode to?
2. Using the same code above, encode the word TUN.