As the volume of data is increasing with time the primary issue is how to store and process such data and get useful information out of it. Analysis of classification algorithms and MapReduce programming model has led to the conclusion that the distributed file system and parallel computing attributes of MapReduce are good for designing classifier model. The major reason for it is parallel processing of data in which data is divided and processed in parallel and the output from each is reduced further for a single output. In this paper, we are going to study how to use MapReduce model to build classifier model. We are using cancer dataset to predict if a person has cancer or not by using Naive Bayes and KNN classification algorithms. We have compared them on the basis on computational time and the factors like sensitivity, specificity, and accuracy. In the end, we would be able to compare these two algorithms and tell which one works better on MapReduce programming model