UTTRAKHAND OPEN UNIVERSITY

SCHOOL OF COMPUTER SCIENCE & IT

2012-2013

UTTARAKHAND OPEN UNIVERSITY, HALDWANI (NAINITAL)

]
mCA 2nd YEAR 3rd SEMESTER ASSIGNMENT
Last Date of Submission: 15 January, 2013 Course Title: Operating System Year: 2012-13 Course Code: MCA-11 Maximum Marks: 40 Marks

Section A Section A contains 08 short answer type questions of 5 marks each. Learners are required to answers 4 questions only. Answers of short answer-type questions must be restricted to 250 words approximately. 1. Explain the basic functions of operating system and explain each one. Also explain operating system structure in detail. 2. Explain the essential properties of batch, real time and time sharing and distributed systems. 3. List all the services provided by an operating system. Explain how they provide

convenience to the users. What do you mean by system protection?

4. Explain short-term, medium-term, long term scheduling. Describe the differences

among them. 5. Describe Producer/Consumer problem. Also explain critical section problem. Also differentiate between user thread and kernel thread. 6. What are necessary conditions to hold a deadlock in a system? What are various solutions to handle deadlock problem .Explain resource allocation graph to handle with it.
7. What is the difference between deadlock prevention and avoidance? How we can

recover from deadlock. What do you mean by multiple base register, and why it is needed? 8. Explain disk structure, scheduling of disk and disk management?

UTTRAKHAND OPEN UNIVERSITY

SCHOOL OF COMPUTER SCIENCE & IT

2012-2013

Section B Section B contains 04 long answer-type questions of 10 marks each. Learners are required to answers 02 questions only.

1. What is CPU scheduling, explain. Suppose the following processes arrive for execution at the time indicated. Each process will run the listed amount of time. In answering the questions, Use non preemptive scheduling and base all decisions on the information you have Process Arrival Time Burst Time P1 0.0 8 P2 0.4 4 P3 1.0 1 a. What is the average turnaround time for these processes with FCFS scheduling algorithm? b. What is the average turnaround time for these processes with SJF scheduling algorithm? 2. Consider the following reference string: 1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6 How many page faults would occur for the following replacement algorithms assuming three, five and six frames? Remember all frames are initially empty. (i)LRU replacement (ii) Optimal replacement. 3. A disk with 1000 cylinders, numbers 0 to 999, compute the number of tracks the disk arm must move to satisfy all the request in the disk queue. Assume the last request serviced was at track 345 and the head is moving towards track 0.The queue in FIFO order contains request for the following tracks: 123,874,692,475,105,376. Perform the computation for the following scheduling algorithms: (i)FIFO (ii) SSTF (iii) Scan 4. Write a short note on the following a. Distributed Operating System b. Multiprocessor Systems c. Security threats and goals d. File system implementation techniques