Homework 11

[Note: this webpage last modified Friday, 04-Feb-2011 19:44:51 EST]

This homework assignment will be handed out on Wednesday November 10 and is due by the beginning of class on the following Wednesday, so by 3pm Wednesday November 17. REMEMBER that your solutions should be explained in complete sentences such that your classmates will understand the solution (and can verify your proofs are correct) even if they have not solved the problems themselves.

  1. HW Polices.

    1. Type your HW (in word, latex, text file, etc.) and send to me by email.

    2. Do NOT share electronically. You must type your own solutions. You can discuss the problems with each other, but you may only discuss them. You may not write out solutions together.

    3. You MAY NOT search the Internet, textbooks, etc. for solutions to the problems. The following are the ONLY sources of information that you may use in solving the problems: the textbook for this course (draft available from here ), Computational Complexity: A Modern Approach, and wikipedia articles on basic math/probability/etc. You may discuss the problems with each other and with myself, but must obey the previous item in doing so.

      If you do find the solution in one of these three sources, you still MUST cite the source in your document.

      You may use NOTHING ELSE that is online or other textbooks. You have already received warnings about this! ANY violations of this policy for the rest of the semester will result in you FAILING the course and being brought before the appropriate committee on campus for handling academic misconduct.

    4. You MAY NOT copy word-for-word from any source, even the 3 you are allowed to consult. If you feel it is necessary, you should put the quotation in quotes and provide a reference/citation.

  2. (-3 points if left blank) List who you collaborated with on this assignment, "none" if none.

  3. (15 Points) Make a cheat sheet for yourself on the basic rules that we use for probability. You should include at least the following items: definition of discreet probability, definition of expectation for discreet random variables, Markov's inequality, union bound, Chernoff bound, definition of conditional probability, definition/product-rule for independent events/random variables, linearity of expectation, rule of inclusion/exclusion, probability of complementary events, law of total probability, formula binomial coefficients and use of that for number of combinations.

    For each of those, you should include the definition or rule. Also include an example for each of using the rule or definition on some particular example.

    You should type these in yourself and not just copy and paste from elsewhere.

  4. (10 Points \textbf{extra credit}) Exercise 7.1 from the textbook.