### Twenty computers are connected in a network. one computer becomes infected with a virus. this virus spreads from an infected computer to any uninfected computer with probability 0.1.

**INSTRUCTIONS TO CANDIDATES**
###### ANSWER ALL QUESTIONS

Question Of Project

Twenty computers are connected in a network. One computer becomes infected with a virus. Every day, this virus spreads from an infected computer to any uninfected computer with probability 0.1. Also, every day, a computer technician takes 5 infected computers at random (or all infected computers, if their number is less than 5) and removes the virus from them. Estimate:

(a) the expected time it takes to remove the virus from the whole network;

(b) the probability that each computer gets infected at least once;

(c) the expected number of computers that get infected.

Instructions

*** At a very basic level, which is good enough for our purposes for now, the Monte Carlo method amounts to repeated simulations of the phenomenon under study. (Of course, there's a lot more to the story, as always; but we've got to start with the basics.) So the main part is to implement a simulation of what's described in the problem. Make sure that your simulation involves randomness exactly as described! And then you run it repeatedly in a loop.

*** First make sure that your Monte Calro simulation works with the provided values. But then, to make your project a bit more advanced, provide an option to choose input values, such as the number of computers, the probability of spreading the infection, and the number of computers repaired.

***To get decent results, make the number of runs large enough. You can hard-code it for now, as some large number, like N = 10000 or something.

## Related Questions

##### Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

##### The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

##### Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

##### SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1
Project 1
Introduction - the SeaPort Project series
For this set of projects for the course, we wish to simulate some of the aspects of a number of

##### Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1
Project 2
Introduction - the SeaPort Project series
For this set of projects for the course, we wish to simulate some of the aspects of a number of