Social Networks as Graphs — past-year questions
Big Data Analysis (CSC702) · Semester 7 · Module 5 · Comps
5 past-year questions on Social Networks as Graphs have appeared in Mumbai University CSC702 papers between 2024–2026, 5 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 Social Networks as Graphs
- 1.
Determine communities for the given social network graph using Girvan-Newman algorithm.
10M1× seenlast asked 2026 - 2.
Demonstrate the different communities using Girvan-Newman algorithm for the following graph.
10M1× seenlast asked 2025 - 3.
Determine communities for the given social network graph using Girvan-Newman algorithm.
10M1× seenlast asked 2025 - 4.
Write an algorithm for the Clique Percolation Method and discover the communities in the given below graph using Clique Percolation Method with clique k=3.
10M1× seenlast asked 2024 - 5.
Determine communities for the given social network graph using Girvan-Newman algorithm.
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.