Apache-Hadoop-Developer 무료 덤프문제 온라인 액세스

In a MapReduce job with 500 map tasks, how many map task attempts will there be?

• A.At most 500.
• B.Exactly 500.
• C.At least 500.
• D.Between 500 and 1000.
• E.It depends on the number of reduces in the job.

What are the TWO main components of the YARN ResourceManager process? Choose 2 answers

• A.Task Tracker
• B.Scheduler
• C.Job Tracker
• D.Applications Manager

You want to understand more about how users browse your public website, such as which pages they visit prior to placing an order. You have a farm of 200 web servers hosting your website. How will you gather this data for your analysis?

• A.Ingest the server web logs into HDFS using Flume.
• B.Sample the weblogs from the web servers, copying them into Hadoop using curl.
• C.Channel these clickstreams inot Hadoop using Hadoop Streaming.
• D.Write a MapReduce job, with the web servers for mappers, and the Hadoop cluster nodes for reduces.
• E.Import all users' clicks from your OLTP databases into Hadoop, using Sqoop.

You want to run Hadoop jobs on your development workstation for testing before you submit them to your production cluster. Which mode of operation in Hadoop allows you to most closely simulate a production cluster while using a single machine?

• A.Run simldooop, the Apache open-source software for simulating Hadoop clusters.
• B.Run the DataNode, TaskTracker, NameNode and JobTracker daemons on a single machine.
• C.Run all the nodes in your production cluster as virtual machines on your development workstation.
• D.Run the hadoop command with the -jt local and the -fs file:///options.

What types of algorithms are difficult to express in MapReduce v1 (MRv1)?

• A.Text analysis algorithms on large collections of unstructured text (e.g, Web crawls).
• B.Algorithms that require applying the same mathematical function to large numbers of individual binary records.
• C.Algorithms that require global, sharing states.
• D.Relational operations on large amounts of structured and semi-structured data.
• E.Large-scale graph algorithms that require one-step link traversal.