Data Structures & Algorithms Flashcards

Informatica Cloud's data masking transformation replaces sensitive values using a substitution dictionary. Which data structure gives the fastest substitution lookup?

Answer: Hash map

A hash map provides O(1) average-case lookup, making it the fastest structure for substituting sensitive values from a pre-built dictionary.

In Informatica Cloud, when flattening a deeply nested JSON array into relational rows, which recursive algorithm pattern is applied?

Answer: Depth-first traversal with a call stack

Depth-first traversal using a call stack recurses into each nested array level before moving to siblings, naturally flattening the hierarchy.

What is the space complexity of a recursive DFS algorithm used to traverse an Informatica Cloud mapping DAG with V vertices and E edges?

Answer: O(V) for the call stack

Recursive DFS uses a call stack proportional to the depth of the DAG, which in the worst case is O(V) for a linear chain of vertices.

Informatica Cloud's incremental load strategy compares new records against existing ones using a sorted merge. This approach avoids which common performance pitfall?

Answer: O(n²) nested-loop comparisons

A naive nested-loop comparison of every new record against every existing record yields O(n²) complexity; sorted merge reduces this to O(n log n).

Which algorithm is used internally when Informatica Cloud auto-generates a topological execution order for transformation stages in a mapping?

Answer: Kahn's algorithm (topological sort via BFS)

Kahn's algorithm performs a topological sort using BFS and in-degree tracking, producing a valid stage execution order for a DAG-based mapping.

In Informatica Cloud, a rank transformation returns the top-k records from a large dataset. Which data structure minimizes memory usage while maintaining the top-k candidates?

Answer: Min-heap of size k

A min-heap of size k evicts the smallest element whenever a larger one arrives, keeping only the k largest records in O(n log k) time and O(k) space.

When Informatica Cloud detects a cycle in a mapping graph (which is invalid), which algorithm is typically used to report the cycle?

Answer: DFS with back-edge detection

DFS detects cycles by tracking visited states; a back edge (revisiting a node already on the current path) confirms a cycle exists in the mapping.