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. |
A multilevel page table is preferred in comparison to a single level page table for translating virtual address to physical address because ____________(a) it reduces the memory access time to read or write a memory location(b) it helps to reduce the size of page table needed to implement the virtual address space of a process(c) it is required by the translation lookaside buffer(d) it helps to reduce the number of page faults in page replacement algorithmsThis question was posed to me in unit test.My query is from Memory Management in chapter Memory Management of Operating System |
|
Answer» Right answer is (B) it helps to reduce the size of page table NEEDED to IMPLEMENT the virtual address space of a process |
|
| 2. |
Consider a computer with 8 Mbytes of main memory and a 128K cache. The cache block size is 4 K. It uses a direct mapping scheme for cache management. How many different main memory blocks can map onto a given physical cache block?(a) 2048(b) 256(c) 64(d) 8I got this question during an interview.This question is from Memory Management in chapter Memory Management of Operating System |
|
Answer» The CORRECT OPTION is (C) 64 |
|
| 3. |
If there are 32 segments, each of size 1Kb, then the logical address should have ____________(a) 13 bits(b) 14 bits(c) 15 bits(d) 16 bitsI had been asked this question in an online quiz.The query is from Memory Management in division Memory Management of Operating System |
|
Answer» The correct option is (a) 13 bits |
|
| 4. |
The protection bit is 0/1 based on ____________(a) write only(b) read only(c) read – write(d) none of the mentionedThe question was posed to me in semester exam.Question is from Memory Management in portion Memory Management of Operating System |
|
Answer» CORRECT option is (C) READ – write Easy explanation - NONE. |
|
| 5. |
When the entries in the segment tables of two different processes point to the same physical location ____________(a) the segments are invalid(b) the processes get blocked(c) segments are shared(d) all of the mentionedThe question was posed to me in my homework.I need to ask this question from Memory Management in portion Memory Management of Operating System |
|
Answer» The CORRECT OPTION is (C) SEGMENTS are shared |
|
| 6. |
If the offset is legal ____________(a) it is used as a physical memory address itself(b) it is subtracted from the segment base to produce the physical memory address(c) it is added to the segment base to produce the physical memory address(d) none of the mentionedThis question was posed to me during an interview for a job.This interesting question is from Memory Management in section Memory Management of Operating System |
|
Answer» Right CHOICE is (a) it is used as a physical memory ADDRESS itself |
|
| 7. |
The offset ‘d’ of the logical address must be ____________(a) greater than segment limit(b) between 0 and segment limit(c) between 0 and the segment number(d) greater than the segment numberI have been asked this question in unit test.My query is from Memory Management in section Memory Management of Operating System |
|
Answer» The CORRECT ANSWER is (b) between 0 and SEGMENT limit |
|
| 8. |
The segment limit contains the ____________(a) starting logical address of the process(b) starting physical address of the segment in memory(c) segment length(d) none of the mentionedI got this question in a job interview.Origin of the question is Memory Management topic in portion Memory Management of Operating System |
|
Answer» The correct answer is (c) segment length |
|
| 9. |
The segment base contains the ____________(a) starting logical address of the process(b) starting physical address of the segment in memory(c) segment length(d) none of the mentionedThis question was posed to me during an interview.The origin of the question is Memory Management topic in portion Memory Management of Operating System |
|
Answer» The CORRECT choice is (b) STARTING physical address of the SEGMENT in memory |
|
| 10. |
Each entry in a segment table has a ____________(a) segment base(b) segment peak(c) segment value(d) none of the mentionedThe question was posed to me in an interview.I want to ask this question from Memory Management topic in portion Memory Management of Operating System |
|
Answer» CORRECT ANSWER is (a) SEGMENT base Easy EXPLANATION - NONE. |
|
| 11. |
In paging the user provides only ________ which is partitioned by the hardware into ________ and ______(a) one address, page number, offset(b) one offset, page number, address(c) page number, offset, address(d) none of the mentionedI got this question in an international level competition.My enquiry is from Memory Management topic in chapter Memory Management of Operating System |
|
Answer» Correct ANSWER is (a) one ADDRESS, page number, offset |
|
| 12. |
In segmentation, each address is specified by ____________(a) a segment number & offset(b) an offset & value(c) a value & segment number(d) a key & valueThe question was posed to me in class test.Query is from Memory Management topic in portion Memory Management of Operating System |
|
Answer» Correct OPTION is (a) a SEGMENT NUMBER & offset |
|
| 13. |
In paged memory systems, if the page size is increased, then the internal fragmentation generally ____________(a) becomes less(b) becomes more(c) remains constant(d) none of the mentionedThe question was asked in class test.I need to ask this question from Memory Management topic in division Memory Management of Operating System |
|
Answer» RIGHT CHOICE is (b) BECOMES more To EXPLAIN I WOULD say: None. |
|
| 14. |
To obtain better memory utilization, dynamic loading is used. With dynamic loading, a routine is not loaded until it is called. For implementing dynamic loading ____________(a) special support from hardware is required(b) special support from operating system is essential(c) special support from both hardware and operating system is essential(d) user programs can implement dynamic loading without any special support from hardware or operating systemThis question was addressed to me during an interview for a job.The query is from Memory Management topic in division Memory Management of Operating System |
|
Answer» The correct OPTION is (d) user PROGRAMS can implement dynamic LOADING without any special support from hardware or operating system |
|
| 15. |
In a paged memory, the page hit ratio is 0.35. The required to access a page in secondary memory is equal to 100 ns. The time required to access a page in primary memory is 10 ns. The average time required to access a page is?(a) 3.0 ns(b) 68.0 ns(c) 68.5 ns(d) 78.5 nsThe question was asked during an interview.My question is based upon Memory Management in portion Memory Management of Operating System |
|
Answer» The CORRECT OPTION is (c) 68.5 ns |
|
| 16. |
When there is a large logical address space, the best way of paging would be ____________(a) not to page(b) a two level paging algorithm(c) the page table itself(d) all of the mentionedI got this question by my college director while I was bunking the class.The origin of the question is Memory Management topic in section Memory Management of Operating System |
|
Answer» RIGHT answer is (b) a TWO level paging algorithm Explanation: NONE. |
|
| 17. |
Illegal addresses are trapped using the _____ bit.(a) error(b) protection(c) valid – invalid(d) accessThe question was asked in exam.My question is based upon Memory Management in portion Memory Management of Operating System |
|
Answer» The correct ANSWER is (c) VALID – invalid |
|
| 18. |
When the valid – invalid bit is set to valid, it means that the associated page ____________(a) is in the TLB(b) has data in it(c) is in the process’s logical address space(d) is the system’s physical address spaceI have been asked this question in an online interview.I'm obligated to ask this question of Memory Management in chapter Memory Management of Operating System |
|
Answer» The correct ANSWER is (C) is in the PROCESS’s LOGICAL address space |
|
| 19. |
Memory protection in a paged environment is accomplished by ____________(a) protection algorithm with each page(b) restricted access rights to users(c) restriction on page visibility(d) protection bit with each pageThe question was asked during a job interview.The above asked question is from Memory Management topic in section Memory Management of Operating System |
|
Answer» The CORRECT ANSWER is (d) PROTECTION BIT with each page |
|
| 20. |
The percentage of times a page number is found in the TLB is known as ____________(a) miss ratio(b) hit ratio(c) miss percent(d) none of the mentionedThe question was asked in an internship interview.My query is from Memory Management topic in chapter Memory Management of Operating System |
|
Answer» RIGHT OPTION is (b) hit ratio Best EXPLANATION: NONE. |
|
| 21. |
An ______ uniquely identifies processes and is used to provide address space protection for that process.(a) address space locator(b) address space identifier(c) address process identifier(d) none of the mentionedThe question was asked in quiz.I'm obligated to ask this question of Memory Management in chapter Memory Management of Operating System |
|
Answer» RIGHT ANSWER is (b) address SPACE identifier The EXPLANATION is: NONE. |
|
| 22. |
If a page number is not found in the TLB, then it is known as a ____________(a) TLB miss(b) Buffer miss(c) TLB hit(d) All of the mentionedThis question was posed to me in an interview.My question is taken from Memory Management topic in section Memory Management of Operating System |
|
Answer» RIGHT OPTION is (a) TLB miss Explanation: NONE. |
|
| 23. |
Each entry in a translation lookaside buffer (TLB) consists of ____________(a) key(b) value(c) bit value(d) constantThis question was addressed to me in exam.Query is from Memory Management in section Memory Management of Operating System |
|
Answer» CORRECT ANSWER is (a) key Easiest EXPLANATION - NONE. |
|
| 24. |
Time taken in memory access through PTBR is ____________(a) extended by a factor of 3(b) extended by a factor of 2(c) slowed by a factor of 3(d) slowed by a factor of 2This question was posed to me during a job interview.The question is from Memory Management topic in division Memory Management of Operating System |
|
Answer» RIGHT CHOICE is (d) SLOWED by a FACTOR of 2 Explanation: NONE. |
|
| 25. |
For every process there is a __________(a) page table(b) copy of page table(c) pointer to page table(d) all of the mentionedThe question was asked in an online quiz.My question is from Memory Management in chapter Memory Management of Operating System |
|
Answer» The CORRECT CHOICE is (a) PAGE table |
|
| 26. |
For larger page tables, they are kept in main memory and a __________ points to the page table.(a) page table base register(b) page table base pointer(c) page table register pointer(d) page table baseThe question was asked during an online interview.The question is from Memory Management topic in section Memory Management of Operating System |
|
Answer» CORRECT option is (a) page table BASE register Easy explanation - NONE. |
|
| 27. |
The page table registers should be built with _______(a) very low speed logic(b) very high speed logic(c) a large memory space(d) none of the mentionedI got this question in an online quiz.This intriguing question comes from Memory Management in section Memory Management of Operating System |
|
Answer» Correct option is (B) very HIGH SPEED logic |
|
| 28. |
Smaller page tables are implemented as a set of _______(a) queues(b) stacks(c) counters(d) registersI got this question during an online interview.This interesting question is from Memory Management in division Memory Management of Operating System |
|
Answer» CORRECT CHOICE is (d) registers The EXPLANATION is: NONE. |
|
| 29. |
Paging increases the ______ time.(a) waiting(b) execution(c) context – switch(d) all of the mentionedI had been asked this question in class test.I would like to ask this question from Memory Management topic in division Memory Management of Operating System |
|
Answer» Correct ANSWER is (C) context – switch |
|
| 30. |
The operating system maintains a ______ table that keeps track of how many frames have been allocated, how many are there, and how many are available.(a) page(b) mapping(c) frame(d) memoryThe question was asked in an interview for internship.Query is from Memory Management topic in division Memory Management of Operating System |
|
Answer» RIGHT CHOICE is (C) frame Best EXPLANATION: NONE. |
|
| 31. |
With paging there is no ________ fragmentation.(a) internal(b) external(c) either type of(d) none of the mentionedI got this question in final exam.This interesting question is from Memory Management topic in division Memory Management of Operating System |
| Answer» | |
| 32. |
If the size of logical address space is 2 to the power of m, and a page size is 2 to the power of n addressing units, then the high order _____ bits of a logical address designate the page number, and the ____ low order bits designate the page offset.(a) m, n(b) n, m(c) m – n, m(d) m – n, nI got this question in exam.I would like to ask this question from Memory Management in section Memory Management of Operating System |
|
Answer» The CORRECT CHOICE is (d) m – N, n |
|
| 33. |
The size of a page is typically ____________(a) varied(b) power of 2(c) power of 4(d) none of the mentionedThe question was posed to me in an interview.This interesting question is from Memory Management in portion Memory Management of Operating System |
|
Answer» Right ANSWER is (B) POWER of 2 |
|
| 34. |
The _____ table contains the base address of each page in physical memory.(a) process(b) memory(c) page(d) frameI had been asked this question by my school principal while I was bunking the class.I would like to ask this question from Memory Management topic in chapter Memory Management of Operating System |
|
Answer» The CORRECT CHOICE is (C) page |
|
| 35. |
The __________ is used as an index into the page table.(a) frame bit(b) page number(c) page offset(d) frame offsetThis question was posed to me in an international level competition.Asked question is from Memory Management in division Memory Management of Operating System |
| Answer» | |
| 36. |
Every address generated by the CPU is divided into two parts. They are ____________(a) frame bit & page number(b) page number & page offset(c) page offset & frame bit(d) frame offset & page offsetI had been asked this question in semester exam.Asked question is from Memory Management in portion Memory Management of Operating System |
|
Answer» CORRECT choice is (b) PAGE number & page offset The EXPLANATION: NONE. |
|
| 37. |
Logical memory is broken into blocks of the same size called _________(a) frames(b) pages(c) backing store(d) none of the mentionedThe question was posed to me in unit test.This intriguing question comes from Memory Management topic in section Memory Management of Operating System |
|
Answer» RIGHT CHOICE is (B) pages Explanation: NONE. |
|
| 38. |
Physical memory is broken into fixed-sized blocks called ________(a) frames(b) pages(c) backing store(d) none of the mentionedI have been asked this question in semester exam.I'm obligated to ask this question of Memory Management topic in division Memory Management of Operating System |
|
Answer» CORRECT CHOICE is (a) frames The BEST EXPLANATION: NONE. |
|
| 39. |
When the memory allocated to a process is slightly larger than the process, then ____________(a) internal fragmentation occurs(b) external fragmentation occurs(c) both internal and external fragmentation occurs(d) neither internal nor external fragmentation occursThis question was posed to me in quiz.Origin of the question is Memory Management topic in division Memory Management of Operating System |
|
Answer» The CORRECT answer is (a) INTERNAL fragmentation occurs |
|
| 40. |
Sometimes the overhead of keeping track of a hole might be ____________(a) larger than the memory(b) larger than the hole itself(c) very small(d) all of the mentionedThis question was addressed to me by my college director while I was bunking the class.My question comes from Memory Management in chapter Memory Management of Operating System |
|
Answer» Right CHOICE is (B) larger than the HOLE itself |
|
| 41. |
External fragmentation will not occur when?(a) first fit is used(b) best fit is used(c) worst fit is used(d) no matter which algorithm is used, it will always occurThis question was addressed to me in unit test.I'd like to ask this question from Memory Management in section Memory Management of Operating System |
|
Answer» The correct choice is (d) no MATTER which ALGORITHM is used, it will ALWAYS occur |
|
| 42. |
External fragmentation exists when?(a) enough total memory exists to satisfy a request but it is not contiguous(b) the total memory is insufficient to satisfy a request(c) a request cannot be satisfied even when the total memory is free(d) none of the mentionedThe question was asked by my school teacher while I was bunking the class.This intriguing question originated from Memory Management in division Memory Management of Operating System |
|
Answer» CORRECT answer is (a) ENOUGH total MEMORY EXISTS to satisfy a request but it is not contiguous To explain: None. |
|
| 43. |
__________ is generally faster than _________ and _________(a) first fit, best fit, worst fit(b) best fit, first fit, worst fit(c) worst fit, best fit, first fit(d) none of the mentionedThe question was asked by my college director while I was bunking the class.This is a very interesting question from Memory Management in portion Memory Management of Operating System |
|
Answer» RIGHT option is (a) FIRST FIT, BEST fit, worst fit The best explanation: None. |
|
| 44. |
The disadvantage of moving all process to one end of memory and all holes to the other direction, producing one large hole of available memory is ____________(a) the cost incurred(b) the memory used(c) the CPU used(d) all of the mentionedI had been asked this question during an interview.Enquiry is from Memory Management topic in chapter Memory Management of Operating System |
|
Answer» The CORRECT CHOICE is (a) the COST incurred |
|
| 45. |
If relocation is static and is done at assembly or load time, compaction _________(a) cannot be done(b) must be done(c) must not be done(d) can be doneThis question was addressed to me in quiz.The above asked question is from Memory Management topic in chapter Memory Management of Operating System |
|
Answer» CORRECT OPTION is (a) cannot be done The EXPLANATION is: NONE. |
|
| 46. |
Another solution to the problem of external fragmentation problem is to ____________(a) permit the logical address space of a process to be noncontiguous(b) permit smaller processes to be allocated memory at last(c) permit larger processes to be allocated memory at last(d) all of the mentionedI got this question in semester exam.My doubt stems from Memory Management in division Memory Management of Operating System |
|
Answer» Right answer is (a) PERMIT the LOGICAL ADDRESS space of a PROCESS to be noncontiguous |
|
| 47. |
A solution to the problem of external fragmentation is ____________(a) compaction(b) larger memory space(c) smaller memory space(d) none of the mentionedThis question was posed to me by my college professor while I was bunking the class.Origin of the question is Memory Management in chapter Memory Management of Operating System |
|
Answer» Correct OPTION is (a) compaction |
|
| 48. |
In internal fragmentation, memory is internal to a partition and ____________(a) is being used(b) is not being used(c) is always used(d) none of the mentionedI have been asked this question during a job interview.My question comes from Memory Management topic in division Memory Management of Operating System |
|
Answer» The CORRECT OPTION is (B) is not being used |
|
| 49. |
The first fit, best fit and worst fit are strategies to select a ______(a) process from a queue to put in memory(b) processor to run the next process(c) free hole from a set of available holes(d) all of the mentionedThe question was posed to me during an interview.Question is from Memory Management in chapter Memory Management of Operating System |
|
Answer» Correct OPTION is (c) FREE hole from a SET of available holes |
|
| 50. |
In fixed size partition, the degree of multiprogramming is bounded by ___________(a) the number of partitions(b) the CPU utilization(c) the memory size(d) all of the mentionedThis question was addressed to me in semester exam.I want to ask this question from Memory Management topic in chapter Memory Management of Operating System |
|
Answer» RIGHT CHOICE is (a) the NUMBER of partitions For EXPLANATION: NONE |
|