What is a Safe State and what is its use in deadlock avoidance?

Correct Answer: Mutual exclusion Hold and wait No preemption Circular wait

Correct Answer: Data registers - can be assigned to a variety of functions by the programmer They can be used with any machine instruction that performs operations on data Address registers - contain main memory addresses of data and instructions or they contain a portion of the address that is used in the calculation of the complete addresses

Correct Answer: A list of processes waiting for a particular I/O device is called device queue

Correct Answer: Scheduling is the activity of the deciding when process will receive the resources they request FCS ---> FCSFS stands for First Come First Served In FCFS the job that has been waiting the longest is served next Round Robin Scheduling--->Round Robin scheduling is a scheduling method where each process gets a small quantity of time to run and then it is preempted and the next process gets to run This is called time-sharing and gives the effect of all the processes running at the same time Shortest Job First ---> The Shortest job First scheduling algorithm is a nonpreemptive scheduling algorithm that chooses the job that will execute the shortest amount of time Priority Scheduling--->Priority scheduling is a scheduling method where at all times the highest priority process is assigned the resource

Correct Answer: Program execution I/O operations File system manipulation Communication Error detection Resource allocation Accounting Protection

Correct Answer: Micro-kernal : 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

Correct Answer: 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 time systems kernel delays need to be bounded

Correct Answer: Hardware device that maps virtual to physical address In MMU scheme, the value in the relocation register is added to every address generated by a user process at the time it is sent to memory ->The user program deals with logical addresses; it never sees the real physical addresses

Correct Answer: Hard disk is the secondary storage device, which holds the data in bulk, and it holds the data on the magnetic medium of the diskHard 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

Correct Answer: Dispatcher module gives control of the CPU to the process selected by the short-term scheduler; this involves: Switching context, Switching to user mode, Jumping to the proper location in the user program to restart that program, dispatch latency ââ?¬â?? time it takes for the dispatcher to stop one process and start another running