For each question, answer only the ones that are false, justifying why in detail. 1. The overlay technique aims to make

[answerhappygod]

For each question, answer only the ones that are false,justifying why in detail.
1. The overlay technique aims to make two programs run,alternately in the same real memory space.2. In the fixed partition scheme, each memory partition has its ownmemory queue.scaling.3. In the fixed partition scheme, you can make programs run onfixed partitions.different using the relocatable translation and loading technique.In this technique theProgram text includes an address table.4. The real-memory variable partition scheme invites inmulti-partitionspredetermined sizes to better accommodate size programswith less internal fragmentation.5. The worst fit allocation technique was so called because it isconsidereduniversally bad. The best technique is always the so-called Bestfit.
6. In the “buddy system” scheme for free-list administration inreal memory, theFree areas all have sizes that are powers of 2.7. In real memory swapping, programs can enter and exitmemoryto maximize the use of system resources.8. In virtual memory schemes a program does not need to becontiguous in thememory.9. In simple paging schemes the overhead for using virtual memoryis oneaccess and an extra sum.10. TLB is a technique of caches inside the processor that decreasethe time ofaccessing values ​​in memory.11. In pure segmented schemes we can do the logical division ofblocks ofprogram code, but this creates an external fragmentationproblem.12. In simple paging schemes the division of programs is by blocksoffixed size, this creates an internal fragmentation problem.13. Segmentation schemes create natural spaces for sharing,potentially decreasing real memory usage on systems with manyusers.14. In segmented pagination schemes we can divide groups ofpages intological segments, but we have the disadvantage of having internalfragmentation andexternal.15. In modern virtual memory systems the average overhead formemory usagevirtual is just a few cycles. This is due to special processingtechniquesdirectly inside the memory chip, performing memory-to-memoryoperations invery reduced time.16. TLBs optimize the use of virtual memory, but unfortunately theyare only applied inpaged memories. This determined the end of pure segmented virtualmemory.17. With the increase in the size of virtual memories, it isnecessary that allprograms share only one virtual memory. This prevents the tablefromblocks take up excessive memory space.18. Placement strategies in pure segmented memories are thesamefound in real memory systems with variable partitions.19. When we expect the principle of locality to apply, it makes nosense toblock pre-fetching strategies (block load anticipation).20. Page replacement strategies attempt to choose from among theresident pages ofmemory, which is least likely to be used in the near future. Incasegeneral it is impossible to guarantee this.