ICC Data Structures & Algorithms 4

Question 1

When Informatica Cloud caches lookup data in memory, which collision resolution strategy is most commonly used in the underlying hash table?

Accepted Answer

Open addressing with linear probing

Answer

Open addressing with linear probing resolves hash collisions by scanning sequentially for the next open slot, keeping data in contiguous memory.

Question 2

What is the time complexity of inserting a new record into a balanced binary search tree used for sorted output in an Informatica transformation?

Accepted Answer

O(log n)

Answer

A balanced BST maintains height O(log n), so each insertion requires at most O(log n) comparisons to find the correct position.

Question 3

In Informatica Cloud, an expression transformation processes each row independently. This row-level operation is analogous to which algorithmic paradigm?

Accepted Answer

Map (apply a function to each element)

Answer

Applying a transformation expression to each row independently mirrors the map paradigm, which applies a function element-by-element without aggregation.

Question 4

Which property of a linked list makes it more suitable than an array for Informatica Cloud dynamic schema mappings where columns are added at runtime?

Accepted Answer

O(1) insertion without shifting elements

Answer

Linked lists allow O(1) insertion at any position without shifting elements, unlike arrays that require O(n) shifting when inserting mid-sequence.

Question 5

An Informatica Cloud aggregator transformation must compute the median of a streaming dataset. Which pair of data structures achieves O(log n) insert and O(1) median retrieval?

Accepted Answer

Max-heap and min-heap

Answer

Maintaining a max-heap for the lower half and a min-heap for the upper half allows O(log n) insertion and O(1) median access via the tops of each heap.

(ICC) Informatica Cloud Certification Practice Test

(ICC) Informatica Cloud Certification Practice Test

ICC Data Structures & Algorithms 4