[The Joy of Programming] Can typing mistakes (typos) cause bugs? Yes, they can! We’ll look at some common C programming mistakes in this column.
[The Joy of Programming] Most programmers don’t understand the meaning and significance of the ‘volatile’ keyword. So let’s explore that in this month’s Joy of Programming.
As programmers, we know that almost any software that we use (or write!) has bugs. What we might not be aware of is that …
This month we take a quick look at the problem of finding out whether a given binary tree is in fact a binary search tree. We then discuss the problem of finding the maximum and minimum in a binary search tree.
In this month’s column, we’ll explore the best lower bounds of algorithms to determine whether a given graph is connected or not. We will then discuss the problem of finding the minimum element in a circular sorted linked list, given an arbitrary pointer into the list.
What in the world is the ‘signals’ framework and how can systems programmers make use of it?
FOSS allows anyone to acquire the skills that lead to becoming a better developer and an improved person.
[The Joy of Programming] In this column, we’ll discuss a common overflow bug in JDK, which surprisingly occurs in the widely used algorithms like binary search and mergesort in C-based languages.
This month’s column focuses on computational complexity and the lower bounds for algorithms. In particular, we’ll show that any algorithm to find the maximum in an array of N elements has a lower bound of O(N) by using an adversary argument.