blog

blog
•
home

Dynamic Programming: Top-Down vs Bottom-Up

31st Jan 2021

Dynamic Programming is a method used to solve problems by breaking the main problem up into subproblems, storing and reusing the results, and combining the solutions...

Dijkstra's Algorithm

5th Dec 2020

While sitting in a café in 1956, Edsger Dijkstra considered the problem of finding the shortest path between two cities, namely Rotterdam and Groningen...

The Cascading Failure Problem

4th Oct 2020

Doug McIlroy is well renowned for being the innovator behind Unix pipelines, along with his work on a range of programming languages and Unix programs...

Isolation in ACID Transactions

10th Sep 2020

In 1981, Jim Gray¹ published the paper, The Transaction Concept: Virtues and Limitations, in which he provides the following definition of a transaction...