InterviewSolution
Saved Bookmarks
InterviewSolution
This section includes InterviewSolutions, each offering curated multiple-choice questions to sharpen your knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
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 |
|
Answer» Right answer is (d) the OPERATING system selects a PROCESS to suspend |
|
| 2. |
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 |
|
Answer» Right option is (B) it may OVERLAP SEVERAL localities |
|
| 3. |
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 |
|
Answer» CORRECT CHOICE is (a) it will not ENCOMPASS ENTIRE locality Explanation: NONE. |
|
| 4. |
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 |
|
Answer» RIGHT ANSWER is (b) working SET size Explanation: None. |
|
| 5. |
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 |
|
Answer» CORRECT CHOICE is (a) may To EXPLAIN I would say: NONE. |
|
| 6. |
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 |
|
Answer» RIGHT OPTION is (a) it DEFINES a new locality The explanation: NONE. |
|
| 7. |
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 |
|
Answer» Right ANSWER is (a) a set of pages that are actively USED together |
|
| 8. |
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 |
| Answer» | |
| 9. |
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 |
|
Answer» Correct option is (b) it spends a lot of TIME PAGING than executing |
|
| 10. |
________ 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 |
|
Answer» The CORRECT ANSWER is (B) Global |
|
| 11. |
One problem with the global replacement algorithm is that ____________(a) it is very expensive(b) many frames can be allocated to a process(c) only a few frames can be allocated to a process(d) a process cannot control its own page – fault rateThe question was asked in an internship interview.This interesting question is from Virtual Memory in section The Linux System of Operating System |
|
Answer» Correct CHOICE is (d) a PROCESS cannot CONTROL its own page – fault rate |
|
| 12. |
_________ replacement allows each process to only select from its own set of allocated frames.(a) Local(b) Universal(c) Global(d) PublicThe question was posed to me in unit test.I want to ask this question from Virtual Memory topic in section The Linux System of Operating System |
|
Answer» RIGHT ANSWER is (a) Local The EXPLANATION: NONE. |
|
| 13. |
_________ replacement allows a process to select a replacement frame from the set of all frames, even if the frame is currently allocated to some other process.(a) Local(b) Universal(c) Global(d) PublicI have been asked this question by my college professor while I was bunking the class.This intriguing question originated from Virtual Memory in division The Linux System of Operating System |
|
Answer» The CORRECT CHOICE is (C) Global |
|
| 14. |
With either equal or proportional algorithm, a high priority process is treated ___________ a low priority process.(a) greater than(b) same as(c) lesser than(d) none of the mentionedThe question was posed to me in a job interview.This key question is from Virtual Memory in portion The Linux System of Operating System |
|
Answer» CORRECT OPTION is (B) same as Best EXPLANATION: None. |
|
| 15. |
The algorithm in which we allocate memory to each process according to its size is known as ____________(a) proportional allocation algorithm(b) equal allocation algorithm(c) split allocation algorithm(d) none of the mentionedI have been asked this question in a job interview.Query is from Virtual Memory in division The Linux System of Operating System |
|
Answer» The CORRECT choice is (a) PROPORTIONAL allocation algorithm |
|
| 16. |
The algorithm in which we split m frames among n processes, to give everyone an equal share, m/n frames is known as ____________(a) proportional allocation algorithm(b) equal allocation algorithm(c) split allocation algorithm(d) none of the mentionedThis question was posed to me in an online quiz.The doubt is from Virtual Memory in division The Linux System of Operating System |
|
Answer» Right ANSWER is (B) equal allocation algorithm |
|
| 17. |
The maximum number of frames per process is defined by ____________(a) the amount of available physical memory(b) operating System(c) instruction set architecture(d) none of the mentionedThe question was posed to me in semester exam.The question is from Virtual Memory topic in section The Linux System of Operating System |
|
Answer» The CORRECT ANSWER is (a) the amount of available PHYSICAL memory |
|
| 18. |
Consider a machine in which all memory reference instructions have only one memory address, for them we need at least _____ frame(s).(a) one(b) two(c) three(d) none of the mentionedI had been asked this question by my college professor while I was bunking the class.My question comes from Virtual Memory topic in portion The Linux System of Operating System |
|
Answer» The CORRECT choice is (B) two |
|
| 19. |
When a page fault occurs before an executing instruction is complete if ____________(a) the instruction must be restarted(b) the instruction must be ignored(c) the instruction must be completed ignoring the page fault(d) none of the mentionedThe question was asked during a job interview.My question is based upon Virtual Memory in portion The Linux System of Operating System |
|
Answer» RIGHT ANSWER is (a) the INSTRUCTION must be restarted For explanation: NONE. |
|
| 20. |
The minimum number of frames to be allocated to a process is decided by the ____________(a) the amount of available physical memory(b) operating System(c) instruction set architecture(d) none of the mentionedI got this question in a national level competition.This interesting question is from Virtual Memory topic in chapter The Linux System of Operating System |
|
Answer» The CORRECT CHOICE is (c) INSTRUCTION set architecture |
|
| 21. |
The implementation of the LFU and the MFU algorithm is very uncommon because ____________(a) they are too complicated(b) they are optimal(c) they are expensive(d) all of the mentionedThis question was addressed to me by my school principal while I was bunking the class.This interesting question is from Virtual Memory topic in portion The Linux System of Operating System |
|
Answer» The correct ANSWER is (C) they are expensive |
|
| 22. |
What is the reason for using the MFU page replacement algorithm?(a) an actively used page should have a large reference count(b) a less used page has more chances to be used again(c) it is extremely efficient and optimal(d) all of the mentionedThe question was asked in quiz.The origin of the question is Virtual Memory in section The Linux System of Operating System |
|
Answer» The CORRECT CHOICE is (B) a less used PAGE has more CHANCES to be used again |
|
| 23. |
What is the reason for using the LFU page replacement algorithm?(a) an actively used page should have a large reference count(b) a less used page has more chances to be used again(c) it is extremely efficient and optimal(d) all of the mentionedThe question was asked in class test.The doubt is from Virtual Memory topic in division The Linux System of Operating System |
|
Answer» The CORRECT option is (a) an actively used page should have a LARGE reference count |
|
| 24. |
The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by ____________(a) the instruction set architecture(b) page size(c) physical memory size(d) number of processes in memoryThis question was posed to me in an interview.My enquiry is from Virtual Memory in portion The Linux System of Operating System |
|
Answer» The CORRECT answer is (a) the instruction SET architecture |
|
| 25. |
The essential content(s) in each entry of a page table is/are ____________(a) Virtual page number(b) Page frame number(c) Both virtual page number and page frame number(d) Access right informationI have been asked this question in homework.Asked question is from Virtual Memory topic in division The Linux System of Operating System |
|
Answer» RIGHT option is (B) Page frame number The explanation: NONE. |
|
| 26. |
Increasing the RAM of a computer typically improves performance because ____________(a) Virtual memory increases(b) Larger RAMs are faster(c) Fewer page faults occur(d) None of the mentionedI had been asked this question during a job interview.The question is from Virtual Memory in portion The Linux System of Operating System |
|
Answer» Correct ANSWER is (C) FEWER page faults occur |
|
| 27. |
There is a set of page replacement algorithms that can never exhibit Belady’s Anomaly, called ____________(a) queue algorithms(b) stack algorithms(c) string algorithms(d) none of the mentionedThis question was addressed to me during an interview for a job.Asked question is from Virtual Memory in chapter The Linux System of Operating System |
|
Answer» Correct ANSWER is (b) STACK algorithms |
|
| 28. |
In the stack implementation of the LRU algorithm, a stack can be maintained in a manner ____________(a) whenever a page is used, it is removed from the stack and put on bottom(b) the bottom of the stack is the LRU page(c) the top of the stack contains the LRU page and all new pages are added to the top(d) none of the mentionedI got this question in an interview for internship.Origin of the question is Virtual Memory in division The Linux System of Operating System |
|
Answer» The correct choice is (b) the BOTTOM of the stack is the LRU page |
|
| 29. |
When using counters to implement LRU, we replace the page with the ____________(a) smallest time value(b) largest time value(c) greatest size(d) none of the mentionedI had been asked this question in homework.This interesting question is from Virtual Memory topic in chapter The Linux System of Operating System |
|
Answer» Right choice is (a) smallest time value |
|
| 30. |
What are the two methods of the LRU page replacement policy that can be implemented in hardware?(a) Counters(b) RAM & Registers(c) Stack & Counters(d) RegistersThis question was addressed to me in an online quiz.This is a very interesting question from Virtual Memory in chapter The Linux System of Operating System |
|
Answer» The correct answer is (C) STACK & Counters |
|
| 31. |
LRU page – replacement algorithm associates with each page the ______(a) time it was brought into memory(b) the time of that page’s last use(c) page after and before it(d) all of the mentionedI got this question during an interview for a job.Query is from Virtual Memory in section The Linux System of Operating System |
|
Answer» Right CHOICE is (B) the time of that page’s LAST use |
|
| 32. |
Optimal page – replacement algorithm is difficult to implement, because ____________(a) it requires a lot of information(b) it requires future knowledge of the reference string(c) it is too complex(d) it is extremely expensiveI got this question in a national level competition.Question is from Virtual Memory in portion The Linux System of Operating System |
|
Answer» Correct option is (B) it requires FUTURE KNOWLEDGE of the reference string |
|
| 33. |
What is the Optimal page – replacement algorithm?(a) Replace the page that has not been used for a long time(b) Replace the page that has been used for a long time(c) Replace the page that will not be used for a long time(d) None of the mentionedI got this question at a job interview.My question comes from Virtual Memory topic in chapter The Linux System of Operating System |
|
Answer» The correct choice is (c) Replace the page that will not be USED for a long time |
|
| 34. |
A FIFO replacement algorithm associates with each page the _______(a) time it was brought into memory(b) size of the page in memory(c) page after and before it(d) all of the mentionedThis question was addressed to me during an internship interview.The doubt is from Virtual Memory in section The Linux System of Operating System |
|
Answer» The correct ANSWER is (a) time it was BROUGHT into memory |
|
| 35. |
The aim of creating page replacement algorithms is to ____________(a) replace pages faster(b) increase the page fault rate(c) decrease the page fault rate(d) to allocate multiple pages to processesI have been asked this question in my homework.This interesting question is from Virtual Memory in chapter The Linux System of Operating System |
|
Answer» RIGHT OPTION is (C) decrease the PAGE FAULT rate The explanation is: None. |
|
| 36. |
When a page is selected for replacement, and its modify bit is set ____________(a) the page is clean(b) the page has been modified since it was read in from the disk(c) the page is dirty(d) the page has been modified since it was read in from the disk & page is dirtyThis question was addressed to me in an interview for job.Enquiry is from Virtual Memory in portion The Linux System of Operating System |
|
Answer» Right OPTION is (d) the page has been modified SINCE it was read in from the DISK & page is dirty |
|
| 37. |
If no frames are free, _____ page transfer(s) is/are required.(a) one(b) two(c) three(d) fourThis question was addressed to me at a job interview.My question is from Virtual Memory topic in chapter The Linux System of Operating System |
|
Answer» RIGHT CHOICE is (B) two Explanation: NONE. |
|
| 38. |
Users _______ that their processes are running on a paged system.(a) are aware(b) are unaware(c) may unaware(d) none of the mentionedThe question was posed to me in exam.This question is from Virtual Memory topic in section The Linux System of Operating System |
|
Answer» RIGHT OPTION is (B) are unaware Easiest EXPLANATION - NONE. |
|
| 39. |
A memory page containing a heavily used variable that was initialized very early and is in constant use is removed, then the page replacement algorithm used is ____________(a) LRU(b) LFU(c) FIFO(d) None of the mentionedI got this question in an interview.I'm obligated to ask this question of Virtual Memory in division The Linux System of Operating System |
| Answer» | |
| 40. |
In question 2, if the number of page frames is increased to 4, then the number of page transfers ____________(a) decreases(b) increases(c) remains the same(d) none of the mentionedI have been asked this question in semester exam.This intriguing question originated from Virtual Memory in chapter The Linux System of Operating System |
| Answer» | |
| 41. |
A process refers to 5 pages, A, B, C, D, E in the order : A, B, C, D, A, B, E, A, B, C, D, E. If the page replacement algorithm is FIFO, the number of page transfers with an empty internal store of 3 frames is?(a) 8(b) 10(c) 9(d) 7The question was asked in semester exam.My doubt is from Virtual Memory in chapter The Linux System of Operating System |
|
Answer» CORRECT OPTION is (C) 9 Best EXPLANATION: NONE. |
|
| 42. |
Which of the following page replacement algorithms suffers from Belady’s Anomaly?(a) Optimal replacement(b) LRU(c) FIFO(d) Both optimal replacement and FIFOThe question was asked in an interview for job.This intriguing question comes from Virtual Memory in portion The Linux System of Operating System |
|
Answer» CORRECT CHOICE is (C) FIFO Easiest EXPLANATION - NONE. |
|
| 43. |
Locality of reference implies that the page reference being made by a process ____________(a) will always be to the page used in the previous page reference(b) is likely to be one of the pages used in the last few page references(c) will always be one of the pages existing in memory(d) will always lead to page faultsThis question was addressed to me by my school teacher while I was bunking the class.This key question is from Virtual Memory in portion The Linux System of Operating System |
|
Answer» Correct answer is (b) is LIKELY to be one of the pages USED in the last few page references |
|
| 44. |
When the page fault rate is low ____________(a) the turnaround time increases(b) the effective access time increases(c) the effective access time decreases(d) turnaround time & effective access time increasesI have been asked this question during an internship interview.Query is from Virtual Memory in portion The Linux System of Operating System |
|
Answer» CORRECT CHOICE is (C) the effective ACCESS time decreases Explanation: None. |
|
| 45. |
If the memory access time is denoted by ‘ma’ and ‘p’ is the probability of a page fault (0 |
|
Answer» The CORRECT option is (c) (1-p) X ma + p x PAGE fault time |
|
| 46. |
When a process begins execution with no pages in memory?(a) process execution becomes impossible(b) a page fault occurs for every page brought into memory(c) process causes system crash(d) none of the mentionedI got this question in an online interview.My question is from Virtual Memory in portion The Linux System of Operating System |
|
Answer» Correct answer is (B) a page fault OCCURS for EVERY page BROUGHT into memory |
|
| 47. |
When a page fault occurs, the state of the interrupted process is ____________(a) disrupted(b) invalid(c) saved(d) none of the mentionedThe question was asked in an interview.Query is from Virtual Memory topic in section The Linux System of Operating System |
|
Answer» The CORRECT answer is (C) saved |
|
| 48. |
A page fault occurs when?(a) a page gives inconsistent data(b) a page cannot be accessed due to its absence from memory(c) a page is invisible(d) all of the mentionedThe question was posed to me in an internship interview.I'd like to ask this question from Virtual Memory in section The Linux System of Operating System |
|
Answer» RIGHT CHOICE is (b) a page cannot be accessed due to its absence from memory To explain I WOULD SAY: None. |
|
| 49. |
The valid – invalid bit, in this case, when valid indicates?(a) the page is not legal(b) the page is illegal(c) the page is in memory(d) the page is not in memoryI had been asked this question in quiz.This intriguing question originated from Virtual Memory topic in chapter The Linux System of Operating System |
|
Answer» CORRECT CHOICE is (C) the PAGE is in memory Explanation: NONE. |
|
| 50. |
Using a pager ____________(a) increases the swap time(b) decreases the swap time(c) decreases the swap time & amount of physical memory needed(d) increases the amount of physical memory neededI had been asked this question during an online interview.I'd like to ask this question from Virtual Memory topic in division The Linux System of Operating System |
|
Answer» Correct ANSWER is (c) DECREASES the swap TIME & amount of PHYSICAL memory needed |
|