Counting Distinct Elements in a Stream — past-year questions
Big Data Analysis (CSC702) · Semester 7 · Module 4 · Comps
5 past-year questions on Counting Distinct Elements in a Stream have appeared in Mumbai University CSC702 papers between 2024–2026, 6 times in total. Every question is shown in full below with its marks and repeat count. Model answers require a free account.
Questions asked on Counting Distinct Elements in a Stream
- 1.
Suppose the stream is S = {4, 2, 5, 9, 1, 6, 3, 7}. Let hash function h(x) = 3x + 7 mod 32 for some a and b, treat result as a 5-bit binary integer. Show how the Flajolet-Martin algorithm will estimate the number of distinct elements in this stream.
10M2× seenlast asked 2026 - 2.
Suppose our stream consists of the integers 3, 1, 4, 1, 5, 9, 2, 6, 5. Determine the number of distinct elements if the hash function is: h(x) = 3x + 7 mod 8.
10M1× seenlast asked 2025 - 3.
Suppose the stream is S = {10, 12, 8, 15, 6, 9, 14, 7}. Let hash function h(x) = 5x + 11 mod 32 for some a and b, treat result as a 5-bit binary integer. Show how the Flajolet-Martin algorithm will estimate the number of distinct elements in this stream.
10M1× seenlast asked 2025 - 4.
Which algorithm can be used for finding distinct elements in a long data stream? Give two real life applications for the same.
5M1× seenlast asked 2025 - 5.
For the stream of integers: 9, 8, 7, 6, 5, 4, 3, 2. Use the hash function, h(x) = (2x+1) mod 32 and treat the result as a 5-bit binary integer. Show the steps of the Flajolet-Martin algorithm to estimate the number of distinct elements in this stream.
10M1× seenlast asked 2024
Want the answers to these questions?
The questions above are free to read. Create a free account to get AI model answers for Big Data Analysis, a curated set of the questions that matter most, flashcard revision, and a study plan built around your exam date.