This document is an exam for a Big Data Analytics course covering key concepts like MapReduce, HDFS, clustering, classification algorithms, and applications of Big Data. Students are assessed on their knowledge of characteristics of Big Data, differences between MapReduce and YARN, clustering methods like K-Means, and classifiers like Naive Bayes. Questions cover explaining concepts in short answers worth up to 2 marks each, short essays up to 5 marks, and longer essays worth up to 10 marks.
This document is an exam for a Big Data Analytics course covering key concepts like MapReduce, HDFS, clustering, classification algorithms, and applications of Big Data. Students are assessed on their knowledge of characteristics of Big Data, differences between MapReduce and YARN, clustering methods like K-Means, and classifiers like Naive Bayes. Questions cover explaining concepts in short answers worth up to 2 marks each, short essays up to 5 marks, and longer essays worth up to 10 marks.
This document is an exam for a Big Data Analytics course covering key concepts like MapReduce, HDFS, clustering, classification algorithms, and applications of Big Data. Students are assessed on their knowledge of characteristics of Big Data, differences between MapReduce and YARN, clustering methods like K-Means, and classifiers like Naive Bayes. Questions cover explaining concepts in short answers worth up to 2 marks each, short essays up to 5 marks, and longer essays worth up to 10 marks.
DEPARTMENT OF COMPUTER SCIENCE B.VOC FIFTH SEMESTER DEGREE FIRST INTERNAL EXAMINATION SJSDC5IT23 - BIG DATA ANALYTICS
Time: 1 Hour 15 minutes Maximum: 30
Marks
CO1: Design algorithms by employing Map Reduce technique for solving
Big Data Problems.
CO2: Identify similarities using appropriate measures.
CO3: Design solutions for problems in Big Data by suggesting appropriate
clustering techniques.
Section A – Short Answer type questions
(Answer all questions, each correct answer carries a maximum of 2 Marks.
Ceiling 10 marks)
1. Explain the term Big Data? CO1
2. Define HDFS? CO1 3. What is clustering and classification in data mining? CO3 4. What are the widely used classification and clustering CO3 algorithms? 5. Write two application for clustering and classification CO3 6. Write any two applications of Big Data CO1
Section B – Short Essay type questions
(Answer all questions, each correct answer carries a maximum of 5 marks.
Ceiling 15 marks)
7. Explain characteristics of Big Data CO1
8. Difference between Map reduce and YARN CO1 9. Explain the K-Means clustering method CO3 10. Explain the Naïve Bayes classifier. CO3 Section C – Essay type questions
(Answer any one question, each correct answer carries a maximum of l0