Indian Institute of Technology Madras
BS Degree Programme · Examination & Study Paper
Algorithms for Data Science
Graph cuts, Laplacians & sparsifiers
Official Paper
Examination Instructions & Guidelines
- Solve on notebook/paper first before checking solutions.
- MCQ: Exactly 1 option is correct. Negative marking applies.
- NAT: Numerical response. No negative marking.
- Scientific calculator allowed for all calculations.
- Official answer key is sealed at the end of this sheet.
End Term · 31 Aug 2025 (FN)End Term
- Q1MCQ2 Marks·Choose one option
- A
- B
- C
- D
- A
Quiz 2 · 3 Aug 2025 (AN)Quiz 2
Read the passage below, then answer Q2–Q4
Consider the following weighted, undirected graph. If an edge is not present in the graph, the corresponding weight is zero.
Based on the above data, answer the given subquestions.
Q2NAT4 Marks·Write the number
Your answer:- Q3MCQ4 Marks·Choose one option
Find the Laplacian, L, of the graph.
- A
- B
- C
- D
- A
- Q4NAT5 Marks·Write the number
How many zero eigenvalues does L have?
Your answer: