STUPIDSID
1 (a)
List the operating system responsibilities in connection, with a process management and memory management.
8 M
1 (b)
Explain the 'graceful degradation' and 'fault tolerant' in a multiprocessor system.
6 M
1 (c)
What is a 'virtual machine'? Explain the just-in-time (JIT) compiler, used in a java virtual machine.
6 M
2 (a)
Explain the process state, with the suitable diagram.
8 M
2 (b)
Explain the benefits of multithreaded programming.
8 M
2 (c)
Explain the hard real time system.
4 M
3 (a)
Define test and set instruction and implement mutual exclusion, using test and set.
5 M
3 (b)
Sleeping-barber and sleeping-customers problem:
A barbershop consists of a waiting room with 'N' chairs (chair [1], chair [2]??. Chair [n]) as shown in Fig.Q3(b) and the barber room containning the barber chair (chair [0]). If there are no customers to be served, the barber goes to sleep. if a customer enters the berbershop and all the chairs are occupied, then the new customer goes to sleep. if the barber in busy, but the waiting chairs are available, then the new customer occupies the next free chair to maintain the queue. if the barber in asleep, the customer wakes up the barber and occupies the barber chair.
Assume chair [0] in one of the critical regions and all waiting chairs together are another critical region. Also assume only the following abstract functions are available:
(i) Haircut():
// barber busy in his work.
(ii) Customers-shift-to-next-chair();
// after haircut the customer gets up from the barber chair and all other customer shift by one position to the next chair towards the barber chair.
(iii) Customer-occupies-free-chair ();
// new customer occupies the next free chair to maintain the queue, or, if no customers are waiting then new customer directly occupies the barber chair.
write an abstract C program to coordinate the barber and customer in sleeping-barber and sleeping-customer problem, using semaphores with atomic operations wait () and signal (). Assume suitable data structure for abstract implementation.
A barbershop consists of a waiting room with 'N' chairs (chair [1], chair [2]??. Chair [n]) as shown in Fig.Q3(b) and the barber room containning the barber chair (chair [0]). If there are no customers to be served, the barber goes to sleep. if a customer enters the berbershop and all the chairs are occupied, then the new customer goes to sleep. if the barber in busy, but the waiting chairs are available, then the new customer occupies the next free chair to maintain the queue. if the barber in asleep, the customer wakes up the barber and occupies the barber chair.
Assume chair [0] in one of the critical regions and all waiting chairs together are another critical region. Also assume only the following abstract functions are available:
(i) Haircut():
// barber busy in his work.
(ii) Customers-shift-to-next-chair();
// after haircut the customer gets up from the barber chair and all other customer shift by one position to the next chair towards the barber chair.
(iii) Customer-occupies-free-chair ();
// new customer occupies the next free chair to maintain the queue, or, if no customers are waiting then new customer directly occupies the barber chair.
write an abstract C program to coordinate the barber and customer in sleeping-barber and sleeping-customer problem, using semaphores with atomic operations wait () and signal (). Assume suitable data structure for abstract implementation.
15 M
4 (a)
List any four examples of deadlock that are not related to computer systems.
8 M
4 (b)
Explain the safety algorithm used in Banker's algorithm, with suitable data structures.
12 M
5 (a)
What is dynamic storage allocation? Explain the commonly used strategies for dynamic storage allocation.
12 M
5 (b)
Explain the buddy-system, used for managing free memory assigned to kernal process.
8 M
6 (a)
List the common file types along with its extension and fuctions.
10 M
6 (b)
How do the morden operating system concurrently support multiple types of file system? Explain its implementation, in detail.
10 M
7 (a)
Explain sector slipping, with an example.
4 M
7 (b)
Assume the disk queue, with request fun I/O to block on cylinders as 80, 30, 15, 100, 125, 90, 45, and 10. If the disk head is initially at cylinder 35, illustrate the disk movements, using the SSTF scheduling algorithm. Also calculate the total head movement.
8 M
7 (c)
Explain the various questions that arise in revocation of access rights.
8 M
8 (a)
Distinguish between fork () and clone () system call. Also customize the clone () system call to fork () functionality, with suitable modifications/settings.
8 M
8 (b)
Explain the Linux device drive the block structure.
12 M
More question papers from Operating Systems