Consider the First Come First Serve (FCFS) algorithm for the scheduling of three processes A, B, C. None of these processes will perform I/O operations. Their arrival time in seconds are 0, 2, 1 respectively. Their running time in seconds are 11, 6, 8 respectively. The turnaround time of A will be . The turnaround time of B will be . The turnaround time of C will be . The response time of A will be . The response time of B will be . The response time of C will be Consider the Shortest Job First (SJF) algorithm for the scheduling of three processes A, B, C. None of these processes will perform I/O operations. Their arrival time in seconds are 0, 10, 20 respectively. Their running time in seconds are 100, 50, 30 respectively. The turnaround time of A will be . The turnaround time of B will be . The turnaround time of C will be . The response time of A will be . The response time of B will be . The response time of C will be Consider the pre-emptive Shortest Time to Completion First (STCF) algorithm for the scheduling of three processes A, B, C. None of these processes will perform I/O operations. Their arrival time in seconds are 0, 10, 20 respectively. Their running time in seconds are 90, 70, 50 respectively. The turnaround time of A will be . The turnaround time of B will be . The turnaround time of C will be . The response time of A will be . The response time of B will be . The response time of C will be
Function mycpu() is implemented in xv6 in a file named ______.
Consider the First Come First Serve (FCFS)
The turnaround time of A will be .
The turnaround time of B will be .
The turnaround time of C will be .
The response time of A will be .
The response time of B will be .
The response time of C will be
Consider the Shortest Job First (SJF) algorithm for the scheduling of three processes A, B, C. None of these processes will perform I/O operations. Their arrival time in seconds are 0, 10, 20 respectively. Their running time in seconds are 100, 50, 30 respectively.
The turnaround time of A will be .
The turnaround time of B will be .
The turnaround time of C will be .
The response time of A will be .
The response time of B will be .
The response time of C will be
Consider the pre-emptive Shortest Time to Completion First (STCF) algorithm for the scheduling of three processes A, B, C. None of these processes will perform I/O operations. Their arrival time in seconds are 0, 10, 20 respectively. Their running time in seconds are 90, 70, 50 respectively.
The turnaround time of A will be .
The turnaround time of B will be .
The turnaround time of C will be .
The response time of A will be .
The response time of B will be .
The response time of C will be
A 3300 student would like to insert the following statement
cprintf(“SYSTEM CALL\n”);
into xv6 so that each time the kernel handles a trap caused by a system call, the phrase SYSTEM CALL will be displayed on the screen. This phrase should be printed exactly once per system call handling, no matter which system call. If the trap is not caused by a system call, nothing should be printed. Give seven line numbers (within range 0000 – 6500) where this print statement can be inserted. The line numbers should be taken from selectedfiles.pdf. You can find this file in the midterm exam area of the blackboard. Your answers represent seven different choices – it does not mean that all should be added simultaneously. Two line numbers referring to the same place in the code, like 0001 and 0002, are considered the same answer. If you think there are less than seven answers, you do not have to fill in all the blanks. If you think there are more than seven, choose any seven of them.
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 3 images
