Graph Based Clustering — past-year questions
Machine Learning (CSC701) · Semester 7 · Module 5 · Comps
9 past-year questions on Graph Based Clustering have appeared in Mumbai University CSC701 papers between 2024–2026, 10 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 Graph Based Clustering
- 1.
Demonstrate MST algorithm along with example.
10M2× seenlast asked 2025 - 2.
Explain the concept of Expectation Maximization Algorithm.
10M1× seenlast asked 2026 - 3.
Describe DBSCAN algorithm. Apply DBSCAN on dataset {1, 2, 3.5, 4, 5, 11} with ε = 2 and MinPts = 4.
10M1× seenlast asked 2026 - 4.
Expectation Maximization Algorithm.
10M1× seenlast asked 2025 - 5.
Explain DBSCAN clustering algorithm along with an example.
10M1× seenlast asked 2025 - 6.
DBSCAN algorithm.
10M1× seenlast asked 2025 - 7.
Demonstrate DBSCAN algorithm along with example.
10M1× seenlast asked 2024 - 8.
Explain Clustering with minimal spanning tree along with example.
10M1× seenlast asked 2024 - 9.
What is Density based clustering? Explain the steps used for clustering task using Density-Based Spatial Clustering of Applications with Noise (DBSCAN) 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 Machine Learning, a curated set of the questions that matter most, flashcard revision, and a study plan built around your exam date.