Intro
by Kostiantyn Synyshyn Front-end Developer at Levi Nine
Table of contents
Computer science
PROCESSES
PROCEDURES
JavaScript
Python
C++
Java
Declarative vs Imperative
√X is the Y such that
Y * Y = X and Y>=0To find an apoximation to √X
-make a guess G
-improve the guess G
by averaging the G and X/G
-keep improving/iterating
on the instruction until G is good enough THEORETICAL COMPUTER SCIENCE
COMPUTER ENGINEERING
APPLICATIONS
THEORETICAL COMPUTER SCIENCE
Alan Mathison Turing
1912-1954
THEORETICAL COMPUTER SCIENCE
Alan Mathison Turing
1912-1954
«On Computable Numbers, With An Application to Entscheidungsproblem»
THEORETICAL COMPUTER SCIENCE
Computational complexity
P
NP
&
Nondeterministic polynomial time - easy to check, hard to solve.
Polynomial-time type problems - easy for computer, both to solve and check.
COMPUTER ENGINEERING
von Neumann architecture
APPLICATIONS
WEB APPS
BROWSER
OPERATING SYSTEM
BIOS
SILICON
processor commands
assembly
C/ C++
Java
JavaScript
C#
Swift
APPLICATIONS
RUST
COMPILERS
APPLICATIONS
WEB APPS
your code
node_modules
Links
Summary
Thank you!
Q&A