Reference no: EM131291796
Question 1: Consider the following set of processes, with the length of the ctiu burst given in milliseconds:
Process Burst Time Priority
P1 2 2
P2 1 1
P3 8 4
P4 4 2
P5 5 3
The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time O.
a. Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, nonpreemptive priority (a larger priority number implies a higher priority), and R R (quantum = 2)+
b. What is the turnaround time of each process for each of the scheduling algorithms in part a?
c. What is the waiting time of each process for each of these schedul-ing algorithms?
d. Which of the algorithms results in the minimum average waiting time (over all processes)?
Question 2: The following processes are being scheduled using a preemptive, round-robin scheduling algorithm. Each process is assigned a numerical priority, with a higher number indicating a higher relative priority. In addition to the processes listed below, the system also has an idle task (which consumes no CPU resources and is identified as Pure). This task has priority 0 and is scheduled whenever the system has no other available processes to run. The length of a time quantum is 10 units. If a process is preempted by a higher-priority process, the preempted process is placed at the end of the queue.
| Thread |
Priority |
Bust |
Arrival |
| P1 |
4a |
20 |
0 |
| p2 |
30 |
25 |
25 |
| P3 |
30 |
25 |
30 |
| P4 |
35 |
15 |
60 |
| P5 |
5 |
10 |
100 |
| P6 |
10 |
10 |
105 |
a. Show the scheduling order of the processes using a Gantt chart.
b What is the turnaround time for each process?
c. What is the waiting time for each process?
d. What is the CPU utilization rate?
Question 3: Consider the following snapshot of a system:
Allocation Max Available
ABCD ABCD ABCD
P0 0012 0012 1520
P1 1000 1750
P2 1354 2356
P3 0632 0652
P4 0014 0656
Answer the following questions using the banker's algorithm:
a. What is the content of the matrix Need?
b. Is the system in a safe state?
c. If a request from process 131 arrives for (0,42,0), can the request be granted immediately?
Question 4 Consider the following snapshot of a system:
|
Allocation |
Max |
Available |
|
ABCD |
ABCD |
ABCD |
| P0 |
2001 |
4212 |
3321 |
| P1 |
3121 |
5252 |
|
| P2 |
2103 |
2316 |
|
| P3 |
1312 |
1424 |
|
| P4 |
1432 |
3665 |
|
Answer the following questions using the banker's algorithm:
a. Illustrate that the system is in a safe state by demonstrating an order in which the processes may complete.
b. If a request from process Pi arrives for (1, 1, 0, 0), can the request be granted immediately?
c. If a request from process P4 arrives for (0, 0, 2, 0), can the request be granted immediately?
For all these questions, please consider taking inputs from the file. Don't fixed the input in your
Program. We will test with various data given though the file.
Attachment:- Instructions.rar
|
Bank reconciliation and adjusting entries
: Bank reconciliation and adjusting entries; cash and cash equivalents [Appendix 7A] The bank statement for the checking account of Management Systems Inc. (MSI) showed a December 31, 2016, balance of $14,732.37. What amount would MSI report as cash an..
|
|
Calculate ordinary gain when it is sold during third year
: A drill press with a cost basis of $55,000 is a 7-year MACRS property. Calculate ordinary gain when it is sold during the third year for $35,000. Round to the nearest integer.
|
|
Calculate ordinary gain when it is sold during third year
: A drill press with a cost basis of $55,000 is a 7-year MACRS property. Calculate ordinary gain when it is sold during the third year for $35,000. Round to the nearest integer.
|
|
Compute the depreciation charges at year two
: A depreciable asset costs $20,000 and has an estimated salvage value of $4,500 at the end of its 5-year depreciable life. Use DB depreciation with depreciation rate 1.5 to compute the depreciation charges at year 2.
|
|
What is the turnaround time of each process
: What is the turnaround time of each process for each of the scheduling algorithms in part and what is the waiting time of each process for each of these schedul-ing algorithms?
|
|
Write a java application that displays the triangle patterns
: Write a Java application (Triangles.java) that displays the following triangle patterns side-by-side using nested while loops. Everything can be in main().
|
|
Discuss about the motivations of altruistic behavior
: Justify the use of elements by connecting them to various motivations of altruistic behavior as identified in social exchange theory.
|
|
Compare and/or contrast your responses
: encourage further dialogue and discussion,encourage your classmate to think about other aspects of the topic,ask a relevant, meaningful question to better assist with your understanding,compare and/or contrast your responses
|
|
Mission or values statement
: Which of the following exist in an organization where you've worked: mission or values statement, policy manual, code of conduct, ethics training (who conducts it), hotline? Were they consistent and credible?
|