443 views
0 votes
0 votes
How to solve this when arrival time nd scheduling algorithm to use is not mentioned?

1. Consider the processes P 1 , P 2 , P 3 arrived in the sequence P 2 , P 3 , P 1 and the burst time of the
processes are 3, 3, 24 respectively. What is the average TAT?

(a) 30  (c) 40
(b) 10  (d) 35

1 Answer

0 votes
0 votes
20 unit as order of execution is given p2-p3-p1 use fcfs

Related questions

0 votes
0 votes
0 answers
1
vk_9_1_9 asked Jul 30, 2018
168 views
Not sure about option c, can anyone please explain the relation between bounded waiting and busy waiting? 1. Bounded waiting does not allow: (a) Starvation of a process (...
1 votes
1 votes
0 answers
2
Akhilesh Singla asked Apr 14, 2018
1,712 views
I think options A, D and E are wrong; B is true. I'm not sure about C. I think it should be true because page table is created for a process and not for its threads so pa...
0 votes
0 votes
1 answer
3
overflow1403 asked Dec 8, 2023
208 views
int func(int n){if(n <= 1)return n;elsereturn 3*func(n-3) - 3*func(n-2); }The running time of the above function is