3225_final_2005

# 3225_final_2005 - Math 3225 Final Exam Fall 2005 1 Define...

This preview shows pages 1–2. Sign up to view the full content.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Math 3225 Final Exam, Fall 2005 December 13, 2010 1. Define the following a. A sigma algebra. b. The Kolgomorov axioms of probability. c. The Law of Large Numbers. d. The Central Limit Theorem. 2. Bob wishes to transmit one bit of information across a noisy channel to Alice. If the bit to be transmitted is ‘1’, then Bob sends three 1’s in a row; and, if the bit to be transmitted is ‘0’, then Bob sends three 0’s. Alice’s rule for determining which bit Bob wanted her to receive is ‘Majority Rules’: If the number of 1’s among the three received bits is 2 or 3, then Alice reports that Bob was trying to send her a ‘1’, and if the number of 0’s among the three received bits is 2 or 3, then Alice reports that Bob was trying to send her a ‘0’. Suppose that the channel makes an error 1/3 of the time (thus, if you sent 1000 1’s in a row, about 333 of them will be flipped to 0’s, and whether a bit is flipped is independent of whether the other bits get flipped). And suppose that Bob chooses the bit 0 or 1 of information with equal probability. If Alice recieves the noisy message ‘110’, what is the probability that Bob’s intended bit was, indeed, ‘1’, as Alice reports?bit was, indeed, ‘1’, as Alice reports?...
View Full Document

{[ snackBarMessage ]}

### Page1 / 3

3225_final_2005 - Math 3225 Final Exam Fall 2005 1 Define...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online