Register

Sample Paper

180 views
0 votes
0 votes
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
 (b) A process to wait indefinitely to wait for Critical Section
 (c) Busy waiting
 (d) All of the above
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
vk_9_1_9 asked Jul 29, 2018
467 views
Sample paper
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
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 ...
User Avatar
1 votes
1 votes
0 answers
2
Akhilesh Singla asked Apr 14, 2018
1,774 views
PGEE sample paper question on threads
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 page table should be shared among threads of a same process.
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...
User Avatar
0 votes
0 votes
1 answer
3
overflow1403 asked Dec 8, 2023
230 views
IISC DS and AI sample paper
int func(int n) { if(n <= 1) return n; else return 3*func(n-3) - 3*func(n-2); } The running time of the above function is
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
User Avatar
Link Copied!