The n queens puzzle is the problem of placing n queens on an n×n chessboard such that none of them are able to capture any other using the standard chess queen’s moves. The queens must be placed in such a way that no two queens attack each other. Thus, a solution requires that no two [...]
Archive for March, 2010
Posted in 
C code for MAGIC MATRIX
Posted by Mohit Chandra on March 29th, 2010
Magic Matrix of order n*n is a matrix in which the sum of elements of every row,every column and every diagonal is same.The following C code generate a magic matrix of order 3*3.
#include “stdio.h”
main()
{
int a[3][3];
int i=2,r=2,c=1;
a[r][c]=1;
while(i<=9)
[...]
C code for finding Subset
Posted by Abhishek on March 26th, 2010
One of the interesting programming problems is finding all the possible subsets of any given set. It is not only asked in many programming contests but is also used as a function in solving other programming problems.
The C code for finding the subsets of any given superset using recursion has already been presented here [...]
Researchers Give Update on Road to Parallelism
Posted by Saurabh on March 25th, 2010
EE Times (03/19/10) Merritt, Rick
University of Illinois researchers have taken several small steps toward developing new parallel programming models to tap the many-core processors of the future. The DeNovo project attempts to define a new and more rigorous way of utilizing shared memory. It is working concurrently with a separate effort to define a deterministic, [...]
GREEN REVOLUTION OF SOFTWARE INDUSTRY
Posted by Neha on March 24th, 2010
Open–Source movement/ free software movement began in 1983 when Richard Stallman announced the GNU. Idea was to start a freedom of movement for users of computers replacing software with restrictive licensing terms for free software.
These days this is referred as the green revolution of the IT sector, the earlier green revolution of the agricultural sector, [...]
