Question

How many words (both nonsense and sensical) may be formed using all the letters of the...

How many words (both nonsense and sensical) may be formed using all the letters of the word SENSELESS where N and L are the first and last letters. (i.e. Case 1: N _ _ _ L and Case 2: L _ _ _ _ N)

The choices given are:

  1. 70
  2. 35
  3. 840
  4. 1260
  5. 1960

Homework Answers

Answer #1

There are 9 letters in the word SENSELESS,

The letter S is appears 4 times and

Letter E appears 3 times

So in CASE 1, with N first and L last letter

We have number of words possible is

As there are 7 letters 4 S's and 3 E's

In similar way the number of words possible with L first and N last is

As there are 7 letters 4 S's and 3 E's

Hence the total number of words possible is

Option a) is correct

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
How many 3 letter words (both nonsense and sensical) may be formed out of the letters...
How many 3 letter words (both nonsense and sensical) may be formed out of the letters of the word 'PROBABILITY'? The choices given are: a. 210 b. 432 c. 552 d. 531 e. 1960
(a) How many words with or without meaning, can be formed by using all the letters...
(a) How many words with or without meaning, can be formed by using all the letters of the word, ’DELHI’ using each letter exactly once? (b) How many words with or without meaning, can be formed by using all the letters of the word, ’ENGINEERING’ using each letter exactly once?
How many words can be formed by arranging the letters of the word “EQUATIONS” such that...
How many words can be formed by arranging the letters of the word “EQUATIONS” such that the first letter of the word is a vowel and the last position is a consonant letter? (Note: The words thus formed need not be meaningful.)
a) How many four-letter words can be formed from the letters of the word TAUDRY if...
a) How many four-letter words can be formed from the letters of the word TAUDRY if each letter can only be used one time in a word? Y is NOT considered a vowel in this word. b) How many contain all the vowels? c) How many contain exactly three consonants? d) How many of them begin and end in a consonant? e) How many contain both D and Y?
a) How many four-letter words can be formed from the letters of the word TAUDRY if...
a) How many four-letter words can be formed from the letters of the word TAUDRY if each letter can only be used one time in a word? Y is NOT considered a vowel in this word. b) How many contain the letter Y? c) How many contain all the vowels? d) How many contain exactly three consonants? e) How many of them begin and end in a consonant? f) How. many begin with a D and end in a vowel...
How many different "words" can you make using all the letters of the word MISSISSIPPI if...
How many different "words" can you make using all the letters of the word MISSISSIPPI if a) there are no restrictions b) the word must end with an I c) the word cannot end in an I
25. The following parts (a) and (b) refer to the letters MMMMPPIII. (a) How many words...
25. The following parts (a) and (b) refer to the letters MMMMPPIII. (a) How many words can be created such that both P’s occur to the left of the first I? (b) Suppose each word is equally likely to occur. What is the probability that you randomlyselect a word where both P’s occur to the left of the first I?
5 -letter "words" are formed using the letters A, B, C, D, E, F, G. How...
5 -letter "words" are formed using the letters A, B, C, D, E, F, G. How many such words are possible for each of the following conditions? a) No condition is imposed.   b) No letter can be repeated in a word. c) Each word must begin with the letter A. d) The letter C must be at the end.   e) The second letter must be a vowel.
How many 3-letter passwords can be formed from the letters A through Z if a) all...
How many 3-letter passwords can be formed from the letters A through Z if a) all letters in the password must be different (i.e ARJ) b) all letters in the password must be different and they are in alphabetical order (i.e. AJR) c) there are no restrictions (i.e. ARR)
how many strings of length 14 of lower case letters from the English alphabet can be...
how many strings of length 14 of lower case letters from the English alphabet can be formed, if the first two letters cannot Abe both vowels and the last letter must be a consonant?