Anki Deck Changes

Note 1: ETH::A&D

Deck: ETH::A&D
Note Type: Horvath Cloze
GUID: AS{7LiImd:

modified

Before

Front

A graph $G$ is bipartite if {{c2:: it's possible to partition the vertices into two sets $V_1$ and $V_2$ that are disjoint and cover the graph. Any edge $\{u, v\}$ has to have one endpoint in $V_1$ and the other in $V_2$}}.

Back

A graph $G$ is bipartite if {{c2:: it's possible to partition the vertices into two sets $V_1$ and $V_2$ that are disjoint and cover the graph. Any edge $\{u, v\}$ has to have one endpoint in $V_1$ and the other in $V_2$}}.

After

Front

A graph $G$ is bipartite if {{c2:: it's possible to partition the vertices into two sets $V_1$ and $V_2$ that are disjoint and cover the graph. Any edge $\{u, v\}$ has to have one endpoint in $V_1$ and the other in $V_2$}}.

Back

A graph $G$ is bipartite if {{c2:: it's possible to partition the vertices into two sets $V_1$ and $V_2$ that are disjoint and cover the graph. Any edge $\{u, v\}$ has to have one endpoint in $V_1$ and the other in $V_2$}}.

Field-by-field Comparison

Field	Before	After
Text	A graph $G$ is {{c1::~~ ~~<b>bipartite</b>}} if {{c2:: it's possible to partition the vertices into two sets $V_1$ and $V_2$ that are disjoint and cover the graph. Any edge $\{u, v\}$ has to have one endpoint in $V_1$ and the other in $V_2$}}.	A graph $G$ is {{c1::<b>bipartite</b>}} if {{c2:: it's possible to partition the vertices into two sets $V_1$ and $V_2$ that are disjoint and cover the graph. Any edge $\{u, v\}$ has to have one endpoint in $V_1$ and the other in $V_2$}}.

Tags: ETH::1._Semester::A&D::07._Graphs::1._Introduction_to_Graphs

Note 2: ETH::A&D

Deck: ETH::A&D
Note Type: Horvath Cloze
GUID: B9BorfLC*u

modified

Before

Front

{{c1:: $\sum_{i = 1}^{n} i$}} $\leq$ $O(n^2)$ (Sum)

Back

{{c1:: $\sum_{i = 1}^{n} i$}} $\leq$ $O(n^2)$ (Sum)

After

Front

{{c1:: $\sum_{i = 1}^{n} i$::Sum}} $\leq$ $O(n^2)$

Back

{{c1:: $\sum_{i = 1}^{n} i$::Sum}} $\leq$ $O(n^2)$

Field-by-field Comparison

Field	Before	After
Text	{{c1:: $\sum_{i = 1}^{n} i$}} $\leq$ {{c2::$O(n^2)$~~ (Sum)~~}}	{{c1:: $\sum_{i = 1}^{n} i$::Sum}} $\leq$ {{c2::$O(n^2)$}}

Tags: ETH::1._Semester::A&D::02._Asymptotic_Notation::3._O-Notation::Sums

Note 3: ETH::A&D

Deck: ETH::A&D
Note Type: Horvath Cloze
GUID: iFt.dzS26%

modified

Before

Front

A graph $G$ is transitive when for {{c2:: any two edges $\{u, v\} \text{ and } \{v, w\}$ in $E$, the edge $\{u, w\}$ is also in $E$}}.

Back

A graph $G$ is transitive when for {{c2:: any two edges $\{u, v\} \text{ and } \{v, w\}$ in $E$, the edge $\{u, w\}$ is also in $E$}}.

After

Front

A graph $G$ is transitive when for {{c2::any two edges $\{u, v\} \text{ and } \{v, w\}$ in $E$, the edge $\{u, w\}$ is also in $E$}}.

Back

A graph $G$ is transitive when for {{c2::any two edges $\{u, v\} \text{ and } \{v, w\}$ in $E$, the edge $\{u, w\}$ is also in $E$}}.

Field-by-field Comparison

Field	Before	After
Text	A graph $G$ is {{c1::~~ ~~<b>transitive</b>}} when for {{c2:: any two edges $\{u, v\} \text{ and } \{v, w\}$ in $E$, the edge $\{u, w\}$ is also in $E$}}.	A graph $G$ is {{c1::<b>transitive</b>}} when for {{c2::any two edges $\{u, v\} \text{ and } \{v, w\}$ in $E$, the edge $\{u, w\}$ is also in $E$}}.

Tags: ETH::1._Semester::A&D::07._Graphs::1._Introduction_to_Graphs

Note 4: ETH::A&D

Deck: ETH::A&D
Note Type: Horvath Cloze
GUID: iHlSvEEQPk

modified

Before

Front

A graph $G$ is complete when it's set of edges is {{c2:: $\{\{u, v\} \ | \ u, v \in V, u \neq v\}$ }}.

Back

A graph $G$ is complete when it's set of edges is {{c2:: $\{\{u, v\} \ | \ u, v \in V, u \neq v\}$ }}.

After

Front

A graph $G$ is complete when it's set of edges is {{c2:: $\{\{u, v\} \ | \ u, v \in V, u \neq v\}$ }}.

Back

A graph $G$ is complete when it's set of edges is {{c2:: $\{\{u, v\} \ | \ u, v \in V, u \neq v\}$ }}.

Field-by-field Comparison

Field	Before	After
Text	A graph $G$ is {{c1::~~ ~~<b>complete</b>}} when it's set of edges is {{c2:: $\{\{u, v\} \ \| \ u, v \in V, u \neq v\}$ }}.	A graph $G$ is {{c1::<b>complete</b>}} when it's set of edges is {{c2:: $\{\{u, v\} \ \| \ u, v \in V, u \neq v\}$ }}.

Tags: ETH::1._Semester::A&D::07._Graphs::1._Introduction_to_Graphs

Note 5: ETH::A&D

Deck: ETH::A&D
Note Type: Horvath Cloze
GUID: n!`Y!GEmVs

modified

Before

Front

{{c1:: $\sum_{i = 1}^{n} i$}} $=$ {{c2::$\frac{n(n + 1)}{2}$ (Sum)}}

Back

{{c1:: $\sum_{i = 1}^{n} i$}} $=$ {{c2::$\frac{n(n + 1)}{2}$ (Sum)}}

After

Front

{{c1:: $\sum_{i = 1}^{n} i$::Sum}} $=$ {{c2::$\frac{n(n + 1)}{2}$}}

Back

{{c1:: $\sum_{i = 1}^{n} i$::Sum}} $=$ {{c2::$\frac{n(n + 1)}{2}$}}

Field-by-field Comparison

Field	Before	After
Text	{{c1:: $\sum_{i = 1}^{n} i$}}  $=$ {{c2::$\frac{n(n + 1)}{2}$~~ (Sum)~~}}	{{c1:: $\sum_{i = 1}^{n} i$::Sum}}  $=$ {{c2::$\frac{n(n + 1)}{2}$}}

Tags: ETH::1._Semester::A&D::02._Asymptotic_Notation::3._O-Notation::Sums

Note 6: ETH::A&D

Deck: ETH::A&D
Note Type: Horvath Cloze
GUID: yg-tkTB|,7

modified

Before

Front

{{c1:: $\sum_{i = 1}^{n} i\log(i)$}} $\leq$ {{c2::$\sum_{i = 1}^n n \log(n) = n^2 \log n$}} (Sum)

Back

{{c1:: $\sum_{i = 1}^{n} i\log(i)$}} $\leq$ {{c2::$\sum_{i = 1}^n n \log(n) = n^2 \log n$}} (Sum)

After

Front

{{c1:: $\sum_{i = 1}^{n} i\log(i)$}} $\leq$ {{c2::$\sum_{i = 1}^n n \log(n) = n^2 \log n$::Sum}}

Back

{{c1:: $\sum_{i = 1}^{n} i\log(i)$}} $\leq$ {{c2::$\sum_{i = 1}^n n \log(n) = n^2 \log n$::Sum}}

Field-by-field Comparison

Field	Before	After
Text	{{c1:: $\sum_{i = 1}^{n} i\log(i)$}}  $\leq$ {{c2::$\sum_{i = 1}^n n \log(n) = n^2 \log n$~~}} (Sum) ~~	{{c1:: $\sum_{i = 1}^{n} i\log(i)$}}  $\leq$ {{c2::$\sum_{i = 1}^n n \log(n) = n^2 \log n$::Sum}}

Tags: ETH::1._Semester::A&D::02._Asymptotic_Notation::3._O-Notation::Sums

Note 7: ETH::DiskMat

Deck: ETH::DiskMat
Note Type: Horvath Classic
GUID: pa$vtGEA[j

modified

Before

Front

Define a euclidean domain:

Back

Define a euclidean domain:

A euclidean domain is an integral domain $D$ together with a degree function $d: D \setminus {0} \rightarrow \mathbb{N}$ such that:

For every $a$ and $b \neq 0$ in $D$ there exist $q$ and $r$ such that $a = bq + r$ and $d(r) < d(b)$ or $r = 0$
For all nonzero $a$ and $b$ in $D$, $d(a) \leq d(ab)$.

After

Front

Define a euclidean domain:

Back

Define a euclidean domain:

A euclidean domain is an integral domain $D$ together with a degree function $d: D \setminus {0} \rightarrow \mathbb{N}$ such that:

For every $a$ and $b \neq 0$ in $D$ there exist $q$ and $r$ such that $a = bq + r$ and $d(r) < d(b)$ or $r = 0$
For all nonzero $a$ and $b$ in $D$, $d(a) \leq d(ab)$.

Field-by-field Comparison

Field	Before	After
Back	<div>A euclidean domain is an integral domain $D$ together with a degree function $d: D \setminus {0} \rightarrow \mathbb{N}$ such that:</div><ul><li>For every $a$ and $b \neq 0$ in $D$ there exist $q$ and $r$ such that $a = bq + r$ and $d(r) < d(b)$ or $r = 0$</li><li>For all nonzero $a$ and $b$ in $D$, $d(a) \leq d(ab)$.</li></ul>	<div>A euclidean domain is an integral domain $D$ together with a degree function $d: D \setminus {0} \rightarrow \mathbb{N}$ such that:</div><ul><li>For every $a$ and $b \neq 0$ in $D$ there exist $q$ and $r$ such that $a = bq + r$ and $d(r) < d(b)$ or $r = 0$</li><li>For all nonzero $a$ and $b$ in $D$, $d(a) \leq d(ab)$.</li></ul>

Tags: ETH::1._Semester::DiskMat::5._Algebra::6._Polynomials_over_a_Field::3._Analogies_Between_Z_and_F[x],_Euclidean_Domains_*