You are planning to call 8 of your relatives on the first day of Ramazan Holiday. On this day the communication network is really busy and the chances that you can make a call are 0.35 if you try every 15min (you make only one attempt every 15 min). At each attempt, the chances that you reach your relative are independent from the outcomes of previous attempts. a) What are the chances that you can successfully reach out to 4 of your relatives making 5 call attempts? b) How much time do you expect it will take you till you reach out to your first relative? c) If you start calling at 08:00am in the morning and try regularly every 15 min, at what time do you expect to have called all of your 8 relatives? d) What are the chances that you will reach out to no more than 3 relatives within 2 hours.s hours?

You are planning to call 8 of your relatives on the first day of Ramazan Holiday. On this day the communication network is really busy and the chances that you can make a call are 0.35 if you try every 15min (you make only one attempt every 15 min). At each attempt, the chances that you reach your relative are independent from the outcomes of previous attempts. a) What are the chances that you can successfully reach out to 4 of your relatives making 5 call attempts? b) How much time do you expect it will take you till you reach out to your first relative? c) If you start calling at 08:00am in the morning and try regularly every 15 min, at what time do you expect to have called all of your 8 relatives? d) What are the chances that you will reach out to no more than 3 relatives within 2 hours.s hours?

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter20: Queuing Theory

Section20.11: The M/g/s/gd/s/∞ System (blocked Customers Cleared)

Problem 4P

See similar textbooks

Similar questions

Calculate average wait time for the following situation. Time quanta 5 min, base on round robin
Two blue armies are each poised on opposite hills preparing to attack a single red army in the valley. The red army can defeat either of the blue armies separately but will fail to defeat both blue armies if they attack simultaneously. The blue armies communicate via an unreliable communications system (a foot soldier). The commander with one of the blue armies would like to attack at noon. His problem is this: If he sends a message to the other blue army, ordering the attack, he cannot be sure it will get through. He could ask for acknowledgment, but that might not get through. Is there a protocol that the two blue armies can use to avoid defeat?
A well known cricket team has a schedule tour of XYZ country in some days. They want to make sure to provide good security to the national team. Different security members have visited this country to check security arrangements. Some are agreed while some has little concerns. There are 4 different members who have visited in different period of time. The tour can go as schedule if there are at-least 3 members have submitted the positive report about security arrangements but if two members submit positive report while two other members submit negative report then there will be a deadlock between decision so there can be a don’t care condition. Now you have to design a Combination Circuit which can satisfy this scenario. Steps needed: Truth Table for four variables, SOP simplification through K map with don’t care condition, Equation and circuit
An old encryption system uses 20-bit keys. A cryptanalyst, who wants to brute-force attack the encryption system, is working on a computer system with a performance rate N keys per second. a- How many possible keys will be available in the above encryption system? b- What will be the maximum number of keys per second (N) that the computer system is working with, if the amount of time needed to brute-force all the possible keys was 512 milli seconds? Show you detailed calculations.
An old encryption system uses 24-bit keys. A cryptanalyst, who wants to brute-force attack the encryption system, is working on a computer system with a performance rate N keys per second. How many possible keys will be available in the above encryption system? What will be the maximum number of keys per second (N), that the computer system is working with, if the amount of time needed to brute-force all the possible keys was 8192 milli seconds?
Get the answer in less than an hour and get a high rating
You are a detective in charge of bringing down drug dealers (D). A tip has led you to a small apartment complex where you believe one or more D might be hiding out. There are five apartments in a row. Each apartment could contain a drug dealer Dor could contain innocent people: adults (A), families with babies (B), or with teenagers (T). Before you break down a door, you need to be absolutely sure that a dealer D is inside, otherwise you could get sued for police sub-optimality. 1 2 3 4 5 m To help you narrow down where drug dealers D might be (if any are there at all!), you use the fact that different people make different noises. Every time you walk between two apartments, you can hear the louder of the two noises that are being made in those apartments. The loudest people are teenagers T, who blast music (m), the next loudest are babies B who cry (e), the next loudest is the drug dealer D, who makes a rustling sound (r), and the quietest people are adults A. who are totally silent…
Calculate average wait time for the following situation. Time quanta 5 min
A web developer know from experience that the bounce rate (measured as a percentage) for a small website they manage is 6%. He tracks the bounce rate for a sample of 50 visitors to the website on a give day. Bounce rate is the number of people who leave without doing anything after visiting the page.- without buying something, or viewing a product, etc. - so the lower the better. Calculate the probability (as a decimal) that between 0 and 2 visors leave the website without buying something (inclustive)?
You own a club on eerie planet. The day on this planet comprises of H hours. You appointed C crew members to handle the huge crowd that you get, being the best club on the planet. Each member of the crew has fixed number of duty hours to work. There can be multiple or no crew members at work at any given hour of the day. Being on weird planet, the rules of this club cannot be normal. Each member of the crew only allows people who are taller than him to enter the club when he is at work. Given the schedule of work and heights of the crew members, you have to answer Q queries. Each query specifies the time of entry and height of a person who is visiting the club. You have to answer if the person will be allowed to enter the club or not. Please solve it asap.
Dhofar University uses System(SIS) to track the attendance of students. The Instructor during the lecture enters the attendance of the 6. a Student Information student in SIS. The SIS calculates the total absence of the student. If the absence is more than 25%, the student will receive a "WITHDRAWAL" message, if the student absence is more than 15%, the student gets "SECOND WARNING", if the student absence is more than 5% the student gets “FIRST WARNING" and if the absence is less than 5% then no message is sent to student. Write the Pseudocode and Draw flowchart for the scenario.
Get the answer in less than an 30m and get a high rating