Explained Simply

/Explained Simply

Straight to the point articles covering the basic theory on various technology topics

B-tree vs. Binary Tree

B-Trees and binary trees are both non-linear data structures and while their names may sound similar, they’re very different in nature. In this article, we will compare them to make them easier to distinguish. B-Tree B-tree is a self-balancing tree data structure in which a node can have more than two children. The height of [...]

By |2019-04-07T13:17:28+03:00February 11th, 2019|Categories: Explained Simply|Tags: , , |0 Comments

BFS vs. DFS

Breadth-First Search (BFS) and Depth-First Search (DFS) are algorithms for traversing graphs. Traversal is the process of accessing each vertex (node) of a data structure in a systematic well-defined order. Choosing the algorithm depends on the type of data you are dealing with. There are generally two types of traversal and the main difference between [...]

By |2019-04-07T13:19:44+03:00January 28th, 2019|Categories: Explained Simply|Tags: , , , |0 Comments

What is JSON Web Token?

JWT or JSON Web Token is JSON base standard for credential access (RFC 7519). The token contains access claims. For example the authentication server can generate token with claim "edit article" and the user with this claim can access functionality in REST API to "edit article". What is JWT structure? Typically JWT looks like: xxxx.yyyy.zzzz [...]

By |2019-01-06T23:49:44+03:00January 14th, 2019|Categories: Explained Simply|Tags: , |0 Comments

The essence of JSON

JSON means JavaScript Object Notation. It is an open source text base standard for data exchange. Primary usage of JSON is to transmit data between web browsers and servers as alternative of XML. Syntax rules Data is a key-value pair (also reffered to as property) separated by a comma. Keys are always strings.Curly brackets hold [...]

By |2018-12-23T17:26:24+03:00January 8th, 2019|Categories: Explained Simply|Tags: |0 Comments

Trees vs. Graphs

Trees and graphs are data structures used to resolve various complex problems. Knowing the difference between them is useful in terms of better understanding of the non-linear way of storing data. Definition: Trees and graphs are both abstract data structures. They are a non-linear collection of objects, which means that there is no sequence between [...]

By |2019-04-07T13:20:21+03:00January 1st, 2019|Categories: Explained Simply|Tags: , , |0 Comments

Recursion vs. Iteration

Both algorithms repeatedly execute a set of instructions. Recursion is a function that call itself repeatedly. Iteration is when a loop is executed repeatedly while certain condition is true. Differences between recursion and iteration: Recursion is a process applied on a function, iteration does not require a function.Infinite recursion can lead to system crash (stack [...]

By |2018-12-06T23:24:08+03:00December 7th, 2018|Categories: Explained Simply|Tags: , , |0 Comments

Stacks vs. Queues

Stacks and queues are both very commonly used data structures. They dynamically store and retrieve data items in two different ways. Let’s take a look at these two principles, so we can understand what differences they have and where their uses may be applicable. Definition: Stacks and queues are both abstract data structures and the [...]

By |2019-04-07T13:26:28+03:00December 6th, 2018|Categories: Explained Simply|Tags: , , |0 Comments

What is Recursion?

In the film "Edge of Tomorrow", the main character, Major William Cage, fights against aliens and gets to relive the same day over and over again. Each time he dies, accidentally or with purpose, he is brought back to the same point in time. This special ability allows him to overcome the challenges he is [...]

By |2018-12-05T21:04:58+03:00December 5th, 2018|Categories: Explained Simply|Tags: |0 Comments

Bit Manipulation in C

Writing programs for embedded systems often requires the manipulation of individual bits. Below is a list of the most common operations. In the examples we are performing them on an unsigned long variable called ctrl_reg. Setting a bit We can set a bit using the bitwise OR operator (|): ctrl_reg |= 1UL << n; The [...]

By |2018-08-17T22:57:56+03:00February 2nd, 2018|Categories: Explained Simply|Tags: , , |0 Comments

Git – Basic Commands

Using Git requires getting familiar with its commands and their usage. The list below contains some of the more important commands: init - Used for creating and initializing repository (project). Most often it is done on a server where the entire repository is stored. clone - Download repository. add - Add files to git repository. commit [...]

By |2018-12-03T22:38:42+03:00June 3rd, 2017|Categories: Explained Simply|0 Comments
We use cookies on this site to improve our service, perform analytics and remember website preference. By using the site, you consent to these cookies (Privacy policy). I consent to cookies