984 お客様のコメント
質問 1：
You need to import a portion of a relational database every day as files to HDFS, and generate Java classes to Interact with your imported data. Which of the following tools should you use to accomplish this?
A. Hive
B. Hue
C. Flume
D. Pig
E. Sqoop
F. fuse-dfs
G. Oozie
正解：E
解説: (Pass4Test メンバーにのみ表示されます)
質問 2：
You use the hadoop fs -put command to write a 300 MB file using an HDFS block size of 64 MB. Just after this command has finished writing 200 MB of this file, what would another user see when trying to access this file?
A. They would see no content until the whole file is written and closed.
B. They would see the content of the file through the last completed block.
C. They would see Hadoop throw an concurrentFileAccessException when they try to access this file.
D. They would see the current state of the file, up to the last bit written by the command.
正解：A
解説: (Pass4Test メンバーにのみ表示されます)
質問 3：
For each input key-value pair, mappers can emit:
A. As many intermediate key-value pairs as desired, but they cannot be of the same type as the input key-value pair.
B. One intermediate key value pair, of a different type.
C. One intermediate key value pair, but of the same type.
D. As many intermediate key-value pairs as desired. There are no restrictions on the types of those key-value pairs (i.e., they can be heterogeneous).
E. As many intermediate key value pairs as desired, as long as all the keys have the same type and all the values have the same type.
正解：D
解説: (Pass4Test メンバーにのみ表示されます)
質問 4：
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 r files, each with exactly k/r 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 m files, each with approximately k/m key-value pairs.
正解：A
解説: (Pass4Test メンバーにのみ表示されます)
質問 5：
All keys used for intermediate output from mappers must do which of the following:
A. Implement WritableComparable
B. Be compressed using a splittable compression algorithm.
C. Use a comparator for speedy sorting
D. Override isSplitable
E. Be a subclass of Filelnput-Format
正解：A
解説: (Pass4Test メンバーにのみ表示されます)
質問 6：
Does the MapReduce programming model provide a way for reducers to communicate with each other?
A. Yes, all reducers can communicate with each other by passing information through the jobconf object.
B. Yes, reducers running on the same machine can communicate with each other through shared memory, but not reducers on different machines.
C. Yes, reducers can communicate with each other by dispatching intermediate key value pairs that get shuffled to another reduce
D. No, each reducer runs independently and in isolation.
正解：D
解説: (Pass4Test メンバーにのみ表示されます)
You need to import a portion of a relational database every day as files to HDFS, and generate Java classes to Interact with your imported data. Which of the following tools should you use to accomplish this?
A. Hive
B. Hue
C. Flume
D. Pig
E. Sqoop
F. fuse-dfs
G. Oozie
正解：E
解説: (Pass4Test メンバーにのみ表示されます)
質問 2：
You use the hadoop fs -put command to write a 300 MB file using an HDFS block size of 64 MB. Just after this command has finished writing 200 MB of this file, what would another user see when trying to access this file?
A. They would see no content until the whole file is written and closed.
B. They would see the content of the file through the last completed block.
C. They would see Hadoop throw an concurrentFileAccessException when they try to access this file.
D. They would see the current state of the file, up to the last bit written by the command.
正解：A
解説: (Pass4Test メンバーにのみ表示されます)
質問 3：
For each input key-value pair, mappers can emit:
A. As many intermediate key-value pairs as desired, but they cannot be of the same type as the input key-value pair.
B. One intermediate key value pair, of a different type.
C. One intermediate key value pair, but of the same type.
D. As many intermediate key-value pairs as desired. There are no restrictions on the types of those key-value pairs (i.e., they can be heterogeneous).
E. As many intermediate key value pairs as desired, as long as all the keys have the same type and all the values have the same type.
正解：D
解説: (Pass4Test メンバーにのみ表示されます)
質問 4：
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 r files, each with exactly k/r 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 m files, each with approximately k/m key-value pairs.
正解：A
解説: (Pass4Test メンバーにのみ表示されます)
質問 5：
All keys used for intermediate output from mappers must do which of the following:
A. Implement WritableComparable
B. Be compressed using a splittable compression algorithm.
C. Use a comparator for speedy sorting
D. Override isSplitable
E. Be a subclass of Filelnput-Format
正解：A
解説: (Pass4Test メンバーにのみ表示されます)
質問 6：
Does the MapReduce programming model provide a way for reducers to communicate with each other?
A. Yes, all reducers can communicate with each other by passing information through the jobconf object.
B. Yes, reducers running on the same machine can communicate with each other through shared memory, but not reducers on different machines.
C. Yes, reducers can communicate with each other by dispatching intermediate key value pairs that get shuffled to another reduce
D. No, each reducer runs independently and in isolation.
正解：D
解説: (Pass4Test メンバーにのみ表示されます)
山口** -
５５歳の私が簡単CCD-333合格出来ました。
一度落ちて、再チャレンジでしたが、この本はわかりやすかったです。