Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
What do you mean by SCAN algorithm for the disk scheduling?
Illustrate the difference between Multiprogramming and Multitasking operating system?
Describe the different approaches for implementing the mutual exclusion in a distributed environment.
Explain the First fit, best fit and the worst fit allocation algorithms. Given memory partitions of 100K, 500K, 200K, 300K and 600K (in order),
Consider the given system snapshot by using data structures in the Banker’s algorithm, with resources A, B, C and D and process P0 to P4:
Describe the schemes for defining the logical structure of a directory.
Design the state diagram of a process and label different transitions. Describe the need of process suspension.
Explain Dijkstra shortest path algorithm. Also illustrate the working process of Dijkstra algorithm with the help of an illustration.
Illustrate the time stamping scheme of the distributed system for mutual exclusion? Describe the functioning of the scheme via a diagram.
What do you mean by the term Virtual File Systems? How is it implemented?
Give an illustration of classical problem of concurrent programming and illustrate how it leads to the deadlock?
Illustrate the two main functions of the operating systems?
Describe about how logical address is mapped to physical address during execution time.
Describe in detail about Bakery Algorithm for Critical Section Problem with suitable example.
Describe User-Level Thread and Kernel-Level Thread. What do you mean by Process? Write down the difference between a process and a program.
There are few classical problems of synchronization and these problems are examples of a large class of concurrency–control problems. One of the problems is Dining-Philosophers problem. Descri
Consider the following page reference string 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1. How many page faults will occur for the given replacement algorithms: LRU, FIFO, and Optimal
Describe the different strategies for dealing with the deadlocks namely prevention, avoidance and recovery?
Describe the differences in the degree to which FCFS, RR and Non-pre-emptive SJF scheduling algorithms discriminate in favour of short processes. State and demonstrate banker’s algorithm.
Describe how semaphore can be used to solve readers and writers problem?
Describe Two-Phase Locking. Describe Dynamic Memory Allocation Strategy.
Write down the essential conditions for a deadlock situation to arise? Explain them in detail with suitable example. Compare paging and segmentation?
Consider a set of process <p1,p2,p3,p4,p5> with length of the cpu burst <10,1,2,1,5> and they enter in the same order at time 0. Determine the turn around and waiting time for each proce
Explain the TEST–AND-SET mechanism for synchronization of processes in detail.