What are decision trees? Decision trees are a form of supervised machine learning. They are built on a binary tree data structure and generate predictions by percolating input features through a system of binary questions. All non-leaf nodes in the tree ask these questions and the leaf nodes contain predictions. The below illustration depicts a decision tree (specifically a classifier tree): Decision trees are of two primary types: classification and regression....
Notes from learning measure theory. Covers a review of Riemann integrals and integrability. These are notes and therefore liable to inaccuracies.
This article covers the tree data structure. In particular: the unbalanced binary search tree and its implementations are investigated. Pitfalls of these implementations are discussed in terms of time and space efficiency. Mitigation of these through the AVL tree is presented and quantified by establishing an upper-bound on search time complexity.
Visual basic .NET was launched as a successor to Visual Basic in 2002. It runs on the .NET framework and is multi-paradigm and object-oriented. As far as I’m aware multi-paradigm refers to the language’s ability to support more than one programming paradigm or style, for example - to support OOP in combination with imperative and procedural styles. VB.NET is being deprecated as the language will not have any new features added to it....
Today, we take a break from my series on sorting algorithms and look at thread-safety. As a result, we will learn about threads and create a multi-threaded program. Then, we learn about thread safety and implement it in a C# console application. What are threads? Every program I have ever written has had a single sequential flow of control. Once the program begins executing, it systematically goes through every line of code until the end....