3. Suppose there are n audiences for a show, say X₁,..., Xn. Each audience gets a switch which can be turned on or off. The switches are wired to m challenges of the form X₂ V X¡ V¬Xk (3-CNF, that is or of the variables / the negation of exactly 3 variables). Leaving Blank would result in 20% for each part. (a) Suppose all audiences turn their respective switch on/off independently at random. Calculate the expected number of challenges being satisfied. (b) Suppose m→∞. Show that with (1)-probability, a random configu- ration of switches satisfy at least 75% of the challenges.

Oh no! Our experts couldn't answer your question.

Don't worry! We won't leave you hanging. Plus, we're giving you back one question for the inconvenience.

Submit your question and receive a step-by-step explanation from our experts in as fast as 30 minutes.
You have no more questions left.
Message from our expert:
Our experts are unable to provide you with a solution at this time. Try rewording your question, and make sure to submit one question at a time. A question credit has been added to your account for future use.
Your Question:

Please do not rely too much on chatgpt, because its answer may be wrong. Please consider it carefully and give your own answer. You can borrow ideas from gpt, but please do not believe its answer.Very very grateful!Please do not rely too much on chatgpt, because its answer may be wrong. Please consider it carefully and give your own answer. You can borrow
ideas from gpt, but please do not believe its answer.Very very grateful!

3.
Suppose there are n audiences for a show, say X₁,..., Xn. Each audience
gets a switch which can be turned on or off. The switches are wired to m challenges of
the form X₂ V X¡ V¬Xk (3-CNF, that is or of the variables / the negation of exactly 3
variables). Leaving Blank would result in 20% for each part.
(a)
Suppose all audiences turn their respective switch on/off independently
at random. Calculate the expected number of challenges being satisfied.
(b)
Suppose m→∞. Show that with (1)-probability, a random configu-
ration of switches satisfy at least 75% of the challenges.
Transcribed Image Text:3. Suppose there are n audiences for a show, say X₁,..., Xn. Each audience gets a switch which can be turned on or off. The switches are wired to m challenges of the form X₂ V X¡ V¬Xk (3-CNF, that is or of the variables / the negation of exactly 3 variables). Leaving Blank would result in 20% for each part. (a) Suppose all audiences turn their respective switch on/off independently at random. Calculate the expected number of challenges being satisfied. (b) Suppose m→∞. Show that with (1)-probability, a random configu- ration of switches satisfy at least 75% of the challenges.
Knowledge Booster
Uncertainty Problems
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education