In a certain code language, 'Where are you' is written as 'me ki na', 'When you come' is written as 'bel na se', and 'Come back home' is written as 'se ne jo'. How will 'When' be written in that language?
bel
This question asks us to decode a specific word, 'When', based on three given phrases and their corresponding coded representations. This is a common type of logical reasoning puzzle where we need to identify the code for each word by comparing the phrases where those words appear.
Let's list the given information:
Our goal is to find the code for the word 'When'. We can do this by comparing the phrases to find common words and their corresponding common codes.
Step 1: Compare Phrase 1 and Phrase 2.
The common word in both phrases is 'you'.
Now let's look at their codes:
The common code word is 'na'. Therefore, the code for 'you' is 'na'.
you → na
Step 2: Compare Phrase 2 and Phrase 3.
The common word in both phrases is 'come'.
Now let's look at their codes:
The common code word is 'se'. Therefore, the code for 'come' is 'se'.
come → se
Step 3: Determine the code for 'When' using Phrase 2.
Now we look back at Phrase 2 and its code:
We have already determined the codes for 'you' (na) and 'come' (se). The remaining word in Phrase 2 is 'When', and the remaining code word is 'bel'.
Therefore, the code for 'When' must be 'bel'.
When → bel
| Word | Code |
|---|---|
| you | na |
| come | se |
| When | bel |
Based on the comparison, the code for 'When' is 'bel'.
By comparing the given phrases and their coded forms, we systematically eliminated the codes for common words. This process allowed us to isolate the code for the specific word 'When'. The code corresponding to 'When' in the given language is 'bel'.
| Concept | Description |
|---|---|
| Coding Language Puzzle | A type of logical reasoning problem where words are assigned specific codes based on a pattern or substitution. |
| Decoding Method | Typically involves comparing multiple phrases and their codes to find common elements (words and codes) to establish word-code pairs. |
| Elimination | Once a word-code pair is identified, it can be eliminated from other phrases/codes to help identify remaining pairs. |
Problems like this fall under the category of logical reasoning or verbal reasoning. They test your ability to identify patterns and relationships between different sets of information. Mastering these types of puzzles requires careful observation and systematic comparison.
Other types of coding-decoding problems include letter-based coding (e.g., substituting letters based on their position in the alphabet) or number-based coding. The key to solving most decoding problems is to look for consistent rules or patterns applied across the given examples.
In a certain code language, 'India is my country' means ‘8573’, 'Sam is my friend' means ‘8634’, 'My country' means ‘73’ and 'Team India' means ‘59’. What number is the code for 'Country'?
In a certain code language, 'he came back' is written as 'ni ji pa', 'go back now' is written as 'pa ja ka' and 'stop it now' is written as 'ka my uk' . How will 'go' be written in the same code language?
In a certain code language, ‘I am fine’ is written as ‘le su kim’, ‘you are fine’ is written as ‘se kim de’ and ‘all are fine’ is written as ‘kim ru se’. How will ‘all’ be written in that language ?
In a certain code language, ‘PAPER IS WHITE’ is written as ‘JH NX TRO’, ‘BOTTLES ARE WHITE’ is written as ‘HN NX TP’, and ‘BOTTLES IS BROKEN’ is written as ‘HN TRO SNG’. How will ‘PAPER’ be written in that language?
In a certain code language, ‘how are you’ is written as ‘so me lo’, ‘you are intelligent’ is written as ‘the lo me’ and ‘are they lazy’ is written as ‘me ca ya’. How will ‘how are they’ be written in that language?