Optimal algorithm is the best... It has fewer page faults and avoids belady

Which is the best page replacement algorithm and Why ?

Question Posted / dorathy

Answer Posted / dorathy

Optimal algorithm is the best... It has fewer page faults and avoids beladys anamolies..

Is This Answer Correct ?

2 Yes

1 No

Please Help Members By Posting Answers For Below Questions

what is the relationship between page size and page table?

2478

Which one you will use to implement critical section?

2277

What is the difference between mailbox and queue?

1199

Explain page fault interrupt?

1101

Can a bad cpu cause blue screen?

1087

Is 100 cpu usage bad?

1046

What is the trc timing?

1103

Explain the concept of the multi-processor systems or parallel systems?

1068

How you can detect deadlock condition?

1230

What is a ready queue?

1087

What are the 3 types of software?

1063

Does dual boot slow down pc?

998

Under what circumstances do page faults occur?

1232

What do you understand by registers?

1009

Can you move programs from c drive to d?

1024