Introduction By definition, a Distributed system is not a Centralized system where state is stored on a single computer. Centralized Systems are simpler, easy to understand and can be faster for a single user. Distributed Systems state is divided over multiple computers. It is more robust, scalable but also more complex. Examples of Distributed Systems : Distributed Systems Advantages The main advantage …
Introduction Splunk and ELK Stack (Elasticsearch, Logstash, and Kibana) are the “big 2” log analytic engines on the market. They have a lot in common and it’s pretty tricky to find which one suits your needs. They capture, index, and correlate real-time data in a searchable repository from which it can generate graphs, reports, alerts, dashboards, and …
Introduction As you may have seen in my previous article how to use Ansible (https://www.linkedin.com/pulse/configuration-automation-ansible-beginners-lionel-gurret/), we can use many modules to configure and developp our playbooks. Here are in my opinion the 10 most useful Ansible modules you should know (on Linux environments) ! The Ping Module The first thing you probably want to do …
Here are the famous 14 principles that drive Amazon. Customer obsession – Leaders start with the customer and work backwards. They work vigorously to earn and keep customer trust. They obsess over customers. Ownership – Leaders are owners. They think long term and act on behalf of the entire company. They never say, “That’s not my job.” …
Introduction Recursion is a way of solving a problem by having a function calls itself. In this article we will use factorials as an example with Python. Factorials Do you remember what are factorials ? Pretty easy : n! = n * (n-1) * (n-2) * (n-3) * (n-4) * …. * 3 * 2 …
Introduction A hashing algorithm’s goal is to generate a value computed from a base input number using a hashing function which are one way functions. It’s generally a cryptographic function that maps data of arbitrary size to a hash of a fixed size. The ideal hash function should respect the following points : As you …
Introduction As we explained it in the Data Structure article, “Graphs algorithms” are used a lot in real-life. They are used to represent networks like you can find in cities, phones or even in Facebook where each person is represented by a node. Each node contains information like the name, the gender, the phone number …
Introduction Dynamic Programming is basically used to resolve problems by dividing them into sub-problems. You will begin with the smallest first and then continue with bigger ones. It has been introduced by Richard Bellman in the 50s. When should we use it ? When we have optimal structure and overlapping subproblems : Example with Fibonacci sequence …
In computer science, a search algorithm is any algorithm which solves the search problem, namely, to retrieve information stored within some data structure. In this article we will take a look at two simple search algorithms. Linear search How it works ? The easiest search algorithm you can imagine ! Also known as sequential search this is a method for finding an element …
Introduction In mathematics and computer science, an algorithm is an unambiguous specification of how to solve a class of problems. Algorithms can perform calculation, data processing, and automated reasoning tasks. Some algorithms are better than others even if they produce equal results. Generally, the fewer steps it takes to compute, the better it is. But sometimes we care …