Archive for the ‘IGNOU’ Category

DEC 1998

Comments off

Time : 3 Hours
Max. Marks : 75

Note: Question 1 is compulsory.
Answer any three from the rest.

(a) Write an algorithm that solves the producer/consumers problem with a bounded buffer. How is it different from the unbounded buffer algorithm? Explain

(b) Explain the two primitive operations of a semaphore and implement the busy-wait implementation of them.

(c) Discuss a detailed step-by-step comparison of Lamport’s and Ricart 7 Agrawala’s algorithms for mutual exclusion Read more…

Categories: IGNOU Tags:

Education India

Education India

Categories: IGNOU Tags:
Pages: Prev 1 2