Computer Memory and Storage

Components in Delphi must be dynamically allocated on the heap because they have lifetimes that extend beyond the function scope and need flexible memory management. The stack is for local variables with automatic lifetimes, registers are CPU storage, and floppy/compact disk are storage media unrelated to runtime memory allocation. Components are created with constructor calls and explicitly freed.

Array elements are stored in consecutive memory locations, enabling efficient address calculation. By knowing the base address (first element's location) and element size, the computer can directly compute any element's address using simple arithmetic: base_address + (index × element_size).

VSAM clusters with ONLY fixed-length records are RRDS (Relative Record Dataset) and LDS (Linear Dataset). RRDS organizes records by relative record numbers and requires fixed length. The question asks which cluster supports only fixed length, and RRDS is the standard answer taught in mainframe curricula.

VSAM processing options are determined in priority order: catalog entries first (highest priority), then program specifications, then JCL specifications (lowest priority). This hierarchy allows flexible override of defaults - catalog defines baseline, program can override, JCL can override both.

VSAM processing options can be defined globally in the catalog definition, overridden or specified at runtime via the AMP parameter in the JCL DD statement, or dynamically configured programmatically inside the program's control blocks such as the Access Control Block (ACB) and Request Parameter List (RPL).

A variable P is called a pointer if it contains the address of an element in DATA. Option A correctly states this fundamental definition - pointers store memory addresses, not the data itself. Option B is incorrect because pointers can point to any element, not just the first. Option C is too restrictive. Option D is wrong because pointers store addresses, not both data and addresses.

The memory address of the very first element of an array is known as the base address, which is used as the starting reference point to calculate the addresses of subsequent elements. Other terms like floor, foundation, or first address are incorrect terminology.

Lotus Notes creates 2 local archive databases by default: one for the active mail archive and one as a template or backup archive. This standard configuration allows users to maintain current and historical archives while providing a foundation for additional custom archives. Users can create more archives manually, but the default installation establishes this two-archive structure.

cache.ndk is the Lotus Notes design cache file that stores cached design elements of databases from replicas to improve performance. The workspace cache is represented by desktop8.ndk, and bookmark information is stored in bookmark.nsf.

Swapping is a memory management technique where the entire process is moved between main memory and secondary storage (disk). Processes take turns using memory - when one process is swapped out to disk, another can be swapped in and use that memory space. It doesn't work with many small partitions (that's paging), doesn't allow simultaneous use (processes alternate), and can actually complement overlaying by extending its principles.

SCANDISK is a disk diagnostic and repair utility in MS-DOS and Windows that scans for and fixes disk errors, including bad sectors, file system problems, and cross-linked files. FDisk partitions disks but doesn't fix errors.

Virtual storage allows programs to use more memory than physically available by combining real storage with auxiliary storage like disk. Options A, B, and D describe true characteristics of virtual storage. Option C is NOT true because virtual storage specifically allows processors to access a larger simulated amount of storage than what physically exists.

DASD (Direct Access Storage Device), such as disk drives, forms the cornerstone of mainframe storage hierarchy by providing online, direct-access storage. While tapes are used for archival, and CPU cache and central storage are volatile, DASD provides the primary persistent storage layer.

Gather is a de-partitioning component that collects data from multiple partitions and consolidates it into a single partition. This is the opposite of partitioning operations (like Partition by Key) that split data across partitions, making it the correct answer.

Gather is a de-partitioning component because it collects data from multiple partitioned flows and reunites them into a single flow. The opposite operation is partitioning (by key, round robin, etc.). Components like Partition by key and Join are partitioning operations, not de-partitioning.