Suppose you are organizing a party for a large group of your friends. Your friends are pretty opinionated, though, and you don’t want to invite two friends if they don’t like each other. So you have asked each of your friends to give you an “enemies” list, which identifies all the other people among your friends that they dislike and for whom they know the feeling is mutual. Your goal is to invite the largest set of friends possible such that no pair of invited friends dislike each other. To solve this problem quickly, one of your relatives (who is not one of your friends) has offered a simple greedy strategy, where you would repeatedly invite the person with the fewest number of enemies from among your friends who is not an enemy of someone you have already invited, until there is no one left who can be invited. Show that your relative’s greedy algorithm may not always result in the maximum number of friends being invited to your party.
Relative’s greedy algorithm is not optimal.
This can be proved by the following example.
Let the friends to be invited are Ali, Bill, David, Dennis, Grace, Eemi, and Sam.
The enemy list of each friend is shown below:
• Ali: Bill. David, Dennis
• Bill: Ali, Grace, Eemi, Sam
• David: Ali, Grace, Eemi, Sam
• Dennis: Ali, Grace, Eemi, Sam
• Grace: Bill. David, Dennis. Eemi . Sam
• Eemi: Bill, David, Dennis, Grace, Sam
• Sam: Bill, David, Dennis, Eemi, Grace
Here the one with fewer enemies is Ali.
If we invite Ali, then Bill, David, and Dennis cannot be invited.
Next person that can be invited is one from Grace, Eemi, and Sam
If we choose any one of them we cannot add any other person.
For example, if we choose Grace, all other members are enemies of Ali and Grace. So only Ali
and Grace can only be invited.
So we get a list of two members using relative’s greedy algorithm.
This is not the optimal solution.
The optimal solution is a list of 3 members
• Bill, David, and Dennis can be invited to the party.
Hence proved that relative’s greedy algorithm is not optimal, where the maximum number of friends is not invited to the party.
Suppose you are organizing a party for a large group of your friends. Your friends are...
You decide to run an experiment. You invite 50 friends to a party. You randomly select 25 friends and tell them that there will be free food; most of them show up to your party. For the other 25 friends you do not mention the free food; none of these free friends show up. Based on the correlation in your data, you conclude that free food causes people to come to parties. A buddy points out "be careful correlation does...
Q2. Bayesian Rule and Conditional Probability (50 points): You are hosting a group of friends for your Birthday party today and as you wake up early in the morming to start preparing the food, the sky is cloudy. In general, 50% of all rainy days start cloudy, but cloudy mornings are common (about 40% of the days start cloudy. This is usually a dry month (which means typically only 10% of the days tend to be rainy). If this cloudy...
Suppose you are organizing a dinner party. The guests are going to be seated around a single roundtable. Show that if each guest knows at least half of the other guests, then everyone can be seated next to two people they know.
You are planning a night out with your friends, which will include dinner and a concert. Your plan is to get dinner near your apartment, then taxi to the concert venue. A taxi will fit at most 4 people, so if there are 5-8 people in your group, you will need two taxis; if there are 1-4 people, you will only need one taxi. Suppose that you invite 6 people (not including yourself), that each person has a 75% chance...
1. (3) Determine the chromatic number of each of the two graphs below. Support your answer by showing a valid coloring, and showing that no fewer colors can be used. 2. (3) Sam has eight friends with whom he wants to have dinner before leaving town for the summer. He has limited time, so he'll try to dine with several at once. His goal is to see all of these friends in as few dinners as possible. Some of these...
State the number of friends (or connections) that you have on Facebook (or Linkedin). In case you have more than 365 friends or connections, think of an alternative, smaller group of friends or relatives. What is the chance that there are at least 2 people among your friends (or connections) with the same birthday (same day, not same year)? Let's find out. Please respond with an estimate of the probability that this will happen. This estimate can be intuitive or...
3. Drawing on your personal experience (relatives, friends, acquaintances) and your clinical experience, list examples of people who: a. Recovered from a life-threatening illness, contrary to the expectation of their physicians. b. Recovered from a serious illness through medical intervention, such as surgery, only to develop symptoms of another serious illness within a year. Refer to one of the examples you listed above and consider what factors may have contributed to the recovery. What traits characterize that person? 4. List...
7. You and your few friends, none of whom are famous, have decided to sell flower arrangements for $6. Each of you is to produce 25 arrangements per day. a. What should you do if your dumb friend Kyle decides to produce 30 flower arrangements per day? b. What should you do if your other dumb friend Piper decides to charge $8 for her flower arrangements?
please solve 22.1, using the Theorem given. Thank you. Theorem 22.1. Suppose that n people (n 2 2) are at a party. Then there exist at least two people at the party who know the same number of people present First you need to know the rules. We will assume that no one knows him- or herself. We will also assume that if x claims to know y, then y also knows x. The idea behind the proof is this,...
3. Dating. Yo ing. You randomly call some of your friends who could be potential partners for a You think that they all respond to your requests independently of each other, and estimate that each one is 7% likely to accept your request. Let X, indicate the event What you need to call y or more people until you find someone who accepted your invitation. So polity X =X1 + X2 + X3+... is the total number of people that...