Making Simple Modifications to the Linux Source
March 23, 2018
This post is Part 2 of a series on the Linux kernel. Part 1 - Part 3 The Linux kernel is one of the most complex open-source projects available to the public, and the source code that comprises it is highly intricate, to say the least. Knowing this, I wondered what it would take to pick apart such a technological beast and actually begin to understand it. The key to understanding, like anything else, is to learn by doing.
How to Compile the Linux Kernel from Source
March 3, 2018
This post is Part 1 of a series on the Linux kernel. Part 2 - Part 3 Linux is everywhere, and there are plenty of Linux distributions available providing great out-of-the-box features. But what happens when you need to make an intricate, low-level change to system functionality? What if you wanted to get into kernel development and start to understand one of the world’s largest open source projects? The first step to doing all of these things is compiling the Linux kernel from source.
How to Implement a Hash Table in Python
November 24, 2017
This tutorial will show you how to implement a hash table with separate chaining. It’s not the most efficient method, but it is the simplest way to get started and create a fully functioning hash table. Background Hash tables are indispensable tools for solving a wide assortment for so many interesting programming problems. I always love to incorporate a hash table into a problem; they can provide a clean solution to an issue that would be a mess otherwise.
How to Implement a Queue in Python
June 23, 2017
You may hate the line at the DMV, but without it, things might turn into a rough-and-tumble free for all! In the same way that a line keeps raging motorists from getting out of hand, a Queue helps your computer keep its ducks in a row. The Queue functions very much like a line of people. It’s a First-In, First-Out (FIFO) data structure, so no cutting! Starting Out Bear with me.
How to Implement a Stack in Python
June 22, 2017
There’s no other data structure like the Stack. In only a few minutes, you can have a fully working implementation that can be used to solve a wide variety of problems. Stacks are useful for anything from reversing a string to language processing applications - not to mention the fact that many programming languages (and probably your operating system) rely on a Stack to function. Click here for the full Stack source code.
How to Implement a Linked List in Python
June 20, 2017
Need a quick run down on a classic data structure? Look no further. Click here for the full LinkedList source code. Also, here is the test code. A linked list is an ordered collection of elements. The thing that makes it special is how it stores data. Behind the scenes, each number, string, object, or other value you may need to keep track of is stored in a Node. Each Node references its successor.