Answer Posted / girajendra kumar

Necessary and sufficient conditions for a solution to the
c.s. problem:
1. Mutual Exclusion --- if is executing in one of its
critical sections, no , , is executing in its critical
sections.
2. Progress --- a process operating outside of its
critical section cannot prevent other processes from
entering theirs; processes attempting to enter their
critical sections simultaneously must decide which process
enters eventually.
3. Bounded Waiting --- a process attempting to enter
its critical region will be able to do so eventually.
Assumptions:
1. No assumptions made about relative speed of
processes
2. No process may remain in its critical section
indefinitely (may not terminate in its critical section)
3. A memory operation (read or write) is atomic ---
cannot be interrupted. For now, we do not assume
indivisible RMW cycles.

If your server is running on Unix and one of the sessions are keep on running without loading any data. how would you kill it?

1048

---

Explain the different kinds of threads?

975

---

Explain the performance differences between user-space threads and kernel-supported threads.?

1130

---

What is the window of the working set of a process?

1010

---

What is the working set of a process?

977

---

What is protection boundary?

1031

---

Explain what are threads?

990

---

List the system calls used for process management?

1019

---

Explain similarities between thread and process?

923

---

Explain how to work unix commands on windows xp without installing unix o/s in pc?

905

---

Explain critical section?

993

---

Explain what is scheduling?

997

---

Explain what is critical section?

916

---

How would you kill a process?

979

---

explain about the initial process sequence while the system boots up?

965

---