1.

TO FIND THE PROPERTIES OF A LOCAL MACHINE

AIM:

TO FIND THE PROPERTIES OF A LOCAL MACHINE

ALGORITHM:

STEP1: START THE PROCESS.

STEP2: IMPORT THE REQUIRED PACKAGES.

STEP3: GET THE LOCALHOST INFORMATION BY INVOKING THE RELEVANT METHOD.

STEP4: PRINT THE SYSTEM NAME&THE IPADDRESS.

STEP5: STOP THE PROCESS.

PROGRAM:

import java.io.*;
import java.net.*;
public class find
{
public static void main(String args[])throws Exception
{
InetAddress ia=InetAddress.getLocalHost();
System.out.println("Host and address:"+ia);
System.out.println("HostName:"+ia.getHostName());
String s=ia.toString();
System.out.println("IPAddress"+s.substring(s.indexOf("/")+1));
}
}
OUTPUT:

RESULT:

THE ABOVE PROGRAM WAS SUCCESSFULLY EXECUTED AND THE RESULTS ARE
VERIFIED

2. TCP PACKET DETAILS

AIM:

TO FIND THE DETAILS OF THE TCP PACKET ON THE RESPECTIVE PORT.

ALGORITHM:

STEP1: START THE PROCESS.

STEP2: IMPORT THE REQUIRED PACKAGES.

STEP3 : GET THE IPADDRESS OF THE SYSTEM USING GETLOCALHOST METHOD.

STEP4 : PASS THIS ADDRESS TO THE GETADDRESS METHOD AS AUGUMENT AND FIND
ITS HOSTNAME.

STEP5: GETS ITS PORT NUMBER BY USING GETPORT METHOD.

STEP6 : DISPLAY THE SIZE OF THE ADDRESS BY USING GETLENGTH METHOD.

STEP7: SAVE AND EXECUTE THE PROGRAM.

STEP8: STOP THE PROCESS.

PROGRAM:
import java.io.*;
import java.net.*;
public class tcp
{
public static void main(String args[])throws Exception
{
String s="network";
byte data[]=s.getBytes();
try
{
InetAddress id=InetAddress.getLocalHost();
System.out.println(id);
int port=7;
DatagramPacket dp=new DatagramPacket(data,data.length,id,port);
System.out.println("The address is"+dp.getAddress()+" onPort "+dp.getPort());

System.out.println("There are "+dp.getLength()+" Byte of data packet");

}
catch(UnknownHostException e)
{
System.out.println(e);
}
}
}

OUTPUT:

RESULT:

THE ABOVE PROGRAM WAS SUCCESSFULLY EXECUTED AND THE RESULTS ARE
VERIFIED
 3. DNS SERVER

AIM:

TO GET THE DOMAIN NAME AND THE URL USED CURRENTLY.

ALGORITHM:

STEP1: START THE PROCESS.

STEP2: IMPORT THE REQUIRED PACKAGES.

STEP3: GET THE INET ADDRESS.

STEP4: DISPLAY THE URL NAME BY CALLING GETALLBYNAME METHOD.

STEP5: THE INET ADDRESS CALCULATE THE IP ADDRESS OF THE GIVEN DNS AND DISPLAYS ITS ADDRESS

STEP6: SAVE AND EXECUTE THE PROGRAM.

STEP7: STOP THE PROCESS.

PROGRAM:
import java.net.*;
import java.io.*;
class dns
{
public static void main (String args[])
{
try
{
InetAddress[]Address=InetAddress.getAllByName("www.google.com");
for(int j=0;j<Address.length;j++)
System.out.println(Address[j]);
}
catch(Exception e)
{
System.out.println("Error in catch"+e);
}
}
}
OUTPUT:

RESULT:

THE ABOVE PROGRAM WAS SUCCESSFULLY EXECUTED AND THE RESULTS ARE
VERIFIED
 4. IPADDRESS AND MASKING

AIM:

GET THE IPADDRESS OF THE SYSTEM&MASK IT.

ALGORITHM:

STEP1: START THE PROCESS.

STEP2: IMPORT THE EQUIRED PACKAGES.

STEP3: EXTRACT THE IPADDRESS OF THE SYSTEM USING GETCANONICAL METHOD.

STEP4: DISPLAY THE CANONICALHOST ADDRESS USING GETHOSTADDRESS METHOD.

STEP5: MASK THE IPADDRESS BY GETADDRESS METHOD FOR THE EXTRACTED

IPADDRESS.

STEP6: SAVE AND EXECUTE THE PROGRAM.

STEP7: STOP THE PROCESS.

PROGRAM:

import java.io.*;
import java.net.*;
public class mask
{
public static void main(String args[])throws Exception
{
InetAddress addr=InetAddress.getLocalHost();
String IpAddress=addr.getHostAddress();
System.out.println("IP Address of localhost from java program:"+IpAddress);
System.out.println("Canoncial HostAddress:"+addr.getAddress());
String hostname=addr.getHostName();
System.out.println("Host Name:"+hostname);
}
}
OUTPUT:

RESULT:

THE ABOVE PROGRAM WAS SUCCESSFULLY EXECUTED AND THE RESULTS ARE
VERIFIED
 5. IP VALIDATOR

AIM:

TO CHECK WHETHER THE GIVEN IPADDRESS IS VALID OR NOT.

ALGORITHM:

STEP1: START THE PROCESS.

STEP2: IMPORT THE REQUIRED NET& OTHER PACKAGES.

STEP3: GET THE IPADDRESS WITH 4 FIELDS SEPARATE BY THE DELIMITOR.

STEP4: USING ISVALIDIP METHOD CHECK THE IPADDRESS.

STEP5: USING BOOLEAN VALUE, PRINT TRUE/FALSE FOR THE VALID AND INVALID
IPADDRESS.

STEP6 SAVE AND EXECUTE THE PROGRAM.

STEP7: STOP THE PROCESS.

PROGRAM

import java.io.*;
import java.net.*;
public class IPValidator
{
public static final String DELIM="\\.";
public boolean isValidIP(String ip)
{
if(ip==null ||" ".equals(ip.trim()))
{
return false;
}
String[]parts=ip.split(DELIM);
if(parts.length!=4)
{
return false;
}
for(String part:parts)
{
try
{
int intVal=Integer.parseInt(part);
if(intVal<0|| intVal>255)
{
return false;
}
}
catch(NumberFormatException e)
{
return false;
}
}
return true;
}
public static void main(String args[])
{
String ip1="128.0.0.1";
String ip2="125.16.100.1";
String ip3="125.512.100.1";
String ip4="125.512.100.abc";
String ip5=" ";
String ip6=null;
IPValidator Validator=new IPValidator();
System.out.println(Validator.isValidIP(ip1));
System.out.println(Validator.isValidIP(ip2));
System.out.println(Validator.isValidIP(ip3));
System.out.println(Validator.isValidIP(ip4));
System.out.println(Validator.isValidIP(ip5));
System.out.println(Validator.isValidIP(ip6));
}
}
OUTPUT:

RESULT:

THE ABOVE PROGRAM WAS SUCCESSFULLY EXECUTED AND THE RESULTS ARE
VERIFIED

6. ROUTING ALGORITHM

AIM:

TO FIND THE SHORTEST PATH USING DIJISKTRA ROUTING ALGORITHM .

ALGORITHM:

STEP1: START THE PROCESS.

STEP2: IMPORT THE REQUIRED NET& OTHER PACKAGES.

STEP3: GET THE IPADDRESS WITH 4 FIELDS SEPARATE BY THE DELIMITOR.

STEP4: USING ISVALIDIP METHOD CHECK THE IPADDRESS.

STEP5: USING BOOLEAN VALUE, PRINT TRUE/FALSE FOR THE VALID AND INVALID
IPADDRESS.

STEP6 SAVE AND EXECUTE THE PROGRAM.

STEP7: STOP THE PROCESS.

PROGRAM:

import java.util.*;
public class Dijkstra
{
public int distance[] = new int[10];
public int cost[][] = new int[10][10];
public void calc(int n,int s)
{
int flag[] = new int[n+1];

int i,minpos=1,k,c,minimum;
for(i=1;i<=n;i++)
{
flag[i]=0;
this.distance[i]=this.cost[s][i];
}
c=2;
while(c<=n)
{
minimum=99;
for(k=1;k<=n;k++)
{
if(this.distance[k]<minimum && flag[k]!=1)
{
minimum=this.distance[i];
minpos=k;
}
}
flag[minpos]=1;
c++;
for(k=1;k<=n;k++)
{
if(this.distance[minpos]+this.cost[minpos][k] < this.distance[k] && flag[k]!=1 )
this.distance[k]=this.distance[minpos]+this.cost[minpos][k];
}
}
}
public static void main(String args[])
{
int nodes,source,i,j;
Scanner in = new Scanner(System.in);

System.out.println("Enter the Number of Nodes \n");

nodes = in.nextInt();
Dijkstra d = new Dijkstra();
System.out.println("Enter the Cost Matrix Weights: \n");
for(i=1;i<=nodes;i++)
for(j=1;j<=nodes;j++)
{
d.cost[i][j]=in.nextInt();
if(d.cost[i][j]==0)
d.cost[i][j]=999;
}
System.out.println("Enter the Source Vertex :\n");
source=in.nextInt();
d.calc(nodes,source);
System.out.println("The Shortest Path from Source \t"+source+"\t to all other vertices are :
\n");
for(i=1;i<=nodes;i++)
if(i!=source)
System.out.println("source :"+source+"\t destination :"+i+"\t MinCost is
:"+d.distance[i]+"\t");
}
}
OUTPUT:

RESULT:

THE ABOVE PROGRAM WAS SUCCESSFULLY EXECUTED AND THE RESULTS ARE
VERIFIED

7. FILE SHARING BETWEEN CLIENT AND SERVER

AIM:

TO FIND THE SHORTEST PATH USING DIJISKTRA ROUTING ALGORITHM .

ALGORITHM:

STEP1: START THE PROCESS.

STEP2: IMPORT THE REQUIRED NET& OTHER PACKAGES.

STEP3: GET THE IPADDRESS WITH 4 FIELDS SEPARATE BY THE DELIMITOR.

STEP4: USING ISVALIDIP METHOD CHECK THE IPADDRESS.

STEP5: USING BOOLEAN VALUE, PRINT TRUE/FALSE FOR THE VALID AND INVALID
IPADDRESS.

STEP6 SAVE AND EXECUTE THE PROGRAM.

STEP7: STOP THE PROCESS.

PROGRAM:

Server
import java.io.*;
import java.net.*;
public class fserver
{
public static void main(String args[])
{
ServerSocket s=null;
Socket s1;
int n;
char c;
OutputStream o;
DataOutputStream dis;
DataInputStream d;
String str1,str2;
File f1;
FileInputStream fi;
str2=new String();
try
{
d=new DataInputStream(System.in);
System.out.println(“enter the file you want to transferred”);
str1=d.readLine();
f1=new File(str1);
fi=new FileInputStream(f1);
s=new ServerSocket(4500);
s1=s.accept();
o=s1.getOutputStream();
dis=new DataOutputStream(o);
while((n=fi.read())!=-1)
{
c=(char)n;
str2=str2+c;
}
}
dis.writeUTF(str2);
catch(Exception)
System.out.println(“file transferred”);
{
s1.close();
}
s.close();
}
o.close();
}
Client
import java.io.*;
import java.net.*;
public class fclient
{
public static void main(String args[])
{
Socket s1=null;
intm,n;
InputStreami;
DataInputStream dis;
DataInputStream d;
String str1,str2;
while(true)
{
try
{
s1=new Socket(““,4500);
i=s1.getInputStream();
dis=new DataInputStream(i);
System.out.println(“enter the file name to be saved”);
d=new DataInputStream(System.in);
str1=d.readLine();
File f=new File(str1);
FileOutputStream f1=new FileOutputStream(f);
str2=dis.readUTF();
m=str2.length();
for(n=0;n<m;n++)
{
char c=str2.charAt(n);
f1.writeI;
}
System.out.println(“file copied”);
s1.close();
i.close();}
catch(Exception e){}}}}

OUTPUT:

c:\jdk1.7.0\bin>java fserver c:\jdk1.7.0\bin>java fclient

Enter the file you want to transferred Enter the file name to be saved
c:\jdk1.file
asys.java
transferred asysc.java
file transferred
file copied
RESULT:

THE ABOVE PROGRAM WAS SUCCESSFULLY EXECUTED AND THE RESULTS ARE
VERIFIED

8. MACHINE-TO-MACHINE CHATTING USING UDP PACKET

AIM:

TO IMPLEMENT MACHINE-TO-MACHINE CHATTING USING UDP PACKET.

ALGORITHM:

STEP1: START THE PROCESS.

STEP2: IMPORT THE REQUIRED PACKAGES.

STEP3: IN THE CLIENTSIDE, DECLARE BUFFER&THE SIZE OF THE BUFFER IN BYTES.

STEP4: CREATE A DATAGRAM PACKET TO GET LENGTH OF THE INPUT REQUIRED

FROM THE DATAGRAM.

STEP5: BY INVOKING THE GETDATA&GETLENGTH METHOD, THE DATA AND LENGTH

OF DATA ARE RECEIVED.

STEP6: PUT THE RECEIVED INPUT IN THE RESPECTIVE DATAGRAMSOCKET IN THE

SERVERSIDE & ALSO GET THE SAME INPUT SUCH AS BUFFERLENGTH AND STORE IT
IN THE DATAGRAM PACKAGE.

STEP7: STORE THE INPUT IN THE RESPECTIVE DATAGRAM SOCKET NUMBER

STEP8: SAVE AND EXECUTE THE PROGRAM.

STEP9: STOP THE PROCESS.

PROGRAM:

SERVER
import java.net.*;
class server
{
public static DatagramSocket ds;
public static byte buffer[]=new byte[1024];
public static void myserver()throws Exception
{
int pos=0;
while(true)
{
int c=System.in.read();
switch(c)
{
case-1:System.out.println("server quite");
return;
case'\r':break;
case'\n':ds.send(new DatagramPacket(buffer,pos,InetAddress.getLocalHost(),(777)));
pos=0;
break;
default:buffer[pos++]=(byte)c;
}}}
public static void main(String args[])throws Exception
{
System.out.println("server ready...\n please type here");
ds=new DatagramSocket(888);
myserver();
}}

CLIENT
import java.net.*;
class client
{
public static DatagramSocket ds;
public static byte buffer[]=new byte[1024];
public static void myclient()throws Exception
{
while(true)
{
DatagramPacket p=new DatagramPacket(buffer,buffer.length);
ds.receive(p);
System.out.println(new String(p.getData(),0,p.getLength()));
}
}
public static void main(String args[])throws Exception
{
System.out.println("client for quit ctrl+c");
ds=new DatagramSocket(777);
myclient();
}
}
OUTPUT:

RESULT:

THE ABOVE PROGRAM WAS SUCCESSFULLY EXECUTED AND THE RESULTS ARE
VERIFIED

9. REMOTE METHOD INVOCATION

AIM:

TO IMPLEMENT MACHINE-TO-MACHINE CHATTING USING UDP PACKET.

ALGORITHM:

STEP1: START THE PROCESS.

STEP2: IMPORT THE REQUIRED PACKAGES.

STEP3: IN THE CLIENTSIDE, DECLARE BUFFER&THE SIZE OF THE BUFFER IN BYTES.

STEP4: CREATE A DATAGRAM PACKET TO GET LENGTH OF THE INPUT REQUIRED

FROM THE DATAGRAM.

STEP5: BY INVOKING THE GETDATA&GETLENGTH METHOD, THE DATA AND LENGTH

OF DATA ARE RECEIVED.

STEP6: PUT THE RECEIVED INPUT IN THE RESPECTIVE DATAGRAMSOCKET IN THE

SERVERSIDE & ALSO GET THE SAME INPUT SUCH AS BUFFERLENGTH AND STORE IT
IN THE DATAGRAM PACKAGE.

STEP7: STORE THE INPUT IN THE RESPECTIVE DATAGRAM SOCKET NUMBER

STEP8: SAVE AND EXECUTE THE PROGRAM.

STEP9: STOP THE PROCESS.

PROGRAM:

PRIME
import java.rmi.*;
public interface prime extends Remote
{
public Boolean isprime(int no)throws Exception;
}
PRIMEC
import java.io.*;
import java.rmi.*;
import java.rmi.registry.*;
class primec
{
public static void main(String args[])throws Exception
{
DataInputStream in=new DataInputStream(System.in);
String host=args[0];
System.out.println("enter the number");
int no=Integer.parseInt(in.readLine());
Registry reg=LocateRegistry.getRegistry(host,5000);
prime pri=(prime)reg.lookup("prime server");
System.out.println(pri.isprime(no));
}
}
PRIMES
import java.rmi.*;

import java.rmi.registry.*;
import java.rmi.server.*;
public class primes extends UnicastRemoteObject implements prime
{
public primes() throws Exception
{
}
public Boolean isprime(int no)throws RemoteException
{
for(int i=2;i<no/2;i++)
if(no%i==0)return false;
return true;
}
public static void main(String args[])throws Exception
{
Registry reg=LocateRegistry.createRegistry(5000);
System.out.println("registry created");
reg.rebind("prime server",new primes());
System.out.println("server started");
}
}

OUTPUT:
RESULT:

THE ABOVE PROGRAM WAS SUCCESSFULLY EXECUTED AND THE RESULTS ARE
VERIFIED

10. ENCRYPTION

AIM:

TO IMPLEMENT MACHINE-TO-MACHINE CHATTING USING UDP PACKET.

ALGORITHM:

STEP1: START THE PROCESS.

STEP2: IMPORT THE REQUIRED PACKAGES.

STEP3: IN THE CLIENTSIDE, DECLARE BUFFER&THE SIZE OF THE BUFFER IN BYTES.

STEP4: CREATE A DATAGRAM PACKET TO GET LENGTH OF THE INPUT REQUIRED

FROM THE DATAGRAM.

STEP5: BY INVOKING THE GETDATA&GETLENGTH METHOD, THE DATA AND LENGTH

OF DATA ARE RECEIVED.

STEP6: PUT THE RECEIVED INPUT IN THE RESPECTIVE DATAGRAMSOCKET IN THE

SERVERSIDE & ALSO GET THE SAME INPUT SUCH AS BUFFERLENGTH AND STORE IT
IN THE DATAGRAM PACKAGE.

STEP7: STORE THE INPUT IN THE RESPECTIVE DATAGRAM SOCKET NUMBER

STEP8: SAVE AND EXECUTE THE PROGRAM.

STEP9: STOP THE PROCESS.

PROGRAM:

import java.io.*;
class encrypt
{
public static void main(String args[])
{
try
{
DataInputStream ds=new DataInputStream(System.in);
System.out.println("enter the text to encrypt");

String plaintext=ds.readLine();
plaintext=plaintext.toUpperCase();
int shiftkey=28;
shiftkey=shiftkey;
String cipherText=" ";
for(int i=0;i<plaintext.length();i++)
{
int AsciiValue=(int)plaintext.charAt(i);
if(AsciiValue<65||AsciiValue>90)
{
cipherText+=plaintext.charAt(i);
continue;
}
int basicvalue=AsciiValue-65;
int newAsciiValue=65+((basicvalue+shiftkey)%26);
cipherText+=(char)newAsciiValue;
}
System.out.println(cipherText);
}
catch(Exception e)
{
e.printStackTrace();
}}}
OUTPUT:

RESULT:

THE ABOVE PROGRAM WAS SUCCESSFULLY EXECUTED AND THE RESULTS ARE
VERIFIED