CMC702 · Big Data Analysis · End-sem 27 Nov 2026

Previous-year questions, by module

Every question from the six Mumbai University papers (May 2023 to May 2026), sorted by syllabus topic. Repeats are merged into one entry; other wordings sit under “Also asked as”.

How the paper works

  • 3 hours, 80 marks. Same format in all six papers.
  • Q1 is compulsory: four short questions (a to d), all to be answered.
  • Q2 to Q6: answer any 3. Each has two parts (a, b).
  • Most papers mix in 2 to 4 numericals: Flajolet-Martin, Bloom filter, MapReduce word count, Girvan-Newman or R scripts.
  • Dec 25 had two corrections from the university (Q3a, Q5a). The corrected versions are used here.

Times asked, by module

M110
M217
M312
M419
M515
M614
54 unique questions from 87 asks

Asked in 3 or more of the 6 papers

  • 5×M1 · 1.1Mention four characteristics of big data and explain them in detail.
  • 5×M4 · 4.4Show how the Flajolet-Martin algorithm estimates the number of distinct elements in the stream, using the hash function given.
  • 4×M2 · 2.3 · 2.4Write MapReduce pseudo code for the word count problem. Apply it to the document below and show all the steps.
  • 4×M5 · 5.3Determine the communities in the given social network graph using the Girvan-Newman algorithm.
  • 3×M1 · 1.4Describe the components of the Hadoop ecosystem with the help of a diagram.
  • 3×M3 · 3.1List and explain the core business drivers behind the NoSQL movement.
  • 3×M4 · 4.1With a neat sketch, explain the architecture of a data-stream management system.
4× times asked (blue at 4+) May 25 asked that sitting Dec 24 not asked Numerical has data to solve
Module I

Introduction to Big Data and Hadoop

4 unique questions · asked 10 times across 6 papers

1.1Big Data characteristics and types

  1. 5×
    Mention four characteristics of big data and explain them in detail.
    Also asked as
    • Mention four characteristics of big data. Elaborate these characteristics with respect to social media websites. May 23, Dec 25
    • Describe the characteristics of big data with an example. May 26
    May 23May 24Dec 24May 25Dec 25May 26

1.2 · 1.3Traditional vs Big Data business approach, case studies

  1. 1×
    How does big data analysis provide a competitive advantage to industries?
    May 23May 24Dec 24May 25Dec 25May 26

1.4Hadoop, core components and ecosystem

  1. 3×
    Describe the components of the Hadoop ecosystem with the help of a diagram.
    Also asked as
    • Draw a diagram of the typical Hadoop ecosystem and explain any two of its components. Dec 24
    • Explain the Hadoop ecosystem in detail. Dec 25
    May 23May 24Dec 24May 25Dec 25May 26
  2. 1×
    Explain how big data problems are handled by the Hadoop system.
    May 23May 24Dec 24May 25Dec 25May 26
Module II

Hadoop HDFS and MapReduce

11 unique questions · asked 17 times across 6 papers

2.1 · 2.2Distributed file systems and HDFS

  1. 1×
    Describe HDFS. How does HDFS manage the storage and replication of data across a distributed cluster of machines?
    May 23May 24Dec 24May 25Dec 25May 26
  2. 1×
    Distinguish between the NameNode and the DataNode.
    May 23May 24Dec 24May 25Dec 25May 26
  3. 1×
    “The Secondary NameNode is a backup of the NameNode.” Is this statement true or false? Justify your answer.
    May 23May 24Dec 24May 25Dec 25May 26

2.3 · 2.4Map tasks, grouping by key, reduce tasks, combiners, execution

  1. 4×
    Write MapReduce pseudo code for the word count problem. Apply it to the document below and show all the steps.
    Dec 24
    This is NoSQL. NoSQL handles complex data.
    May 25 · Dec 25
    Big data is powerful. Big data drives decisions.
    Also asked as
    • May 24 gave no document: “Illustrate with an example showing all the steps.” May 24
    May 23May 24Dec 24May 25Dec 25May 26
  2. 2×
    Explain the MapReduce execution pipeline with a suitable example.
    Also asked as
    • Explain the Shuffle & Sort phase and the Reducer phase in MapReduce. May 25
    May 23May 24Dec 24May 25Dec 25May 26
  3. 1×
    What is the role of a combiner in the MapReduce framework? Explain with an example.
    May 23May 24Dec 24May 25Dec 25May 26

2.6Matrix-vector multiplication by MapReduce

  1. 1×
    Write MapReduce pseudo code for matrix-vector multiplication. Show all the steps for the matrix and vector below.
    M =123456789×v =123
    NumericalMay 23May 24Dec 24May 25Dec 25May 26
  2. 1×
    Write MapReduce pseudo code to multiply two matrices. Apply MapReduce to the multiplication below.
    A =1234×B =6789

    Matrix-matrix multiplication is not named in the syllabus (2.6 says matrix-vector), but it is in the same textbook section (MMDS 2.3.9).

    NumericalMay 23May 24Dec 24May 25Dec 25May 26

2.7Relational-algebra operations by MapReduce

  1. 2×
    Explain the selection and projection relational-algebra operations using MapReduce.
    Also asked as
    • Explain the MapReduce task and the following operations using MapReduce: 1) selection, 2) projection. May 26
    May 23May 24Dec 24May 25Dec 25May 26
  2. 2×
    Explain the natural join and the grouping and aggregation relational-algebra operations using MapReduce.

    Natural join and grouping/aggregation are not listed in 2.7, which stops at union, intersection and difference. They are in the same textbook section (MMDS 2.3).

    May 23May 24Dec 24May 25Dec 25May 26

2.8Hadoop limitations

  1. 1×
    Write down the limitations of Hadoop.
    May 23May 24Dec 24May 25Dec 25May 26

2.5 coping with node failures was never asked on its own.

Module III

NoSQL

9 unique questions · asked 12 times across 6 papers

3.1Introduction to NoSQL, business drivers

  1. 3×
    List and explain the core business drivers behind the NoSQL movement.
    May 23May 24Dec 24May 25Dec 25May 26
  2. 1×
    Explain CAP. How is CAP different from the ACID property in databases?

    CAP is not named in the syllabus. It fits 3.1 (why NoSQL) and 3.4 (distribution models).

    May 23May 24Dec 24May 25Dec 25May 26

3.2NoSQL data architecture patterns

  1. 1×
    List the architectural patterns in NoSQL databases. Discuss the key-value and document-oriented patterns, focusing on their characteristics, use cases and examples.
    May 23May 24Dec 24May 25Dec 25May 26
  2. 1×
    Explain the following NoSQL data architecture patterns in detail: 1) key-value stores, 2) graph stores.
    May 23May 24Dec 24May 25Dec 25May 26
  3. 1×
    What is a key-value store? What are the benefits of using a key-value store?
    May 23May 24Dec 24May 25Dec 25May 26
  4. 1×
    What is a graph store? Give an example where a graph store can be used to effectively solve a particular business problem.
    May 23May 24Dec 24May 25Dec 25May 26
  5. 1×
    Write a short note on variations of NoSQL architectural patterns.
    May 23May 24Dec 24May 25Dec 25May 26

3.3NoSQL case study

  1. 2×
    Summarize how business problems have been solved faster, cheaper and more effectively using NoSQL, considering Google’s Bigtable case study. Also illustrate the business drivers and findings in it.
    May 23May 24Dec 24May 25Dec 25May 26

3.4NoSQL solutions for big data

  1. 1×
    Explain the term NoSQL. Differentiate between master-slave and peer-to-peer distribution models.
    May 23May 24Dec 24May 25Dec 25May 26
Module IV

Mining Data Streams

11 unique questions · asked 19 times across 6 papers

4.1The stream data model, DSMS, stream queries, issues

  1. 3×
    With a neat sketch, explain the architecture of a data-stream management system.
    Also asked as
    • What is a data stream management system? How does it work? May 26
    May 23May 24Dec 24May 25Dec 25May 26
  2. 1×
    List and explain the different issues and challenges in data stream query processing.
    May 23May 24Dec 24May 25Dec 25May 26

4.3Filtering streams: Bloom filter

  1. 1×
    Explain the concept of a Bloom filter with an example.
    May 23May 24Dec 24May 25Dec 25May 26
  2. 1×
    Create a Bloom filter with the following parameters. Bit array size m = 8. Hash functions: h1(x) = x mod m, h2(x) = (2x + 1) mod m, h3(x) = (3x + 2) mod m.
    1. Insert the elements 12, 25, 30 and 5 into the Bloom filter.
    2. Check whether the elements 6 and 55 are present in the Bloom filter.
    3. Discuss the results of your checks: which element is a true positive and which is a true negative.
    NumericalMay 23May 24Dec 24May 25Dec 25May 26
  3. 1×
    Discuss the Bloom filter in detail and insert the elements 10 and 7 into a Bloom filter of size 5 using the hash functions h1(x) = x mod 5 and h2(x) = (2x + 6) mod 5.

    This is the corrected version the university sent on 14 Nov 2025. The scanned paper printed the hash functions with stray “1-” and “2-” labels.

    NumericalMay 23May 24Dec 24May 25Dec 25May 26
  4. 1×
    What is a false positive in a Bloom filter? Give an example.
    May 23May 24Dec 24May 25Dec 25May 26
  5. 1×
    Why is recall 100% for a Bloom filter? Explain in detail.
    May 23May 24Dec 24May 25Dec 25May 26

4.4Counting distinct elements: Flajolet-Martin

  1. 5×
    Show how the Flajolet-Martin algorithm estimates the number of distinct elements in the stream, using the hash function given.
    PaperStreamHash functionTreat result as
    May 232, 1, 6, 1, 5, 9, 2, 3, 5h(x) = 4x + 1 mod 164-bit binary
    May 244, 2, 5, 9, 1, 6, 3, 7h(x) = 3x + 7 mod 325-bit binary
    Dec 249, 8, 7, 6, 5, 4, 3, 2h(x) = (2x + 1) mod 325-bit binary
    May 2510, 12, 8, 15, 6, 9, 14, 7h(x) = 5x + 11 mod 325-bit binary
    Dec 253, 1, 4, 1, 5, 9, 2, 6, 5h(x) = 3x + 7 mod 85-bit binary*

    * Dec 25 as corrected by the university (14 Nov 2025): mod 8 gives values 0 to 7, which need only 3 bits, yet the paper says “5-bit binary integer”. Copied as printed. May 23 also says “h(x) = ax + b mod 16 for some a and b” before giving 4x + 1.

    NumericalMay 23May 24Dec 24May 25Dec 25May 26
  2. 1×
    Which algorithm can be used to find distinct elements in a long data stream? Give two real-life applications of it.
    May 23May 24Dec 24May 25Dec 25May 26

4.5Counting ones in a window: DGIM

  1. 2×
    What is the DGIM algorithm? Explain it with an example.
    Also asked as
    • Explain the DGIM algorithm for counting ones in a stream, with an example. May 24
    May 23May 24Dec 24May 25Dec 25May 26
  2. 2×
    List all six constraints that must be satisfied when representing a stream by buckets in the DGIM algorithm, with examples.
    Also asked as
    • List any five constraints that must be satisfied when representing a stream by buckets using DGIM, with examples. Dec 24
    May 23May 24Dec 24May 25Dec 25May 26

4.2 sampling data in a stream and decaying windows were never asked.

Module V

Real-Time Big Data Models

10 unique questions · asked 15 times across 6 papers

5.1Recommendation systems: content-based and collaborative filtering

  1. 2×
    Define collaborative filtering. Using an example of an e-commerce site like Flipkart or Amazon, describe how it can be used to recommend products to users.
    Also asked as
    • Describe collaborative filtering in a recommendation system. May 24
    May 23May 24Dec 24May 25Dec 25May 26
  2. 1×
    Predict the rating of User 2 for Movie 3 using Pearson’s correlation coefficient.
    UsersRatings
    Movie 1Movie 2Movie 3Movie 4Movie 5
    User 123211
    User 234?43
    User 343433
    NumericalMay 23May 24Dec 24May 25Dec 25May 26
  3. 2×
    Explain content-based filtering with an example.
    Also asked as
    • Justify the use of a content-based recommendation system with a specific case study. Dec 24
    May 23May 24Dec 24May 25Dec 25May 26
  4. 1×
    Describe the terms TF and IDF with respect to content-based filtering.
    May 23May 24Dec 24May 25Dec 25May 26
  5. 1×
    What is a recommendation system? How is a classification algorithm used in a recommendation system?
    May 23May 24Dec 24May 25Dec 25May 26
  6. 1×
    Define distance measure and give the formula of cosine similarity.

    Distance measures are not named in the syllabus. They come from MMDS ch. 3 and are used for similarity in 5.1.

    May 23May 24Dec 24May 25Dec 25May 26
  7. 1×
    Explain Euclidean distance and Jaccard distance with an example.
    May 23May 24Dec 24May 25Dec 25May 26

5.3Social networks as graphs, communities

  1. 4×
    Determine the communities in the given social network graph using the Girvan-Newman algorithm.
    May 23
    ACBDEF
    May 24
    ABCDEF
    May 25 · Dec 25 (same graph)
    ABECD
    Also asked as
    • Demonstrate the different communities using the Girvan-Newman algorithm for the following graph. Dec 25
    NumericalMay 23May 24Dec 24May 25Dec 25May 26
  2. 1×
    Write an algorithm for the Clique Percolation Method and discover the communities in the graph below using CPM with clique size k = 3.
    12345678

    The paper’s graph has no node labels. The numbers 1 to 8 are added here so you can name cliques; the edges are as printed.

    NumericalMay 23May 24Dec 24May 25Dec 25May 26
  3. 1×
    Write a note on social networks as graphs.
    May 23May 24Dec 24May 25Dec 25May 26

5.2 product recommendation case study was never asked by name.

Module VI

Data Analytics with R

9 unique questions · asked 14 times across 6 papers

6.1Basic features of R: vectors, objects, data structures

  1. 2×
    List and discuss the various types of data structures in R.
    May 23May 24Dec 24May 25Dec 25May 26
  2. 1×
    The table shows the number of units of different products sold on different days. Create five sample numeric vectors from this data.
    ProductMondayTuesdayWednesdayThursdayFriday
    Bread1235119
    Milk2127182015
    Cola Cans10133612
    Chocolate bars6741312
    Detergent58122023

    Asked together with “Name and explain the operators used to form data subsets in R” (6.3, below).

    NumericalMay 23May 24Dec 24May 25Dec 25May 26

6.2Reading datasets and exporting data

  1. 1×
    Write a script to create a dataset named data1 in R containing the following text: 2, 3, 4, 5, 6.7, 7, 8.1, 9.
    NumericalMay 23May 24Dec 24May 25Dec 25May 26

6.3Manipulating and processing data in R

  1. 2×
    Using the data frame below, create subsets and demonstrate the output.
    1. Create a subset of course less than 3 (May 23) / less than 5 (May 24) using [ ] brackets.
    2. Create a subset where course is less than 3 or class equals 2 (May 23) / course is less than 4 or class equals 1 (May 24) using the subset() function.
    courseidclassmarks
    111156
    212275
    313148
    414269
    515184
    616253
    NumericalMay 23May 24Dec 24May 25Dec 25May 26
  2. 2×
    Create a data frame in R for the project data below and display the output.
    1. Dec 24 (ABC Corp, Mr. Thomas): show the structure and summary statistics of the data frame.
    2. May 25 (XYZ Ltd., Ms. Meera): two new projects were approved. Update the data frame to include them and show the final output.
    Dec 24
    ProjectIdProjectNameBudget
    1Website Redesign150000
    2Mobile App Launch100000
    3Data Migration80000
    4AI Development200000
    5Cybersecurity Audit50000
    May 25
    Project IdProject NameBudgetStatus
    1CRM Implementation120000In Progress
    2Cloud Infrastructure180000Completed
    3Network Upgrade60000Not Started
    4E-Commerce Platform220000Completed
    5Data Analytics90000In Progress
    May 25 · new projects to add
    Project IdProject NameBudgetStatus
    6UX Research160000Not Started
    7Cloud Integration190000Not Started
    NumericalMay 23May 24Dec 24May 25Dec 25May 26
  3. 2×
    List and explain the functions provided by R to combine different sets of data.
    May 23May 24Dec 24May 25Dec 25May 26
  4. 1×
    Name and explain the operators used to form data subsets in R.
    May 23May 24Dec 24May 25Dec 25May 26

6.4Functions and built-in functions

  1. 1×
    Write a script to sort the values in the vector (46, 23, 15, 38, 98, 56, 28, 78) in ascending and descending order. Demonstrate the output.
    NumericalMay 23May 24Dec 24May 25Dec 25May 26

6.5Data visualization

  1. 2×
    Explain the different data visualization techniques in R with examples.
    Also asked as
    • Describe the applications of data visualization. May 24
    May 23May 24Dec 24May 25Dec 25May 26