HDPCD 無料問題集「Hortonworks Data Platform Certified Developer」

（A）mXn (i.e., m multiplied by n)

（B）n

（C）mn (i.e., m to the power of n)

（D）m+n (i.e., m plus n)

（E）m

（A）Scheduler

（B）Job Tracker

（C）Applications Manager

（D）Task Tracker

（A）Combine

（B）IdentityReducer

（C）IdentityMapper

（D）Speculative Execution

（E）Default Partitioner

（A）The JobTracker spawns a new Mapper to process all records in a single file.

（B）The JobTracker calls the TaskTracker's configure () method, then its map () method and finally its close () method.

（C）The TaskTracker spawns a new Mapper to process all records in a single input split.

（D）The TaskTracker spawns a new Mapper to process each key-value pair.

（A）Large-scale graph algorithms that require one-step link traversal.

（B）Algorithms that require applying the same mathematical function to large numbers of
individual binary records.

（C）Text analysis algorithms on large collections of unstructured text (e.g, Web crawls).

（D）Algorithms that require global, sharing states.

（E）Relational operations on large amounts of structured and semi-structured data.

（A）Accepts only data that is defined by metadata tables stored in a database

（B）Accepts only data that has a key/value pair structure

（C）Accepts tab-delimited text data only

（D）Accepts any data: structured or unstructured

（E）Accepts data whether it has metadata or not

（A）Sequences of MapReduce job only; on Pig on Hive tasks or jobs. These MapReduce sequences can be combined with forks and path joins.

（B）Iterntive repetition of MapReduce jobs until a desired answer or state is reached.

（C）Sequences of MapReduce and Pig. These sequences can be combined with other actions including forks, decision points, and path joins.

（D）Sequences of MapReduce and Pig jobs. These are limited to linear sequences of actions with exception handlers but no forks.

（A）Combining

（B）Shuffling and sorting

（C）Reducing

（D）Partitioning

（A）64

（B）200

（C）640

（D）100

（A）Flume

（B）Hadoop Streaming

（C）Oozie

（D）mapred

（E）Sqoop