➡️ Concurrent Computing ⬅️
Concurrent computing is a form of computing in which several computations are executed during overlapping time periods—concurrently—instead of sequentially (one completing before the next starts).
This is a property of a system—this may be an individual program, a computer, or a network—and there is a separate execution point or "thread of control" for each computation ("process").
A concurrent system is one where a computation can advance without waiting for all other computations to complete.
Concurrent computing is a form of computing in which several computations are executed during overlapping time periods—concurrently—instead of sequentially (one completing before the next starts).
This is a property of a system—this may be an individual program, a computer, or a network—and there is a separate execution point or "thread of control" for each computation ("process").
A concurrent system is one where a computation can advance without waiting for all other computations to complete.
🛑 Big O notation 🛑
Big O notation is a mathematical notation that describes the limiting behavior of a function when the argument tends towards a particular value or infinity.
In computer science, big O notation is used to classify algorithms according to how their running time or space requirements grow as the input size grows.
The letter O is used because the growth rate of a function is also referred to as the order of the function.
Big O notation is a mathematical notation that describes the limiting behavior of a function when the argument tends towards a particular value or infinity.
In computer science, big O notation is used to classify algorithms according to how their running time or space requirements grow as the input size grows.
The letter O is used because the growth rate of a function is also referred to as the order of the function.
⭕️ First Programming Languages ⭕️
The first high-level programming language was Plankalkül, created by Konrad Zuse between 1942 and 1945.
The first high-level language to have an associated compiler was created by Corrado Böhm in 1951, for his PhD thesis.
The first commercially available language was FORTRAN (FORmula TRANslation); developed in 1956 (first manual appeared in 1956, but first developed in 1954) by a team led by John Backus at IBM.
The first high-level programming language was Plankalkül, created by Konrad Zuse between 1942 and 1945.
The first high-level language to have an associated compiler was created by Corrado Böhm in 1951, for his PhD thesis.
The first commercially available language was FORTRAN (FORmula TRANslation); developed in 1956 (first manual appeared in 1956, but first developed in 1954) by a team led by John Backus at IBM.
⭕️ Deep Learning ⭕️
Deep learning (also known as deep structured learning or hierarchical learning) is part of a broader family of machine learning methods based on learning data representations, as opposed to task-specific algorithms.
Learning can be supervised, semi-supervised or unsupervised.
Deep learning models are vaguely inspired by information processing and communication patterns in biological nervous systems yet have various differences from the structural and functional properties of biological brains (especially human brains), which make them incompatible with neuroscience evidences.
Deep learning (also known as deep structured learning or hierarchical learning) is part of a broader family of machine learning methods based on learning data representations, as opposed to task-specific algorithms.
Learning can be supervised, semi-supervised or unsupervised.
Deep learning models are vaguely inspired by information processing and communication patterns in biological nervous systems yet have various differences from the structural and functional properties of biological brains (especially human brains), which make them incompatible with neuroscience evidences.
🔶 KMP Algorithm 🔶
Knuth–Morris–Pratt string-searching algorithm (or KMP algorithm) searches for occurrences of a word within a main text string by employing the observation that when a mismatch occurs, the word itself embodies sufficient information to determine where the next match could begin, thus bypassing re-examination of previously matched characters.
The algorithm was conceived in 1970 by Donald Knuth and Vaughan Pratt, and independently by James H. Morris.
This was the first linear-time algorithm for string matching. The three published it jointly in 1977.
Knuth–Morris–Pratt string-searching algorithm (or KMP algorithm) searches for occurrences of a word within a main text string by employing the observation that when a mismatch occurs, the word itself embodies sufficient information to determine where the next match could begin, thus bypassing re-examination of previously matched characters.
The algorithm was conceived in 1970 by Donald Knuth and Vaughan Pratt, and independently by James H. Morris.
This was the first linear-time algorithm for string matching. The three published it jointly in 1977.
Python Programming for Beginners
A great Introductory Course for Beginner Programmers
• 3 hours on-demand video
• 39 articles
• Full lifetime access
• Access on mobile and TV
• Certificate of Completion
• 30-Day Money-Back Guarantee
93% Off — 23 hours left!
Start With This Link 👇🏻
http://shorturl.at/cfgm5
A great Introductory Course for Beginner Programmers
• 3 hours on-demand video
• 39 articles
• Full lifetime access
• Access on mobile and TV
• Certificate of Completion
• 30-Day Money-Back Guarantee
93% Off — 23 hours left!
Start With This Link 👇🏻
http://shorturl.at/cfgm5
⭕️ MVVM Architectural Pattern ⭕️
MVVM facilitates a separation of development of the graphical user interface – be it via a markup language or GUI code – from development of the business logic or back-end logic (the data model).
The view model of MVVM is a value converter, meaning the view model is responsible for exposing (converting) the data objects from the model in such a way that objects are easily managed and presented.
In this respect, the view model is more model than view, and handles most if not all of the view's display logic.
The view model may implement a mediator pattern, organizing access to the back-end logic around the set of use cases supported by the view.
MVVM facilitates a separation of development of the graphical user interface – be it via a markup language or GUI code – from development of the business logic or back-end logic (the data model).
The view model of MVVM is a value converter, meaning the view model is responsible for exposing (converting) the data objects from the model in such a way that objects are easily managed and presented.
In this respect, the view model is more model than view, and handles most if not all of the view's display logic.
The view model may implement a mediator pattern, organizing access to the back-end logic around the set of use cases supported by the view.
⭕️ Turing Test ⭕️
The Turing test, developed by Alan Turing in 1950, is a test of a machine's ability to exhibit intelligent behavior equivalent to, or indistinguishable from, that of a human.
Turing proposed that a human evaluator would judge natural language conversations between a human and a machine designed to generate human-like responses.
The evaluator would be aware that one of the two partners in conversation is a machine, and all participants would be separated from one another.
The conversation would be limited to a text-only channel such as a computer keyboard and screen so the result would not depend on the machine's ability to render words as speech.
If the evaluator cannot reliably tell the machine from the human, the machine is said to have passed the test. The test results do not depend on the machine's ability to give correct answers to questions, only how closely its answers resemble those a human would give.
The Turing test, developed by Alan Turing in 1950, is a test of a machine's ability to exhibit intelligent behavior equivalent to, or indistinguishable from, that of a human.
Turing proposed that a human evaluator would judge natural language conversations between a human and a machine designed to generate human-like responses.
The evaluator would be aware that one of the two partners in conversation is a machine, and all participants would be separated from one another.
The conversation would be limited to a text-only channel such as a computer keyboard and screen so the result would not depend on the machine's ability to render words as speech.
If the evaluator cannot reliably tell the machine from the human, the machine is said to have passed the test. The test results do not depend on the machine's ability to give correct answers to questions, only how closely its answers resemble those a human would give.
☕️ CoffeeScript ☕️
CoffeeScript is a programming language that transcompiles to JavaScript.
It adds syntactic sugar inspired by Ruby, Python and Haskell in an effort to enhance JavaScript's brevity and readability.
Specific additional features include list comprehension and pattern matching.
CoffeeScript is a programming language that transcompiles to JavaScript.
It adds syntactic sugar inspired by Ruby, Python and Haskell in an effort to enhance JavaScript's brevity and readability.
Specific additional features include list comprehension and pattern matching.
⭕️ Babel ⭕️
Babel is a JavaScript compiler!
Babel is a toolchain that is mainly used to convert ECMAScript 2015+ code into a backwards compatible version of JavaScript in current and older browsers or environments.
Here are the main things Babel can do for you:
• Transform syntax
• Polyfill features that are missing in your target environment
• Source code transformations
Babel is a JavaScript compiler!
Babel is a toolchain that is mainly used to convert ECMAScript 2015+ code into a backwards compatible version of JavaScript in current and older browsers or environments.
Here are the main things Babel can do for you:
• Transform syntax
• Polyfill features that are missing in your target environment
• Source code transformations
➡️ Web Accessibility ⬅️
Web accessibility is the inclusive practice of ensuring there are no barriers that prevent interaction with, or access to, websites on the World Wide Web by people with disabilities.
When sites are correctly designed, developed and edited, generally all users have equal access to information and functionality.
Web accessibility is the inclusive practice of ensuring there are no barriers that prevent interaction with, or access to, websites on the World Wide Web by people with disabilities.
When sites are correctly designed, developed and edited, generally all users have equal access to information and functionality.