A) Managing stack pointers for dynamic local variables B) Preallocating memory chunks for specific object types or sizes C) Automatically garbage collecting unused heap objects D) Allocating memory exclusively for static global variables
A) A POSIX standard memory routine B) A temporary stack pointer adjustment C) A garbage collection pool D) A preallocated chunk of memory
A) The memory fragment is compressed B) The slot is added back to the free list C) The stack pointer is decremented D) The memory is immediately returned to the OS
A) It never requires free lists B) It uses hardware acceleration C) It automatically ignores object types D) It eliminates the need to search for suitable memory portions
A) It increases the depth of recursion B) It ensures memory is never overwritten C) It alleviates memory fragmentation D) It prevents all types of stack overflows
A) Dynamic stack memory allocation B) Compacting memory fragments C) Managing static heap memory D) Automatic garbage collection
A) A complex garbage collection routine B) A heap-based allocation library C) Inlined instructions manipulating the stack pointer D) A standard system call managed by the OS kernel
A) When the calling function returns B) When the manual free function is called C) When the garbage collector runs D) When the program reaches the heap limit
A) Memory leakage in the garbage collector B) Heap fragmentation C) Excessive cache misses D) Stack overflow
A) Only in Windows-specific headers B) No C) Yes D) Only in POSIX standards
A) stack_malloc B) mem_guard C) _malloca D) alloca_safe
A) free_stack B) release_mem C) _free_alloca D) _freea
A) It ignores the allocation request B) It delegates to malloc C) It crashes the application immediately D) It throws an SEH exception
A) A variable stored in the global data segment B) A heap-allocated object handled by garbage collection C) A non-static local variable of a subroutine D) A variable managed by manual memory allocation
A) The register file B) The call stack C) The static data segment D) The heap
A) The automatic allocation of local variables B) The slab allocation mechanism C) Garbage collection algorithms D) Manual memory management
A) It prevents programmers from using recursion B) It creates stack overflows C) It requires manual allocation calls D) It can compete with the application for processor time
A) Managing stack pointer arithmetic B) Preallocating chunks for specific object sizes C) Detecting and reclaiming unusable objects D) Allocating memory for local subroutine variables
A) It automatically detects unusable memory B) It uses a stack pointer for all operations C) It requires the programmer to explicitly release memory D) It is not used in any modern programming language
A) It is no longer a relevant concern for software developers B) It is only a problem for assembly programmers C) It is a difficult problem D) It is easily solved by hardware
A) Multiple processes run simultaneously B) It reduces the need for storage C) It prevents hardware crashes D) It speeds up network communication
A) Android B) Linux C) Unix-like systems D) Burroughs/Unisys MCP
A) Paging B) Chunking C) Swapping D) Caching
A) Outstanding allocations B) Disk partition sizes C) User login attempts D) The system clock
A) 52 B) 28 C) 42 D) 64
A) Reduced overhead improves performance B) It handles large objects efficiently C) It eliminates all fragmentation D) It uses less total system memory
A) Simple embedded systems B) Massive supercomputer clusters C) Virtual machine environments D) General purpose operating systems
A) The kernel instruction path B) The total system pool C) A list of all free pointers D) Its buddy
A) They are deleted from memory B) They are moved to a fixed-size list C) They are split into smaller units D) They are combined
A) A random block B) Largest available block C) The first block in the free list D) Smallest sufficiently large block
A) By increasing the counter manually B) By disabling the pointer check C) By using only primary storage D) By using weak references
A) The application's logic B) The physical hardware C) The operating system kernel D) The CPU registers
A) The secondary storage controller B) The physical hardware C) The compiler D) The user
A) A reference that always points to null B) A reference that is only used in primary storage C) A reference that does not participate in reference counting D) A reference that cannot be translated to a physical address
A) Cache memory B) The memory management unit C) Additional CPU registers D) Extra space on a peripheral device
A) Paging B) Overlaying C) Swapping D) Segmentation
A) 1955 B) 1971 C) 1951 D) 1961
A) Pages B) Sectors C) Clusters D) Segments
A) Segment descriptor B) Memory map C) The MCP kernel D) The overlay register
A) Ada Lovelace B) Charles Babbage C) Donald Knuth D) Alan Turing
A) RAM B) Tape C) Flash D) Disk
A) GETMEM B) FREEMAIN C) GETMAIN D) ALLOCATE
A) 8 KB B) 4 KB C) 2 KB D) 1 KB
A) 250–255 B) 0–15 C) 1–127 D) 0–255
A) 0–255 B) 250–255 C) 0–127 D) 128–255
A) MFT B) PCP C) MVT D) OS/VS2
A) 1 KiB B) 4 KiB C) 2 KB D) 8 KiB
A) Common Storage Area (CSA) B) Local System Queue Area (LSQA) C) System Work area (SWA) D) System Queue Area (SQA)
A) 0–3 B) 8–15 C) 0–7 D) 0–15
A) Subpool sets B) Virtual pages C) Fixed partitions D) Single partition
A) FREEMAIN B) DEALLOCATE C) RELEASE D) GETMAIN
A) The number of subpools B) The supervisor key C) The region size D) The page size
A) Setting protection keys B) Managing virtual memory C) Redefining partitions D) Assigning subpools
A) System Work area (SWA) B) Common Storage Area (CSA) C) Local System Queue Area (LSQA) D) System Queue Area (SQA) |