Segment replacement algorithms are more complex than page replacement algorithms because ____________(a) Segments are better than pages(b) Pages are better than segments(c) Segments have variable sizes(d) Segments have fixed sizesThe question was posed to me in an online interview.This question is from Virtual Memory topic in section The Linux System of Operating System

Segment replacement algorithms are more complex than page replacement

1.	Segment replacement algorithms are more complex than page replacement algorithms because ____________(a) Segments are better than pages(b) Pages are better than segments(c) Segments have variable sizes(d) Segments have fixed sizesThe question was posed to me in an online interview.This question is from Virtual Memory topic in section The Linux System of Operating System
Answer» Correct choice is (C) SEGMENTS have VARIABLE sizes Easy explanation - NONE.

Discussion

No Comment Found

Related InterviewSolutions

If the sum of the working – set sizes increases, exceeding the total number of available frames ____________(a) then the process crashes(b) the memory overflows(c) the system crashes(d) the operating system selects a process to suspendThe question was asked in an online interview.This intriguing question originated from Virtual Memory topic in division The Linux System of Operating System
If working set window is too large ____________(a) it will not encompass entire locality(b) it may overlap several localities(c) it will cause memory problems(d) none of the mentionedThe question was asked in a job interview.The query is from Virtual Memory in chapter The Linux System of Operating System
If working set window is too small ____________(a) it will not encompass entire locality(b) it may overlap several localities(c) it will cause memory problems(d) none of the mentionedI have been asked this question in my homework.Query is from Virtual Memory in portion The Linux System of Operating System
The accuracy of the working set depends on the selection of ____________(a) working set model(b) working set size(c) memory size(d) number of pages in memoryI got this question in an online interview.My doubt stems from Virtual Memory in section The Linux System of Operating System
A program is generally composed of several different localities, which _____ overlap.(a) may(b) must(c) do not(d) must notThis question was addressed to me in unit test.I would like to ask this question from Virtual Memory in portion The Linux System of Operating System
When a subroutine is called ____________(a) it defines a new locality(b) it is in the same locality from where it was called(c) it does not define a new locality(d) none of the mentionedI got this question during an online exam.The query is from Virtual Memory in portion The Linux System of Operating System
What is a locality?(a) a set of pages that are actively used together(b) a space in memory(c) an area near a set of processes(d) none of the mentionedThis question was posed to me in semester exam.My query is from Virtual Memory in division The Linux System of Operating System
Thrashing _______ the CPU utilization.(a) increases(b) keeps constant(c) decreases(d) none of the mentionedThe question was asked in a national level competition.This interesting question is from Virtual Memory topic in section The Linux System of Operating System
A process is thrashing if ____________(a) it spends a lot of time executing, rather than paging(b) it spends a lot of time paging than executing(c) it has no memory allocated to it(d) none of the mentionedI got this question in my homework.This intriguing question originated from Virtual Memory in section The Linux System of Operating System
________ replacement generally results in greater system throughput.(a) Local(b) Global(c) Universal(d) PublicI got this question in an online quiz.This intriguing question originated from Virtual Memory topic in portion The Linux System of Operating System

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment