000: Hash Tables, or sort of
In a few words and at a risk to make some mistakes in my definition, a hash table is basically a data structure or array that allows to return a value paired with
In a few words and at a risk to make some mistakes in my definition, a hash table is basically a data structure or array that allows to return a value paired with
What is a concurrent process? In a few words pseudo parallelism. Take a look at the following diagram that I steal from somewhere else. The first image shows tree tasks (processes) running in
Every task or process we have in our programs should have been designed to run with a predefined periodicity, this is a must for a real-life program, and timing is an important asset
Circular buffers or queues are also very common algorithms in computing, their utility ranges from communicating processes securely, storing information to be used later, or as a synchronization mechanism for processes that run
You should not underestimate the code necessary to control effectively a mechanical button, trust me it has its own amount of complexity. I’m not going to start explaining the effects of a
In simpler terms, a state machine will read a series of inputs. When it reads an input, it will switch to a different state. Each state specifies which state to switch to, for