CCD-333 무료 덤프문제 온라인 액세스

Which statement best describes the data path of intermediate key-value pairs (i.e., output of the mappers)?

• A.Intermediate key-value pairs are written to the local disks of the machines running the map tasks, and are then copied to HDFS. Reducers read the intermediate data from HDFS.
• B.Intermediate key-value pairs are written to HDFS. Reducers copy the intermediate data to the local disks of the machines running the reduce tasks.
• C.Intermediate key-value pairs are written to HDFS. Reducers read the intermediate data from HDFS.
• D.Intermediate key-value pairs are written to the local disks of the machines running the map tasks, and then copied to the machine running the reduce tasks.

If you run the word count MapReduce program with m mappers and r reducers, how many output files will you get at the end of the job? And how many key-value pairs will there be in each file? Assume k is the number of unique words in the input files.

• A.There will be m files, each with approximately k/m key-value pairs.
• B.There will be r files, each with approximately k/r key-value pairs.
• C.There will be r files, each with approximately k/m key-value pairs.
• D.There will be m files, each with exactly k/m key value pairs.
• E.There will be r files, each with exactly k/r key-value pairs.

Which MapReduce daemon runs on each slave node and participates in job execution?

• A.NameNode
• B.TaskTracker
• C.Secondary NameNode
• D.JobTracker

All keys used for intermediate output from mappers must do which of the following:

• A.Be compressed using a splittable compression algorithm.
• B.Override isSplitable
• C.Use a comparator for speedy sorting
• D.Implement WritableComparable
• E.Be a subclass of Filelnput-Format

You have the following key value pairs as output from your Map task:
(The, 1)
(Fox, 1)
(Runs, 1)
(Faster, 1)
(Than, 1)
(The, 1)
(Dog, 1)
How many keys will be passed to the reducer?

• A.One
• B.Six
• C.Five
• D.Four
• E.Three
• F.Two