- All Exams Instant Download
In Hadoop 2.0, which TWO of the following processes work together to provide automatic failover of the NameNode? Choose 2 answers
In Hadoop 2.0, which TWO of the following processes work together to provide automatic failover of the NameNode? Choose 2 answersA . ZKFailoverControllerB . ZooKeeperC . QuorumManagerD . JournalNodeView AnswerAnswer: A,D
In a MapReduce job with 500 map tasks, how many map task attempts will there be?
In a MapReduce job with 500 map tasks, how many map task attempts will there be?A . It depends on the number of reduces in the job.B . Between 500 and 1000.C . At most 500.D . At least 500.E . Exactly 500.View AnswerAnswer: D Explanation: From Cloudera Training Course:...
Which Hadoop component is responsible for managing the distributed file system metadata?
Which Hadoop component is responsible for managing the distributed file system metadata?A . NameNodeB . MetanodeC . DataNodeD . NameSpaceManagerView AnswerAnswer: A
What types of algorithms are difficult to express in MapReduce v1 (MRv1)?
What types of algorithms are difficult to express in MapReduce v1 (MRv1)?A . Algorithms that require applying the same mathematical function to large numbers of individual binary records.B . Relational operations on large amounts of structured and semi-structured data.C . Algorithms that require global, sharing states.D . Large-scale graph algorithms...
Which one of the following statements describes a Pig bag. tuple, and map, respectively?
Which one of the following statements describes a Pig bag. tuple, and map, respectively?A . Unordered collection of maps, ordered collection of tuples, ordered set of key/value pairsB . Unordered collection of tuples, ordered set of fields, set of key value pairsC . Ordered set of fields, ordered collection of...
What types of algorithms are difficult to express in MapReduce v1 (MRv1)?
What types of algorithms are difficult to express in MapReduce v1 (MRv1)?A . Algorithms that require applying the same mathematical function to large numbers of individual binary records.B . Relational operations on large amounts of structured and semi-structured data.C . Algorithms that require global, sharing states.D . Large-scale graph algorithms...
For each input key-value pair, mappers can emit:
For each input key-value pair, mappers can emit:A . As many intermediate key-value pairs as designed. There are no restrictions on the types of those key-value pairs (i.e., they can be heterogeneous).B . As many intermediate key-value pairs as designed, but they cannot be of the same type as the...
Which one of the following statements describes the result set?
Assuming the following Hive query executes successfully: Which one of the following statements describes the result set?A . A bigram of the top 80 sentences that contain the substring "you are" in the lines column of the input data A1 table.B . An 80-value ngram of sentences that contain the...
You write MapReduce job to process 100 files in HDFS. Your MapReduce algorithm uses TextInputFormat: the mapper applies a regular expression over input values and emits key-values pairs with the key consisting of the matching text, and the value containing the filename and byte offset. Determine the difference between setting the number of reduces to one and settings the number of reducers to zero.
You write MapReduce job to process 100 files in HDFS. Your MapReduce algorithm uses TextInputFormat: the mapper applies a regular expression over input values and emits key-values pairs with the key consisting of the matching text, and the value containing the filename and byte offset. Determine the difference between setting...
When can a reduce class also serve as a combiner without affecting the output of a MapReduce program?
When can a reduce class also serve as a combiner without affecting the output of a MapReduce program?A . When the types of the reduce operation’s input key and input value match the types of the reducer’s output key and output value and when the reduce operation is both communicative...
