Register

Sample Paper

434 views
0 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

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Computer Orgranizati...Next → · RS Aggrawal
← Previous in category · #OS Reader Writer Us...Next in category → · Access Time Doubt
Position:
Show:

Related questions

0 0 votes
1 1 answer
818
818 views
vk_9_1_9 asked Jul 29, 2018
818 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 ...
1 1 vote
0 0 answers
2.6k
2.6k views
Akhilesh Singla asked Apr 14, 2018
2,615 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 pa...
0 0 votes
1 1 answer
464
464 views
overflow1403 asked Dec 8, 2023
464 views
IISC DS and AI sample paper
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
3 3 votes
3 3 answers
7.6k
7.6k views
admin asked Oct 21, 2023
7,585 views
GATE Data Science and Artificial Intelligence 2024 | Sample Paper | Question: 1
Let $\text{b}$ be the branching factor of a search tree. If the optimal goal is reached after $\text{d}$ actions from the initial state, in the worst case, how many times...