A. First-come-first-served         B. Round Robin       C. Priority          D. Shortest process next        E. Shortest remaining time first

int main() {

Assuming all fork() calls succeed, which of the following correctly represents the final process count and the number of newly created child processes?

int main() {

Assuming all fork() calls succeed, how many child processes are created in total?

1. Use-level threads are transparent to the kernel

Consider a set of four processes (same as previous question) with arrival and burst times of 1, 2, 3, 4, and 2, 3, 4, 5 respectively. Calculate the average Turn Around time if the CPU scheduling policy is LJF preemptive. Note: If two processes have the same burst time, give preference to the process with the lowest process ID.

An operating system has three user processes, each of which requires three XYZ units of resources. The smallest number of XYZ units required to ensure that no deadlocks occur is

Which of the following scheduling algorithms is commonly implemented using a non-preemptive scheduling policy?

An operating system manages 8 identical scanners. Each process may require up to 4 scanners during execution. What is the largest number of processes the system can support without any chance of deadlock?

Which of the following is not typically a thread model?

Which one is not covered under an acceptable deadlock prevention policy?