A computing system is composed of two servers that are mirrors of each other (for redundancy, so if one fails, it can be restored from the other). Assume that each server has an MTBF of 500 hours that follows an exponential distribution. Furt hermore assume that when a server fails, it takes exactly 10 hours to restore the data from the mirror. Write a program that generates synthetic data showing the failure and restoration times for each server over 20 years.

A computing system is composed of two servers that are mirrors of each other (for redundancy, so if one fails, it can be restored from the other). Assume that each server has an MTBF of 500 hours that follows an exponential distribution. Furt hermore assume that when a server fails, it takes exactly 10 hours to restore the data from the mirror. Write a program that generates synthetic data showing the failure and restoration times for each server over 20 years.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 24PE

See similar textbooks

Similar questions

vvvHarry has a big wall clock, that got hit while he was playing. Now, the minute hand doesn't rotate by the angle 2π/3600 each second, but now it moves according to different angle x. You can assume that coordinates of the centre of the clock are (0, 0) and the length of the minute hand is l. One endpoint of the minute hand is always located at the clock centre; the other endpoint is initially located at the point (0, l). One second later, Harry observes that this endpoint is at distance d above the x-axis, i.e., the y-coordinate of this endpoint is equal to d. Harry is curious about where the minute hand will be (specifically, its y-coordinate) after t seconds. Because t can be very large, Harry can't wait for that moment. Please help him to write a python code that prints a single line containing the output.Input: 4 2 2Output4Harry has a big wall clock, that got hit while he was playing. Now, the minute hand doesn't rotate by the angle 2π/3600 each second, but now it moves according…
The Fibonacci sequence begins with 0 and then 1 follows. All subsequent values are the sum of the previous two, for example: 0, 1, 1, 2, 3, 5, 8, 13. Complete the Fibonacci() function, which has an index, n, as parameter and returns the nth value in the sequence. Any negative index values should return -1. Ex: If the input is: 7 the output is: Fibonacci(7) is 13 Note: Use a for loop and DO NOT use recursion.
The same professor writes a program to analyze the chat logs from the various lectures as a partial measure of class participation. Each chat log consists of multiple lines, each of form TIME, NAME, COMMENT, in the order in which they were posted to the chat . The algorithm then sorts all that data - across all the chat logs - in order of student names, and scores each set using a metric based on the number of contributions and their length. [a] What are the various input sizes to consider when analyzing the algorithmic approaches? (One is the number of students in the class, but that is not the only factor.) [b] Which sorting algorithm do you think is best suited for the sorting portion of this algorithm and why? [c] What is the time complexity of the sorting algorithm chosen in step [b] as a function of the various input sizes identified in step [a]? [d] What is the overall time complexity of the chat analysis program as described above?
Suppose the function X₂+1 = (ax₂ + c) mod m is used to generate pseudo random number. Assume: m=11₁a-6,c=2, xo=5, what are x₁, x2 and x3 ?
Python This simulates the population of fish. Use this to generate a plot with a numerical solution and the exact solution on the same plot axes for model parameters, P_m = 20,000 fish with a birth rate of b=6%, a harvesting rate of h=4%, a change in t=0.5 and y_0=5000
The Fibonacci sequence begins with O and then 1 follows. All subsequent values are the sum of the previous two, for example: 0, 1, 1, 2, 3, 5, 8, 13. Complete the Fibonacci() function, which has an index n as a parameter and returns the nth value in the sequence. Any negative index values should return -1. Ex: If the input is: 7 the output is: Fibonacci (7) is 13 Note: Use a for loop and DO NOT use recursion. 1 #include NM in N 2 3 int Fibonacci(int n) { 4 /* Type your code here. */ 5} 6 7 int main(void) { 8 int startNum; 9 scanf("%d", &startNum); main.c 10 11 printf("Fibonacci (%d) is %d", startNum, Fibonacci (startNum)); return 0; 12 13 14
Write a script (Python) for least squares l2 that can receive either: a 2D point cloud. Let the program load an ASCII txt file with the data in two columns, as appropriate. The number of points is arbitrary. In addition, display a graph with the cloud of points and the approximate line, together with the error made.
Suppose, you are the owner of a bank that operates in a strange way. Customers can lend money from your bank (just like a normal bank) and they can also deposit money in your bank. A register is maintained to track the daily transactions. However, being the strange owner of a strange bank, you have a fascination with finding out whether a portion of your daily transactions (in/out) balance out to zero. For example, suppose your daily transaction register looks like this: 1 Lend 100 2 Deposit 150 3 Lend 400 4 Lend 500 5 Deposit 1000 6 Lend 460 7 Deposit 160 8 Deposit 200 9 Lend 500 10 Depost 100 In this case, there is a portion of the transactions that would balance itself out. (6th, 7th, 8th, and 10th transactions would amount to 0). Your task is to use a genetic algorithm to solve this strange bank problem. Task Breakdown: Model the transaction register in a way suitable for the problem.…
using python Develop a simulation and visualization of a pit viper hunting for food in a cool environment. Have one rodent moving and resting at random. Most mammals have an average body temperature of around 37 ºC. For example, the normal body temperature of a rabbit is 38.3 ºC, and that of a laboratory ’“use is 36.9 ºC. Have one pit viper that tends to move toward warmth. In the case of the same temperature in all neighboring cells, the snake selects a direction at random.
Overflows You have learned the concept of overflow (with say n! that overflows at 13! for integer) Now consider Fibonacci numbers this way: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, etc. A Fibonacci sequence f(n) is of the form: f(1) = f(2) = 1, and f(n+2) = f(n) + f(n+1) for n >= 1. 6. Write a Java computer program that prints out Fibonacci numbers in a certain data type from f(1) until f(n) with n an integer you input from the keyboard. 7
Write a Python program that takes 7 inputs and appends them to a list (aGrades). Randomize the scores. The final exam will be the last item in the list. Calculate the number of exams as the length of the list minus one; assign examCount to len(aGrades)-1. Here we will introduce the function sum() to the class. The Total Points will be equal to the sum of the list minus the final exam. Assign Total Points to sum(aGrades)- aGrades[lastitemIndex]. Compute the Test Average to be equal to the Total Points divided by the length of the list minus one. Assign Test Average to Total Points / examCount The final average will be equal to 60% of the test average plus 40% of the Final Exam. Assign Final Average to Test Average *.6 + Final Exam * .4 Display the grades list, test average and the final average on separate lines. Upload the code, and the word doc explaining each line of code and their variables. . Use of the append method
Write a Python program that takes 7 inputs and appends them to a list (aGrades). Randomize the scores. The final exam will be the last item in the list. Calculate the number of exams as the length of the list minus one; assign examCount to len(aGrades)-1. Here we will introduce the function sum() to the class. The Total Points will be equal to the sum of the list minus the final exam. Assign Total Points to sum(aGrades)- aGrades[lastitemIndex]. Compute the Test Average to be equal to the Total Points divided by the length of the list minus one. Assign Test Average to Total Points / examCount The final average will be equal to 60% of the test average plus 40% of the Final Exam. Assign Final Average to Test Average *.6 + Final Exam * .4 Display the grades list, test average and the final average on separate lines. Upload the code, and the word doc explaining each line of code and their variables. .