In a certain coding system, 'how are you' is coded as '639', 'are you fine today' is coded as '6453', and 'stay fine' is coded as '58'. What is the code for 'Today' in this system ?
4
This question involves a simple substitution coding system where each word is represented by a unique digit. To find the code for a specific word, we need to compare the given phrases and their corresponding codes to identify the common words and their associated digits.
We are given three coded phrases:
Let's compare the phrases and their codes:
| Phrase | Code |
|---|---|
| how are you | 639 |
| are you fine today | 6453 |
| stay fine | 58 |
Step 1: Compare the first and second phrases.
The common words in Phrase 1 and Phrase 2 are 'are' and 'you'. The common digits in their codes (639 and 6453) are 6 and 3. This means 'are' and 'you' are coded as 6 and 3, but we don't know which word gets which digit yet.
Step 2: Compare the second and third phrases.
The common word in Phrase 2 and Phrase 3 is 'fine'. The common digit in their codes (6453 and 58) is 5. Therefore, the code for 'fine' is 5.
Step 3: Deduce the code for 'stay'.
We know that 'fine' is coded as 5. In the code '58', if 5 represents 'fine', then the remaining digit 8 must represent 'stay'. So, the code for 'stay' is 8.
Step 4: Deduce the code for 'today'.
From previous steps, we know:
In the code '6453', the digits 6, 3, and 5 correspond to 'are', 'you', and 'fine'. The only remaining digit in the code is 4, and the only remaining word in the phrase is 'today'. Therefore, the code for 'today' is 4.
Step 5: Deduce the code for 'how'. (Optional, but confirms the system)
We know that 'are' and 'you' are coded as 6 and 3. In the code '639', if 6 and 3 represent 'are' and 'you', the remaining digit 9 must represent 'how'. So, the code for 'how' is 9.
Based on our analysis, the codes for the words are:
We were asked for the code for 'Today'. Based on our decoding process, the code for 'Today' is 4.
Reviewing the key steps and results:
| Phrase | Code | Inference |
|---|---|---|
| how are you | 639 | 'are', 'you' $\rightarrow$ 6, 3 |
| are you fine today | 6453 | 'are', 'you' $\rightarrow$ 6, 3; 'fine' $\rightarrow$ 5; 'today' $\rightarrow$ 4 |
| stay fine | 58 | 'fine' $\rightarrow$ 5; 'stay' $\rightarrow$ 8 |
| Combining Inferences | - | fine=5, stay=8, are/you={6,3}, today=4, how=9 |
Coding and decoding questions often appear in reasoning sections of competitive exams. These questions test your ability to identify patterns and apply logical deduction. Common types include:
Solving such problems requires careful observation, comparison of given examples, and systematic elimination to find the rule or mapping.
In a certain code language, 3224 means ‘Taj is in Agra’, and 4245 means ‘Agra is near Delhi’. Which of the following is the code for ‘I like all fruits’?
In a certain code, 'jig fig vic' means 'I love India' and 're dig fig lic vic' means 'I like culture of India'. Which of the following is the code for 'love'?
In a certain code language, ' first of all' is written as 'kan dan san', who is first' is written as 'zan kan ven', and 'this is pale' is written as 'ven gen len'. How will 'who' be written in that language?
In a certain code language, ‘Min Fin Dig’ means ‘Sohan is Engineer’ and ‘Sic Ric Min Dic Fin’ means ‘Profession of Engineer is tough’. Which of the following is the code for ‘Sohan’?
In a certain code language, 'so it be' is written as 'lor kor nor', 'it is done' is written as 'zor kor tor', and 'be yourself' is written as 'nor xor'. How will 'so' be written in that language?