Information Technology Engineering Sem 8 Big Data Analysis Question Paper PDF 2026 - Mumbai University | munotes

Questions asked in this paper

1. Q1 (a) Explain Blooms filter for stream data mining. 5 marks
   • (b) Find the jaccard distance and cosine distance between the following pairs of set: 5
   • (c) Explain the steps of the HITS algorithm. 5
   • (d) Explain “Shuffle & Sort” phase and “Reducer Phase” in Map Reduce. 5
2. Q2 (a) Write a Map reduce pseudo code to multiply two matrices. with an example showing all the steps 10 marks
   • (b) Explain Hadoop Ecosystem with core components. Explain its. physical architecture. State the limitations of Hadoop 10
3. Q3 (a) Suppose a data stream consists of the integers 1,3,2,1,2,3,4,3,1,2,3,1. Let the Hash function being used is h(x) = (6x+1) mod 5; estimate the number of distinct in this 10 marks
   • (b) Distinguish the following: 10
   • a) PCY, Multistage
   • b) Document data store and Column family data store
4. Q4 (a) Give two applications for counting the number of 1’s in a long stream of binary values. Using a stream of binary digits, Illustrate how DGIM will find the number 10 marks
   • (b) For the given graph show how clique percolation method will find cliques. 10
   • (a). Consider the web graph given below with six pages (A, B, C, D, E, F) with directed links as follows Assume that the PageRank values for any page m at iteration 0 is PR(m)=1 and teleportation factor for iterations is B=0.85. Perform the page rank algorithm and determine the rank for every page at iteration 2 10
   • (b) Explain clearly how the SON partition based algorithm helps to perform frequent item set mining for large data sets. How does this algorithm avoid false negatives? 10
5. Q6 (a) collaborative filtering system. How is it different from content based 10 marks
   • (b) explain how CURE algorithm can be used to cluster big data sets. 10

Read from the scan above, so a character or two may differ. The scan is the original.