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