For Q1, n is the number of variables. 

Note. The quiz will auto-submit once the timer runs out.

Try and submit before it does. 🙈

In Q3, assume no string is contained in another, as the smaller strings can be removed. For Q3C, ignore the first two options.

For Q4D, ignore the first two options. For Q4B, see below for the expression that is not rendering.

Ignore all marks that show up in the portal.

Assume every part is worth one point and wrong answers are worth -0.5.

apart from the portal, submit your answers on paper,

include any clarifications.

\(|s(\pi)|=\sum_{i=1}^n\left|s_i\right|-\sum_{i=1}^{n-1}\left|\text{ov}\left(s_{\pi(i)}, s_{\pi(i+1)}\right)\right|\)

A Hamiltonian path is a path that visits each vertex of the graph exactly once.

Show that every tournament* has a Hamiltonian path.

*A tournament is a complete directed graph.