In the following question, select the word which cannot be formed using the letters of the given word.
STRICT
Understanding the Letter Puzzle
The question asks us to find a word among the given options that cannot be created using only the letters available in the word ELECTRICIANS. To solve this, we need to look at the letters present in the original word and count how many times each letter appears. Then, for each option word, we check if all the required letters are available in sufficient quantities.
Analyzing the Letters in ELECTRICIANS
Let's list the unique letters in the word ELECTRICIANS and their frequencies:
- E: 2 times
- L: 1 time
- C: 2 times
- T: 1 time
- R: 1 time
- I: 2 times
- A: 1 time
- N: 1 time
- S: 1 time
So, the total available letters are E, E, L, C, C, T, R, I, I, A, N, S.
Checking Each Option Word Against ELECTRICIANS Letters
Now, let's examine each option word to see if it can be formed using the available letters from ELECTRICIANS.
Option 1: STRICT
Let's list the letters needed for the word STRICT and check against the available letters:
- S: Needs 1. Available in ELECTRICIANS: 1. (OK)
- T: Needs 2. Available in ELECTRICIANS: 1. (NOT OK)
- R: Needs 1. Available in ELECTRICIANS: 1. (OK)
- I: Needs 1. Available in ELECTRICIANS: 2. (OK)
- C: Needs 1. Available in ELECTRICIANS: 2. (OK)
- T: Needs 1 (second T). Available in ELECTRICIANS: 1. (Requires a second 'T', which is not available)
The word STRICT requires two 'T's, but the word ELECTRICIANS only contains one 'T'. Therefore, the word STRICT cannot be formed.
Option 2: TRAINS
Let's list the letters needed for the word TRAINS and check against the available letters:
- T: Needs 1. Available in ELECTRICIANS: 1. (OK)
- R: Needs 1. Available in ELECTRICIANS: 1. (OK)
- A: Needs 1. Available in ELECTRICIANS: 1. (OK)
- I: Needs 1. Available in ELECTRICIANS: 2. (OK)
- N: Needs 1. Available in ELECTRICIANS: 1. (OK)
- S: Needs 1. Available in ELECTRICIANS: 1. (OK)
All letters required for TRAINS are available in ELECTRICIANS with sufficient counts. So, TRAINS can be formed.
Option 3: ELECTS
Let's list the letters needed for the word ELECTS and check against the available letters:
- E: Needs 1. Available in ELECTRICIANS: 2. (OK)
- L: Needs 1. Available in ELECTRICIANS: 1. (OK)
- E: Needs 1 (second E). Available in ELECTRICIANS: 2. (OK)
- C: Needs 1. Available in ELECTRICIANS: 2. (OK)
- T: Needs 1. Available in ELECTRICIANS: 1. (OK)
- S: Needs 1. Available in ELECTRICIANS: 1. (OK)
All letters required for ELECTS are available in ELECTRICIANS with sufficient counts. So, ELECTS can be formed.
Option 4: RACES
Let's list the letters needed for the word RACES and check against the available letters:
- R: Needs 1. Available in ELECTRICIANS: 1. (OK)
- A: Needs 1. Available in ELECTRICIANS: 1. (OK)
- C: Needs 1. Available in ELECTRICIANS: 2. (OK)
- E: Needs 1. Available in ELECTRICIANS: 2. (OK)
- S: Needs 1. Available in ELECTRICIANS: 1. (OK)
All letters required for RACES are available in ELECTRICIANS with sufficient counts. So, RACES can be formed.
Conclusion
Based on the analysis, the only word that requires a letter more times than it appears in ELECTRICIANS is STRICT (needs two 'T's, but only one is available).
Therefore, the word which cannot be formed using the letters of ELECTRICIANS is STRICT.
Revision Table: Word Formation Check
| Option Word | Letters Needed | Letters Available (ELECTRICIANS) | Can be Formed? | Reason |
|---|---|---|---|---|
| STRICT | S(1), T(2), R(1), I(1), C(1) | E(2), L(1), C(2), T(1), R(1), I(2), A(1), N(1), S(1) | No | Needs 2 'T's, but only 1 'T' is available. |
| TRAINS | T(1), R(1), A(1), I(1), N(1), S(1) | E(2), L(1), C(2), T(1), R(1), I(2), A(1), N(1), S(1) | Yes | All needed letters are available in sufficient counts. |
| ELECTS | E(2), L(1), C(1), T(1), S(1) | E(2), L(1), C(2), T(1), R(1), I(2), A(1), N(1), S(1) | Yes | All needed letters are available in sufficient counts. |
| RACES | R(1), A(1), C(1), E(1), S(1) | E(2), L(1), C(2), T(1), R(1), I(2), A(1), N(1), S(1) | Yes | All needed letters are available in sufficient counts. |
Additional Information: Letter-Based Puzzles
This type of question is common in verbal ability and reasoning tests. It assesses your attention to detail and ability to manipulate letters within a given set. These puzzles can appear in various forms:
- Finding words that can be formed.
- Finding words that cannot be formed (like this question).
- Finding anagrams (words formed using the exact same letters).
- Questions based on letter sequences or patterns within a word.
The key to solving these problems is always to carefully count the frequency of each letter in the source word and compare it accurately with the letters needed for the target words. Don't miss repeated letters!
Similar Questions
In the following question, select the word which cannot be formed using the letters of the given word.
TRADITIONALIn the following question, select the word which cannot be formed using the letters of the given word.
HANGOVERIn the following question, select the word which cannot be formed using the letters of the given word.
CONDITIONERIn the following question, from the given alternatives, select the word which cannot be formed using the letters of the given word.
BASTIONEDIn the following question, from the given alternatives, select the word which cannot be formed using the letters of the given word.
SPRITUALITYIn the following question, select the word which cannot be formed using the letters of the given word.
COMMUNICATIONSIn the following question, select the word which cannot be formed using the letters of the given word.
OPERATINGIn the following question, select the word which cannot be formed using the letters of the given word.
RETROGADE
In the following question, select the word which cannot be formed using the letters of the given word.
ENTERTAINMENTIn the following question, select the word which cannot be formed using the letters of the given word.
UNNECESSARILY
Important Questions from Word Formation
From the given alternative words, select the word which cannot be formed using the letters of the given word: CHRONOLOGICAL
In the question, a word is represented by only one set of numbers as given in any one of the alternatives. The sets of numbers given in the alternatives are represented by two classes of alphabets as in two matrices given below. The columns and rows of Matrix I are numbered from 0 to 4 and that of Matrix II are numbered from 5 to 9. A letter from these matrices can be represented first by its row and next by its column, e.g., 'B' can be represented by 00, 13 etc., and 'A' can be represented by 55, 69 etc
Similarly you have to identify the set for the word 'GIRL'
From the given alternative words, select the word which cannot be formed from the letters of the given word :
SIMILARITY
From the given alternative words, select the word that cannot be formed using the letters of given word:
MAINTAIN
From the given alternative words, select the word that cannot be formed using the letters of the below word.
PENDULAM
