No subject

13.3 Random Variables and their Expectations
13.4 Randomized Approximation Algorithm for MAX 3-SAT
Specifically, the probabilistic method on page 726.
Monte-Carlo and Las Vegas will come after the midterm.

Chapter 1 and 2 and 3 are covered.
For chapter 4, the first 7 sections  and for chapter 5 the first 3 sections.

-- Karl


On Tue, Feb 23, 2010 at 5:27 PM, Jonathan DiBiasio <jdibs87 at gmail.com>wrote:

> Will we encounter any questions from chapter 13 in the book on the
> midterm?  If so, up until which section?  Will we need to know monte
> carlo, or las vegas algorithms?  universal hashing?  thanks.
>
> ~Jon
>

--0016e65bc19e4a604904804c636e
Content-Type: text/html; charset=ISO-8859-1
Content-Transfer-Encoding: quoted-printable

<div>Hi Jon:</div>
<div>=A0</div>
<div>From chapter 13 we only cover in the midterm what was in hw6:</div>
<div>=A0</div>
<div>13.3 Random Variables and their Expectations<br>13.4 Randomized Approx=
imation Algorithm for MAX 3-SAT</div>
<div>Specifically, the probabilistic method on page 726.</div>
<div>Monte-Carlo and Las Vegas will come after the midterm.</div>
<div>=A0</div>
<div>Chapter 1 and 2 and 3 are covered.</div>
<div>For chapter 4, the first 7 sections=A0=A0and for chapter 5 the first 3=
 sections.</div>
<div>=A0</div>
<div>-- Karl=A0<br><br><br></div>
<div class=3D"gmail_quote">On Tue, Feb 23, 2010 at 5:27 PM, Jonathan DiBias=
io <span dir=3D"ltr">&lt;<a href=3D"mailto:jdibs87 at gmail.com">jdibs87 at gmail=
.com</a>&gt;</span> wrote:<br>
<blockquote style=3D"BORDER-LEFT: #ccc 1px solid; MARGIN: 0px 0px 0px 0.8ex=
; PADDING-LEFT: 1ex" class=3D"gmail_quote">Will we encounter any questions =
from chapter 13 in the book on the<br>midterm? =A0If so, up until which sec=
tion? =A0Will we need to know monte<br>
carlo, or las vegas algorithms? =A0universal hashing? =A0thanks.<br><br>~Jo=
n<br></blockquote></div><br>

--0016e65bc19e4a604904804c636e--