Answer Posted / pravin tripathi

optimal page replacement algorithm seems to be the best page
replacement algorithm as"the no. of page faults are minimum
as compared to any page replacement algorithm as well as it
is free from belady's anomaly",but the problem is that,it is
very difficult to implement as it need the future knowledge
of reference string.
while least-recently-used(LRU)algorithm is also free
from belady's anamoly and the no. of page faults are fewer
than any other page repl. algorithm(besides OPT algorithm)
it is easy to implement.and is the best page replacement
algorithm.

Describe the objective of multiprogramming.

1376

---

What is the difference between 16 bit and 32 bit?

969

---

How do I tell if excel 2016 is 32 or 64 bit?

1161

---

What is the difference between tty and pts?

1035

---

What is fragmentation?

1154

---

What are the different tasks of Lexical analysis?

2286

---

Is excel for mac 64 bit?

1061

---

What are the 7 elements of communication?

993

---

Explain the typical elements of a process image?

1077

---

Can you tell me the difference between semaphore and mutex.

1221

---

What is a critical section in os?

997

---

Is it possible to have a deadlock involving only one process? Explain your answer.

1038

---

How do I upgrade my excel to 64 bit?

1007

---

Does more ram increase fps?

1059

---

Explain smp.

1048

---