barend-erasmus Goto Github PK

airline-reservation-system

Airline Reservation System

alopia

angular-and-apache-jena-fuseki

apache-jena-fuseki-proxy

axios

Promise based HTTP client for the browser and node.js

bitcoin-trader

bloom-filter

A Bloom filter is a space-efficient probabilistic data structure, conceived by Burton Howard Bloom in 1970, that is used to test whether an element is a member of a set. False positive matches are possible, but false negatives are not – in other words, a query returns either "possibly in set" or "definitely not in set".

bond-repayment-visualizer

canary-releases

Canary release is a technique that helps reduce the impact of negative changes by gradually rolling out the changes. If a problem with the new release is detected during the rollout then it can be rolled back, and only a subset of the traffic will have been impacted.

chat-application

clear-redis

Clear Redis using a pattern

code-testing-guidelines

Unit Test, Integration Test, Functional Test

connection-pool-performance-testing

content-predictor-service

creating-libraries

A simple guide to creating libraries

d3-dom-less

data-science

data-structures-and-algorithms

data-structures-performance-testing

database-backup-dropbox

Backups database and copies file to Dropbox

design-patterns

In software engineering, a design pattern is a general repeatable solution to a commonly occurring problem in software design. A design pattern isn't a finished design that can be transformed directly into code. It is a description or template for how to solve a problem that can be used in many different situations.

developersworkspace.co.za

diet-formulator-service

diffie-hellman-key-exchange-algorithm

Diffie–Hellman key exchange (D–H) [nb 1] is a specific method of securely exchanging cryptographic keys over a public channel and was one of the first public-key protocols as originally conceptualized by Ralph Merkle and named after Whitfield Diffie and Martin Hellman.[1][2] D–H is one of the earliest practical examples of public key exchange implemented within the field of cryptography.

dijkstra-s-algorithm

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.

distributed-browser-computing

distributed-lock-manager

The DLM maintains a list of system resources and provides locking mechanisms to control allocation and modification of resources.

distributed-lock-manager-net

.NET Client for Distributed Lock Manager Server

distributed-lock-manager-node

Node.js Client for Distributed Lock Manager Server

dynamic-ip-store