hw110fall - CS 4540, Advanced Algorithms Homework 1 Mon,...

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

View Full Document Right Arrow Icon
CS 4540, Advanced Algorithms Homework 1 Mon, Aug 30, 2010 Due Fri, Sept 10, 2010 Problem 1 Exercise 3, pages 782(bottom)-784(top) of Chapter 13 ”Randomized Algorithms” by Kleinberg and Tardos (posted in class lecture notes and assinged reading 08-23-10). Recommendation: In addition to lecture notes and assigned reading of 08-23-10, it will be quite useful to go over Solved Exercise 1, pages 776(bottom)-779(top) of Chapter 13 ”Randomized Algorithms” by Kleinberg and Tardos. Problem 2 Suppose that n distributed non-communicating processes want to access a machine M where, if more than two processes attempt to access M at the same time unit, then M rejects all requests, but if at most two processes attempt to acess M at the same time unit, then M satisfies their requets. (a) Suppose that, at each time unit, each process attempts to access M with probability 1 n . Determine a value t as a function of n and c such that, the probability that all processes n have succeeded in accessing
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 2

hw110fall - CS 4540, Advanced Algorithms Homework 1 Mon,...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online