Based on the question paper and syllabus provided, here's the module-wise sorted question
list:
MODULE 01: Introduction to Big Data & Hadoop (06
Hours)
Q.1) Draw Hadoop ecosystem and briefly explain its components.
Q.6) What is Hadoop and why its matters and what are the advantages and limitation of
Hadoop.
Q.7) Explain the architecture of Big data and give characteristics of it.
Q.15) Explain HDFS architecture in detail.
Q.21) Differentiate between the following:
● ii) Traditional database and big data
Q.22) Write a short note on:
● iv) Big data enabling technologies
MODULE 02: Hadoop HDFS and Map Reduce (10 Hours)
Q.2) Explain page rank using Map reduce, also explain spider traps and dead ends OR
Explain page rank algorithm in detail.
Q.5) Explain relational algebra operation with example.
Q.13) Write the functions of the components and execution steps in Map reduce.
Q.14) Write a Map reduce pseudo code to multiply two matrices. Illustrate with an example
showing all the steps.
Q.20) Explain how failures are handled in Map reduce job.
MODULE 03: NoSQL (06 Hours)
Q.10) Explain key value, document store, Column family (Bigtable)stores, Document stores,
and Variations of NoSQL architectural patterns with example. (Note: This question may
asked directly also Explain the four types of NoSQL database) Also (Prepare for compare
also)
Q.21) Differentiate between the following:
● i) SQL vs NoSQL
● iii) DBMS and DSMS
Q.22) Write a short note on:
● ii) Four ways that NoSQL system handle big data problems
● iii) 5 V's of big data
MODULE 04: Mining Data Streams (12 Hours)
Q.3) Explain DGIM algorithm.
Q.11) Explain issues in data stream query processing.
Q.12) Draw a neat sketch, explain the architecture of data stream management system.
Q.22) Write a short note on:
● i) Bloom filter with analysis
Numerical:
Q.1) Flajolet-Martin Algorithm
Q.2) What is clique percolation method Write an algorithm on (CPM). Given will be given that
how CPM finds clique from graph explain (text appears partially cut off)
MODULE 05: Finding Similar Items and Clustering (08
Hours)
Q.4) Explain cure algorithm.
Q.18) List and Explain with example two major classes of distance measures.
MODULE 06: Real-Time Big Data Models (10 Hours)
Q.8) What is Recommender System? Explain Types of recommender system.
Q.9) Explain movie recommendation using both recommended system. (Content and
collaborative based filtering)
Q.16) What is a Social Network? Give Varieties of Social Networks and the need for social
network graph.
Q.17) Explain the structure of web with suitable diagram.
Q.19) Explain CAP theorem. State how it is different from ACID properties.
Note: The question paper doesn't explicitly mention marks for individual questions, only that
it's for B.E SEM-VII, SCHEME: R-19 C SCHEME, FOR WINTER SESSION 2025. The
module hours are indicated in the syllabus (Module 01: 06 hours, Module 02: 10 hours,
Module 03: 06 hours, Module 04: 12 hours, Module 05: 08 hours, Module 06: 10 hours).