From eaf89064f0f6abb8ebeb09c7da49cd792514c897 Mon Sep 17 00:00:00 2001 From: Mitja Felicijan Date: Sun, 23 Sep 2018 23:30:10 +0200 Subject: content update --- .../basic-math-in-programming/default.pug | 150 ++++++++++++ .../basic-math-in-programming/drawing1.svg | 264 +++++++++++++++++++++ .../basic-math-in-programming/meta.json | 3 + slides/presentations/example/default.pug | 150 ------------ slides/presentations/example/drawing1.svg | 264 --------------------- slides/presentations/example/meta.json | 3 - 6 files changed, 417 insertions(+), 417 deletions(-) create mode 100644 slides/presentations/basic-math-in-programming/default.pug create mode 100644 slides/presentations/basic-math-in-programming/drawing1.svg create mode 100644 slides/presentations/basic-math-in-programming/meta.json delete mode 100644 slides/presentations/example/default.pug delete mode 100644 slides/presentations/example/drawing1.svg delete mode 100644 slides/presentations/example/meta.json (limited to 'slides') diff --git a/slides/presentations/basic-math-in-programming/default.pug b/slides/presentations/basic-math-in-programming/default.pug new file mode 100644 index 0000000..c84446d --- /dev/null +++ b/slides/presentations/basic-math-in-programming/default.pug @@ -0,0 +1,150 @@ +section + h1 Why understanding of basic math is imporant for computer programing + p September 21, 2018 + a(href="https://twitter.com/mitjafelicijan") @mitjafelicijan + + + +section.center + q We Cannot Solve Our Problems With The Same Thinking We Used When We Created Them. + footer — Albert Einstein + + + +section + h2 How we usually find solutions and why this is problematic? + + ul + li We search for code example instead of algorithms. + li We copy and paste and do testing on trial&error principle. + li We don't take enough time to properly understand problem we a re trying to solve. + li Brute force solutions we make are usually not optimized + + +section + h3 Grid example + div.grid.col-1-1 + div Lipsum + div Lipsum + + div.grid.col-2-1 + div Lipsum + div Lipsum + + div.grid.col-1-2 + div Lipsum + div Lipsum + +section + h2 Basic linear algebra + + pre + code.language-css + | body { + | background: black; + | } + + pre + code.language-javascript + | $(document).ready(function() { + | $('pre code').each(function(i, block) { + | hljs.highlightBlock(block); + | }); + | }); + + hr + figcaption.right Step 1: Finding nearest point + + div.center + img(src="drawing1.svg") + + hr + figcaption.right Step 1: Finding nearest point + + $$ \large{ \mathbb{R}^2 ∈ \vec{a} \bar{a} } $$ + $$ \large{ e^{i\pi} + 1 = 0 } $$ + $$ \large{ x = {-b \pm \sqrt{b^2-4ac} \over 2a} } $$ + + hr + figcaption.right Step 2: Finding nearest point + + pre + code.language-python + | fruits = ["apple", "banana", "cherry"] + | for x in fruits: + | if x == "banana": + | break + | print(x) + + hr + figcaption.right Finding nearest point + + $$ \large{ \mathbb{R}^2 ∈ \vec{a} \bar{a} } $$ + $$ \large{ e^{i\pi} + 1 = 0 } $$ + $$ \large{ x = {-b \pm \sqrt{b^2-4ac} \over 2a} } $$ + + hr + figcaption.right Finding nearest point + + pre + code.language-c + | #include + | int main () { + | for( ; ; ) { + | printf("This loop will run forever.\n"); + | } + | return 0; + | } + + hr + figcaption.right Finding nearest point + + pre + code.language-python + | fruits = ["apple", "banana", "cherry"] + | for x in fruits: + | if x == "banana": + | break + | print(x) + + hr + figcaption.right Finding nearest point + + pre + code.language-sql + | SELECT `CustomerName`, `City` FROM `Customers`; + + hr + figcaption.right Finding nearest point + + pre + code.language-go + | package main + | import "fmt" + | func main() { + | sum := 0 + | for i := 0; i < 10; i++ { + | sum += i + | } + | fmt.Println(sum) + | } + + hr + figcaption.right Finding nearest point + + pre + code.language-javascript + | $(document).ready(function() { + | $('pre code').each(function(i, block) { + | hljs.highlightBlock(block); + | }); + | }); + + hr + figcaption.right Finding nearest point + + pre + code.language-css + | body { + | background: black; + | } diff --git a/slides/presentations/basic-math-in-programming/drawing1.svg b/slides/presentations/basic-math-in-programming/drawing1.svg new file mode 100644 index 0000000..19212c3 --- /dev/null +++ b/slides/presentations/basic-math-in-programming/drawing1.svg @@ -0,0 +1,264 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + image/svg+xml + + + + + + + + + + + + a + + + + + diff --git a/slides/presentations/basic-math-in-programming/meta.json b/slides/presentations/basic-math-in-programming/meta.json new file mode 100644 index 0000000..c670b2f --- /dev/null +++ b/slides/presentations/basic-math-in-programming/meta.json @@ -0,0 +1,3 @@ +{ + "title": "Example presentation" +} diff --git a/slides/presentations/example/default.pug b/slides/presentations/example/default.pug deleted file mode 100644 index c84446d..0000000 --- a/slides/presentations/example/default.pug +++ /dev/null @@ -1,150 +0,0 @@ -section - h1 Why understanding of basic math is imporant for computer programing - p September 21, 2018 - a(href="https://twitter.com/mitjafelicijan") @mitjafelicijan - - - -section.center - q We Cannot Solve Our Problems With The Same Thinking We Used When We Created Them. - footer — Albert Einstein - - - -section - h2 How we usually find solutions and why this is problematic? - - ul - li We search for code example instead of algorithms. - li We copy and paste and do testing on trial&error principle. - li We don't take enough time to properly understand problem we a re trying to solve. - li Brute force solutions we make are usually not optimized - - -section - h3 Grid example - div.grid.col-1-1 - div Lipsum - div Lipsum - - div.grid.col-2-1 - div Lipsum - div Lipsum - - div.grid.col-1-2 - div Lipsum - div Lipsum - -section - h2 Basic linear algebra - - pre - code.language-css - | body { - | background: black; - | } - - pre - code.language-javascript - | $(document).ready(function() { - | $('pre code').each(function(i, block) { - | hljs.highlightBlock(block); - | }); - | }); - - hr - figcaption.right Step 1: Finding nearest point - - div.center - img(src="drawing1.svg") - - hr - figcaption.right Step 1: Finding nearest point - - $$ \large{ \mathbb{R}^2 ∈ \vec{a} \bar{a} } $$ - $$ \large{ e^{i\pi} + 1 = 0 } $$ - $$ \large{ x = {-b \pm \sqrt{b^2-4ac} \over 2a} } $$ - - hr - figcaption.right Step 2: Finding nearest point - - pre - code.language-python - | fruits = ["apple", "banana", "cherry"] - | for x in fruits: - | if x == "banana": - | break - | print(x) - - hr - figcaption.right Finding nearest point - - $$ \large{ \mathbb{R}^2 ∈ \vec{a} \bar{a} } $$ - $$ \large{ e^{i\pi} + 1 = 0 } $$ - $$ \large{ x = {-b \pm \sqrt{b^2-4ac} \over 2a} } $$ - - hr - figcaption.right Finding nearest point - - pre - code.language-c - | #include - | int main () { - | for( ; ; ) { - | printf("This loop will run forever.\n"); - | } - | return 0; - | } - - hr - figcaption.right Finding nearest point - - pre - code.language-python - | fruits = ["apple", "banana", "cherry"] - | for x in fruits: - | if x == "banana": - | break - | print(x) - - hr - figcaption.right Finding nearest point - - pre - code.language-sql - | SELECT `CustomerName`, `City` FROM `Customers`; - - hr - figcaption.right Finding nearest point - - pre - code.language-go - | package main - | import "fmt" - | func main() { - | sum := 0 - | for i := 0; i < 10; i++ { - | sum += i - | } - | fmt.Println(sum) - | } - - hr - figcaption.right Finding nearest point - - pre - code.language-javascript - | $(document).ready(function() { - | $('pre code').each(function(i, block) { - | hljs.highlightBlock(block); - | }); - | }); - - hr - figcaption.right Finding nearest point - - pre - code.language-css - | body { - | background: black; - | } diff --git a/slides/presentations/example/drawing1.svg b/slides/presentations/example/drawing1.svg deleted file mode 100644 index 19212c3..0000000 --- a/slides/presentations/example/drawing1.svg +++ /dev/null @@ -1,264 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - image/svg+xml - - - - - - - - - - - - a - - - - - diff --git a/slides/presentations/example/meta.json b/slides/presentations/example/meta.json deleted file mode 100644 index c670b2f..0000000 --- a/slides/presentations/example/meta.json +++ /dev/null @@ -1,3 +0,0 @@ -{ - "title": "Example presentation" -} -- cgit v1.2.3