Consider the following page-reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6

How many page faults would occur for following replacementalgorithms for a memory with 4 frames? Remember that all framesare initially empty, so your first unique pages will all cost onefault each.(i)  LRU replacement.(ii)  FIFO replacement.(iii)  Optimal replacement. Download Solution Ignou Read More …

MCS-042 Solved Assignment 2016-17

Fourth Semester Assignment Details : Operating Systems (MCS-041) Download MCS-041 Solved Assignment 2016-17 Data Communication and Computer Network (MCS-042) Download MCS-042 Solved Assignment 2016-17 Advanced Database Management Systems (MCS-043) Download MCS-042 Solved Assignment 2016-17 Mini Project (MCS-044) Coming soon UNIX Read More …

MCS-041 Solved Assignment 2016-17

Fourth Semester Assignment Details : Operating Systems (MCS-041) Download MCS-041 Solved Assignment 2016-17 Data Communication and Computer Network (MCS-042) Download MCS-042 Solved Assignment 2016-17 Advanced Database Management Systems (MCS-043) Download MCS-042 Solved Assignment 2016-17 Mini Project (MCS-044) Coming soon UNIX Read More …