Best buys this season: The ELCOT Student Laptop

Posted by imdonatello as Acer, Dell, ELCOT, Product, SUSE, laptop, linux, students, ubuntu


The Electronics Corporation of Tamil Nadu has started this year’s sale of inexpensive laptops with preloaded Linux (SUSE Linux Enterprise) for students studying in Tamil Nadu. There have been many press releases, for example, see this one. The laptop is said to be procured from Dell or Acer.
The high capacity version of the ELCOT laptop […]

Popularity: 5%



Breaking the Monotony

Posted by imdonatello as Fun, humour


Rickrolling is such a funny term.
Ok, I made it to IISc: http://csa.iisc.ernet.in/people. Not too discombobulated I hope? Ok then.

Popularity: 2%



Download day Announced!

Posted by imdonatello as Free and Open Source, download day, firefox, linux, mozilla, release, spread firefox


17th June 2008

That’s the official release date that has been announced for Firefox 3 on the Mozilla Developers blog! So lets get ready to implement our pledges and download the best browser out there!
EDIT: 15th June’s “The Hindu” newspapers features an article about Ubuntu and Firefox, how they rock and why they are great for […]

Popularity: 2%



Interesting CS Interview Questions #2

Posted by imdonatello as C program, Complexity, Computer Science, Probability, Problem, SDT, Space complexity, Time complexity, algorithms, binary tree, coding, data structures, functions, interviews, linked lists, logic, recursion, software development engineer, stack


This post is a continuation of my interesting CS interview questions series. The last two problems discussed in this post lean more towards logic and probability rather than a CS concept.
Consider the Lock and Unlock operation defined on an m-ary tree as follows:
Lock Node X => If (no node present in the subtree rooted at […]

Popularity: 3%



Interesting CS Interview Questions #1

Posted by imdonatello as C program, Complexity, Computer Science, Problem, SDT, Space complexity, Time complexity, algorithms, binary tree, coding, data structures, functions, interviews, linked lists, recursion, software development engineer, stack


I’ve been through a lot of CS interviews recently and so I have come across many interesting problems. I find many of them worth sharing. So I am writing this short series of posts on this topic. All of these interviews were for a job post of Software Development Engineer. If you happen to be […]

Popularity: 2%



Lets spread Firefox!

Posted by imdonatello as Free and Open Source, download day, firefox, firefox myths, linux, spreadfirefox


Download Day 2008 will soon be unveiled and hundreds of thousands of people will prepare to download Firefox 3! The higher the number of people who download, the higher the chances of setting a Guinness World Record. Read more about it by clicking the image above.
Though, Firefox is being pushed as a great browser (and […]

Popularity: 3%



New SPOJ Contest has just started

Posted by imdonatello as SPOJ, coding, online programming contest, programming


Its been a somewhat long time since anyone has hosted a contest on SPOJ. Now at last Roman Sol is putting up a programming contest at SPOJ. It is between May 3 and May 20 and the problems are tough!
The contest itself is located here.
Enjoy the contest!

Popularity: 3%



The Hardy Heron flys out!

Posted by imdonatello as Free and Open Source, linux


Well, this is just a note. I’m sure everyone already knows! See the features!
YABBA DABBA DOO!

Popularity: 4%



Ubuntu Hardy Heron is almost out!

Posted by imdonatello as NITT, debmirror, hardy heron, linux, repositories, ubuntu


The release candidate is available! Keeping with its trend to stay on the edge, the release candidate comes with Firefox 3 beta 5 (the last beta version had Beta 4)! Four days to go for the final release, and we at NITT are already getting ready to download the repositories for local usage (we don’t […]

Popularity: 7%



An interesting easy problem

Posted by imdonatello as Problem, algorithm, coding


I haven’t been writing for a pretty long time now Anyways.
Someone asked me to solve this problem:
Given an array A of integers of length N, find a sub-array whose sum is a multiple of N.
To solve it in a brute force manner could be a reasonable exercise for beginners in programming. The solution is […]

Popularity: 2%



Page 1 of 212»