Kill the code: February 2012

Saturday, 25 February 2012

Moving Circle in JAVA

An applet program to move circle in JAVA

import java.applet.*;
import java.awt.*;

/*
<applet code="moving_circle" width=300 height=100>
</applet>
*/

public class moving_circle extends Applet implements Runnable
{
int x=0;
Thread t;
Image buffer;
Graphics bufferg;

public void init()
{
t=new Thread(this);
t.start();
Dimension d=getSize();
buffer=createImage(d.width,d.height);
}
public void run()
{
try
{
while(true)
{
repaint();
Thread.sleep(500);
}
}
catch(Exception e)
{
}
}

public void update(Graphics g)
{
paint(g);
}

public void paint(Graphics g)
{
if(bufferg==null)
bufferg=buffer.getGraphics();

Dimension d=getSize();
bufferg.setColor(Color.black);
bufferg.fillRect(0,0,d.width,d.height);
bufferg.setColor(Color.white);
bufferg.fillOval(x,d.height/4,50,50);

g.drawImage(buffer,0,0,this);
x+=5;
if(x+50>d.width)
x=0;
}
}

Thursday, 23 February 2012

Simple Calculator in Javascript using Switch Case

<html>
<head>
</head>
<body>
<script type="text/javascript">
function all(value1) {

var a1 = parseInt(document.getElementById("n1").value);
var a2 = parseInt(document.getElementById("n2").value);
var a3;
switch(value1)
{
case '+' : a3=a1+a2; break;
case '-' : a3=a1-a2; break;
case '*' : a3=a1*a2; break;
case '/' : a3=a1/a2; break;
}
document.getElementById("ans").value=a3;
return;
}
</script>
<table align="center">
<tr>
<td colspan="2">
<input type="text" id="n1"/>
</td>
<td colspan="2">
<input type="text" id="n2"/>
</td>
</tr>
<tr>
<td>
<input type="button" value="+" id="+but" onclick=" return all(this.value)" value="+"/>
</td>
<td>
<input type="button" value="-" id="-but" onclick=" return all(this.value)" value="-"/>
</td>
<td>
<input type="button" value="*" id="*but" onclick=" return all(this.value)" value="*"/>
</td>
<td>
<input type="button" value="/" id="/but" onclick=" return all(this.value)" value="/"/>
</td>
</tr>
<tr>
<td colspan="4">
<input type="text" id="ans" readonly="readonly"/>
</td>
</tr>
</table>
</body>
</html>

Wednesday, 22 February 2012

Set background color on mouse click

import java.io.*;
import java.awt.*;
import java.awt.event.*;
import java.applet.*;
/*
<applet code="Brighter" width=300 height=400>
</applet>
*/
public class Brighter extends Applet implements MouseListener
{
int i;
Color color;
public void init()
{
color=new Color(i,i,i);
setBackground(color);
addMouseListener(this);
}
public void mouseClicked(MouseEvent me)
{
i+=10;
if(i>255)
{
i=255;

}
color=new Color(i,i,i);
setBackground(color);
repaint();

}
public void mouseEntered(MouseEvent me)
{
}
public void mouseExited(MouseEvent me)
{

}
public void mousePressed(MouseEvent me)
{
}
public void mouseReleased(MouseEvent me)
{
}
}

Sound Play in JAVA

/*Play sound using JAVA...*/

import java.applet.*;
import java.awt.*;
import java.awt.event.*;

public class PlaySoundApplet extends Applet implements ActionListener{
Button play,stop;
AudioClip audioClip;

public void init(){
play = new Button(" Play in Loop ");
add(play);
play.addActionListener(this);
stop = new Button(" Stop ");
add(stop);
stop.addActionListener(this);
audioClip = getAudioClip(getCodeBase(), "TestSnd.wav");
}

public void actionPerformed(ActionEvent ae){
Button source = (Button)ae.getSource();
if (source.getLabel() == " Play in Loop "){
audioClip.play();
}
else if(source.getLabel() == " Stop "){
audioClip.stop();
}
}
}

Sunday, 19 February 2012

Simple Calculator in JavaScript

calc
Preview :

Code :

<html>

<head>

</head>

<body>

function add() {

var a1 = document.getElementById('n1');

var a2 = document.getElementById('n2');

document.getElementById('ans').value = parseInt(a1.value)+parseInt(a2.value);

return;

}

function sub() {

var a1 = document.getElementById('n1');

var a2 = document.getElementById('n2');

document.getElementById('ans').value = parseInt(a1.value)-parseInt(a2.value);

return;

}

function mul() {

var a1 = document.getElementById('n1');

var a2 = document.getElementById('n2');

document.getElementById('ans').value = parseInt(a1.value)*parseInt(a2.value);

return;

}

function div() {

var a1 = document.getElementById('n1');

var a2 = document.getElementById('n2');

document.getElementById('ans').value = parseInt(a1.value)/parseInt(a2.value);

return;

}

function all(id) {

if(id=='+but') add();

if(id=='-but') sub();

if(id=='*but') mul();

if(id=='/but') div();

return;

}

</script>

<tr>

</td>

</td>

</tr>

<tr>

<td>

</td>

<td>

</td>

<td>

</td>

<td>

</td>

</tr>

<tr>

</td>

</tr>

</table>

</body>

</html>

Saturday, 18 February 2012

Vigener Cipher in C

// WAP to implement Vignere cipher in C.

#include<conio.h>
#include<stdio.h>
void main()
{
int i,j,b=65,c=65,d=65,t[20];
char s[20],a[26][26];
clrscr();
for(i=0;i<26;i++)
{
for(j=0;j<26;j++)
{
if(b<91)
{
a[i][j]=b;
b++;
}
else
{
a[i][j]=d;
d++;

}
}
c++;
b=c;
d=65;
}
for(i=0;i<26;i++)
{
for(j=0;j<26;j++)
{
printf("%c",a[i][j]);
}
printf("\n");
}
printf("\nEnter the text : ");
gets(s);
for(i=0;i<strlen(s);i++)
{
t[i]=s[i]-65;
}
for(i=0;i<strlen(s);i++)
{
s[i]=(a[t[i]][i]);
}
for(i=0;i<strlen(s);i++)
{
printf("%c",s[i]);
}
getch();
}

/*OUTPUT :

Enter the text :

D E A R
| | | |
| | | |
| | | | // Cipher text is :
D F C V
| | | |
| | | |
| | | |
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
B C D E F G H I J K L M N O P Q R S T U V W X Y Z A
C D E F G H I J K L M N O P Q R S T U V W X Y Z A B
D E F G H I J K L M N O P Q R S T U V W X Y Z A B C
E F G H I J K L M N O P Q R S T U V W X Y Z A B C D
F G H I J K L M N O P Q R S T U V W X Y Z A B C D E
G H I J K L M N O P Q R S T U V W X Y Z A B C D E F
H I J K L M N O P Q R S T U V W X Y Z A B C D E F G
I J K L M N O P Q R S T U V W X Y Z A B C D E F G H
J K L M N O P Q R S T U V W X Y Z A B C D E F G H I
K L M N O P Q R S T U V W X Y Z A B C D E F G H I J
L M N O P Q R S T U V W X Y Z A B C D E F G H I J K
M N O P Q R S T U V W X Y Z A B C D E F G H I J K L
N O P Q R S T U V W X Y Z A B C D E F G H I J K L M
O P Q R S T U V W X Y Z A B C D E F G H I J K L M N
P Q R S T U V W X Y Z A B C D E F G H I J K L M N O
Q R S T U V W X Y Z A B C D E F G H I J K L M N O P
R S T U V W X Y Z A B C D E F G H I J K L M N O P Q
S T U V W X Y Z A B C D E F G H I J K L M N O P Q R
T U V W X Y Z A B C D E F G H I J K L M N O P Q R S
U V W X Y Z A B C D E F G H I J K L M N O P Q R S T
V W X Y Z A B C D E F G H I J K L M N O P Q R S T U
W X Y Z A B C D E F G H I J K L M N O P Q R S T U V
X Y Z A B C D E F G H I J K L M N O P Q R S T U V W
Y Z A B C D E F G H I J K L M N O P Q R S T U V W X
Z A B C D E F G H I J K L M N O P Q R S T U V W X Y

*/

Sky effect in C

// WAP to implement sky effect in C...

#include<stdio.h>
#include<conio.h>
#include<graphics.h>
#include<stdlib.h>
#include<dos.h>
void main()
{
int d=DETECT,m,i;
clrscr();
initgraph(&d,&m,"c:\\tc\\bgi");
for(i=0;i<150;i++)
{
putpixel(rand()%1000,rand()%1000,rand()%1000);
putpixel(rand()%1000,rand()%1000,rand()%1000);
putpixel(rand()%1000,rand()%1000,rand()%1000);
putpixel(rand()%1000,rand()%1000,rand()%1000);
putpixel(rand()%1000,rand()%1000,rand()%1000);
putpixel(rand()%1000,rand()%1000,rand()%1000);
putpixel(rand()%1000,rand()%1000,rand()%1000);
putpixel(rand()%1000,rand()%1000,rand()%1000);
delay(50);
}
getch();
closegraph();
}

Friday, 17 February 2012

Rail Fence Cipher in C

#include<conio.h>
#include<stdio.h>
void main()
{
int i,j,k=0,l=0,m=0;
char s[20],a[10],b[10];
clrscr();
printf("enter a string:");
scanf("%s",s);
for(i=0;i<strlen(s);i++)
{
if(i%2==0)
{
a[k]=s[i];
k++;
}
else
{
b[l]=s[i];
l++;
}
}

for(i=0;i<k;i++)
{
printf("%c ",a[i]);
s[m]=a[i];
m++;
}
printf("\n");
for(i=0;i<l;i++)
{
printf(" %c",b[i]);
s[m]=b[i];
m++;
}
printf("\n\ncipher text is %s",s);
getch();
}

Thursday, 9 February 2012

DDA Line Drawing Algorithm in C

#include<conio.h>
#include<stdio.h>
#include<graphics.h>
void main()
{
int gd=DETECT, gm, i;
float dx, dy, a, b, c, d, m, t;
clrscr();
initgraph(&gd,&gm,"c:\\tc\\bgi");
printf("enter starting and ending point : ");
scanf("%f %f %f %f",&a,&b,&c,&d);
if(a>c)
{
t=a;
a=c;
c=t;
t=b;
b=d;
d=t;
}
dx=c-a;
dy=d-b;
m=dy/dx;
putpixel(a,b,100);
if(abs(m)<=1)
{
for(i=0; i<dx; i++)
{
a=a+1;
b=b+m;
putpixel(a,b,100);
}
}
if(abs(m)>1)
{
for(i=0; i<dx; i++)
{
a=a+(1/m);
b=b+1;
putpixel(a,b,100);
}
}
getch();
closegraph();
}

Wednesday, 8 February 2012

Mid-Point Circle program in C

#include<conio.h>
#include<stdio.h>
#include<graphics.h>
void main()
{
int xc, yc, x=0, y, i=0, gd=DETECT, gm, p[20];
clrscr();
initgraph(&gd, &gm, "c:\\tc\\bgi");
printf("enter the center of the circle : ");
scanf("%d",&xc);
scanf("%d",&yc);
printf("enter the radius : ");
scanf("%d",&y);
p[0]=1-y;
putpixel(xc+x,yc+y,100);
putpixel(xc+x,yc-y,100);
putpixel(xc+y,yc+x,100);
putpixel(xc+y,yc-x,100);
putpixel(xc-x,yc+y,100);
putpixel(xc-x,yc-y,100);
putpixel(xc-y,yc+x,100);
putpixel(xc-y,yc-x,100);

while(x<=y)
{
if(p[i]<0)
{
p[i+1]=p[i]+2*x+1;
x=x+1;
i++;
}
else
{
p[i+1]=p[i]+2*x-2*y+1;
x=x+1;
y=y-1;
i++;
}
putpixel(xc+x,yc+y,100);
putpixel(xc-x,yc+y,100);
putpixel(xc+x,yc-y,100);
putpixel(xc-x,yc-y,100);
putpixel(xc+y,yc+x,100);
putpixel(xc+y,yc-x,100);
putpixel(xc-y,yc+x,100);
putpixel(xc-y,yc-x,100);
}
getch();
closegraph();
}

Monday, 6 February 2012

Play-Fair Cipher in C

/* Play Fair Cipher in C... */

#include<stdio.h>
#include<conio.h>
void main()
{
int i,j,isI=0,l,k=0,start=0,same=0,k1=0;
int i1,j1,i2,j2,i11,jj;
char alph[5][5],chr[25],chr2[25],character,chr1='a',chr_ex[25];
char txt[25],txt2[25];
clrscr();
printf("\nEnter the text : ");
scanf("%s",chr);
for(i=0;i<strlen(chr2);i++) /*TO PREVENT STRING FROM BEING PRINTED WITH GARBAGE CHARACTER...*/
{
chr_ex[i]='-';
}
for(i=0;i<strlen(chr);i++)
{
printf("\nchr[%d] = %c",i+1,chr[i]);
chr_ex[i]=chr[i];
}
for(i=0;i<5;i++)
{
for(j=0;j<5;j++)
{
alph[i][j]='-';
}
}
for(i=0;i<5;i++)
{
for(j=0;j<5;j++)
{
character=chr[++k];
for(l=k-1;l>=0;l--) //FOR REPEATING CHARACTERS...
{
if(character==chr[l])
{
chr[k]='-';
break;
}
}
}
}
k=0;
for(i=0;i<5;i++)
{
for(j=0;j<5;j++)
{
if(start++<strlen(chr))
if(chr[k]!='-') //FOR i AND j
{
if(chr[k]=='i' || chr[k]=='j')
{
if(isI==0)
{
alph[i][j]=chr[k];
isI=1;
}
else
{
if(chr[k]=='i') chr[k]='i';
if(chr[k]=='j') chr[k]='j';
j--;
}
}
else alph[i][j]=chr[k];
}
else
{
chr[k]='-';
j--;
}
k++;
}
}
chr1--;
k1=0;
for(i=0;i<5;i++)
{
for(j=0;j<5;j++)
{
if(alph[i][j]=='-')
{
same=0;
chr1++;
for(k1=0;k1<strlen(chr);k1++)
{
if(chr1==chr[k1])
{
same=1; //else same=0;
j--;
break;
}
}
if(same!=1)
{
if(chr1=='i' || chr1=='j')
{
if(isI==0)
{
alph[i][j]=chr1;
isI=1;
}
else j--;
}
else alph[i][j]=chr1;
}
}
}
}
printf("\n\n\n");
for(i=0;i<5;i++)
{
for(j=0;j<5;j++)
{
printf("%c ",alph[i][j]);
}
printf("\n");
}
j=0;
for(i=0;i<strlen(chr);i++)
{
if(chr[i]=='-')
{
for(j=i;j<strlen(chr);j++)
{
chr[j]=chr[j+1];
}
}
}
printf("\n\nEnter the plain text : ");
scanf("%s",txt);
j=0;
for(i=0;i<strlen(txt);i++)
{
txt2[j++]=txt[i];
if(txt[i]==txt[i+1])
{
txt2[j++]='x';
}
}
jj=j;
for(i11=0;i11<strlen(txt2);i11+=2)
{
for(i=0;i<5;i++)
{
for(j=0;j<5;j++)
{
if(txt2[i11]==alph[i][j])
{
i1=i;
j1=j;
}
if(txt2[i11+1]==alph[i][j])
{
i2=i;
j2=j;
}
}
}
if(i1==i2)
{
if((j1+1)>=5) j1=-1;
if((j2+1)>=5) j2=-1;
//if(j2>j1)
//{
txt2[i11]=alph[i1][j1+1];
txt2[i11+1]=alph[i2][j2+1];
//}
//else
//{
// txt2[i11]=alph[i1][j2+1];
// txt2[i11+1]=alph[i2][j1+1];
//}
}
else if(j1==j2)
{
if((i1+1)>=5) i1=-1;
if((i2+1)>=5) i2=-1;

//if(i1>i2)
//{
// txt2[i11]=alph[i1+1][j1];
// txt2[i11+1]=alph[i2+1][j2];
//}
//else
//{
txt2[i11]=alph[i1+1][j1];
txt2[i11+1]=alph[i2+1][j2];
//}
}
else
{
if(i2>i1)
{
txt2[i11+1]=alph[i2][j1];
txt2[i11]=alph[i1][j2];
}
else
{
txt2[i11]=alph[i2][j1];
txt2[i11+1]=alph[i1][j2];
}
}
}
printf("\nFinal string : ");
for(i=0;i<jj;i++)
{
printf("%c",txt2[i]);
}
//printf("\nFinal string : %s",txt2);
getch();
}

/* OUTPUT :

Enter the text : playfair

p l a y f
i r b c d
e g h k m
n o q s t
u v w x z

Enter the plain text : nisargmehtay

Final String : ueyqgoegmqfp

OUTPUT Sequence :

ni = ue

p l a y f
i r b c d
e g h k m
n o q s t
u v w x z

sa = yq

p l a y f
i r b c d
e g h k m
n o q s t
u v w x z

rg = go

p l a y f
i r b c d
e g h k m
n o q s t
u v w x z

me = eg

p l a y f
i r b c d
e g h k m
n o q s t
u v w x z

ht = mq

p l a y f
i r b c d
e g h k m
n o q s t
u v w x z

ay = fp

p l a y f
i r b c d
e g h k m
n o q s t
u v w x z

Hill Cipher in C

Just paste this program in your Turbo C/C++ compiler...

#include<stdio.h>
#include<conio.h>
void main()
{
int i,j,ans[25][1],sum=0,mtrx[25][25],end;
char txt[25];
clrscr();
printf("\nEnter the string : ");
scanf("%s",txt);
//clrscr();
for(i=0;i<25;i++)
{
if(txt[i]>=97 && txt[i]<122) {}
else
{
end=i;
break;
}
}
for(i=0;i<end;i++)
{
//printf("initial : %d ",txt[i]);
txt[i]=txt[i]-'a';
//printf("final : %d ",txt[i]);
//printf("\n\n");
}
clrscr();
printf("\nEnter matrix...\n");
for(i=0;i<end;i++)
{
for(j=0;j<end;j++)
{
scanf("%d",&mtrx[i][j]);
}
}
for(i=0;i<end;i++)
{
sum=0;
for(j=0;j<end;j++)
{
sum+=mtrx[i][j]*(int)txt[j];
}
ans[i][0]=sum;
}
for(i=0;i<end;i++)
{
printf(" %c",((ans[i][0])%26)+97);
}
getch();
}

Pages

Saturday, 25 February 2012

Thursday, 23 February 2012

Wednesday, 22 February 2012

Sunday, 19 February 2012

Saturday, 18 February 2012

Friday, 17 February 2012

Thursday, 9 February 2012

Wednesday, 8 February 2012

Monday, 6 February 2012