From 6a98c802fd7400510b2469ccb9315f5d31c7155a Mon Sep 17 00:00:00 2001
From: Mitja Felicijan <mitja.felicijan@gmail.com>
Date: Sun, 23 Sep 2018 22:43:26 +0200
Subject: content update

---
 slides/presentations/example/default.pug | 131 +++++++++++++++++++++++++++++++
 slides/presentations/example/meta.json   |   3 +
 2 files changed, 134 insertions(+)
 create mode 100644 slides/presentations/example/default.pug
 create mode 100644 slides/presentations/example/meta.json

(limited to 'slides/presentations')

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 @@
+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
+  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
+
+  $$ \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 <stdio.h>
+      | 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/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 @@
+{
+	"title": "Example presentation"
+}
-- 
cgit v1.2.3