Lisp: Tears of Joy, Part 5
Lisp has been hailed as the world’s most powerful programming language. But only the top percentile of programmers use it, because of its cryptic syntax and academic reputation. This is rather unfortunate, since…
‘Hundreds Working on Open Source Projects at Yahoo!, and We’ll Continue to Hire’
Yahoo! is a brand associated with open source, particularly for its contributions to the open source community. LINUX For You caught up with Hari Vasudev, VP, Cloud Platform Group, Yahoo! India R&D, to…
CodeSport (December 2010)
Welcome to CodeSport! In this month’s column, we feature a medley of questions covering C/C++, data structures, algorithms and operating systems. We close the year by featuring a bunch of questions based on…
CodeSport (November 2010)
Welcome to CodeSport! In this column, we provide the solutions to a few of the questions we had featured last month. Last month’s column featured solutions to a medley of questions on computer…
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….
A Voyage to the Kernel, Day 9
[Segment 2.3] On the 9th day of our “voyage to the kernel”, we learn about cryptography.
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.
A Voyage to the Kernel, Day 8
[Segment 2.2] In the last column, we had discussed some basic algorithms and methodologies. Now we will generalise the scheme of an algorithm.
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.
A Voyage to the Kernel, Day 7
[Segment 2.2] We are about to enter the core part of this segment—algorithms.
May 22, 2013
amitsaha — Thank you for your kind comments everyone. I am glad it's been of help.
I am excited to announce my book:...
May 22, 2013
zero client — SUNDE desktop computing solutions are very much cost effective with environmental
concern. With SUNDE, your work place can turn out to...
May 22, 2013
tabsong — pretty nice
May 21, 2013
JKR — More efficient? Probably. More readable? Definitely not.
May 21, 2013
Prashanth Joshi — The author assumes that the first article being introductory in nature is for the beginners. So there is no question...
