NGX FHZ TJU DOU WCM
(The new words formed after performing the mentioned operations may or may not necessarily be meaningful English words)
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?
Two
This problem asks us to perform a specific transformation on five given three-letter words: NGX, FHZ, TJU, DOU, and WCM. The transformation involves replacing each consonant in a word with its 2nd preceding letter in the English alphabetical series. Vowels are to remain unchanged. After applying this consonant replacement, we need to count how many of the newly formed words contain exactly two vowels.
To accurately apply the consonant replacement rule, we must understand what "2nd preceding letter" means. This refers to the letter that comes two positions before the given consonant in the standard alphabetical order. For instance, if the letter is 'F', the 1st preceding letter is 'E', and the 2nd preceding letter is 'D'. If the letter is 'C', the 2nd preceding letter is 'A'.
Here is the English alphabetical series for reference:
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Remember that the vowels are A, E, I, O, U. All other letters are consonants.
Let's systematically apply the consonant replacement rule to each of the five words:
After performing the consonant replacement for each word, we now list the new words and count the number of vowels (A, E, I, O, U) in each of them. Our goal is to identify words that have exactly two vowels.
| Original Word | New Word Formed | Vowels in New Word | Number of Vowels |
|---|---|---|---|
| NGX | LEV | E | 1 |
| FHZ | DFX | - | 0 |
| TJU | RHU | U | 1 |
| DOU | BOU | O, U | 2 |
| WCM | UAK | U, A | 2 |
From the analysis presented in the table:
Based on our detailed vowel count analysis, the words that have exactly two vowels after the consonant replacement operation are:
Therefore, there are two words among the transformed set that contain two vowels.
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?
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?
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 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?