1 - that you will analyse You are allowed to collaborate...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
CS155 Probabilistic Methods in CS Upfal Homework 1 Due: Th, 24 Sep 2009, 1:00pm in class Please follow these guidelines while writing up your CS 155 homeworks. A major goal of this class is to instruct you how to mathematically ana- lyze probabilistic processes and events. Hence make sure that your proofs are rigorous, insuring that every step is adequately justified. Attempt to keep your proofs as simple and as concise as possible, keeping in mind that you will potentially have to examine multiple proof strategies in order to achieve this. Make sure to CLEARLY STATE YOUR ASSUMPTIONS at the beginning of any problem for which this is necessary. As we are doing probabilistic analysis, we shall require that you clearly define the probabil- ity space over which you are working with and identify the events within it
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: that you will analyse. You are allowed to collaborate with other students on these problems. But, the write ups should be written by yourself without help from others. If you have any questions regarding how these guidelines apply to a particular problem or what they mean in general please post on the newsgroup or email the TAs. Important Write up each homework problem on a separate sheet and place your name and login on every sheet. Problem 1 There may be several different min-cut sets in a graph. Using the analysis of the randomized min-cut algorithm presented in class, argue that there can be at most n ( n-1) / 2 distinct min-cut sets. Problem 2 Excercise 1.7 from the text book. Problem 3 Excercise 1.13 from the text book....
View Full Document

This document was uploaded on 11/03/2009.

Ask a homework question - tutors are online