RTU Previous Question Papers BE CS 5 th Semester
Operating System July-2011
UNIT – I
1 (a) Write short note on early operating system. List the difference between Multiprogramming and Time-sharing systems.
(b) Explain the architecture of an operating system.
1 (a) List out the various process states and briefly explain with a state diagram.
(b) What do you mean by processor scheduling ? Explain the various levels of scheduling.
UNIT – II
2 (a) In an OS that supports threads, is there one stack per process
of one stack per thread with
(i) Kernal-level threads
(ii) User level threads
(b) A distributed system using mailboxes hastwo IPC primitives, send (pid. msg) and receive (pid, msg). The receive primitive blocks if no message from process pid is available, even though message may be waiting from other processes. There are no shared resources. Processes communicate frequently. Is deadlock possible ? Discuss,
2. If there are a large number of processes resident in memory, there will almost always be a ready process when a page fault occurs. Hence. CPU utilization will be high. If a large amount of memory is allocated to each of a few processes, then page faults will be infrequent. Hence, CPU utilization will be high.
(i) Which of these arguments is correct ?
(ii) What is the best policy ?
UNIT – III
3 (a) How does a semaphore solve the critical section problem ? Discuss whether semaphores satisfy the three requirements for a solution to the critical section problem.
(b) A barbershop consists of a waiting room with ‘n’ chairs and the barber room containing the barber chair. If there are no customers to be served, the barber goes to sleep. If a customer enters the barbershop and all chairs are occupied, . then the customer leaves the shop. If the barber is busy but chairs are available then the customer sits in one of the free chairs. If the barber is asleep the customer wakes up the barber. Write a program to coordinate the barber and the customer.
3. Explain the Banker’s algorithm for dead-lock avoidable.
UNIT – IV
4 (a) Given memory partitions of 100 K, 500 K, 200K and 600K (in order), how would each of the First-fit, Best-fit algorithms place processes of 222 K, 417 K, 162 K and 428 K (in order) ?: Which algorithm makes the most efficient use of memory ?
(b) Write down the different issues in real time scheduling.
(b) Explain any four page replacement algorithms.
UNIT – V
5. Discuss the following disk scheduling algorithms.
(i) Shortest Seek Time First
(ii) First Come First Served
5. Explain how process management is done in Linux ?