Test: IPC, Synchronization & Concurrency- 1


Test Description

7 Questions MCQ Test Question Bank for GATE Computer Science Engineering | Test: IPC, Synchronization & Concurrency- 1

Test: IPC, Synchronization & Concurrency- 1 for Computer Science Engineering (CSE) 2022 is part of Question Bank for GATE Computer Science Engineering preparation. The Test: IPC, Synchronization & Concurrency- 1 questions and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus.The Test: IPC, Synchronization & Concurrency- 1 MCQs are made for Computer Science Engineering (CSE) 2022 Exam. Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests for Test: IPC, Synchronization & Concurrency- 1 below.
Solutions of Test: IPC, Synchronization & Concurrency- 1 questions in English are available as part of our Question Bank for GATE Computer Science Engineering for Computer Science Engineering (CSE) & Test: IPC, Synchronization & Concurrency- 1 solutions in Hindi for Question Bank for GATE Computer Science Engineering course. Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free. Attempt Test: IPC, Synchronization & Concurrency- 1 | 7 questions in 21 minutes | Mock test for Computer Science Engineering (CSE) preparation | Free important questions MCQ to study Question Bank for GATE Computer Science Engineering for Computer Science Engineering (CSE) Exam | Download free PDF with solutions
1 Crore+ students have signed up on EduRev. Have you?
Test: IPC, Synchronization & Concurrency- 1 - Question 1

Critical region is

Detailed Solution for Test: IPC, Synchronization & Concurrency- 1 - Question 1

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.

Test: IPC, Synchronization & Concurrency- 1 - Question 2

Kernel is

Detailed Solution for Test: IPC, Synchronization & Concurrency- 1 - Question 2

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

Test: IPC, Synchronization & Concurrency- 1 - 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

Detailed Solution for Test: IPC, Synchronization & Concurrency- 1 - Question 3

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’.

Test: IPC, Synchronization & Concurrency- 1 - Question 4

Supervisor call

Detailed Solution for Test: IPC, Synchronization & Concurrency- 1 - Question 4

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.

Test: IPC, Synchronization & Concurrency- 1 - Question 5

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

Detailed Solution for Test: IPC, Synchronization & Concurrency- 1 - Question 5

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

Test: IPC, Synchronization & Concurrency- 1 - Question 6

Mutual exclusion problem occurs

Detailed Solution for Test: IPC, Synchronization & Concurrency- 1 - Question 6

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.

Test: IPC, Synchronization & Concurrency- 1 - Question 7

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

Detailed Solution for Test: IPC, Synchronization & Concurrency- 1 - Question 7

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.

Use Code STAYHOME200 and get INR 200 additional OFF
Use Coupon Code
Information about Test: IPC, Synchronization & Concurrency- 1 Page
In this test you can find the Exam questions for Test: IPC, Synchronization & Concurrency- 1 solved & explained in the simplest way possible. Besides giving Questions and answers for Test: IPC, Synchronization & Concurrency- 1, EduRev gives you an ample number of Online tests for practice