Answer Posted / sagarika mishra

In computer science, a semaphore is a protected variable or
abstract data type which constitutes the classic method for
restricting access to shared resources such as shared
memory in a multiprogramming environment. A counting
semaphore is a counter for a set of available resources,
rather than a locked/unlocked flag of a single resource. It
was invented by Edsger Dijkstra. Semaphores are the classic
solution to preventing race conditions in the dining
philosophers problem, although they do not prevent resource
deadlocks.
Semaphores can only be accessed using the following
operations. Those marked atomic should not be interrupted
(that is, if the system decides that the "turn is up" for
the program doing this, it shouldn't stop it in the middle
of those instructions) for the reasons explained below.
P(Semaphore s) // Acquire Resource
{
wait until s > 0, then s := s-1;
/* must be atomic because of race conditions */
}

V(Semaphore s) // Release Resource
{
s := s+1; /* must be atomic */
}

Init(Semaphore s, Integer v)
{
s := v;
}

How do I free up disk space?

1044

---

What is the difference between kernel and operating system?

992

---

Is system restore bad for your computer?

1031

---

Is 4 cores enough for streaming?

1089

---

Which is your favorite editor, shell, programming shell and why?

2578

---

How do you fix a crashed computer?

1044

---

Can I install chrome os on my laptop?

1001

---

What are go channels?

1019

---

How do I clean up my computer to make it run faster?

1053

---

What is the next microsoft operating system?

1049

---

Is chrome os better than windows 10?

1046

---

What is the fastest computer operating system?

1076

---

What is the latest android operating system?

1048

---

How many bytes we can send to apple push notification server in iOS operating system?

1092

---

What is the most powerful processor?

1060

---