Mr. White and Pinkman earned money from their first drug contract. There is an N type of dollar such as A1, A2, A3...... An, each value is different. They have an argument about money sharing. So they decide to throw a coin in order to decide who gets the first choice If the head (H) appears then Mr. White will get a chance to vote first and then Pinkman if not when he says Tails (T) it is time for Jessy Pinkman to vote first and then Mr. White. Each person will select the dollar value in his or her time and the person will not be able to select a dollar note that has already been used. This will continue until all the dollars are allocated between them and in each election, they will throw a coin to decide. You should find the one who receives the extra portion of the money and its value.

Mr. White and Pinkman earned money from their first drug contract. There is an N type of dollar such as A1, A2, A3...... An, each value is different. They have an argument about money sharing. So they decide to throw a coin in order to decide who gets the first choice If the head (H) appears then Mr. White will get a chance to vote first and then Pinkman if not when he says Tails (T) it is time for Jessy Pinkman to vote first and then Mr. White. Each person will select the dollar value in his or her time and the person will not be able to select a dollar note that has already been used. This will continue until all the dollars are allocated between them and in each election, they will throw a coin to decide. You should find the one who receives the extra portion of the money and its value.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

There are a set of courses, each of them requiring a set of disjoint time intervals. For example, a course could require the time from 9am to 11am and 2pm to 3pm and 4pm to 5pm. You want to know, given a number K, if it’s possible to take at least K courses. You can only take one course at any single point in time (i.e. any two courses you choose can’t overlap). Show that the problem is NP-complete, which means that choosing courses is indeed a difficult thing in our life. Use a reduction from the Independent set problem.
X-Kingdom has trapped n number of soldiers of their opponent. They want to execute them. They created a strategy so that the prisoners will kill each other and at the end one prisoner will be alive and eventually released. As part of the process, they assigned each trapped soldier a sequence number starting from 1 and ending at n. If n = 5 and k = 2, then the safe position is 3. Firstly, the person at position 2 is killed, then person at position 4 is killed, then person at position 1 is killed. Finally, the person at position 5 is killed. So, the person at position 3 survives. If n = 7 and k = 3, then the safe position is 4. The people at positions 3, 6, 2, 7, 5, 1 are killed in order, and the person at position 4 survives. Input:n and k Output:Print the list of prisoners in reverse order from n to 1Then reverse the list to print it in correct order from 1 to nDisplay the position number who will survive. You must have to use circular doubly linked list for your solution. You…
One day, an elf jumps out at you from behind a garbage can and proposes a wager. He says that if the weather in Leipzig, Germany tomorrow is sunny, he'll give you $20, if it's cloudy (but dry) he'll give you $1, but if neither of those are the case you owe him $15. Helpfully, he also provides you data that indicates that the probability of sunny weather in Leipzig tomorrow is 40% and cloudy-but-dry is 10%. How much do you expect to win or lose from this wager (if you accept it)? A)Win $15.60 B)Lose $6.00C)Lose $7.50D)Win $0.60E)Win $4.00
Suppose a person can buy a chocolate bar from the vending machine for $1 each. Inside every chocolate bar is a coupon. A person can redeem 3 coupons for one chocolate bar from the machine. This means that once a person has started buying chocolate bars from the machine, he/she always has some coupons. A person would like to know how many chocolate bars can be bought, if a person starts with N dollars and always redeem coupons, if he/she has enough for an additional chocolate bar. For example: With 3 dollars a person could buy 4 chocolate bars after purchasing 3 bars giving him/her 3 coupons and then redeeming the 3 coupons for one bar. This would leave him/her with one extra coupon. Thus, will have 4 chocolate bars and still have one coupon leftover. For 11 dollars, a person can have 16 chocolate bars and still have one coupon leftover. For 12 dollars, a person can have 17 chocolate bars and have two coupons leftover. Write a complete Python program that prompts a buyer to input…
G E N E T I C - A L G O R I T H M OBJECT REWARD WEIGHT A 20 1 B 5 2 C 10 3 D 40 8 E 15 7 F 25 4 G 4 5 H 7 2 Here, Maximum weight = 12 The above problem is a 0/1 Knapsack problem. You have to carry the different objects in your bag in a way such that the reward is maximized without exceeding the weight limit. You can carry an object exactly once but you always have to carry the object labeled “H”. Encode the problem and create an initial population of 4 different chromosomes. Explain what would be an appropriate fitness function for this problem. Use the fitness function and perform natural selection to choose the 2 fittest chromosomes. Using the selected chromosomes perform a single point crossover to get 2 offspring. Perform mutation and check the fitness of the final offspring. Explain your work.
Mastermind is a code-breaking game for two players. In the original real-world game, one player A selects 4 pegs out of 6 colors and puts them in a certain fixed order; multiples of colors are possible (for example, red-green red-green). His opponent B does not know the colors or order but has to find out the secret code. To do so, B makes a series of guesses, each evaluated by the first player. A guess consists of an ordered set of colors which B believes is the code. The first player A evaluates the guess and feeds back to B how many positions and colors are correct. A position is correct ("black") if the guess and the secret code have the same color. Additional colors are correct ("white"), if they are in the guess and the code, but not at the same location. For example1 2 3 4secret: red-green red greenguess: red blue green purpleresults in one correct position ("black = 1") for the red peg at position one and one additional correct color ("white=1") for the green peg in the guess.…
A group of m people is considering sharing the cost of buying some items for their summer camp. There are a total of n possible items to purchase. Each person writes a list of the items they are interested in purchasing on a paper. For example, person one may write “boat, trampoline, hot tub,” whereas person two may write “ hot tub, kayak, paddleboard”. There is no limit to how many items a person registers on their sheet. The goal is to determine if at least k items can be purchased. The following rules apply 1. The cost of any purchased item must be split equally among all those who listed that item on their sheet. No person can refuse to contribute to an item chosen for purchase, which is listed on their sheet. 2. Since each person has a limited budget, they may only contribute to at most one item on their list. The problem of determining if at least k items can be purchased is called SummerCamp. Show that this problem is NP-complete.
There are four people who want to cross a rickety bridge; they all begin on the same side. You have 17 minutes to get them all across to the other side. It is night, and they have one flashlight. A maximum of two people can cross the bridge at one time. Any party that crosses, either one or two people, must have the flashlight with them. The flashlight must be walked back and forth; it cannot be thrown, for example. Person 1 takes 1 minute to cross the bridge, person 2 takes 2 minutes, person 3 takes 5 minutes, and person 4 takes 10 minutes. A pair must walk together at the rate of the slower person's pace. Write the specification of an algorithm that solves the problem.
Consider the following game (anachronistically) called the battle of the sexes. Two brothers, Shahid and Jamil are spending their weekend in Philadelphia, but they have lost communication with each other and Shahid is coming from New York where Jamil is coming from Washington DC. They are trying to find out where they should meet when they arrive in Philadelphia: they want to meet up, and both know that Shahid prefers meeting at Reading Terminal Market (he's a foodie!) and Jamil prefers meeting at the Rocky Steps (he's a movie buff!). Not meeting up though would be the worst outcome as it's the city of brotherly love. Suppose the game is represented by the following payoff matrix with Jamil the row player: Rocky Steps Reading Terminal Market Rocky Steps 2,1 0,0 Reading Terminal Market 0,0 1,2 What is the expected value for each player in the mixed strategy Nash equilibria? 4/3 1.5 2 1 1/3