Get real C2090-421 exam questions for better preparation

IBM C2090-421 Exam Overview:

IBM C2090-421 Exam Syllabus Topics:

IBM InfoSphere DataStage v8.5 Sample Questions:

1. Click the exhibit button.

You submit a job from DataStage Director and then log onto your DataStage Linux server to issue the command "ps -ef | grep ds" and receive the following screen: Which process is a player?

A) 7117
B) 7216
C) 7215
D) 7217

2. Which two statements are true about DataStage Parallel Build stages? (Choose two.)

A) The Build stage can be programmed to read and write automatically or code can be written to manually read and write rows.
B) On the Logic Post-Loop, you specify code that runs after all input records have been processed.
C) Build stages can only be used in a job that has Runtime Column Propagation (RCP) enabled.
D) The Build stage generates a C/C++ source file that is compiled and linked outside of DataStage.

3. Which two properties can be set to read a fixed width sequential file in parallel? (Choose two.)

A) Set the Execution mode to "Parallel".
B) Set the "Read from Multiple Nodes" optional property to a value greater than 1.
C) Set the "Number of Readers Per Node" optional property to a value greater than 1.
D) Set Read Method to "File Pattern".

4. A customer is complaining of poor performance from the job shown in the exhibit, which aggregates and joins on ZIP code. Currently all partitioning is set to "Auto" and sort/partition insertion is allowed.

What would give the best performance improvement for the job?

A) Hash partition and sort on ZIP code prior to the Copy stage, and use same partitioning on the Aggregator and Join stages.
B) Hash partition and sort on ZIP code prior to the Copy stage and use entire partitioning on the output of the Aggregator stage.
C) Hash partition and sort on ZIP code on the input links to the Aggregator and Join stages.
D) Use same partitioning on all input links in the job; create the input data set by hash-partitioning its input on ZIP code.

5. Click the Exhibit button.

These three Sequential Files shown in the exhibit need to be joined. Join_1 is on Columns CustID and OrderID. Join_2 is on CustID and LocationID. What is the most efficient hash partitioning strategy for each link?

A) For LinkA Hash Partition on CustID;
For LinkB Hash Partition on CustID;
For LinkC Same Partition;
For LinkD Hash Partition on CustID.
B) For LinkA Hash Partition on CustID and OrderID; For LinkB Hash Partition on CustID and OrderID; For LinkC Hash Partition on CustID and LocationID; For LinkD Hash Partition on CustID and LocationID.
C) For LinkA Hash Partition on OrderID and CustID; For LinkB Hash Partition on OrderID and CustID; For LinkC Hash Partition on LocationID and CustID; For LinkD Hash Partition on LocationID and CustID.
D) For LinkA Hash Partition on CustID, OrderID and LocationID; For LinkB Hash Partition on CustID, OrderID and LocationID; For LinkC Hash Partition on CustID, OrderID and LocationID; For LinkD Hash Partition on CustID, OrderID and LocationI

Solutions: