-
-
-
-
-
-
Deadlock Detection-Algorithm Usage?
->When, and how often, to invoke depends on:How often a deadlock is likely to occur?How many processes will need to be rolled back?->If detection algorithm is invoked arbitrarily, there may be many cycles in the resource graph and so we would not be able to tell which of the many deadlocked processes “caused” the deadlock.
-
What is multi tasking, multi programming, multi threading?
Multi programming: Multiprogramming is the technique of running several programs at a time using timesharing.It allows a computer to do several things at the same time. Multiprogramming creates logical parallelism. The concept of multiprogramming is that the operating system keeps several jobs in memory simultaneously. The operating system selects a job from the job pool and starts executing a...
-
-
What are different tasks of Lexical Analysis?
The purpose of the lexical analyzer is to partition the input text, delivering a sequence of comments and basic symbols. Comments are character sequences to be ignored, while basic symbols are character sequences that correspond to terminal symbols of the grammar defining the phrase structure of the input
-
Give a non-computer example of preemptive and non-preemptive scheduling?
Consider any system where people use some kind of resources and compete for them. The non-computer examples for preemptive scheduling the traffic on the single lane road if there is emergency or there is an ambulance on the road the other vehicles give path to the vehicles that are in need. The example for preemptive scheduling is people standing in queue for tickets.
-
-
Different types of Real-Time Scheduling?
Hard real-time systems – required to complete a critical task within a guaranteed amount of time.Soft real-time computing – requires that critical processes receive priority over less fortunate ones.
-
-
Explain the difference between microkernel and macro kernel?
Micro-Kernel: A micro-kernel is a minimal operating system that performs only the essential functions of an operating system. All other operating system functions are performed by system processes. Monolithic: A monolithic operating system is one where all operating system code is in a single executable image and all operating system code runs in system mode.
-
Describe the actions taken by thread library to context switch between user level threads?
The thread library function performs the following actions to context switch between user level threadsCopy all live registers to Thread control Block (TCB)Restore the state of the thread to run next i.e (copy the values of live registers from (TCB) to registers)Move to the next thread to execute
-
Compare Linux credit based algorithm with other scheduling algorithms?
For the conventional time –shared processes, Linux uses a prioritized, credit-based algorithm. Each process possesses a certain number of scheduling credits; when a new task must be chosen to run, the process with most credits is selected. Every time that a timer interrupt occurs, the currently running process loses one credit; when its credits reaches zero, it is suspended and another process is...
-
What is the difference between Hard and Soft real-time systems?
A hard real-time system guarantees that critical tasks complete on time. This goal requires that all delays in the system be bounded from the retrieval of the stored data to the time that it takes the operating system to finish any request made of it.A soft real time system where a critical real-time task gets priority over other tasks and retains that priority until it completes. As in hard real...
-
What is hard disk and what is its purpose?
Hard disk is the secondary storage device, which holds the data in bulk, and it holds the data on the magnetic medium of the disk.Hard disks have a hard platter that holds the magnetic medium, the magnetic medium can be easily erased and rewritten, and a typical desktop machine will have a hard disk with a capacity of between 10 and 40 gigabytes. Data is stored onto the disk in the form of files.
-
What are the Methods for Handling Deadlocks?
->Ensure that the system will never enter a deadlock state.->Allow the system to enter a deadlock state and then recover.->Ignore the problem and pretend that deadlocks never occur in the system; used by most operating systems, including UNIX.
-
What is a Safe State and its’ use in deadlock avoidance?
When a process requests an available resource, system must decide if immediate allocation leaves the system in a safe state->System is in safe state if there exists a safe sequence of all processes. ->Sequence <P1, P2… Pn> is safe if for each Pi, the resources that Pi can still request can be satisfied by currently available resources + resources held by all...
Windows Interview Questions
Ans