CS206: Discrete Structures II

Professor - Chitoor Srinivasan CoRE 324 445-2019 Office Hours: Tue 11:00-1:00 srinivas@cs.rutgers.edu

TA - Glenn Rhoads Hill 402 445-4869 Office Hours: Wed 3:00-5:00 rhoads@paul.rutgers.edu

Grades

• Section 6
• Section 7
• GRADES -- plus final exam scores (avg. = 100/200).

Homework Solutions

	Homework 0:	Postscript Format	HTML File
	Homework 1:	Postscript Format	HTML File
	Homework 2a:	Postscript Format	HTML File
	Homework 2b:	Postscript Format	HTML File
	Homework 3:	Postscript Format	HTML File
	Homework 4:	Postscript Format	HTML File
	Homework 5:	Postscript Format	HTML File
	Homework 6:	Postscript Format	HTML File
	Homework 7:	Postscript Format	HTML File
	Homework 8:	Postscript Format	HTML File
	Homework 9:	Postscript Format	HTML File
	Homework 10:	Postscript Format	HTML File
	Homework 11:	Postscript Format	HTML File

Solutions to Review Problems

Miscellaneous

• St. Petersburg Paradox -- The most famous paradox in all of probability theory. Was discovered early in the development of probability theory and was the hot topic of the day for mathematicians. Can you figure out what is wrong?
• Probability Paradoxes -- These aren't paradoxes in the usual sense of a contradiction arising from seemingly correct assumptions and deductions. These are paradoxes in a looser sense that the laws of probability imply a result that is so counterintuitive that many people find it hard to believe even after being presented with a proof.
• Probability Challenge -- A collection of interesting probability problems. Most of these are challenging and a number of them have counter-intuitive answers, yet they can be solved using only the basic definition of probability plus counting arguments (combinations, permutations, etc.). A chance to impress your TA and earn some brownie points.
• Partial Fractions -- Description of the method of partial fractions. An algebraic technique that is frequently needed when solving recurrence relations via generating functions. The solutions to two of the problems in HW set 4 make use of partial fractions. (text file).
• sequence of length n²+1 -- Postscript file with a proof that every sequence of n²+1 distinct numbers has a strictly increasing or decreasing subsequence of length n+1.

Class Location and Time