Question

In: Statistics and Probability

An experiment consists of randomly rearranging the 10 letters of the word QUARANTINE into a sequence...

An experiment consists of randomly rearranging the 10 letters of the word QUARANTINE
into a sequence of 10 letters, where all possible orders of these 10 letters are equally likely. Find the probability of each of the following events:


(1) the first three letters include no A’s;

(2)  the first three letters or the last three letters (or both) include no A’s;


(3) the fourth letter is the first A;

(4) the first letter and the last letter are the same;

(5) the word ‘QUARANTINE’ is obtained;


(6) the sequence contains the word ‘RAN’.

Solutions

Expert Solution

orchestra answered 2 years ago
Next > < Previous

Related Solutions

3. An experiment consists of randomly rearranging the 10 letters of the word QUARANTINE into a...
3. An experiment consists of randomly rearranging the 10 letters of the word QUARANTINE into a sequence of 10 letters, where all possible orders of these 10 letters are equally likely. Find the probability of each of the following events: (1) 2 the first three letters include no A’s; (2) 3 the first three letters or the last three letters (or both) include no A’s; (3) 2 the fourth letter is the first A; (4) 3 the first letter and...
5. Of the 9-letter passwords formed by rearranging the letters AAAABBCCC (4 A’s, 2 B’s, and...
5. Of the 9-letter passwords formed by rearranging the letters AAAABBCCC (4 A’s, 2 B’s, and 3 C’s), I select one at random. Determine the following probabilities. (a) Prob (my word is a palindrome and has no two C’s next to each other). 4 points (b) Prob (my word has two C’s next to each other and the other C not next to them). (c) Prob (my word has the three C’s next to each other and the B’s apart...
5. Of the 9-letter passwords formed by rearranging the letters AAAABBCCC (4 A’s, 2 B’s, and...
5. Of the 9-letter passwords formed by rearranging the letters AAAABBCCC (4 A’s, 2 B’s, and 3 C’s), I select one at random. Determine the following probabilities. (a) Prob (my word is a palindrome and has no two C’s next to each other). (b) Prob (my word has two C’s next to each other and the other C not next to them). (c) Prob (my word has the three C’s next to each other and the B’s apart from each...
A machine prints a word and the number of letters in this word is a Poisson...
A machine prints a word and the number of letters in this word is a Poisson distributed random variable with parameter λ (so it could possibly have zero letters). However, each letter in the word is printed incorrectly with probability 2/3 independently of all other letters. Compute the expectation and the variance of the number of incorrect letters in the word that the machine prints.
A word is said to be “abecedarian” if the letters in the word appear in alphabetical...
A word is said to be “abecedarian” if the letters in the word appear in alphabetical order. For example, the following are all six-letter English abecedarian words: abdest, acknow, acorsy, adempt, adipsy, agnosy, befist, behint, beknow, bijoux, biopsy, cestuy, chintz, deflux, dehors, dehort, deinos, diluvy, dimpsy Write a method called isAbecedarian that takes a String and returns a boolean indicating whether the word is abecedarian.
A seqstring is a sequence of 18 letters(one of the 26 lowercase letters a-z). How many...
A seqstring is a sequence of 18 letters(one of the 26 lowercase letters a-z). How many seq strings are there where the number of letters between any two occurences of the same letter is at least 2?
Suppose that a “word” is any string of six letters. Repeated letters are allowed. For our...
Suppose that a “word” is any string of six letters. Repeated letters are allowed. For our purposes, vowels are the letters a, e, i, o, and u. a) How many words are there? b) How many words begin with a vowel? c) How many words begin with a vowel and end with a vowel? d) How many words have no vowels? e) How many words have exactly one vowel? A professor teaching a Discrete Math course gives a multiple choice...
If all permutations of the letters of the word "BEFORE" are arranged in the order as...
If all permutations of the letters of the word "BEFORE" are arranged in the order as in a dictionary. What is the 32 word?
In C Exercise 8.1 A word is said to be “abecedarian” if the letters in the...
In C Exercise 8.1 A word is said to be “abecedarian” if the letters in the word appear in alphabetical order. For example, the following are all 6-letter English abecedarian words. abdest, acknow, acorsy, adempt, adipsy, agnosy, be?st, behint, beknow, bijoux, biopsy, cestuy, chintz, de?ux, dehors, dehort, deinos, diluvy, dimpsy a. Describe an algorithm for checking whether a given word (String) is abecedarian, assuming that the word contains only lower-case letters. Your algorithm can be iterative or recursive. b. Implement...
Write a program that will prompt for a word with at least five letters in it...
Write a program that will prompt for a word with at least five letters in it (if not, keep asking for input). Then evaluate the word to produce a count of all the vowels in the word. Sample output appears below. Enter a word at least 5 characters long:<SPC>cat<ENTER> Enter a word at least 5 characters long:<SPC>dog<ENTER> Enter a word at least 5 characters long:<SPC>concatenate<ENTER> Letter Counts ========= a: 2 e: 2 i: 0 o: 1 u: 0
ADVERTISEMENT
Subjects
ADVERTISEMENT
Latest Questions
ADVERTISEMENT