Distributed systemTwo generals problem and ATM machines Suppose you want your ATM to give you $100. and ATM has two separate processing steps:  it must record a debit for $100 and it must give you the cash. By the two generals problem, it cannot do both at the same time. It can do these steps in either order and a crash can occur any time. – Suppose it gives you the cash first. What can go wrong?  – Suppose it does the debit first. What can go wrong? How the problem might     eventually be fixed. – Based on your analysis, which option would banks choose?

Suppose we're modelling an RC crane which is receiving a sequence of input commands, each of which is UP, DOWN, or BEEP. This crane has only two vertical positions, and starts in the high position. It should go into an ERROR end state if it is asked to go UP when it is in the high position or DOWN when it is in the low position. Once it is in the ERROR state, it stays in the ERROR state no matter what commands it receives. BEEP commands are legal at any point. Give a state diagram for this system, in which each edge corresponds to receiving a single command.

Problem DescriptionThe Tower of Hanoi ProblemTower of Hanoi is a mathematical game consisting of three pegs (P1, P2 and P3) and a stack of disks of different diameters. Disks can slide onto any peg. The game starts with all disks stacked on P1 and ends at the point where all disks stacked on P3. The game player is required to move all disks from P1 to P3 using P2 as a buffer. Three rules must be followed when playing the game(1) Only one disk may be moved at a time.(2) Each move involves taking a disk on the top of a peg and place it on the top of another peg. (3) A disk of a larger diameter should never be placed on top of a disk of a smaller diameter. The diagrams below demonstrate the starting state and goal state of the game with 5 disks.Starting state Goal stateP1 P2 P3 P1 P2 P32RequirementsIn this assignment, students are required to solve the Tower of Hanoi (with five disks) using state space search algorithms implemented in Python.Two state space search algorithms: (1) a blind…

What would happen if a directive were disregarded? In the following circumstances, a software-managed TLB is faster than a hardware-managed TLB:

me remaining: 00:09:34 Computer Science Create a MPI version of the program below that uses a striped decomposition. Each process is responsible for some number of columns of the square and also maintains two columns of ghost cells to mirror the columns on the neighboring processes. The ghost cells are needed in order to update the cells along the process boundary. At each time step, a ghost cell exchange takes place, then the update takes place.   #include <stdlib.h> #include <assert.h> #include "anim.h"   const int n = 200; // number of discrete points including endpoints int nstep = 200000; // number of time steps int wstep = 400; // time between writes to file const double m = 100.0; // initial temperature of rod interior const int h0 = n/2 - 2, h1 = n/2 + 2; // endpoints of heat source const double k = 0.2; // diffusivity constant char * filename = "diff2d.anim"; // name of file to create double ** u, ** u_new; // two copies of the temperature function ANIM_File…