Here you can find Hadoop Interview Questions and Answers.
In this Hadoop Interview Questions and Answers section you can learn and practice Hadoop Interview Questions and Answers to improve your skills in order to face technical inerview by IT companies. By Practicing these interview questions, you can easily crack any Hadoop interview.
AllIndiaExams provides you lots Hadoop Interview Questions and Answers with proper explanation. Fully solved examples with detailed answer description. All students, freshers can download Hadoop Interview Questions and Answers as PDF files and eBooks.
You no need to worry, we have given lots of Hadoop Interview Questions and Answers and also we have provided lots of FAQ's to quickly answer the questions in the Hadoop technical interview.
What is Hadoop framework?
Hadoop is a open source framework which is written in java by apche software foundation. This framework is used to wirite software application which requires to process vast amount of data (It could handle multi tera bytes of data). It works in-paralle on large clusters which could have 1000 of computers (Nodes) on the clusters. It also process data very reliably and fault-tolerant manner
On What concept the Hadoop framework works?
It works on MapReduce, and it is devised by the Google.
What is MapReduce ?
Map reduce is an algorithm or concept to process Huge amount of data in a faster way. As per its name you can divide it Map and Reduce. The main MapReduce job usually splits the input data-set into independent chunks. MapTask: will process these chunks in a completely parallel manner (One node can process one or more chunks). The framework sorts the outputs of the maps. Reduce Task : And the above output will be the input for the reducetasks, produces the final result. Your business logic would be written in the MappedTask and ReducedTask. Typically both the input and the output of the job are stored in a file-system (Not database). The framework takes care of scheduling tasks, monitoring them and re-executes the failed tasks.
What is compute and Storage nodes?
Compute Node: This is the computer or machine where your actual business logic will be executed. Storage Node: This is the computer or machine where your file system reside to store the processing data. In most of the cases compute node and storage node would be the same machine.
How does master slave architecture in the Hadoop?
The MapReduce framework consists of a single master JobTracker and multiple slaves, each cluster-node will have one TaskskTracker. The master is responsible for scheduling the jobs' component tasks on the slaves, monitoring them and re-executing the failed tasks. The slaves execute the tasks as directed by the master.
How does an Hadoop application look like or their basic components?
Minimally an Hadoop application would have following components. Input location of data Output location of processed data. A map task. A reduced task. Job configuration The Hadoop job client then submits the job (jar/executable etc.) and configuration to the JobTracker which then assumes the responsibility of distributing the software/configuration to the slaves, scheduling tasks and monitoring them, providing status and diagnostic information to the job-client.
Explain how input and output data format of the Hadoop framework?
The MapReduce framework operates exclusively on pairs, that is, the framework views the input to the job as a set of pairs and produces a set of pairs as the output of the job, conceivably of different types. See the flow mentioned below (input) -> map -> -> combine/sorting -> -> reduce -> (output)
What are the restriction to the key and value class ?
The key and value classes have to be serialized by the framework. To make them serializable Hadoop provides a Writable interface. As you know from the java itself that the key of the Map should be comparable, hence the key has to implement one more interface WritableComparable.
Which interface needs to be implemented to create Mapper and Reducer for the Hadoop?
What Mapper does?
Maps are the individual tasks that transform input records into intermediate records. The transformed intermediate records do not need to be of the same type as the input records. A given input pair may map to zero or many output pairs.