In a certain code language, ‘PLAYER’ is written as ‘543976’, ‘DARE’ is written as ‘8367’. What is the code for ‘YELP’ in that code language?
9745
Decoding the PLAYER and DARE Code Logic
This question involves a simple substitution cipher where specific letters are assigned specific numbers. We need to identify this pattern using the given examples and then apply it to find the code for the word 'YELP'.
Analyzing the Given Codes
We are given two words and their corresponding codes:
- 'PLAYER' is coded as '543976'
- 'DARE' is coded as '8367'
Establishing Letter-to-Number Mapping
Let's break down each word and its code to find the mapping for each letter:
From 'PLAYER' = '543976':
- P = 5
- L = 4
- A = 3
- Y = 9
- E = 7
- R = 6
From 'DARE' = '8367':
- D = 8
- A = 3
- R = 6
- E = 7
Verifying Consistency
We can check if the letters common to both 'PLAYER' and 'DARE' have the same code:
- 'A' appears in both and is coded as '3'.
- 'R' appears in both and is coded as '6'.
- 'E' appears in both and is coded as '7'.
The mappings are consistent across both examples.
Finding the Code for 'YELP'
Now, we use the established mappings to find the code for 'YELP':
- Y: From 'PLAYER', the code for 'Y' is 9.
- E: From 'PLAYER' (and 'DARE'), the code for 'E' is 7.
- L: From 'PLAYER', the code for 'L' is 4.
- P: From 'PLAYER', the code for 'P' is 5.
Combining these codes, the code for 'YELP' is '9745'.
Summary Table
Here is a summary of the letter-to-number mappings derived:
| Letter | Code |
|---|---|
| P | 5 |
| L | 4 |
| A | 3 |
| Y | 9 |
| E | 7 |
| R | 6 |
| D | 8 |
Important Questions from Random Sequence of Alphabets
In a certain code language, ‘MAP’ is written as ‘10’, ‘RAMP’ is written as ‘16’. What is the code for ‘LUR’ in that code language?
If the first and last letter of each word is replaced by immediate preceding letter as per alphabetical series, how many words will have only one vowel after rearrangement?
If in each of given words, each of the consonants is replaced by their 2nd preceding letters in the alphabetical series, how many words thus formed will have two vowel?
If all the alphabets are assigned numbers starting from A till Z (i.e. A = 1, B = 2 and so on), then what will be the sum of WCM?
If the letter of given words are arranged in alphabetical order from left to right within the words then which of the following words will remain unchanged?
