logo Use CA10RAM to get 10%* Discount.
Order Nowlogo
(5/5)

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.

(5/5)
Attachments:

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

Ask This Question To Be Solved By Our ExpertsGet A+ Grade Solution Guaranteed

expert
Um e HaniScience

512 Answers

Hire Me
expert
Muhammad Ali HaiderFinance

807 Answers

Hire Me
expert
Husnain SaeedComputer science

787 Answers

Hire Me
expert
Atharva PatilComputer science

766 Answers

Hire Me
March
January
February
March
April
May
June
July
August
September
October
November
December
2025
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
SunMonTueWedThuFriSat
23
24
25
26
27
28
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
2
3
4
5
00:00
00:30
01:00
01:30
02:00
02:30
03:00
03:30
04:00
04:30
05:00
05:30
06:00
06:30
07:00
07:30
08:00
08:30
09:00
09:30
10:00
10:30
11:00
11:30
12:00
12:30
13:00
13:30
14:00
14:30
15:00
15:30
16:00
16:30
17:00
17:30
18:00
18:30
19:00
19:30
20:00
20:30
21:00
21:30
22:00
22:30
23:00
23:30