Wednesday, March 16, 2011

CrazyEngineers Forum - Computer Science & IT Engineering

CrazyEngineers Forum - Computer Science & IT Engineering

Let us forecast the future of Draft Sight in Indian market

Posted: 15 Mar 2011 06:30 PM PDT

Dassault Systemes Releases Free DraftSight, will it become a threat to other CAD software?

Wireless and Mobile Computing

Posted: 15 Mar 2011 08:48 AM PDT

Here I invite all the researcher students to share their research topic and some knowledge about this Subject

Truncating MS-SQL server table

Posted: 15 Mar 2011 07:51 AM PDT

Any body having any idea on how to set up a sql server database table for automatic truncation i mean it should be automatically truncated every day?

(using c)Generating Magic Squares of odd order using De la Loubre's method

Posted: 15 Mar 2011 05:28 AM PDT

Magic squares are nothing but where row,column and diagonal sums are constant
for e.g enter odd number say 9 then you will get the output as magic square as follows
Read the method here
http://britton.disted.camosun.bc.ca/magicsq/magic.html

Attachment 50
Code:
#include<stdio.h>
#include<dos.h>
void main()
{
int a[100][100],x,y,tmp=1,n;
clrscr();
printf("\n Enter the odd no for which you want to generate magic square\n");
scanf("%d",&n);
for(x=0;x<=n-1;x++)
{
for(y=0;y<=n-1;y++)
{
a[x][y]=0;
}
}
x=0;
y=(n-1)/2;

if(!(n%2==0))
{
a[x][y]=tmp;
hello:
x-=1;
y+=1;
if(tmp>=n*n)
goto raw;
if((x<0)&&(y>=n))
{
x+=2;
y-=1;
goto another;
}
if(x<0)
x=n-1;
if(y>=n)
y=0;
another:
tmp+=1;
if(a[x][y]==0)
{
a[x][y]=tmp;
}
else
{
y-=1;
x+=2;
a[x][y]=tmp;
}
goto hello;


}
else
{
printf("\n you have not entered an odd number\n");
}
raw:
printf("\n");
for(x=0;x<=n-1;x++)
{
for(y=0;y<=n-1;y++)
{
delay(300);
printf("%d\t",a[x][y]);
}
printf("\n");
}
getch();
}
Attached Images

SOA testing

Posted: 15 Mar 2011 02:20 AM PDT

Hello All,
My name is Abhishek,working on SOA testing.I am using Automation tool like Parasoft SOAtest and i have knowledge on other automation tools also.I just want to know the chances of future growth on this technology.
Posted by at

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)