Pages for os4/6/2024 ![]() Then 5 comes, it is not available in memory so it replaces the oldest page slot i.e 1. When 3 comes, it is already in memory so -> 0 Page Faults. Initially all slots are empty, so when 1, 3, 0 came they are allocated to the empty slots -> 3 Page Faults. When a page needs to be replaced page in the front of the queue is selected for removal.Įxample-1Consider page reference string 1, 3, 0, 3, 5, 6 with 3 page frames.Find number of page faults. In this algorithm, the operating system keeps track of all pages in the memory in a queue, the oldest page is in the front of the queue. This is the simplest page replacement algorithm. ISRO CS Syllabus for Scientist/Engineer Exam.ISRO CS Original Papers and Official Keys.GATE CS Original Papers and Official Keys. ![]()
0 Comments
Leave a Reply.AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |