Rename sections

Author: enesdemirag

exercises/approximating-pi.md

@@ -1,4 +1,4 @@
-### Question - Approximating Pi
+### Theoretical - Approximating Pi
 
 The number π (pi) is a mathematical constant defined as the ratio of a circle's circumference to its diameter. This magical number appears in many formulas in all areas of mathematics and physics.
 
@@ -8,7 +8,7 @@ Since computers can't work with infinite decimals, they need to approximate pi.
 
 Write a program which approximates the value of π
 
-### Answer - Approximating Pi
+### Practical - Approximating Pi
 
 There are a couple different ways of estimating π. I will use **[Monte Carlo Method](http://mathworld.wolfram.com/MonteCarloMethod.html)** with C programming.
 

exercises/caesar-cipher.md

@@ -1,4 +1,4 @@
-### Question - Caesar Cipher
+### Theoretical - Caesar Cipher
 
 **Caesar Cipher** is one of the simplest and most widely known encryption techniques. It is a type of substitution cipher in which each letter in the text is replaced by a letter some fixed number of positions down the alphabet.
 
@@ -19,7 +19,7 @@ output        : "Congratulations"
 
 You can watch this _[Khan Academy Video](https://www.khanacademy.org/computing/computer-science/cryptography/crypt/v/caesar-cipher)_ and read this _[article](http://www.cs.trincoll.edu/~crypto/historical/caesar.html)_ for more information.
 
-### Answer - Caesar Cipher
+### Practical - Caesar Cipher
 
 We read every character one by one using for loop in Python. Instead of using alphabet string I used Python's two build-in functions for shifting. ```ord()``` function converts character to its _[ascii code](https://theasciicode.com.ar)_ and the ```chr()``` function works vice-versa. Firstly we get the ascii number of the character, then add that shift value.
 

exercises/fibonacci-finder.md

@@ -1,4 +1,4 @@
-### Question - Fibonacci Finder
+### Theoretical - Fibonacci Finder
 
 The Fibonacci sequence is one of the most famous formulas in mathematics. Each number in the sequence is the sum of the two numbers that precede it. So, the sequence goes: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, and so on.
 
@@ -24,7 +24,7 @@ output        : 10
 
 For more information check out _[this](http://mathworld.wolfram.com/FibonacciNumber.html)_ website and *[wikipedia](https://en.wikipedia.org/wiki/Fibonacci_number)* page.
 
-### Answer - Fibonacci Finder
+### Practical - Fibonacci Finder
 
 Here is a function which returns the index of the input number in fibonacci sequence. If input value is not a member of fibonacci sequence it gives -1.
 

exercises/image-kernels.md

@@ -1,4 +1,4 @@
-### Question - Image Kernels
+### Theoretical - Image Kernels
 
 An **image kernel** is a small matrix used to apply effects such as blurring, sharpening, and edge detection. They are like ancestors of modern image processing techniques and even used today in machine learning for _feature extraction_, a technique for determining the most important portions of an image.
 
@@ -32,7 +32,7 @@ output  : (filtered image in a matrix form)
 
 If you want to learn more about image kernels, you can check *[wikipedia](https://bit.ly/2yfaapD)* page and _[this documentation](https://docs.gimp.org/en/gimp-filter-convolution-matrix.html)_ from gimp, also I certainly suggest you to look at _[this website](http://setosa.io/ev/image-kernels/)_ for visually explanation of image kernels.
 
-### Answer - Image Kernels
+### Practical - Image Kernels
 
 I will use Python for this solution. Before coding, we need to import _[numpy](https://docs.scipy.org/doc/numpy/user/whatisnumpy.html)_ and _[matplotlib](https://matplotlib.org/)_ modules to our program. Numpy enables us to perform fast operations on matrices. Of course we can write our program without using numpy but it would be much harder. Matplotlib actually a plotting library for python but we need it just for showing our filtered image.
 

exercises/inverse-factorial.md

@@ -1,4 +1,4 @@
-### Question - Inverse Factorial
+### Theoretical - Inverse Factorial
 
 In mathematics, the **factorial** of a integer n, denoted by n!, is the product of all positive integers less than or equal to n.
 
@@ -11,7 +11,7 @@ input         : 120
 output        : 5
 ```
 
-### Answer - Inverse Factorial
+### Practical - Inverse Factorial
 
 We create a loop counting from one to infinite. And in every loop we check that if number can be divided without remainder and multiply the products until we reach to input value.
 

exercises/linear-regression.md

@@ -1,8 +1,8 @@
-### Question - Linear Regression
+### Theoretical - Linear Regression
 
 todo
 
-### Answer - Linear Regression
+### Practical - Linear Regression
 
 ```python
 import random

exercises/mass-spring-damper-simulation.md

@@ -1,8 +1,8 @@
-### Question - Mass Spring Damper Simulation
+### Theoretical - Mass Spring Damper Simulation
 
 todo
 
-### Answer - Mass Spring Damper Simulation
+### Practical - Mass Spring Damper Simulation
 
 ```python
 import numpy as np

exercises/perlin-noise.md

@@ -1,4 +1,4 @@
-### Question - Perlin Noise
+### Theoretical - Perlin Noise
 
 [Perlin noise](https://en.wikipedia.org/wiki/Perlin_noise) is a random sequence generator producing a more natural, harmonic succession of numbers than that of the standard ```random()``` function. It was developed by Ken Perlin in the 1980s and has been used in graphical applications to generate procedural textures, shapes, terrains, and other seemingly organic forms.
 
@@ -22,7 +22,7 @@ For more information about this topic, you can look links below.
 - [Working with Simplex Noise](https://cmaher.github.io/posts/working-with-simplex-noise/)
 - [Simplex Noise Demystified](http://staffwww.itn.liu.se/~stegu/simplexnoise/simplexnoise.pdf)
 
-### Answer - Perlin Noise
+### Practical - Perlin Noise
 
 [Here](https://gist.github.com/eevee/26f547457522755cb1fb8739d0ea89a1) is a Python implementation of Perlin Noise. You can examine that but for simplicity I will use [OpenSimplex](https://pypi.org/project/opensimplex/) package. Using this package, we can generate 2D, 3D and 4D simplex noise in Python.