Assume a fixed priority scheme where Processor3> Processor2 > Processor 1. Processor3 makes a request and is granted access. Then, Processor2 and Processor1 make requests. Which processor is granted access first? O Processor 1. Processor2 O Processor3 O An error will occur because two requests are pending

Question No 5 1. Assume that the following variables have been defined: .data val1 dw 2000h val2 dw1000h val3 dw 0 The following statements call a procedure named Exchange, using stack parameters: push offset val1 push offset val2 call Exchange add sp,4 The Exchange procedure exchanges the values of val1 and val2, so that after the call, val1 equals 1000h and val2 equals 2000h. Here is the beginning of Exchange: Exchange proc Exchange push ebp mov ebp,esp What instructions should occur next in the Exchange procedure to complete the exchange of the values inside the two variables that were passed to this function?

2) As discussed in the class on the implementation of subprogram (call and re- turn). Which one of the statements is NOT correct? A. The Activation record format and size are dynamic B. The dynamic link points to the top of an instance of the activation record of the caller C. An activation record instance is dynamically created when a subprogram is called D. Activation record instances reside on the run-time stack

Question 2 Write a c program that will generate the safe sequence of process execution for the situation given below:(Use Banker's Algorithm). Note: The code can be implemented in several different ways, but make sure the parameter remains the same as shown below. n = 6; // Number of processes m = 4; I/ Number of resources int alloc[6][4] ={{0, 1,0, 3 }, I/ PO// Allocation Matrix { 2, 0, 0, 3 }, I/ P1 {3, 0, 2, 0}, I/ P2 { 2, 1, 1, 5 }, I/ P3 {0,0, 2, 2 }, // P4 {1, 2, 3, 1}}; //P5 6. 1. int max[6][4] = {{ 6,4, 3, 4 }, // PO // MAX Matrix { 3, 2, 2, 4 }, I/ P1 { 9, 1, 2, 6 }, I/ P2 { 2, 2, 2, 8 }, I/ P3 { 4, 3, 3, 7 }, I/ P4 { 6, 2, 6, 5}}; //P5 int avail[4] = { 2, 2, 2, 1 }; IIAvailable resources

Problem 02 Write a program that creates a child using fork () The child process send three signals SIGHUP, SIGINT and SIGQUIT to the parent process respectively. Child terminates after sending signals. Parent declares signal handlers for these three signals and calls an infinite loop waiting for the signals. Upon generation of SIGHUP and SIGINT associated handlers are called and the parent finally quit on SIGQUIT

Please complete in C++, simulate multithreading using switch statements in the main and each reader or writer is comprised of a big switch statement.

Write an aligned malloc and free function that supports allocating memory such that the memory address returned is divisible by a specific power of two.EXAMPLEalign_malloc (1000, 128) will return a memory address that is a multiple of 128 and that points to memory of size 1000 bytes. aligned_ free () will free memory allocated by align_malloc.

1. Given a global list of users and password like the following, write a function (called login) that takes a user name and password and logs in the user if login is successful:- the user exists in the list- and the password is correct  The function should return a True/False users = {'Jane': 'Password123@', 'John': 'Password123!'} 2. Write a function called register that takes a user name and password and adds the user to the list if the user does not already exist in the listThe function should return a True/False Put it all together: 3. Write a showmenu function that shows the following options and reads the choice from user and returns it:  1: register 2: login 0: logout 3. In the main section, based on the user's selected option, ask the required input (user name, passwords) and perform the requested operation. 4. Repeat the above until the user enters 0. (keep showing the menu that asks for another option)

Modiflow y the beprogram given  to include response time program;FCFS CPU SCHEDULING ALGORITHM #include<stdio.h>#include<conio.h>main(){int bt[20], wt[20], tat[20], i, n; float wtavg, tatavg;clrscr();printf("\nEnter the number of processes -- "); scanf("%d", &n);for(i=0;i<n;i++){printf("\nEnter Burst Time for Process %d -- ", i); scanf("%d", &bt[i]);}wt[0] = wtavg = 0; tat[0] = tatavg = bt[0];for(i=1;i<n;i++){wt[i] = wt[i-1] +bt[i-1];tat[i] = tat[i-1] +bt[i]; wtavg = wtavg + wt[i]; tatavg = tatavg + tat[i];}printf("\t PROCESS \tBURST TIME \t WAITING TIME\t TURNAROUND TIME\n");for(i=0;i<n;i++){printf("\n\t P%d \t\t %d \t\t %d \t\t %d", i, bt[i], wt[i], tat[i]);}printf("\nAverage Waiting Time -- %f", wtavg/n);printf("\nAverage Turnaround Time -- %f", tatavg/n); getch();}

Please help me answer thisd for Operating Systemsz