"programming" tag
Question bank

CodeSport (September 2010)

Welcome to CodeSport. This month, we feature a medley of questions about operating systems, computer architecture and algorithms. Last month’s column featured three questions on mutual exclusion, the memory consistency model and synchronisation….

Typo Bugs

[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.

Joy of Programming: Demystifying the ‘Volatile’ Keyword in C

[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.

Joy of Programming: Silly Programming Mistakes => Serious Harm!

As programmers, we know that almost any software that we use (or write!) has bugs. What we might not be aware of is that many disasters occur because of silly mistakes. What can…

CodeSport (May 2009)

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.

CodeSport (March 2009)

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.

Watch Out for the Signals!

What in the world is the ‘signals’ framework and how can systems programmers make use of it?

Will FOSS Get Me A Job?

FOSS allows anyone to acquire the skills that lead to becoming a better developer and an improved person.

Joy of Programming: About the Java Overflow Bug

[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.

CodeSport (February 2009)

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.

All published articles are released under Creative Commons Attribution-NonCommercial 3.0 Unported License, unless otherwise noted.
Open Source For You is powered by WordPress, which gladly sits on top of a CentOS-based LEMP stack.

Creative Commons License.