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.

Solutions

Expert Solution

Given:

A machine prints a word and the number of letters in this word is a Poisson distributed random variable with parameter λ .

However, each letter in the word is printed incorrectly with probability 2/3 independently of all other letters.

So probability of world is printed incorrectly is

p(Incorrect) = 2/3 = 0.667

Mean, =

Standard deviation, = √

So variance of Poisson =

Variance of probability = p(1-p) = 2/3(1-2/3) = 2/9

1) The expectation of the number of incorrect letters in the word that the machine prints is

expectaion = Mean × P(Incorrect)

= λ×2/3

= 2λ/3

2) The variance of the number of incorrect letters in the word that the machine prints.

Variance = variance of poisson * variance of probability

= λ × p(1-p)

= λ × 2/9

= 2λ/9

orchestra answered 1 year ago

Next > < Previous

Related Solutions

The number of letters arriving each day at a residential address is assumed to be Poisson...

The number of letters arriving each day at a residential address is assumed to be Poisson distributed with mean 1.8. The numbers of letters arriving on different days are independent random variables. (i) Calculate the probability that exactly two letters arrive at the address in one day. (ii) Calculate the probability that no more than 5 letters arrive at this address in a 5 day period. (iii) On a particular day, there are no letters at this address. Find the...

Question # 4. (a) Determine the number of ways to rearrange the letters in the word...

Question # 4. (a) Determine the number of ways to rearrange the letters in the word QUESTION. (b) Determine the number of ways to rearrange the letters in the word BOOKKEEPERS. (c) Determine the number of ways to rearrange the letters in the word SUCCESSFULLY, assuming that all the Ss are kept together, and the E and F are not side-by-side

1) Find the number of unique ways that the letters in the word can be arranged:...

1) Find the number of unique ways that the letters in the word can be arranged: KERFUFFLE 2) A survey of commuters found that 313 owned a motorcycle, 232 owned a car, 269 owned a moped, 98 owned a car and a moped, 57 owned only a car, 104 owned a motorcycle and moped but not a car, 69 owned all three, and 64 owned none. What proportion of people surveyed owned only a moped? Leave your answer as an...

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.

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

Write a class to accept a sentence from the user and prints a new word in...

Write a class to accept a sentence from the user and prints a new word in a terminal formed out of the third letter of each word. For example, the input line “Mangoes are delivered after midnight” would produce “neltd”. Program Style : Basic Java Programming

a) How many arrangements are there of the letters of the word FEEBLENESS? (b) What is...

a) How many arrangements are there of the letters of the word FEEBLENESS? (b) What is the probability that if the letters are arranged at random four E’s will be together? (c) In a random arrangement, what is the probability that exactly three E’ s will be together?

Subjects