Operations Research : Applications and Algorithms
4th Edition
ISBN: 9780534380588
Author: Wayne L. Winston
Publisher: Brooks Cole
expand_more
expand_more
format_list_bulleted
Question
error_outline
This textbook solution is under construction.
Students have asked these similar questions
A nine character long password is to be created using lower-case letters, four special characters {!, @, #, $} and digits. For the password to be valid, it must contain at least one lower-case letter, one of the given special characters and one digit. What is the probability that a randomly generated nine character password is valid? Assume that the password is generated using only the lower-case letters, the given special characters and digits
Please solve the following problem.
Quiz = Pass
Quiz = Fail
AI = Fail
0.1
0.2
AI = Pass
0.6
0.1
Mid = Pass
Mid = Fail
AI = Fail
0.2
0.2
AI = Pass
0.5
0.1
Suppose you have three events AI Grade, Quiz, and Mid. Here each event has two possible outcomes, either pass or fail. Additionally, given that AI Grade is observed, Quiz and Mid become independent of each other. Also, out of every 100 students, 30 students fail the AI course. Now, using the joint probability tables given, calculate P(AI Grade=Pass, Quiz=Fail, Mid=Fail).
Consider a database buffer manager that uses 1GB of main memory andkeeps data on a hard drive which reads 100MB per second and takes 10 milliseconds per disk seek.
(a) Assume that (1) the size of each disk block is 10KB and (2) for each block keptin the buffer, the probability that the buffer manager can handle the next data request usingthat block (i.e., the probability that the block contains the requested data) is 5 · 10-6. Inthis case, calculate the expected data access time (i.e., how much time the buffer manageron average would spend to provide a requested disk block). For this calculation, assume that(1) the buffer manager runs the algorithm explained in Section 13.5.1 of the textbook, (2) thebuffer is already full (i.e., the entirety of the 1GB buffer space is already used to hold 105 diskblocks), and (3) no disk blocks are updated (i.e., no need to write dirty blocks back to thehard drive). Also, ignore the time spent for reading/writing data in the main memory.(b) Assume…
Knowledge Booster
Similar questions
- Consider a web-server that receives web requests at an average rate ? of 20 requestsper second that follows a Poisson distribution. Answer the following questions:(a) What's the probability that it would receive 1000 requests in a minute? (b) What's the probability that no requests will arrive for 3 seconds? (c) Consider one second and assume that 20 requests already arrived in 0.5 second, whatis the probability that 20 requests will arrive in the next 0.5 seconds? (d) If you found out that the web-server was 70% of the time busy on average, what wouldbe its average service rate?arrow_forwardConsider a server (one core) where 30 computational jobs need to be scheduled for processing. Let Ti, where 1 ≤ i ≤ 30 be a random variable indicating the fraction of an hour that is needed by the computer to process the i th job. The distribution of each Ti is unknown, that is, maybe different. But we do know that the expected time taken by each job is 0.3 of an hour. Let T be the sum of all Ti ’s. That is, T represents the total number o hours needed by the computer to process all jobs. What is the expected T? Explain your derivation.arrow_forward(Please Solve problem by using your hand calculation and R). Suppose that X is the downloading time a movie, which follows a uniform distribution between 16 and 22 minutes. Let’s assume you want to download a movie. What is the probability that the download time will be (a) Less than 19 minutes? (b) More than 23 minutes? (c) Between 20 and 22 minutes? (d) What are the mean and standard deviation of the download times?arrow_forward
- that range from 1 to 8 minutes apart. Assuming that the inter-arrival times are integer-valued with each of the 8 values having equal probability, following uniform distribution. The service times vary from 1 to 6 minutes (integer) with the probabilities given in the following table: Service time (in mins) Probability 1 0.10 2 0.20 3 0.30 4 0.25 5 0.10 6 0.05 The random numbers for inter-arrival time are: 913, 727, 015, 948, 309, 922, 753, 235, 302. The random numbers for service time are: 84, 10, 74, 53, 17, 79, 91, 67, 89, 38. As a student of AIT, use your knowledge in computer simulation and help Mr. Owusu to: a) Simulate the system for 10 customers and compute waiting time of customers, total time spent by a customer in the system and idle time of the server. b) i. Explain average waiting time and compute it ii. Explain average time spent in the system and compute it. c) i. Evaluate the probability of idle server ii.…arrow_forwardIn a cellular network, each cell has seven channels, two of which are dedicated solely for handoff calls. Assume that both new and handoff call arrivals are subject to a Poisson process. The average arrival rate of new calls and handoff calls is 1.5 and 0.3 calls per minute, respectively. The holding duration of a channel is exponentially distributed, with a mean of 2 minutes. Determine the blocking probability of new and handoff calls.arrow_forwardComputer Science Consider the demand and supply system p = ad +bdqd +ud p = as +bsqs +us with the equilibrium condition qd = qs = q. The parameters bd and bs are −2 and 1.5, respectively. Find the parameters ad and as are such that q = 5 and p = 10. Throughout this question use N = 100, and set the random seed to 14022022. The variable ud has a standard deviation of 3. All randomly generated variables have a mean of zero and are normally distributed unless something else is specified. All Monte Carlo studies should be done with 10,000 repetitions. Part a. Illustrate the supply and demand curves in a graph, together with a sample of simulated price and quantity data. Provide an additional graph where you have included the OLS estimated line of demand equation above. Are your estimates close to the true values of ad and bd ? Solve the question in Python language on Jupyter notebook.arrow_forward
- A seller has an indivisible asset to sell. Her reservation value for the asset is s, which she knows privately. A potential buyer thinks that the assetís value to him is b, which he privately knows. Assume that s and b are independently and uniformly drawn from [0, 1]. If the seller sells the asset to the buyer for a price of p, the seller's payoff is p-s and the buyer's payoffis b-p. Suppose simultaneously the buyer makes an offer p1 and the seller makes an offer p2. A transaction occurs if p1>=p2, and the transaction price is 1/2 (p1 + p2). Suppose the buyer uses a strategy p1(b) = 1/12 + (2/3)b and the seller uses a strategy p2(s) = 1/4 + (2/3)s. Suppose the buyer's value is 3/4 and the seller's valuation is 1/4. Will there be a transaction? Explain. Is this strategy profile a Bayesian Nash equilibrium? Explain.arrow_forwarda. Given n items, where each item has a weight and a value, and a knapsack that can carry at most W You are expected to fill in the knapsack with a subset of items in order to maximize the total value without exceeding the weight limit. For instance, if n = 6 and items = {(A, 10, 40), (B, 50, 30), (C, 40, 80), (D, 20, 60), (E, 40, 10), (F, 10, 60)} where each entry is represented as (itemIdi, weighti, valuei). Use greedy algorithm to solve the fractional knapsack problem. b. Given an array of n numbers, write a java or python program to find the k largest numbers using a comparison-based algorithm. We are not interested in the relative order of the k numbers and assuming that (i) k is a small constant (e.g., k = 5) independent of n, and (ii) k is a constant fraction of n (e.g., k = n/4). Provide the Big-Oh characterization of your algorithm.arrow_forwardFor the Covid-19 pandemic, let’s make the following assumptions: (i) the natural infection rate is 20% (i.e., a person who is not vaccinated has 20% chance of being infected); (ii) the vaccine is 90% effective at preventing Covid-19 infection (i.e., a vaccinated person has only 2% chance of being infected); (iii) the probability of a random person being vaccinated is 60%. Without knowing whether or not a person is vaccinated, what is the probability that this person will be infected? Given that a person is infected, what is the conditional probability that this person is vaccinated?arrow_forward
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
- Operations Research : Applications and AlgorithmsComputer ScienceISBN:9780534380588Author:Wayne L. WinstonPublisher:Brooks Cole
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole