Java code to implement Math Server with multi client support using socket programming

-

Simple Java Math Server (Factorial, Fibonacci, Prime, and Palindrome) with multi client support using socket programming

Code:


Server:
package javaapplication7;

import java.io.*;

import java.net.*;

import java.util.Scanner;

import java.lang.String;



public class MyServer{

public static void main(String args[]){

try{



ServerSocket ss = new ServerSocket(1111);



Socket s = ss.accept();



DataInputStream dis = new DataInputStream(s.getInputStream());

DataOutputStream dout=new DataOutputStream(s.getOutputStream());



dout.writeUTF("Math Server");

dout.writeUTF("Enter your option from below:");

dout.writeUTF("1.Factorial of the number");

dout.writeUTF("2.Fibonacci series ");

dout.writeUTF("3.Check prime or not");

dout.writeUTF("4.Check the string is palindrome or not");



int option=Integer.parseInt(dis.readUTF());

switch(option){

case 1:

{

dout.writeUTF("Enter the number for factorial:");dout.flush();

int number=Integer.parseInt(dis.readUTF());

if(number<=0){dout.writeUTF("Negative number or 0 is not allowed");dout.flush();}

else{

int fact=1;

for(int i=1;i<=number;i++){

fact=fact*i;



}

dout.writeUTF("Factorial: "+fact);dout.flush();





}

break;

}





case 2:

{

dout.writeUTF("Enter the number of step for Fibonacci series:");dout.flush();

int number=Integer.parseInt(dis.readUTF());

int n1=0,n2=1,n3,i,count=number;

StringBuilder sb = new StringBuilder(256);

sb.append("Fibonacci Series: ").append("0 ").append("1 ");



for(i=2;i<count;++i)//loop starts from 2 because 0 and 1 are already printed

{

n3=n1+n2;

sb.append(Integer.toString(n3)+" ");

n1=n2;

n2=n3;

}

dout.writeUTF(sb.toString());dout.flush();

break;

}

case 3:

{

dout.writeUTF("Enter the number for Prime:");dout.flush();

int n=Integer.parseInt(dis.readUTF());

if(n<0){dout.writeUTF("Negative number not allowed");dout.flush();}

else{

int i,m=0,flag=0;

m=n/2;

if(n==0||n==1){

dout.writeUTF(n+" is not prime number"); dout.flush();

}else{

for(i=2;i<=m;i++){

if(n%i==0){

dout.writeUTF(n+" is not prime number");dout.flush();

flag=1;

break;

}

}

if(flag==0) { dout.writeUTF(n+" is prime number"); dout.flush();}

}

}

break;

}

case 4:

{

dout.writeUTF("Enter the String to be checked:");dout.flush();

String statement = dis.readUTF();

StringBuilder sb = new StringBuilder(statement);

sb.reverse();

if(statement.compareTo(sb.toString())!=0){dout.writeUTF("Not Pelindrome");dout.flush();}

else{dout.writeUTF("Pelindrome");dout.flush();}

break;

}

default:dout.writeUTF("Not Right Choice!\nPress Enter Key To Exit.");dout.flush();break;

}

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

}//psvm

}//class



Client:


package javaapplication7;

import java.net.*;

import java.io.*;

import java.util.Scanner;



public class MyClient {

public static void main(String[] args){

try {

Socket s=new Socket("localhost",1111);

DataOutputStream dout=new DataOutputStream(s.getOutputStream());

DataInputStream dis = new DataInputStream(s.getInputStream());

Scanner sc = new Scanner(System.in);



for (int i = 0; i < 6; i++) {

System.out.println(dis.readUTF());

}



dout.writeUTF(sc.nextLine());

dout.flush();

System.out.println(dis.readUTF());

dout.writeUTF(sc.nextLine());

dout.flush();

System.out.println(dis.readUTF());

}//try

catch(Exception e)

{System.out.println(e);}

} //psvm

}//class

Comments

Post a Comment

Popular posts from this blog

C program to evaluate Prefix Expression using Stack data structure

-
Simple C program to evaluate Prefix Expression using Stack data structure Code: #include<stdio.h> #include<conio.h> #include<string.h> int steck[10]; int top=-1; void push(int value) { steck[top++]=value; } int pop() { return(steck[top--]); } int ope(char c) { if(c=='+'||c=='-'||c=='*'||c=='/') return 1; else return 0; } void main() { char prefix[10]; int len,val,i,opr1,opr2,res; clrscr(); printf("Enter the prefix Expression: "); scanf("%s",prefix); len=strlen(prefix); for(i=len-1;i>=0;i--) { switch(ope(prefix[i])) { case 0: val=prefix[i]; push(val); break; case 1: opr1=pop(); opr2=pop(); switch(prefix[i]) { case '+': res=opr1+opr2; break; case '-': res=opr1-opr2; break; case '*': res=opr1*opr2; break; case '/': res=opr1/opr2; break; } push(res); } } printf("Result is %d",steck[top]); getch(); }
Read more

Java Program to Implement sorting algorithm using TCP on Server application

-
Simple Java program to Implement sorting algorithm using TCP on Server application Input: Give input on client side and client should receive sorted output from server and display sorted list on input(client) side. Note: You can implement any sorting algorithm by changing the sorting algorithm code on server side Code: Server: package aj.pkg7; import java.io.*; import java.net.*; import java.util.*; class Server { public static void main(String args[]) throws Exception { ServerSocket ss=new ServerSocket(1111); Socket s=ss.accept(); DataInputStream din=new DataInputStream(s.getInputStream()); DataOutputStream dout=new DataOutputStream(s.getOutputStream()); int r,i=0; int n=din.readInt(); int a[]=new int[n]; System.out.println("data:"); int count=0; for(i=0;i<n;i++) { a[i]=din.readInt(); } int number = a.length; for (int i1 = 0; i1 < number-1; i1++) for (int j1 = 0; j1 < number-i1-1; j1++) if (a[j1] > a[j1+1]) { int temp = a[j1]; a[j1] = a[j1+1]; a[j1+1] = temp; } ...
Read more

C++ program to perform data transformation Min-max and Z score Normalization

-
Simple C++ program to perform data transformation using min-max normalization, z-score normalization and decimal scaling operation. Code: #include<iostream> #include<math.h> using namespace std; int main() { int n; double sum=0; cout<<"Enter The Number of values:"; cin>>n; int a[n],r1,r2; for(int i=0;i<n;i++) { cin>>a[i]; } cout<<"Enter starting and ending range for normalization:"; cin>>r1>>r2; double max = a[0]; int min = a[0]; for (int i = 0; i <n; i++) { if (a[i] > max) { max = a[i]; } else if (a[i] < min) { min = a[i]; } } float v[n];double temp; for(int i=0;i<n;i++) { temp=double(double(double(a[i]-min)*(r2-r1))/(max-min))+ r1; v[i]=temp; } cout<<"normalization by Min-max"<<endl; cout<<"Values a...
Read more