Data Structures and Algorithms

DES (Data Encryption Standard) has two primary versions: the original DES and Triple DES (3DES). Triple DES was developed to address DES's vulnerability by applying the cipher three times with different keys, effectively strengthening the encryption.

In Java, 'length' is a public final field of an array object that stores the number of elements. Unlike Strings (which use length()) or Collections (which use size()), arrays use the '.length' property.

The delete() function in Perl removes a key-value pair from a hash. There is no built-in 'unhash' or 'rub' function in Perl, and 'remove' is not a standard Perl function for hash operations.

Active transformations change the number of rows passing through them. The Sorter transformation is active because it changes the row order. In contrast, Expression transformations are passive (same number of input and output rows), and Lookup transformations can be active or passive depending on whether they're connected or unconnected.

Sorting is a resource-intensive operation in data processing (such as Ab Initio). It is costly in terms of temporary disk space and CPU time because it requires comparing and reorganizing all records.

B-tree indexes are ideal for unique columns, reverse key indexes are designed to avoid contention in Oracle Parallel Server (RAC) environments, and bitmap indexes are highly efficient for columns with low cardinality.

PL I permits arrays with up to 15 dimensions and elements can be any data type not just numeric. Array subscripts start at 1 by default, not 0, and arrays are memory structures not directly tied to DB2.

Statement A correctly distinguishes subscript (array occurrence number) from index (byte displacement). Statement B is true - index manipulation requires PERFORM VARYING, SEARCH, or SET statements. Statement C is true - SEARCH/SEARCH ALL require an indexed table. Since A, B, C are all true, 'None of the above' (D) is the correct false statement.

The question asks for classes that store key/value pairs, replace old entries on duplicates, and offer constant-time performance. LinkedHashMap, HashMap, and Hashtable implement the Map interface (storing key/value pairs) and provide constant-time performance. LinkedHashSet, TreeSet, and HashSet are Set implementations, not Maps.

A FIFO queue requires efficient add-at-end and remove-from-front operations. LinkedList provides O(1) for both operations. ArrayList requires O(n) for front removal. LinkedHashMap/LinkedHashSet/TreeMap don't provide queue semantics. Vector has same issues as ArrayList. Option D (LinkedList) is optimal.

SQL GROUP functions (also called aggregate functions) perform calculations on sets of rows and return a single result. AVG, COUNT, MAX, and STDDEV are all GROUP functions that compute statistics across multiple rows. LENGTH, however, is a single-row function that operates on individual string values, not groups. The option 'All the above' is incorrect because it includes LENGTH which doesn't belong to GROUP functions.

With infinite memory, Counting sort achieves O(n + k) time complexity where k is the range of values. Since we have infinite memory and are sorting natural numbers, Counting sort is optimal. Comparison sorts like Merge sort and Heap sort are O(n log n), while Bubble sort is O(n^2).

Merge sort consistently performs at O(n log n) time complexity across all cases - best, average, and worst. This is because it always divides the array in half (log n levels) and merges n elements at each level. The n log n complexity is its fundamental characteristic.