ICC Data Structures & Algorithms 5

Question 1

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

Accepted Answer

Hash map

Answer

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

Question 2

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

Accepted Answer

Depth-first traversal with a call stack

Answer

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

Question 3

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

Accepted Answer

O(V) for the call stack

Answer

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.

Question 4

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

Accepted Answer

O(n²) nested-loop comparisons

Answer

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).

Question 5

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

Accepted Answer

Kahn's algorithm (topological sort via BFS)

Answer

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

(ICC) Informatica Cloud Certification Practice Test

(ICC) Informatica Cloud Certification Practice Test

ICC Data Structures & Algorithms 5