Test: IPC, Synchronization & Concurrency- 1


7 Questions MCQ Test GATE Computer Science Engineering(CSE) 2022 Mock Test Series | Test: IPC, Synchronization & Concurrency- 1


Description
This mock test of Test: IPC, Synchronization & Concurrency- 1 for Computer Science Engineering (CSE) helps you for every Computer Science Engineering (CSE) entrance exam. This contains 7 Multiple Choice Questions for Computer Science Engineering (CSE) Test: IPC, Synchronization & Concurrency- 1 (mcq) to study with solutions a complete question bank. The solved questions answers in this Test: IPC, Synchronization & Concurrency- 1 quiz give you a good mix of easy questions and tough questions. Computer Science Engineering (CSE) students definitely take this Test: IPC, Synchronization & Concurrency- 1 exercise for a better result in the exam. You can find other Test: IPC, Synchronization & Concurrency- 1 extra questions, long questions & short questions for Computer Science Engineering (CSE) on EduRev as well by searching above.
QUESTION: 1

Critical region is

Solution:

Critical region is a set of instructions that access common shared resource which exclude one another in time. Critical region is primarily centred on the usage of global shared resources (or variables) among the processes.

QUESTION: 2

Kernel is

Solution:

Kernel is the set of primitive functions upon which the rest of operating system functions are built up.

QUESTION: 3

At a particular time, the value of a counting semaphore is 10. It will become 7 after
1. 3 V operations
2. 3 P operations
3. 5 V operations and 2 P operations
4. 13 P operations and 10 V operations

Solution:

P-denotes wait operation and V denotes signal. Value of counting semaphore initially 10, it will become seven by decreasing it by '3’ which can be done either by ‘3’ wait operation or 13 ‘P’- operation and ‘ 10’ V-operation, which effectively decreases the count by ‘3’.

QUESTION: 4

Supervisor call

Solution:

In computers, especially IBM mainframes, a supervisor call (SVC) is a processor instruction that directs the processor to pass control of the computer to the operating systems supervisor program.

QUESTION: 5

Semaphores are used to solve the problem of
1. Race condition
2. Process synchronization
3. Mutual exclusion

Solution:

Semaphores are used in deadlock avoidance by using them during interprocess communication. It is used to solve the problem of synchronisation among processes.

QUESTION: 6

Mutual exclusion problem occurs

Solution:

Whenever process shared the common data and resources, there is a chance of violating the consistency among the data. This problem which is related to the global data is known as mutual exclusion.

QUESTION: 7

Peterson’s algorithm is the solution of which of the following problem.

Solution:

Peterson's algorithm restricts process entry. It ensures that the concurrent processes will enter alternatively into critical section. So, also solving problem of mutual exclusion.