Hangman is a paper and pencil guessing game for two players. One player thinks of a word, phrase or sentence and the other tries to guess it by suggesting letters within a certain number of guesses. The word to guess is represented by a row of dashes, representing each letter of the word. If the guessing player suggests a letter which occurs in the word, the other player writes it in all its correct positions. If the suggested letter does not occur in the word, the dashes remain as they were and one guess of the player is wasted. The first player can choose as long or as short a word as they wish. The second player is allowed seven guesses. a) If the word length is from 4 to 8 and any letter is allowed except the letter X' and a maximum of two vowels are allowed, then how many words can be formed? b) If it is known that only one vowel comes in the word and that if 'e' is that vowel then it comes as 'ee' and the word length is exactly 6, how many words can be formed? c) Player B decides to try all vowels to get as many dashes of the word filled as possible. If the word contained just one vowel but in two places and the length of the word is 7, how many possibilities of filling up the rest of the dashes are there after the player B has tried all possible vowels?
Hangman is a paper and pencil guessing game for two players. One player thinks of a word, phrase or sentence and the other tries to guess it by suggesting letters within a certain number of guesses. The word to guess is represented by a row of dashes, representing each letter of the word. If the guessing player suggests a letter which occurs in the word, the other player writes it in all its correct positions. If the suggested letter does not occur in the word, the dashes remain as they were and one guess of the player is wasted. The first player can choose as long or as short a word as they wish. The second player is allowed seven guesses. a) If the word length is from 4 to 8 and any letter is allowed except the letter X' and a maximum of two vowels are allowed, then how many words can be formed? b) If it is known that only one vowel comes in the word and that if 'e' is that vowel then it comes as 'ee' and the word length is exactly 6, how many words can be formed? c) Player B decides to try all vowels to get as many dashes of the word filled as possible. If the word contained just one vowel but in two places and the length of the word is 7, how many possibilities of filling up the rest of the dashes are there after the player B has tried all possible vowels?
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
Related questions
Topic Video
Question
100%
Transcribed Image Text:Hangman is a paper and pencil guessing game for two players. One player thinks of a word, phrase or
sentence and the other tries to guess it by suggesting letters within a certain number of guesses. The
word to guess is represented by a row of dashes, representing each letter of the word. If the guessing
player suggests a letter which occurs in the word, the other player writes it in all its correct positions. If
the suggested letter does not occur in the word, the dashes remain as they were and one guess of the
player is wasted. The first player can choose as long or as short a word as they wish. The second player is
allowed seven guesses.
a) If the word length is from 4 to 8 and any letter is allowed except the letter 'X' and a maximum of
two vowels are allowed, then how many words can be formed?
b) If it is known that only one vowel comes in the word and that if 'e' is that vowel then it comes as
'ee' and the word length is exactly 6, how many words can be formed?
c) Player B decides to try all vowels to get as many dashes of the word filled as possible. If the
word contained just one vowel but in two places and the length of the word is 7, how many
possibilities of filling up the rest of the dashes are there after the player B has tried all possible
vowels?
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
