Latest Articles
Sunday, October 30, 2011
Fundamentals of Neural Networks Architectures Algorithms and Applications - CST 416-2 Neural Networks
Posted by Knowledge for all at 7:56 PMFundamentals of Neural networks Architectures algorithms and Applications for CST 416-2
you can download here
Fausett --Fundamentals of Neural Networks-- read more
Wednesday, September 21, 2011
Hibernate with Eclipse part 1 for Rapid Application Development - CST305-3
Posted by Knowledge for all at 3:48 AM
To download this tutorial click on following link.....................................
HibernatewithEclipse.pdf read more
HibernatewithEclipse.pdf read more
Thursday, September 8, 2011
Kaspersky Internet Security 2012 delivers premium protection from viruses, Trojans, spam, hackers, and more. Its cutting-edge, hybrid approach to digital security combines innovative, cloud-based technologies with advanced antivirus protection to deliver a faster, more effective response to today’s complex, ever-evolving threats. You, your private data and PC are completely protected as you work, bank, shop and play online.
And when you purchase it you must pay $59.95 for it. But here you can get it for free and latest updated keys are available for free.
First step:
get Kaspersky Internet Security 2012 from below link
Kaspersky Internet Security 2012 setup
Second step:
Install it and when it ask for key give
AAAAA-AAAAA-AAAAA-AAAA3
as a key.
Third step:
Get key file from below link and extract it and select a suitable key
New keys..
you can get a idea from below picture
read more
Wednesday, September 7, 2011
These are the BODYGUARD movie Download links........
read more
Why to Write Shell Script ?
- Shell script can take input from user, file and output them on screen.
- Useful to create our own commands.
- Save lots of time.
- To automate some task of day today life.
- System Administration part can be also automated.
read more
#include
int main()
{
int i,j,k=1,p,a[20],b[20],n,cnt=1,big;
printf("Enter the maximum number of elements\n");
scanf("%d",&n);
printf("Enter the elements\n");
for(i=1; i<=n; i++)
scanf("%d",&a[i]);
for(i=1; i<=n; i++)
{
for(j=i+1;j<=n; j++)
{
if(a[i]==a[j])
cnt++;
}
b[k]=cnt;
k++;
cnt=1;
}
big=b[1];
p=1;
for(i=2; i<=n; i++)
{
if(big
{
big=b[i];
p=i;
}
}
printf("The element that occurs offenly is %d\n",a[p]);
printf("And it has occurred %d times\n",b[p]);
getch();
return 0;
} read more
int main()
{
int i,j,k=1,p,a[20],b[20],n,cnt=1,big;
printf("Enter the maximum number of elements\n");
scanf("%d",&n);
printf("Enter the elements\n");
for(i=1; i<=n; i++)
scanf("%d",&a[i]);
for(i=1; i<=n; i++)
{
for(j=i+1;j<=n; j++)
{
if(a[i]==a[j])
cnt++;
}
b[k]=cnt;
k++;
cnt=1;
}
big=b[1];
p=1;
for(i=2; i<=n; i++)
{
if(big
{
big=b[i];
p=i;
}
}
printf("The element that occurs offenly is %d\n",a[p]);
printf("And it has occurred %d times\n",b[p]);
getch();
return 0;
} read more
Subscribe to:
Posts (Atom)