399 views

1 Answer

0 votes
0 votes

The very first step is to have a strong conceptual base. Once concepts are clear you should be able to comprehend the questions properly. Questions from these topics looks complicated but once you understand the approach it would be easier. 

You can refer below youtube revision lectures by go classes as a reference – 
https://www.youtube.com/watch?v=FsiJHTOJANg
https://www.youtube.com/watch?v=LOjE5QCVmBs

Related questions

967
views
1 answers
0 votes
humblefool asked Dec 13, 2017
967 views
Process P1Process P2P(S1)P(S1)P(S2)P(S2)Critical SectionCritical SectionV(S2)V(S1)V(S1)V(S2)In one of the Gateoverflow tests, this question was ... see a problem there. Can someone please explain why mutual exclusion is not guaranteed?
591
views
0 answers
0 votes
Nirmal Gaur asked Dec 19, 2018
591 views
Does Progress implies freedom from Deadlock?
883
views
2 answers
2 votes
Kalpataru Bose asked Nov 27, 2017
883 views
If there are n processes executing concurrently using binary semaphore S , (n-1) processes have the code do{ wait(S); <c.s> signal(s); <r.s> }while(1); ... that can be there in the critical section simultaneously?A. 2B . 3C. n-1D. n
801
views
2 answers
2 votes
Kalpataru Bose asked Nov 27, 2017
801 views
If there are n processes executing concurrently using binary semaphore S , (n-1) processes have the codedo{ wait(S ... processes that can be there in the critical section simultaneosly ?A. 2B . 3C. n-1D. n