Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
People arrive at a barber shop at the rate of one every 4.5 minutes. If the shop is full (it can hold five people altogether), 30% of the potential customers leave and come back in 60 ± 20 minutes. The others leave and do not return. One barber gives haircut in 8 ± 2 minutes, whereas the second talks a lot and it takes 12 +/- 4 minutes. If both barbers are idle, a customer prefers the first barber. Treat customers trying to reenter the shop as if they are new customers. Simulate the system until 300 customers have received the haircut.
a. Estimate the balking rate, that is, the number turned away per minute.
b. Estimate the number turned away per minute who do not try again.
c. What is the average time spent in the shop?
d. What is the average time spent getting a hair cut, not including the delay?
e. What is the average number of customers in the shop?
Briefly discuss on Bankers algorithm? The resource-allocation graph algorithm is not applicable to a resource-allocation system with multiple examples for each resource type.
I am not getting what you have tried to describe here. Can you elaborate more about this, i will be thankful to you. Vinay
Q. What are the major differences between capability lists and access lists? Answer: An access list is a list for each object consisting of the domains with a nonempty set of
. cash flou.
For reading, most operating systems use demand paging. This means that pages are only read from the disk into physical memory when they are needed. In the page table, there is a re
Explain the Worker Model The Worker Model of client-server application architecture provides a very good understanding of threads and their power to the developer. This exercis
WHAT IS OPERATING SYSTEM ?ENLIST AND EXPLAIN BASIC SERVICES PROVIDE BY OS
Load Sharing : Processes are not given to a particular processor. A global queue of threads is used to maintain. Each processor, when idle, picks a thread from this queue. Note th
Dynamic scheduling : The number of thread in a program may be changed during the course of operation. Dynamic priority scheduling is a kind of scheduling algorithm in which the pr
MEMORY MANAGEMENT USING BIT MAPS In this memory is separated into different allocation units each of some particular size(a few bites).consider every space of size 4k. A
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd