In computer science, a B-tree is a self-balancing tree data structure that maintains sorted data and allows searches, sequential access, insertions, and deletions in logarithmic time. The B-tree generalizes the binary search tree, allowing for nodes with more than two children.[2] Unlike other self-balancing binary search trees, the B-tree is well suited for storage systems that read and write relatively large blocks of data, such as discs. It is commonly used in databases and file systems.

Peter Naur (25 October 1928 – 3 January 2016)[1] was a Danish computer science pioneer and Turing award winner. He is best known as a contributor, with John Backus, to the Backus–Naur form (BNF) notation used in describing the syntax for most programming languages. He also contributed to creating the language ALGOL 60.

Fast development. Flutter's hot reload helps you quickly and easily experiment, build UIs, add features, and fix bugs faster. Experience sub-second reload times..

Vim is an extremely powerful editor.  Not only you can use it from command line but also from IntelliJ, Visual Studio Code, and for actual command line manipulation.

ISO 8601 Data elements and interchange formats – Information interchange – Representation of dates and times is an international standard covering the exchange of date- and time-related data. It was issued by the International Organization for Standardization and was first published in 198

Should you invest time in using Vim for software development? What should you do with Vim? How do you search for files? What about syntax coloring? Loading files from history, autocomplete and more.  As it turns out you don't need plugins for all this.

Why Google Stores Billions of lines of code in a single repository - this is a brief summary of a research paper published by google.

In a paper named Fixed it for you.  Protocol repair using lineage graphs it is described how machine can autocorrect programming error.

The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph.

Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later. The algorithm exists in many variants