Course Code  CS-13
Course Title Operating Systems
Assignment Number  MCA(6)-13/project/03
Maximum Marks  15
Last Date of Submission   31st October, 2003

This is a Project. There are four questions in this Assignment. Answer all the questions. Each question carries equal weightage. You may use illustrations and diagrams to enhance explanations. Please go through the guidelines regarding assignments .

Question 1:  A road crosses a railway track at two points. Gates are constructed on the road at each crossing to stop road traffic when a train is about to pass. Two way traffic of cars is permitted on the road and two-way train traffic is permitted on the railway tracks.
(a) Discuss whether deadlocks can arise in the road-and-train traffic. Would there be no deadlocks if both-road and
     train traffic is only one- way?
(b)    Design a set of rules to avoid deadlocks in the road-and train traffic.
Question 2:  A time-sharing system is to be designed to support a large number of users. List all considerations, which influence the choice of the time slice. Justify each consideration.
Question 3:   Two partitioned memory management algorithms namely best fit and first fit were presented in the material. Yet another algorithm has been proposed namely "worst fit". Worst fit always tries to assign the job to the largest partition found.
(a)    Comment on implementation.
(b)    Comment on expected performance
(c)    Show a sequence of jobs where worst fit is better than best fit or first fit.
(d)    Show a sequence of jobs where worst fit is bad.
Question 4: Study and implement the Dekker's solution to mutual exclusion algorithm using C++ programming language