Data Structures and Algorithms

In Ruby, the index method (also called find_index) returns the position of the first occurrence of the specified element in the array. For days.index("Saturday"), this would return 5 (zero-indexed) or 6 (one-indexed position), which is the correct way to find an element's index.

Without seeing the actual structure code, based on the correct answer being 'A list of hashes which contains a list', this describes a Perl data structure where you have an outer array (list), each element is a hashref, and each hash contains a key whose value is an arrayref (list). This is common in Perl for representing structured data like database query results or nested configurations.

Vector insertions or deletions at arbitrary positions require shifting all subsequent elements to maintain contiguous storage. In the worst case, this means moving N-1 elements, resulting in O(N) time complexity.

The correct answer is A (Binary Search). When the number of records is large and the input is already sorted, binary search is the most efficient with O(log n) time complexity. Sequential search has O(n) complexity and becomes very slow for large datasets. Binary search repeatedly divides the search interval in half, making it exponentially faster than linear search for sorted data.

The correct answer is A (Using Index to access). In COBOL and similar languages, accessing array elements using an index is more efficient than using subscripts. Indexes use binary addressing and direct memory access, while subscripts may require additional calculations or conversions. For performance-critical code involving repeated array access, index-based access is the preferred method.

Java arrays are statically typed - an array is declared to hold a specific type (like int[], String[]) and cannot hold mixed types. To store different types, you would need an array of Object or use a Collection.

Merge Sort, Quick Sort, and Bubble Sort are all sorting algorithms. Binary search is a search algorithm for finding elements in sorted arrays, not a sorting algorithm.

Merge Sort has O(n log n) average and worst-case time complexity because it divides the array in half recursively (log n levels) and merges n elements at each level. Selection Sort, Bubble Sort, and Insertion Sort are all O(n^2).

Divide and conquer algorithms recursively break problems into smaller subproblems, solve them independently, and combine results. Merge Sort divides array into halves then merges. Quick Sort partitions around a pivot and recursively sorts partitions.

Merge Sort, Selection Sort, and Bubble Sort all compare elements to determine ordering. Radix Sort processes individual digits/buckets and doesn't compare elements directly, making it non-comparison based.

In nested loops, the innermost loop executes the most times because it completes all its iterations for each iteration of every outer loop. For example, in loops with 3, 4, and 5 iterations, the innermost runs 3×4×5=60 times.

Direct record access is fastest because it uses a direct database key to locate records without requiring navigation through sets or index lookups. This provides the most efficient path to the data.

In Perl, the sort function is non-destructive and returns the sorted list without modifying the original array in-place. Because the return value is discarded, @array remains unchanged as 10 30 20. Distractors assume in-place sorting or numerical conversion.