Cloudera
DS-200 · Question #25
DS-200 Question #25: Real Exam Question with Answer & Explanation
Sign in or unlock DS-200 to reveal the answer and full explanation for question #25. The question stem and answer options stay visible for context.
Question
You have a data file that contains two trillion records, one record per line (comma separated). Each record lists two friends and unique message sent between them. Their names will not have commas. Michael, John, Pabst, Blue Ribbon Tiffany, James, BMX Racing John, Michael, Natural Lemon Flavor Analyze the pseudo code examples below and determine which set of mappers and reducers in the below pseudo code snippets will solve for the mean number of messages each user sends to all of the friends? For example pseudo code may have three friends to whom he sends 6, 10, and 200 messages, respectively, so Michael's mean would be (6+10+200)/3. The solution may require a pipeline of two MapReduce jobs.
Options
- Adef mapper1 (line):
- Bdef mapper1 (line):
- Cdef mapper1 (line):
- Ddefmapper (line):
Unlock DS-200 to see the answer
You've previewed enough free DS-200 questions. Unlock DS-200 for full answers, explanations, the timed quiz mode, progress tracking, and the master PDF. Question stem and options stay visible so you can still see what's on the exam.