Using the following table as your starting point for each algorithm SJN Given the following information: Job: A B C D E Arrival
Time: 0 2 3 6 10 Time burst: 4 2 1 10 2 The turnaround time for a job is the completion time minus the arrival time what is the turnaround time for: Job A: Job B: Job C: Job D: Job E : What is the average turn around time for this algorithm with these jobs? The wait time for a job is the turn around time minus the burst time what is the wait time for: Job A: Job B: Job C: Job D: Job E: What is the average wait time for this algorithm with these jobs?
Please answer
Please answer
1 answer:
You might be interested in
Answer:
SOP=AB'+B'C
POS=B'(A'+C)
Shorthand Minterms=m₀+m₁+m₅
Shorthand Maxterms=M₃+M₂+M₄+M₆+M₇
Explanation:
For the full explanation of this question refer to the image attached which is of the k-Map of F.As we can see in the k-map that there are only 3 ones.by making 2 pairs of 1 we get the SOP expression.
Rest of them are zero from there we will get the POS expression.
The one's in the k-map represent the Minterms and 0's represent Maxterms and the number written in the box is their respective minterm and maxterm number.Minterms are represented by m and maxterms are represented by M.
