Question 25 The system calls of an operating system typically Consist of a pre-defined set May be made by any process Accomplish tasks the calling processes are not allowed to perform All of the above Question 26 Operating ayatens maintain a process control block which holds a process array for each process which helde information about that process. True False Question 27 Time sharing, contrasted with batch processing, tends to achieve better CPU utilization. True False

Course: Operating Systems Given below is the pseudocode to synchronize processes P1, P2, P3, P4, P5, and P6 byusing three semaphores X, Y and Z that are initialized as follow: X=0, Y=0, Z= –2. TheOperating System can schedule the processes which are ready to execute in any order.List down at least 5 possible orders of execution in which the processes can run.

Briefly describe the phenomenon of process famine in priority scheduling, as well as how it may be avoided.

Modern Operating Systems must tackle the challenges of Synchronization and Deadlock. 'Process Synchronization' is the task of coordinating the execution of processes in a way that no two processes can have access to the same shared data or resource. A process requesting a resource may have to wait, if the resource is not available at that time. Sometimes, a waiting process is never able to change state, because the resources it has requested are held by other waiting processes; this situation is called 'Deadlock'. In concurrent programming, a "critical section" is a part of a multi-process program thatmay not be concurrently executed by more than one of the program's thread. Let us consider a 2 processes solution: do {flag[i] = TRUE;while(flag[j]); %waitCRITICAL SECTIONflag[i] = FALSE;REMAINDER SECTION} while (TRUE);Pseudo-code of $P_i$ (the one of $P_j$ is symmetric) a) Does the given solution satisfy the mutual exclusion requirement? Explain (asimple 'yes-no' answer is NOT enough.…

Modern Operating Systems must tackle the challenges of Synchronization and Deadlock. ’Process Synchronization’ is the task of coordinating the execution of processes in a way that no two processes can have access to the same shared data or resource. A process requesting a resource may have to wait, if the resource is not available at that time. Sometimes, a waiting process is never able to change state, because the resources it has requested are held by other waiting processes; this situation is called ’Deadlock'.

Explain the difference between nonpreemptive process scheduling and preemptive scheduling in terms of how the operating system makes decisions about the choice of RUNNING process in response to the event types that cause context switch from user to kernel mode.

(a). Operating systems schedule processes for executionon the processor using various scheduling schemes.Compare and contrast Fist come first servedscheduling scheme and Round-robin schedulingscheme. Give appropriate examples to illustrate youranswer.(b). Compare and contrast the forms of interface thatoperating systems provide to users of computersystems. Give practical examples to illustrate youranswer and discuss practical limitations of each formof interface.

Explain the difference between non preemptive process scheduling and preemptive scheduling in terms of how the operating system makes decisions about the choice of RUNNING process in response to the event types that cause context switching from user to kernel mode.

Explain the concept of "Context Switching" in operating systems and discuss its impact on multi-threaded processes. How does the operating system maintain the state of the process during a context switch, and what are the typical overheads associated with it?

Discuss a difficulty caused by concurrent processing in an operating system.