Paper / Subject Code: 42155 / Big Data & Analytics (DLOC - III)

(3 Hours)
[Total Marks 80]
i. Q.1 is compulsory
ii. Attempt any three from the remaining
iii. Assume suitable data

Q.1 (a) Explain Edit distance measure with an example. (5)

(b) When it comes to big data how NoSQL scores over RDBMS. (5)
(c) Give difference between Traditional data management and analytics approach (5)
Versus Big data Approach
(d) Give Applications of Social Network Mining (5)
Q.2 (a) What is Hadoop? Describe HDFS architechure with diagram. (10)
(b) Explain with block diagram architechure of Data stream Management System. (10)
Q.3 (a) What is the use of Recommender System. How is classification algorithm used (10)
in recommendation system. 7 4
3
(b) Explain the following terms with diagram 1
3
6 (10)
1
4
6
1) Hubs and Authorities A
4
3
A
6
3
2) Structure of the Web 1
6
D
1
E
D
2
Q.4 (a) What do you mean by Counting Distinct ElementsE
3
2 in a stream. Illustrate with an (10)
9
3
2
9
example working of an Flajolet – Martin Algorithm
4
2
4
8
used to count number of
4
3
8
distinct elements. 3
9
3
8
9
6
8
(b) Explain different ways by which big data problems
D
6
0 are handled by NoSQL. (10)
D
4
0
Q.5 (a) Describe Girwan – Newman Algorithm. For the4A 5
A
2
following graph show how the (10)
5
4
2
Girvan Newman algorithm finds the different communities.
7
4
7
7
4

(b) What is the role of JobTracker and TaskTracker in MapReduce.Illustrate Map (10)
Reduce execution pipeline with Word count example.
Q.6 (a) Compute the page rank of each page after running the PageRank algorithm for (10)
two iterations with teleportation factor Beta ( β)value = 0.8

(b) What are the challenges in clustering of Data streams. Explain stream (10)
clustering algorithm in detail.

76084