Across
- 2. → The part of memory where unneeded processes are temporarily moved.
- 5. → A process where memory occupied by a terminated process is released.
- 6. → A contiguous block of unused memory within allocated space.
- 10. → The actual location in RAM where data is stored.
- 11. → Memory allocated when a process is created.
- 15. → A hardware component that handles memory address translation.
- 16. → A fixed-size block of physical memory used in paging.
- 17. → A problem where small free memory spaces remain fragmented and cannot be used.
- 19. → The operating system’s process of relocating memory to remove fragmentation.
- 22. → A memory allocation system that divides memory into variable-sized partitions.
- 23. → A technique to manage frequently used memory allocations efficiently.
- 25. → The part of memory used to temporarily hold process data.
- 26. → An address generated by the CPU before translation to a physical address.
- 28. → A memory management technique allowing execution of programs larger than physical memory.
- 33. → Assigning new memory to a running process when needed.
- 35. → A fixed portion of memory allocated to a process.
- 36. → A data structure often used to track free and allocated memory blocks.
- 38. → A type of fragmentation occurring when small memory blocks remain unused inside a partition.
- 40. → The minimum amount of memory required by a job.
- 42. → A page replacement algorithm that removes the least recently accessed page.
- 44. → A contiguous block of memory allocated to a process.
- 45. → Memory blocks not allocated to any process.
- 46. → The process of reclaiming memory no longer in use.
- 47. → The part of memory storing instructions waiting for execution.
- 48. → The portion of a process currently in physical memory.
- 49. → A system that loads a page only when it is needed.
- 50. → The maximum amount of memory a job can be allocated.
- 51. → A scheme that allocates memory only as needed.
- 52. → The portion of memory used for function call execution.
Down
- 1. → A memory allocation method that places a job in the smallest available partition that can fit it.
- 3. → A method of splitting memory into equal-sized sections.
- 4. → A memory allocation strategy that places processes in the largest available block.
- 7. → Memory with multiple small free spaces that are difficult to use efficiently.
- 8. → A method where the operating system dynamically allocates memory partitions.
- 9. → The first memory partition large enough to accommodate a process is chosen.
- 12. → The continuous merging of adjacent free memory blocks.
- 13. → A memory management method where a process is assigned consecutive memory blocks.
- 14. → The memory segment used for storing dynamically allocated variables.
- 18. → A structure mapping virtual memory addresses to physical memory addresses.
- 20. → The method used to divide a program into smaller blocks that fit memory.
- 21. → The part of memory where actively used data and instructions reside.
- 24. → A type of fragmentation caused by unused space outside allocated partitions.
- 27. → A memory allocation method where memory is divided into blocks of fixed size.
- 29. → A condition where excessive paging reduces performance.
- 30. → A situation where a program fails to release unused memory.
- 31. → An event triggered when a process accesses a page not in memory.
- 32. → A memory scheme that assigns jobs to fixed partitions.
- 34. → A structure that stores details about memory segments in segmentation.
- 37. → A strategy used when a requested page is not in memory and a new page must be loaded.
- 39. → Adjusting memory addresses to fit a program into available memory.
- 41. → A process moving jobs between RAM and disk.
- 43. → Memory allocation strategy that assigns an entire segment of a program to a location.