diff options
Diffstat (limited to 'slides/presentations')
| -rw-r--r-- | slides/presentations/example/default.pug | 131 | ||||
| -rw-r--r-- | slides/presentations/example/meta.json | 3 |
2 files changed, 134 insertions, 0 deletions
diff --git a/slides/presentations/example/default.pug b/slides/presentations/example/default.pug new file mode 100644 index 0000000..67174cd --- /dev/null +++ b/slides/presentations/example/default.pug | |||
| @@ -0,0 +1,131 @@ | |||
| 1 | section | ||
| 2 | h1 Why understanding of basic math is imporant for computer programing | ||
| 3 | p September 21, 2018 | ||
| 4 | a(href="https://twitter.com/mitjafelicijan") @mitjafelicijan | ||
| 5 | |||
| 6 | |||
| 7 | |||
| 8 | section.center | ||
| 9 | q We Cannot Solve Our Problems With The Same Thinking We Used When We Created Them. | ||
| 10 | footer — Albert Einstein | ||
| 11 | |||
| 12 | |||
| 13 | |||
| 14 | section | ||
| 15 | h2 How we usually find solutions and why this is problematic? | ||
| 16 | |||
| 17 | ul | ||
| 18 | li We search for code example instead of algorithms. | ||
| 19 | li We copy and paste and do testing on trial&error principle. | ||
| 20 | li We don't take enough time to properly understand problem we a re trying to solve. | ||
| 21 | li Brute force solutions we make are usually not optimized | ||
| 22 | |||
| 23 | |||
| 24 | |||
| 25 | section | ||
| 26 | h2 Basic linear algebra | ||
| 27 | |||
| 28 | pre | ||
| 29 | code.language-css | ||
| 30 | | body { | ||
| 31 | | background: black; | ||
| 32 | | } | ||
| 33 | |||
| 34 | pre | ||
| 35 | code.language-javascript | ||
| 36 | | $(document).ready(function() { | ||
| 37 | | $('pre code').each(function(i, block) { | ||
| 38 | | hljs.highlightBlock(block); | ||
| 39 | | }); | ||
| 40 | | }); | ||
| 41 | |||
| 42 | hr | ||
| 43 | figcaption.right Step 1: Finding nearest point | ||
| 44 | |||
| 45 | $$ \large{ \mathbb{R}^2 ∈ \vec{a} \bar{a} } $$ | ||
| 46 | $$ \large{ e^{i\pi} + 1 = 0 } $$ | ||
| 47 | $$ \large{ x = {-b \pm \sqrt{b^2-4ac} \over 2a} } $$ | ||
| 48 | |||
| 49 | hr | ||
| 50 | figcaption.right Step 2: Finding nearest point | ||
| 51 | |||
| 52 | pre | ||
| 53 | code.language-python | ||
| 54 | | fruits = ["apple", "banana", "cherry"] | ||
| 55 | | for x in fruits: | ||
| 56 | | if x == "banana": | ||
| 57 | | break | ||
| 58 | | print(x) | ||
| 59 | |||
| 60 | hr | ||
| 61 | figcaption.right Finding nearest point | ||
| 62 | |||
| 63 | $$ \large{ \mathbb{R}^2 ∈ \vec{a} \bar{a} } $$ | ||
| 64 | $$ \large{ e^{i\pi} + 1 = 0 } $$ | ||
| 65 | $$ \large{ x = {-b \pm \sqrt{b^2-4ac} \over 2a} } $$ | ||
| 66 | |||
| 67 | hr | ||
| 68 | figcaption.right Finding nearest point | ||
| 69 | |||
| 70 | pre | ||
| 71 | code.language-c | ||
| 72 | | #include <stdio.h> | ||
| 73 | | int main () { | ||
| 74 | | for( ; ; ) { | ||
| 75 | | printf("This loop will run forever.\n"); | ||
| 76 | | } | ||
| 77 | | return 0; | ||
| 78 | | } | ||
| 79 | |||
| 80 | hr | ||
| 81 | figcaption.right Finding nearest point | ||
| 82 | |||
| 83 | pre | ||
| 84 | code.language-python | ||
| 85 | | fruits = ["apple", "banana", "cherry"] | ||
| 86 | | for x in fruits: | ||
| 87 | | if x == "banana": | ||
| 88 | | break | ||
| 89 | | print(x) | ||
| 90 | |||
| 91 | hr | ||
| 92 | figcaption.right Finding nearest point | ||
| 93 | |||
| 94 | pre | ||
| 95 | code.language-sql | ||
| 96 | | SELECT `CustomerName`, `City` FROM `Customers`; | ||
| 97 | |||
| 98 | hr | ||
| 99 | figcaption.right Finding nearest point | ||
| 100 | |||
| 101 | pre | ||
| 102 | code.language-go | ||
| 103 | | package main | ||
| 104 | | import "fmt" | ||
| 105 | | func main() { | ||
| 106 | | sum := 0 | ||
| 107 | | for i := 0; i < 10; i++ { | ||
| 108 | | sum += i | ||
| 109 | | } | ||
| 110 | | fmt.Println(sum) | ||
| 111 | | } | ||
| 112 | |||
| 113 | hr | ||
| 114 | figcaption.right Finding nearest point | ||
| 115 | |||
| 116 | pre | ||
| 117 | code.language-javascript | ||
| 118 | | $(document).ready(function() { | ||
| 119 | | $('pre code').each(function(i, block) { | ||
| 120 | | hljs.highlightBlock(block); | ||
| 121 | | }); | ||
| 122 | | }); | ||
| 123 | |||
| 124 | hr | ||
| 125 | figcaption.right Finding nearest point | ||
| 126 | |||
| 127 | pre | ||
| 128 | code.language-css | ||
| 129 | | body { | ||
| 130 | | background: black; | ||
| 131 | | } | ||
diff --git a/slides/presentations/example/meta.json b/slides/presentations/example/meta.json new file mode 100644 index 0000000..c670b2f --- /dev/null +++ b/slides/presentations/example/meta.json | |||
| @@ -0,0 +1,3 @@ | |||
| 1 | { | ||
| 2 | "title": "Example presentation" | ||
| 3 | } | ||
