Anki Deck Changes

Note 1: ETH::2. Semester::Analysis

Deck: ETH::2. Semester::Analysis
Note Type: Horvath Cloze
GUID: Hpp:g}bJuy

modified

Before

Front

Der Abstand zwischen zwei Komplexen $z_1, z_2$ ist $ d = |z_2 - z_1 | = |z_1 - z_2| $.

Back

Der Abstand zwischen zwei Komplexen $z_1, z_2$ ist $ d = |z_2 - z_1 | = |z_1 - z_2| $.

Hier gilt wieder die Dreiecksungleichung: $|z + w| \leq |z| + |w|$.

After

Front

Der Abstand zwischen zwei Komplexen $z_1, z_2$ ist $ d = {{c1:: |z_2 - z_1 | = |z_1 - z_2| ::\text{Beide Formen} }}$.

Back

Der Abstand zwischen zwei Komplexen $z_1, z_2$ ist $ d = {{c1:: |z_2 - z_1 | = |z_1 - z_2| ::\text{Beide Formen} }}$.

Hier gilt wieder die Dreiecksungleichung: $|z + w| \leq |z| + |w|$.

Field-by-field Comparison

Field	Before	After
Text	Der Abstand zwischen zwei Komplexen $z_1, z_2$ ist $ d = {{c1:: \|z_2 - z_1 \| = \|z_1 - z_2\| :: Beide Formen }}$.	Der Abstand zwischen zwei Komplexen $z_1, z_2$ ist $ d = {{c1:: \|z_2 - z_1 \| = \|z_1 - z_2\| ::\text{Beide Formen} }}$.

Tags: ETH::2._Semester::Analysis::1._Logik,_Mengen,_Zahlen::3._Zahlen::4._Komplexe_Zahlen::2._Polarform

Note 2: ETH::2. Semester::Analysis

Deck: ETH::2. Semester::Analysis
Note Type: Horvath Classic
GUID: J9yi_Ht+N)

modified

Before

Front

Dreiecksungleichung (Substraktion)

Back

Dreiecksungleichung (Substraktion)

\[|x + y| \geq ||x| - |y|| \]

After

Front

Dreiecksungleichung (Subtraktion)

Back

Dreiecksungleichung (Subtraktion)

\[|x + y| \geq ||x| - |y|| \]

Field-by-field Comparison

Field	Before	After
Front	Dreiecksungleichung (Substraktion)	Dreiecksungleichung (Subtraktion)

Tags: ETH::2._Semester::Analysis::1._Logik,_Mengen,_Zahlen::3._Zahlen::1._Ordnung

Note 3: ETH::2. Semester::Analysis

Deck: ETH::2. Semester::Analysis
Note Type: Horvath Cloze
GUID: KWf.KkD*CS

modified

Before

Front

Für $z \in \mathbb{C}$ gilt: $z + \bar{z} = {{c1:: 2 \text{Re}(z) }}$ und $z - \bar{z} = {{c1:: 2i \text{Im}(z) }}$

Back

Für $z \in \mathbb{C}$ gilt: $z + \bar{z} = {{c1:: 2 \text{Re}(z) }}$ und $z - \bar{z} = {{c1:: 2i \text{Im}(z) }}$

After

Front

Für $z \in \mathbb{C}$ gilt:
$z + \bar{z} = {{c1:: 2 \text{ Re}(z)}} \text{ und } z - \bar{z} = {{c1:: 2i \text{ Im}(z) }}$

Back

Für $z \in \mathbb{C}$ gilt:
$z + \bar{z} = {{c1:: 2 \text{ Re}(z)}} \text{ und } z - \bar{z} = {{c1:: 2i \text{ Im}(z) }}$

Field-by-field Comparison

Field	Before	After
Text	Für $z \in \mathbb{C}$ gilt:  $z + \bar{z} = {{c1:: 2 \text{Re}(z) }}$ und $z - \bar{z} = {{c1:: 2i \text{Im}(z) }}$	Für $z \in \mathbb{C}$ gilt:  <br>$z + \bar{z} = {{c1:: 2 \text{ Re}(z)}} \text{ und } z - \bar{z} = {{c1:: 2i \text{ Im}(z) }}$

Tags: ETH::2._Semester::Analysis::1._Logik,_Mengen,_Zahlen::3._Zahlen::4._Komplexe_Zahlen::1._Properties

Note 4: ETH::2. Semester::Analysis

Deck: ETH::2. Semester::Analysis
Note Type: Horvath Cloze
GUID: L1F:TU2gp~

modified

Before

Front

Youngsche Ungleichung: Für jedes $x, y \in \mathbb{R}$, $\epsilon > 0$ gilt \[ 2|xy| \leq {{c2:: \epsilon x^2 + \frac{1}{\epsilon} y^2 }}\]Proof Included

Back

Youngsche Ungleichung: Für jedes $x, y \in \mathbb{R}$, $\epsilon > 0$ gilt \[ 2|xy| \leq {{c2:: \epsilon x^2 + \frac{1}{\epsilon} y^2 }}\]Proof Included

Proof: Setze $\gamma = \sqrt{\epsilon} > 0$. OBDA gelte $x \cdot y \geq 0$. \[ 0 \leq (\gamma x - \frac{y}{\gamma})^2 = \gamma^2 x^2 - 2x\cdot y + \frac{1}{\gamma^2}y^2 \]

After

Front

Youngsche Ungleichung

Für jedes $x, y \in \mathbb{R}$, $\epsilon > 0$ gilt: \[ 2|xy| \leq {{c2:: \epsilon x^2 + \frac{1}{\epsilon} y^2 }}\]Proof Included

Back

Youngsche Ungleichung

Für jedes $x, y \in \mathbb{R}$, $\epsilon > 0$ gilt: \[ 2|xy| \leq {{c2:: \epsilon x^2 + \frac{1}{\epsilon} y^2 }}\]Proof Included

Proof: Setze $\gamma = \sqrt{\epsilon} > 0$. OBDA gelte $x \cdot y \geq 0$. \[ 0 \leq (\gamma x - \frac{y}{\gamma})^2 = \gamma^2 x^2 - 2x\cdot y + \frac{1}{\gamma^2}y^2 \]

Field-by-field Comparison

Field	Before	After
Text	<b>Youngsche Ungleichung<~~/b>:~~ Für jedes $x, y \in \mathbb{R}$, $\epsilon > 0$ gilt \[ {{c1:: 2\|xy\| }} \leq {{c2:: \epsilon x^2 + \frac{1}{\epsilon} y^2 }}\]<i>Proof Included</i>	<b>Youngsche Ungleichung<br></b><br>Für jedes $x, y \in \mathbb{R}$, $\epsilon > 0$ gilt: \[ {{c1:: 2\|xy\| }} \leq {{c2:: \epsilon x^2 + \frac{1}{\epsilon} y^2 }}\]<i>Proof Included</i>

Tags: ETH::2._Semester::Analysis::1._Logik,_Mengen,_Zahlen::3._Zahlen::1._Ordnung

Note 5: ETH::2. Semester::Analysis

Deck: ETH::2. Semester::Analysis
Note Type: Horvath Cloze
GUID: L@=m$)(QYg

modified

Before

Front

Aus $x \leq y$ und $u \leq v$ folgt $x + u \leq y + v$ .

Back

Aus $x \leq y$ und $u \leq v$ folgt $x + u \leq y + v$ .

Konsistenz der Ordnung zur Addition

After

Front

Aus $x \leq y$ und $u \leq v$ folgt $x + u \leq y + v$ .

Back

Aus $x \leq y$ und $u \leq v$ folgt $x + u \leq y + v$ .

Konsistenz der Ordnung zur Addition

Field-by-field Comparison

Field	Before	After
Text	Aus $x \leq y$ und $u \leq v$ folgt {{c1::$x + u \leq y + v$ :: Kombination }}.	Aus $x \leq y$ und $u \leq v$ folgt {{c1::$x + u \leq y + v$ ::Kombination}}.

Tags: ETH::2._Semester::Analysis::1._Logik,_Mengen,_Zahlen::3._Zahlen::1._Ordnung

Note 6: ETH::2. Semester::DDCA

Deck: ETH::2. Semester::DDCA
Note Type: Horvath Classic
GUID: rKhGk@]2@!

modified

Before

Front

What is dynamic power consumption?

Back

What is dynamic power consumption?

Power used to charge capacitance as signals change (0 <==> 1).

After

Front

What is dynamic power consumption?

Back

What is dynamic power consumption?

Power used to charge capacitance as signals change (0$\iff$1).

Field-by-field Comparison

Field	Before	After
Back	Power used to charge capacitance as signals change (0 ~~<==>~~ 1).	Power used to charge capacitance as signals change (0$\iff$1).

Tags: ETH::2._Semester::DDCA::02._Combinational_Logic::2._Logic_Gates

Note 7: ETH::2. Semester::PProg

Deck: ETH::2. Semester::PProg
Note Type: Horvath Cloze
GUID: hxi*,8Kfw7

modified

Before

Front

A thread is an independent (i.e. capable of running in parallel) unit of computation that executes a piece of code.

Back

A thread is an independent (i.e. capable of running in parallel) unit of computation that executes a piece of code.

After

Front

A thread is an independent (i.e. capable of running in parallel) unit of computation that executes a piece of code.

Back

A thread is an independent (i.e. capable of running in parallel) unit of computation that executes a piece of code.

Field-by-field Comparison

Field	Before	After
Text	A {{c1::thread}} is an {{c2::independent (i.e. capable of running in parallel) unit of computation}} that executes a piece of code.	A {{c1::thread}} is {{c2::an independent (i.e. capable of running in parallel) unit of computation that executes a piece of code}}.

Tags: ETH::2._Semester::PProg::03._Java_Threads ETH::2._Semester::PProg::Terminology

Note 8: ETH::2. Semester::PProg

Deck: ETH::2. Semester::PProg
Note Type: Horvath Occlusio
GUID: uzNFPB755~

modified

Before

Front

Back

After

Front

Back

Field-by-field Comparison

Field	Before	After
Occlusion	{{c1::image-occlusion:rect:left=.5507:top=.2774:width=.1165:height=.0841:oi=1}}<br>{{c2::image-occlusion:rect:left=.315:top=.5032:width=.1086:height=.0819:oi=1}}<br>{{c2::image-occlusion:rect:left=.2422:top=.7~~402~~:width=.2555:height=.0798:oi=1}}<br>{{c3::image-occlusion:rect:left=.7731:top=.5032:width=.1205:height=.0~~775~~:oi=1}}<br>{{c3::image-occlusion:rect:left=.699:top=.7357:width=.2582:height=.0797:oi=1}}<br>	{{c1::image-occlusion:rect:left=.5516:top=.2782:width=.1174:height=.0851:oi=1}}<br>{{c2::image-occlusion:rect:left=.3149:top=.504:width=.1095:height=.0818:oi=1}}<br>{{c2::image-occlusion:rect:left=.2425:top=.7396:width=.2562:height=.0785:oi=1}}<br>{{c3::image-occlusion:rect:left=.7726:top=.504:width=.1213:height=.0897:oi=1}}<br>{{c3::image-occlusion:rect:left=.6982:top=.7363:width=.2582:height=.0785:oi=1}}<br>

Tags: ETH::2._Semester::PProg::03._Java_Threads::1._Multitasking

Note 9: ETH::2. Semester::PProg

Deck: ETH::2. Semester::PProg
Note Type: Horvath Cloze
GUID: vP9^d+kmz!

modified

Before

Front

A livelock is a situation in which all threads starve by infinitely often trying to enter a critical section, but never succeeding.

Back

A livelock is a situation in which all threads starve by infinitely often trying to enter a critical section, but never succeeding.

Similar to a deadlock, the system makes no real progress, although the threads execute statements/use CPU time.

After

Front

A livelock is a situation in which all threads starve by infinitely often trying to enter a critical section, but never succeeding.

Back

A livelock is a situation in which all threads starve by infinitely often trying to enter a critical section, but never succeeding.

Similar to a deadlock, the system makes no real progress, although the threads execute statements/use CPU time.

Field-by-field Comparison

Field	Before	After
Text	A {{c1::livelock}} is a situation in which all threads ~~{{c2::~~starve by infinitely often trying to enter a critical section, but never succeeding}}.	A {{c1::livelock}} is a situation in which {{c2::all threads starve by infinitely often trying to enter a critical section, but never succeeding}}.

Tags: ETH::2._Semester::PProg::01._Introduction ETH::2._Semester::PProg::Terminology