Question

Problem 16-03 (Algorithmic) The computer center at Rockbottom University has been experiencing computer downtime. Let us...

Problem 16-03 (Algorithmic)

The computer center at Rockbottom University has been experiencing computer downtime. Let us assume that the trials of an associated Markov process are defined as one-hour periods and that the probability of the system being in a running state or a down state is based on the state of the system in the previous period. Historical data show the following transition probabilities:

To
From Running Down
Running 0.80 0.20
Down 0.30 0.70
  1. If the system is initially running, what is the probability of the system being down in the next hour of operation? If required, round your answers to two decimal places.

    The probability of the system is .20
  2. What are the steady-state probabilities of the system being in the running state and in the down state? If required, round your answers to two decimal places.

    pi-1 =

    pi-2 =

Homework Answers

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
The computer center at Rockbottom University has been experiencing computer downtime. Let us assume that the...
The computer center at Rockbottom University has been experiencing computer downtime. Let us assume that the trials of an associated Markov process are defined as one-hour periods and that the probability of the system being in a running state or a down state is based on the state of the system in the previous period. Historical data show the following transition probabilities: To From Running Down Running 0.70 0.30 Down 0.20 0.80 If the system is initially running, what is...
The computer center at Rockbottom University has been experiencing computer downtime. Let us assume that the...
The computer center at Rockbottom University has been experiencing computer downtime. Let us assume that the trials of an associated Markov process are defined as one-hour periods and that the probability of the system being in a running state or a down state is based on the state of the system in the previous period. Historical data show the following transition probabilities: To From Running Down Running 0.80 0.20 Down 0.30 0.70 a. the system is initially running, what is...
Problem 16-05 (Algorithmic) A major traffic problem in the Greater Cincinnati area involves traffic attempting to...
Problem 16-05 (Algorithmic) A major traffic problem in the Greater Cincinnati area involves traffic attempting to cross the Ohio River from Cincinnati to Kentucky using Interstate 75. Let us assume that the probability of no traffic delay in one period, given no traffic delay in the preceding period, is 0.9 and that the probability of finding a traffic delay in one period, given a delay in the preceding period, is 0.6. Traffic is classified as having either a delay or...
Problem 16-05 (Algorithmic) A major traffic problem in the Greater Cincinnati area involves traffic attempting to...
Problem 16-05 (Algorithmic) A major traffic problem in the Greater Cincinnati area involves traffic attempting to cross the Ohio River from Cincinnati to Kentucky using Interstate 75. Let us assume that the probability of no traffic delay in one period, given no traffic delay in the preceding period, is 0.9 and that the probability of finding a traffic delay in one period, given a delay in the preceding period, is 0.6. Traffic is classified as having either a delay or...
Problem 16-07 (Algorithmic) Data collected from selected major metropolitan areas in the eastern United States show...
Problem 16-07 (Algorithmic) Data collected from selected major metropolitan areas in the eastern United States show that 8% of individuals living within the city limits move to the suburbs during a one-year period, while 4% of individuals living in the suburbs move to the city during a one-year period. Answer the following questions assuming that this process is modeled by a Markov process with two states: city and suburbs. Prepare the matrix of transition probabilities. City Suburbs City 0.92 0.08...
Problem 16-07 (Algorithmic) Data collected from selected major metropolitan areas in the eastern United States show...
Problem 16-07 (Algorithmic) Data collected from selected major metropolitan areas in the eastern United States show that 6% of individuals living within the city limits move to the suburbs during a one-year period, while 2% of individuals living in the suburbs move to the city during a one-year period. Answer the following questions assuming that this process is modeled by a Markov process with two states: city and suburbs. Prepare the matrix of transition probabilities. City Suburbs City 0.94 0.06...
Problem 16-07 (Algorithmic) Data collected from selected major metropolitan areas in the eastern United States show...
Problem 16-07 (Algorithmic) Data collected from selected major metropolitan areas in the eastern United States show that 6% of individuals living within the city limits move to the suburbs during a one-year period, while 2% of individuals living in the suburbs move to the city during a one-year period. Answer the following questions assuming that this process is modeled by a Markov process with two states: city and suburbs. Prepare the matrix of transition probabilities. City Suburbs City __________ _________...
Problem 11-30 (Algorithmic) A large insurance company maintains a central computing system that contains a variety...
Problem 11-30 (Algorithmic) A large insurance company maintains a central computing system that contains a variety of information about customer accounts. Insurance agents in a six-state area use telephone lines to access the customer information database. Currently, the company's central computer system allows three users to access the central computer simultaneously. Agents who attempt to use the system when it is full are denied access; no waiting is allowed. Management realizes that with its expanding business, more requests will be...
Problem 11-30 (Algorithmic) A large insurance company maintains a central computing system that contains a variety...
Problem 11-30 (Algorithmic) A large insurance company maintains a central computing system that contains a variety of information about customer accounts. Insurance agents in a six-state area use telephone lines to access the customer information database. Currently, the company's central computer system allows three users to access the central computer simultaneously. Agents who attempt to use the system when it is full are denied access; no waiting is allowed. Management realizes that with its expanding business, more requests will be...
Problem 11-30 (Algorithmic) A large insurance company maintains a central computing system that contains a variety...
Problem 11-30 (Algorithmic) A large insurance company maintains a central computing system that contains a variety of information about customer accounts. Insurance agents in a six-state area use telephone lines to access the customer information database. Currently, the company's central computer system allows three users to access the central computer simultaneously. Agents who attempt to use the system when it is full are denied access; no waiting is allowed. Management realizes that with its expanding business, more requests will be...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT