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.
Five rules you should follow.
[The Joy of Programming] Integer overflows often result in nasty bugs. In this column, we’ll look at some techniques to detect an overflow before it occurs.
Transifex can be your gateway to translations.
Let’s learn the intricacies of D-Bus and use it to hack some nifty features into programs.
What in the world is the ‘signals’ framework and how can systems programmers make use of it?
Configure GlassFish, code an application and deploy it on the application server.
[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.
[Segment 2.2] In the last column, we had discussed some basic algorithms and methodologies. Now we will generalise the scheme of an algorithm.
In this part 10 of the series on “Programming in Python for Friends and Relations” we build a small classifieds application.