Initial commit
This commit is contained in:
18 files changed
+1852
No files matched your search
@@ -0,0 +1,103 @@
|
||||
#import "@preview/clean-sheets:0.2.2": Cal, base-template, ex_box, qed
|
||||
|
||||
#show: body => base-template(
|
||||
1,
|
||||
[Linear Algebra I],
|
||||
[Prof. Dr. Daniel Docent],
|
||||
[Dr. Anne Assistant],
|
||||
4,
|
||||
([Jane Doe], [Joe Shmoe]),
|
||||
[John Q. Public],
|
||||
show-logo: false,
|
||||
show-end-message: true,
|
||||
body,
|
||||
)
|
||||
|
||||
= Exercise 1
|
||||
|
||||
#ex_box(
|
||||
heading: [#lorem(5)],
|
||||
points: [$5 + 10 + 5$ Points],
|
||||
)[
|
||||
#lorem(30)
|
||||
|
||||
+ #lorem(10)
|
||||
|
||||
+ #lorem(15)
|
||||
- #lorem(10)
|
||||
- #lorem(12)
|
||||
|
||||
+ #lorem(8)
|
||||
|
||||
#lorem(40)
|
||||
]
|
||||
|
||||
#lorem(59)#footnote[#lorem(21)]
|
||||
$
|
||||
(a + b)^n = sum_(k = 0)^n binom(n, k) space.thin a^(n - k) b^k
|
||||
$
|
||||
|
||||
#lorem(30) #qed
|
||||
|
||||
= Exercise 2
|
||||
|
||||
#ex_box(points: [$25$ Points])[
|
||||
#lorem(41)
|
||||
|
||||
#lorem(26)
|
||||
]
|
||||
|
||||
#lorem(17) $-pi/2 < arctan(x) := integral_0^x (dif t) / (1 + t^2) < pi/2 space forall x in RR$. #lorem(24)
|
||||
|
||||
$
|
||||
V(x_1, ..., x_n) := mat(
|
||||
1, x_1, x_1^2, dots.c, x_1^(n-1);
|
||||
1, x_2, x_2^2, dots.c, x_2^(n-1);
|
||||
1, x_3, x_3^2, dots.c, x_3^(n-1);
|
||||
dots.v, dots.v, dots.v, dots.down, dots.v;
|
||||
1, x_n, x_n^2, dots.c, x_n^(n-1)
|
||||
)
|
||||
$
|
||||
|
||||
#lorem(20)
|
||||
|
||||
$
|
||||
det V(x_1, ..., x_n) = product_(1 <= i < j <= n)(x_j - x_i)
|
||||
$
|
||||
|
||||
#lorem(60)#footnote[#lorem(31)]#footnote[#lorem(13)] #qed
|
||||
|
||||
#lorem(30) #qed
|
||||
|
||||
= Exercise 3
|
||||
|
||||
#ex_box(heading: [#lorem(8)])[
|
||||
#lorem(20)
|
||||
|
||||
#lorem(30)
|
||||
]
|
||||
|
||||
```js
|
||||
#!/usr/bin/env node
|
||||
/* block comment */ // line comment
|
||||
const π = 0xFF + 0b1010 + 0o755 + 1_000 + 1.2e-3, nil = null, nope = undefined;
|
||||
let str = "double\n\"quote\"", s = 'single\'quote', tpl = `template ${π ?? 42} \`tick\``;
|
||||
const re = /(?<=foo)[a-z\d_-]+?(?=bar)/giu;
|
||||
const obj = { key: true, ["computed-"+π]: false, nested: { ...{x: 1} } };
|
||||
const fn = async (x = 0) => x?.foo?.(π) ?? (() => { throw new Error("💥"); })();
|
||||
class Ω extends Array { #private = 1; static get x() { return this?.name; } }
|
||||
if (π >= 0 && π !== Infinity || !NaN) for (const [k,v] of Object.entries(obj)) console.log(k, v);
|
||||
try { await Promise.resolve(fn?.({foo:n=>n**2})); } catch (e) { console.error(`${e}`); }
|
||||
```
|
||||
|
||||
$
|
||||
bold("B")(P) =
|
||||
mu_0 / (4 pi)
|
||||
integral
|
||||
(I times bold(hat("r"))) / r^2 dif bold(l)
|
||||
= (mu_0 I) / (4 pi)
|
||||
integral
|
||||
(dif bold(l) times bold(hat("r"))) / r^2
|
||||
$
|
||||
|
||||
#lorem(30) #qed
|
||||
@@ -0,0 +1,47 @@
|
||||
#import "@preview/clean-sheets:0.2.2": Cal, chevrons, computer-science-template, def, ex_box, qed, satz
|
||||
|
||||
#show: body => computer-science-template(
|
||||
[Exemplarische Grundlagen I],
|
||||
(
|
||||
([Max Mustermann], [1234567]),
|
||||
([Erika Musterfrau], [7654321]),
|
||||
),
|
||||
[Wintersemester 2025/26],
|
||||
[Beispiel-Universität Musterstadt],
|
||||
[Institut für Exemplarisches],
|
||||
sheetnumber: 1,
|
||||
subtitle: lorem(5),
|
||||
department: [Abteilung Beispiel],
|
||||
submit_until: datetime(day: 1, month: 1, year: 2026, hour: 14, minute: 0, second: 0),
|
||||
testats_from: datetime(day: 1, month: 1, year: 2026, hour: 18, minute: 0, second: 0),
|
||||
testats_until: datetime(day: 8, month: 1, year: 2026, hour: 10, minute: 0, second: 0),
|
||||
group-digits: true,
|
||||
decimal-comma: true,
|
||||
body,
|
||||
)
|
||||
|
||||
|
||||
= Aufgabe 1
|
||||
|
||||
#ex_box(
|
||||
heading: [Aufgabe 1],
|
||||
points: [10 Punkte],
|
||||
)[
|
||||
Zeigen Sie eine einfache Aussage über Listen.
|
||||
]
|
||||
|
||||
```pseudo
|
||||
DEF magic_recursive(string s, string p):
|
||||
IF len(p) == 0 THEN return TRUE
|
||||
IF len(s) == 0 OR p[0] != s[0] THEN return FALSE
|
||||
return magic_recursive(s[1:], p[1:])
|
||||
```
|
||||
|
||||
#table(
|
||||
columns: 6,
|
||||
|
||||
[Heading 1], [Heading 2], [Heading 3], [Heading 4], [Heading 5], [Heading 6],
|
||||
|
||||
[Cell 1], [Cell 2], [Cell 3], [Cell 4], [Cell 5], [Cell 6],
|
||||
[Cell 7], [Cell 8], [Cell 9], [Cell 10], [Cell 11], [Cell 12],
|
||||
)
|
||||
Reference in new issue
Block a user