Suppose n people have a $5 bill, and n people have a $10 bill. They line up single file one night to buy a ticket that costs $5. The agent selling tickets has no change at the beginning of the night. No one ever changes place in line. If the agent does not have change for the next customer, the ticket booth shuts down. Ignore the fact this would not happen with real human beings. Each possible ordering of the customers is equally likely. What is the probability that every customer who lined up at the beginning of the process will be able to purchase a ticket? Remember, there are 2n customers, so the answer will depend on n. Use R to simulate this scenario. Your simulation will create a randomly selected ticket line. Then you determine if everyone gets to purchase a ticket. Repeat this simulation many times. Estimate the probability everyone can purchase a ticket for cases where n= 10, n = 50, and n = 99.

Suppose n people have a $5 bill, and n people have a $10 bill. They line up single file one night to buy a ticket that costs $5. The agent selling tickets has no change at the beginning of the night. No one ever changes place in line. If the agent does not have change for the next customer, the ticket booth shuts down. Ignore the fact this would not happen with real human beings. Each possible ordering of the customers is equally likely. What is the probability that every customer who lined up at the beginning of the process will be able to purchase a ticket? Remember, there are 2n customers, so the answer will depend on n. Use R to simulate this scenario. Your simulation will create a randomly selected ticket line. Then you determine if everyone gets to purchase a ticket. Repeat this simulation many times. Estimate the probability everyone can purchase a ticket for cases where n= 10, n = 50, and n = 99.

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

On an island, a group of people are living until a visitor arrives with an odd directive: everyone with blue eyes must leave the island as quickly as possible. Every evening, a flight will depart at 8:00. Everyone can see the colour of everyone else's eyes, but they are blind to their own (nor is anyone allowed to tell them). They also do not know the number of persons who have blue eyes, but they do know that at least one person has them. How long will it take the folks with blue eyes to leave?
A salesman has a number of cities to visit. They want to calculate the total number of possible paths they could take, visiting each city once before returning home. Return the total number of possible paths a salesman can travel, given n cities. If we have cities A, B and C, possible paths would be: A - B -> C A -> C -> B B -> A -> C B -> C -> A C -> B -> A C -> A > B which gives us 6 as the possible number of paths. Examples paths (4) → 24
Every patient has a primary physician. Every doctor has at least one patient. Each pharmacy sells several drugs and has a price for each. A drug could be sold at several pharmacies, and the price could vary from one pharmacy to another. Doctors prescribe drugs for patients. A doctor could prescribe one or more drugs for several patients, and a patient could obtain prescriptions from several doctors. Each prescription has a date and a quantity associated with it. You can assume that, if a doctor prescribes the same drug for the same patient more than once, only the last such prescription needs to be stored. Pharmaceutical companies have long-term contracts with pharmacies. A pharmaceutical company can contract with several pharmacies, and a pharmacy can contract with several pharmaceutical companies. For each contract, you have to store a start date, an end date, and the text of the contract. Pharmacies appoint a supervisor for each contract. There must always be a supervisor for each…
In a prison, there is a door b/w any pair of adjacent cells and one exit guarded by a guard G. One prisoner is a maniac M which kills anybody he can see when he enters a cell. If M returns to the cell with his victim, then he loses consciousness and stops. In the evening all inmates and the guard went to sleep in their cells. In the morning, maniac M is gone and all other prisoners with the guard were found dead in their cells. Show the route of the maniac.
The cook must participate in the presence before each class, i.e. call out the names of the students one by one and indicate which students are present. Each student has a first and last name. To save time, Rajesh only wants to call up students' first names. However, if there are multiple students with the same first name, the Rajesh must call out the full names (first and last names) of all those students. For any student who does not share a first name with any other student, the cook can still only call that student's first name. Help the Rajesh decide for each student whether to call that student's full name or just their first name. Note: Please Answer in java language only. Input 1 1 hasan jaddouh Output hasan
A group of individuals are living on an island when a visitor arrives with an unusual order: all blue-eyed people must leave the island immediately. Every evening at 8:00 p.m., a flight will depart. Everyone can see everyone else's eye colour, but no one knows their own (nor is anyone allowed to tell them). Furthermore, they have no idea how many people have blue eyes, but they do know that at least one person has. How long will it take for the blue-eyed individuals to leave?
Implement an algorithmic solution, indicating which states are valid and which are not, and model the space of the following problem: An interest group from a small town decided to sue a company for commercial abuse. For this, the people have organized themselves and decided to send 3 representatives, who will have to travel in a Van to the city where the lawsuit will be filed. The company to be sued, upon learning of these actions, has decided to send 3 lawyers to persuade the representatives, who will also travel in the same Van for that purpose. The community must file the class action suit under these conditions: - The three applicants must reach the destination city; - Only two people can travel per trip in the Van (small town - city, city - small town); - There can never be more lawyers than plaintiffs in any one place (either in the small town or city) because the lawyers can persuade the plaintiffs and as a consequence, the lawsuit would not be made; - The Van cannot be…
There are exactly N people living in a certain parallel universe. The Ith of these NN people claim to be the parent of exactly Ai off these N people. However, some of these people may be lying - the person may either be telling the truth (in which case they have exactly Ai children) or lying down (in which case they can have any number of children). It is known that each person has at most one parent. Furthermore, as one would expect, a person's child is not allowed to also be their ancestor. What is the maximum possible number of truth tellers in this universe Using C++ programming language. Possible input 1 2 10 Required Output 2
Correct answer will be upvoted else Multiple Downvoted. Don't submit random answer. Computer science. all dishes are ready in various cafés and consequently Petya needs to get his orders from n better places. To accelerate this interaction, he needs to arrange messenger conveyance at certain eateries. Subsequently, for each dish, there are two choices for Petya how he can get it: the dish will be conveyed by a dispatch from the café I, for this situation the messenger will show up in man-made intelligence minutes, Petya goes to the eatery I all alone and gets the dish, he will spend bi minutes on this. Every café has its own dispatches and they begin conveying the request right now Petya goes out. As such, all dispatches work in equal. Petya should visit all cafés in which he has not picked conveyance, he does this reliably. For instance, assuming Petya needs to arrange n=4 dishes and a=[3,7,4,5], and b=[2,1,2,4], then, at that point, he can arrange conveyance from the…
There are m towns in a straight line, with a road joining each pair of consecutive towns. Legends say that an ordinary person in one of these towns will become a hero by completing a sequence of n quests. The first quest will be completed in their home town, but after each quest they may complete their next quest either in the same town or after moving to a neighbouring town.For example, if n = 5 and m = 4, a resident of town 2 may become a hero as follows:• begin in town 2 for quest 1,• then move to town 3 for quest 2,• stay in town 3 for quest 3,• return to town 2 for quest 4, and• move to town 1 for quest 5.Design an algorithm which runs in O(nm) time and finds the total number of waysto complete n quests.
You are given the midsem and endsem marks for the N Students in the course. A student P is said to dominate a student Q, if the midsem and endsem marks of P are both greater than the respective midsem and endsem marks of Q. Design an efficient algorithm for finding all the students that are not dominated by any other student in the class.
The diagram below shows the arrangement of a Habitrail cage for a pet hamster. (Plastic tubes connect different cages.) Is it possible for a hamster to travel through every tube without going through the same tube twice? If so, find a route for the hamster to follow. Can the hamster return to its starting point without repeating any tube passages>