Consider a reference string 7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1 of frame size 4. Calculate the number of page faults using optimal page replacement algorithm.(a) 7(b) 9(c) 8(d) 6This question was addressed to me during an online exam.This question is from Page Replacement Algorithms topic in portion Page Replacement Algorithms of Data Structures & Algorithms II

Consider a reference string 7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1 of

1.	Consider a reference string 7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1 of frame size 4. Calculate the number of page faults using optimal page replacement algorithm.(a) 7(b) 9(c) 8(d) 6This question was addressed to me during an online exam.This question is from Page Replacement Algorithms topic in portion Page Replacement Algorithms of Data Structures & Algorithms II
Answer» The correct option is (c) 8 For explanation: For the GIVEN reference string, the NUMBER of page faults using optimal page replacement algorithm is said to be 8. It is SOLVED in the given diagram.

Discussion

No Comment Found

Related InterviewSolutions

_________ states that, on a page fault, the frame that has been in memory the longest is replaced.(a) Belady’s anomaly(b) Second chance algorithm(c) Partial second chance algorithm(d) LRU replacement algorithmI have been asked this question by my college professor while I was bunking the class.The above asked question is from Page Replacement Algorithms topic in portion Page Replacement Algorithms of Data Structures & Algorithms II
Under which of the following scenarios is page replacement algorithm required?(a) When total memory exceeds physical memory(b) To determine the number of frames for each process(c) When paging and segmentation are to be used(d) Execution of a process, not in memoryI have been asked this question by my school teacher while I was bunking the class.My doubt stems from Page Replacement Algorithms in portion Page Replacement Algorithms of Data Structures & Algorithms II
What is the competitive analysis of the FIFO algorithm?(a) k/k+1(b) k+1(c) k(k+1)(d) k/(k-h+1)The question was posed to me in a job interview.This is a very interesting question from Page Replacement Algorithms in portion Page Replacement Algorithms of Data Structures & Algorithms II
FIFO algorithm is used by __________ operating system.(a) Linux(b) Mac(c) Windows(d) VAX/VMSThis question was addressed to me in final exam.Enquiry is from Page Replacement Algorithms in portion Page Replacement Algorithms of Data Structures & Algorithms II
The cost required to execute a FIFO algorithm is expensive.(a) True(b) FalseI have been asked this question during an online exam.Asked question is from Page Replacement Algorithms in section Page Replacement Algorithms of Data Structures & Algorithms II
In a FIFO algorithm, when a page is to be replaced, which of the following page is chosen?(a) Oldest page(b) Newest page(c) Frequently occurred page in past(d) Frequently occurred page in futureI have been asked this question by my school principal while I was bunking the class.My question is based upon Page Replacement Algorithms topic in section Page Replacement Algorithms of Data Structures & Algorithms II
Which of the following is required to determine the number of page faults in FIFO?(a) Page number(b) Page frame number(c) Memory capacity(d) Segment numberI had been asked this question in an international level competition.My question is from Page Replacement Algorithms topic in portion Page Replacement Algorithms of Data Structures & Algorithms II
Which of the following is the main drawback of FIFO page replacement algorithm?(a) Requirement of large memory(b) Frame allocation(c) Reduction in multiprogramming(d) Reduced optimalityThis question was addressed to me by my school teacher while I was bunking the class.My question is from Page Replacement Algorithms topic in division Page Replacement Algorithms of Data Structures & Algorithms II
Which of the following page replacement algorithms return the minimum number of page faults?(a) LRU replacement algorithm(b) Optimal page replacement algorithm(c) FIFO(d) Counting based replacementThis question was posed to me by my school principal while I was bunking the class.Asked question is from Page Replacement Algorithms topic in chapter Page Replacement Algorithms of Data Structures & Algorithms II
As the number of frames available increases, the number of page faults decreases.(a) True(b) FalseThis question was addressed to me in quiz.This key question is from Page Replacement Algorithms in section Page Replacement Algorithms of Data Structures & Algorithms II

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment