What are the different types of Real-Time Scheduling?

Correct Answer: In order to protect the operating systems and the system programs from the malfunctioning programs the two mode operations were evolved System mode User mode

Correct Answer: The process of packaging and sending interface method parameters across thread or process boundaries

Correct Answer: Mutex is a program object that allows multiple program threads to share the same resource, such as file access, but not simultaneously When a program is started a mutex is created woth a unique name After this stage, any thread that needs the resource must lock the mutex from other threads while it is using the resource the mutex is set to unlock when the data is no longer needed or the routine is finished

Correct Answer: Deadlock is a situation where a group of processes are all blocked and none of them can become unblocked until one of the other becomes unblocked The simplest deadlock is two processes each of which is waiting for a message from the other

Correct Answer: User thread Kernel thread

Correct Answer: Absolute path-- Exact path from root directory Relative path-- Relative to the current path

Correct Answer: Fragmentation occurs in a dynamic memory allocation system when many of the free blocks are too small to satisfy any request

Correct Answer: Transferring the control from one process to other process requires saving the state of the old process and loading the saved state for new process This task is known as context switching

Correct Answer: DRAM is not the best, but it?s cheap, does the job, and is available almost everywhere you look DRAM data resides in a cell made of a capacitor and a transistor The capacitor tends to lose data unless it?s recharged every couple of milliseconds, and this recharging tends to slow down the performance of DRAM compared to speedier RAM types

Correct Answer: Waiting state