COMS20017 Algorithms and Data 2025-26: Q&A 3 by

johnlapinskas1 — 2026-02-06 18:05:15 UTC

Quiz 3 (Qns 6)

2026-02-07 10:15:31 UTC

Could you explain, step by step, how to check the in-degree and out-degree conditions for Euler walks in directed graphs, including when in-degree equals out-degree at every vertex and when exactly two vertices differ by one?

Problem Sheet 3 (Qns 5(f))

2026-02-08 12:46:55 UTC

Could you go through this question

Is it always the case that strong components are maximal and disjoint?

2026-02-08 13:32:55 UTC

Problem sheet 3 (Qns 6)

2026-02-08 13:56:35 UTC

Could you explain this question as well, I don't fully understand the part where Hamilton cycle requires the vertices to be adjacent.

Lastly, just a general question, but how would you recommend us to prepare to be able to answer any sort of proof questions in the exam

2026-02-08 13:58:06 UTC