Operating systems 116)According to page replacement algorithm, when a page fault occurs, the operating system divides all the pages into four classes based on the current values of thee R and M bits: Class 0: Page A, Page B, Page C Class 1: Page D, Page E Class 2: Page F. Page G Class 3: Page H. Page I, Page J 79. According to this classification, if a page fault occurs, what is the possibility of Page C to be evicted from the memory? A) %25 B) %33.3 C) %0 D) %10

Quiz-1: Refer to Lecture-3 Module 1 swap (int* V, int k) {   temp = V[k];  /* temp in $t0 */   V[k] = V[k+1];   V[k+1] = temp; } Write the swap() function using special registers  required for accessing parameters passed to this function. Use “t” registers for any needed temporary registers.

Real-time Scheduling: Select all of the following statements that are true. Rate Monotonic (RM) scheduling works by dividing the total amount of time available up into an equal number of shares, and then each process must request a certain share of the total when it tries to start. A real-time system is schedulable under RM when its overall CPU utilization is less than 1. A real-time system is schedulable under Earliest Deadline First (EDF) when its overall CPU utilization is less than or equal to 1. If a process has period p, it is activated every p units of time. RM scheduling assigns a higher priority to processes with shorter periods. EDF scheduling assigns the highest priority to a process with the smallest remaining time until its deadline.

Q2) Design a minimum state HLSM that manages access to a road that is under construction. Maximum 10 cars can pass in any one direction at a time, when there are cars waiting on the other side. • The system starts in the IDLE state • CARS LEFT =1 if there are cars on the left side waiting to pass • CARS_RIGHT = 1 if there are cars on the right side waiting to pass • If cars arrive simultaneously on the left and on the right at the same time, the cars on the right go first. • Only one car is allowed on the road at a time. • If 10 cars have passed in one direction and there are no cars waiting on the other side, direction shouldn't be changed until a car arrives on the other side. (a) Draw the HLSM to represent the above system. (b) Draw the circuit representing the data-path of this system. (c) Draw the control unit and connect it to the data-path with correct labeling.

Assume the memory contains 6 holes with the sizes of 190, 550, 220, 420, 650, and 110 A sequence of requests for 4 blocks is to be satisifed: A = 210, B = 430, C = 100, D = 420. The following table has two rows for each of the four memory allocation strategies (first fit, next fit, best fit, worst fit). Fill in the table as follows: Block Allocated: Enter the letter of the memory block that will be placed in the indicated hole. If more than one block is allocated in a hole, include both blocks with no spaces (e.g. "DG"). If no block is allocated in a hile, enter "-". • Remaining Size: Enter the size of the remaining hole after all four memory blocks are placed. H1: 190 H2: 550 H3: 220 H4: 420 H5: 650 H6: 110 Block First Fit Blank 1 Blank 2 Blank 3 Blank 4 Blank 5 Blank 6 Allocated Remaining Blank 7 Blank 8 Blank 9 Blank 10 Blank 11 Blank 12 Size Block Next Fit Blank 13 Blank 14 Blank 15 Blank 16 Blank 17 Blank 18 Allocated Remaining Blank 19 Blank 20 Blank 21 Blank 22 Blank 23 Blank 24…

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…

Assume: CPU Clock = 1 GHz 1 OP requires 5 clock cycles (arithmetic instruction, conditional, etc.) 1 memory access requires 100 clock cycles (Read or Write) Problem size: N = 1,000,000 (1 million) There is no cost associated with the loop index variable: do not count any arithmetic instructions for initializing or incrementing the loop index value, do not count any memory accesses for accessing and using the loop index variable in your computation of a sum. Assume the loop index variable is "free of charge" There is no memory cost of accessing and updating your accumulator variable (e.g., sum += ...), but there is an arithmetic operation involved in updating the accumulator variable. Questions: 1. For algorithm #1 shown below (direct sum): • How many arithmetic instructions are required by this algorithm? • How many memory accesses are required by this algorithm? • How many clocks are required by this algorithm? • What is the CPI (cycles per instruction) required by this algorithm? •…

3. I/O Management: Disk Arm Scheduling & RAIDa. It is known that a disk drive has 256 cylinders, with cylinder numbers starting from 0 and ending at 255. The position of the needle on the disk drive currently stops at 128. It is also known that the needle always “goes to the cylinder with the smaller number first”. The order of the positions visited sequentially is: 254, 64, 32, 100, 50, 70. From the 3 choices of algorithms below, which one is the best algorithm? Make each image and determine the seektime.i. SCANii. C-SCANiii. FIFO

Indirect Addressing Mode Instruction 002A J@ RETADR 3E20030030 RETADR RESW 1 1.Instruction Starts with 002A2.Opcode of J is 3C3.Object code is 3E2003Please show the details

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…