Answered: #include #include main() { int bt[20],…

Name: Modiflow y the beprogram given to include response timeprogram;FCFS C
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: Modiflow y the beprogram given to include response timeprogram;FCFS CPU SCHEDULING ALGORITHM#include #include main(){int bt[20], wt[20], tat[20], i, n; float wtavg, tatavg;clrscr();printf("\nEnter the number of processes -- "); scanf

Engineering

Computer Science

#include #include 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

Microsoft Visual C#

7th Edition

ISBN:9781337102100

Author:Joyce, Farrell.

Publisher:Joyce, Farrell.

Chapter8: Advanced Method Concepts

Section: Chapter Questions

Problem 7RQ

See similar textbooks

Similar questions

Modify below program to include response time Program:SJF CPU SCHEDULING ALGORITHM: #include<stdio.h>#include<conio.h>using namespace std; int main(){int p[20], bt[20], wt[20], tat[20], i, k, n, temp; float wtavg, tatavg;printf("\nEnter the number of processes--"); scanf("%d", &n);for(i=0;i<n;i++){p[i]=i;printf("Enter Burst Time for Process %d--", i); scanf("%d", &bt[i]);}for(i=0;i<n;i++)for(k=i+1;k<n;k++)if(bt[i]>bt[k]){temp=bt[i];bt[i]=bt[k];bt[k]=temp;temp=p[i];p[i]=p[k];p[k]=temp;}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("\n\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", p[i], bt[i], wt[i], tat[i]);printf("\nAverage Waiting Time--%f", wtavg/n);printf("\nAverage Turnaround Time--%f", tatavg/n);getch();}
Modify below program to include response time Program: PRIORITY CPU SCHEDULING ALGORITHM: #include<stdio.h>#include <conio.h>int main(){int bt[20],p[20],wt[20],tat[20],pr[20],i,j,n,total=0,pos,temp,avg_wt,avg_tat;printf("Enter Total Number of Process:");scanf("%d",&n);printf("\nEnter Burst Time and Priority\n");for(i=0;i<n;i++){printf("\nP %d\n",i+1);printf("Burst Time:");scanf("%d",&bt[i]);printf("Priority:");scanf("%d",&pr[i]);p[i]=i+1;}for(i=0;i<n;i++){pos=i;for(j=i+1;j<n;j++){if(pr[j]<pr[pos])pos=j;}temp=pr[i];pr[i]=pr[pos];pr[pos]=temp;temp=bt[i];bt[i]=bt[pos];bt[pos]=temp;temp=p[i];p[i]=p[pos];p[pos]=temp;}wt[0]=0;for(i=1;i<n;i++){wt[i]=0;for(j=0;j<i;j++)wt[i]+=bt[j];total+=wt[i];}avg_wt=total/n;total=0;printf("\nProcess\t Burst Time \tWaiting Time\tTurnaround Time");for(i=0;i<n;i++){tat[i]=bt[i]+wt[i];total+=tat[i];printf("\nP %d \t\t %d\t\t %d\t\t\t%d",p[i],bt[i],wt[i],tat[i]);}avg_tat=total/n;printf("\n\nAverage Waiting…
Consider the following recursive function to compute factorialint fact (int n) {if (n <= 1)return 1;elsereturn n * fact(n-1);}int main() {cout << fact(5) << endl;return 0;} Show the stack of activation records each time the function fact is called (either directly or recursively). Each activation record needs to be identified by the name of the function and the parameter value, but there is no need to elaborate the specific content of each activation record.
write C++ program to implement cpu scheduling algorthim (Code must have 2 algorithms together, not 2 separate codes for each one) .Preemptive SJF . Nonpreemptive sjf
In C Every budding computer scientist must grapple with certain classic problems, and the Towers of Hanoi (see Figure below) is one of the most famous of these. Legend has it that in a temple in the Far East, priests are attempting to move a stack of disks fromone peg to another. The initial stack had 64 disks threaded onto one peg and arranged from bottom to top by decreasing size. The priests are attempting to move the stack from this peg to a second peg under the constraints that exactly one disk is moved ata time, and at no time may a larger disk be placed above a smaller disk. A third peg is available for temporarily holding the disks. Supposedly the world will end when the priests complete their task, so there is little incentive for us to facilitate their efforts.Let’sassume that the priests are attempting to move the disks from peg 1 to peg 3. We wish to develop an algorithm that will print the precise sequence of disk-to-disk peg transfers. If we were to approach this…
implement a function for finding the nth Fibonacci number using the MIPS assembly language. Following gives the definition of the Fibonacci Sequence.Let F be the Fibonacci function:F(0) = 0F(1) = 1For n > 1 F(n) = F(n-1) + F(n-2)Example Output of Execution:Enter the sequence number: 6F(6) = 8 A - Loop ImplementationIn a file named FiboLoop.asm, implement the above function using a loop. B - Recursive ImplementationIn a file named FiboRec.asm, implement the above function using a loop.
Write a python code in multiprocessing (from mpi4py import MPI) Consider a system of 2 processes. The master process generates an array of random numbers of the size n. It shares the array with the slave. The slave is asked to do the sum of numbers. The result returned by the slave is printed by the master process. The master process is simultaneously counting the numbers less than 50 in the array and printing the same.In all the above cases, print the details of who is printing and what is being printed. Use mpi4py Python Package in the coding.
In computer science, the dining philosophers’ problem is an example problem often used in concurrent algorithm design to illustrate synchronization issues and techniques for resolving them. It was formulated in 1965 as a student exam exercise. It is still used now although many updates and solutions have been presented through the years. Give a brief explanation of the dining philosophers’ problem. Include the problem’s rules and steps.
Write a single and complete C program to help faculty ‘X’ preparing grades ofEEE 103:a. Ask the user how many students he has in his class and take it as input.b. Dynamically allocate memory and take input of the student’s EEE 103final marks using pointersc. Find the maximum marks obtained among them. The marks must beaccessed using pointer.d. Those who got below 50% of the maximum marks, add 2 marks bonus tothose student’s marks. The marks must be accessed using pointer.e. Consider the final exam has been taken for a total of 45 marks. But theweight of finals for the EEE 103 course is 32%. Now convert eachstudent's marks he received to 32% for preparing the grades. Store theconverted marks in another dynamically allocated array.f. Print the converted marks for all the students.
// the language is c++, please code with common for better understanding, and after your code finished take a screenshot of the execution. Write a C++ program to simulate a stack using an array. You should create an index (the stack pointer) to point into the stack. Initialize it to 0. The stack should grow to location [1], [2], [3], etc. Write a "push (int)" function to push an int onto the top of the stack. Also, write an "int pop" instruction to pop the data that is stored on the top of the stack. The pop instruction must return the popped data. The push and pop instructions should increment and decrement the stack pointer appropriately. Your source should contain calls to your functions demonstrating that it works. Note, that you should do several pushes and several pops to show that data is correctly stored on the stack. You can do this by showing sample runs. Cut and paste the results of the runs into a separate document
2. Consider the two main variables: Number and N. Number is a 1024 byte variable. It represents a huge unsigned integer. N is a 4 byte variable. It represents the number of bits by which the number will be shifted. assenbly language Write an SHL1024 function that receives two parameters on the stack: the address of a number of 1024 bytes and a value giving by how many bits the number of 1024 bytes will be shifted towards the left. This function must act like an SHL but on a 1024 byte variable. On return, the content of the Number variable will be shifted to the left by the number of bits demand. On return, the values of the general registers and the EFLAGS should be the same as before the call to SHL1024
Take the following program and translate it into PEP/9 assembly language: #include <iostream> using namespace std; int fib(int n) { int temp; if (n <= 0) return 0; else if (n <= 2) return 1; else { temp = fib(n – 1); return temp + fib(n-2); } } int main() { int num; cout << "Which fibonacci number? "; cin >> num; cout << fib(num) << endl; return 0; } You must use equates to access the stack and follow the call to the function as discussed in the book (pass the parameter, return address, return a value and so on). There are NO global variables in the resulting code (except a global message of "Range num? "). It must be able to do sum a range greater than 2. comments would be appreciated