Program 14: Servlet(first part)
<!DOCTYPE html>
<html>
<head>
<title></title>
</head>
<body>
<form action="pro14_second">
Enter a Number :<input type="text" name="t1"><br>
Select a Radio Button from following :<br>
<input type="radio" name="r1" value="posi">Positive or Negative<br>
<input type="radio" name="r1" value="odd">Odd or Even<br>
<input type="radio" name="r1" value="prim">Primary Number<br>
<input type="radio" name="r1" value="pali">Palindrome Number<br>
<input type="radio" name="r1" value="arms">Armstrong Number<br>
<input type="radio" name="r1" value="fibo">Fibonacci Series<br>
<input type="radio" name="r1" value="exit">Exit<br>
<input type="submit" value="Click For Result">
</form>
</body>
</html>
Servlet(second part)(Program:14)
import java.io.IOException;
import java.io.PrintWriter;
import javax.servlet.ServletException;
import javax.servlet.http.HttpServlet;
import javax.servlet.http.HttpServletRequest;
import javax.servlet.http.HttpServletResponse;
public class pro14_second extends HttpServlet
{
protected void processRequest(HttpServletRequest request, HttpServletResponse
response) throws ServletException, IOException
{
response.setContentType("text/html");
try (PrintWriter out = response.getWriter())
{
String s1=request.getParameter("t1");
int n=Integer.parseInt(s1);
String op=request.getParameter("r1");
if(op.equals("posi"))
{
if(n>0)
out.println("Number is positive");
else
out.println("Number is negative");
}
if(op.equals("odd"))
{
if(n%2==0)
out.println("Number is Even");
else
out.println("Number is Odd");
}
if(op.equals("prim"))
{
int i,m=0,count=0;
m=n/2;
if(n==0 || n==1)
out.println("Number is not prime");
else
{
for(i=2;i<=m;i++)
{
if(n%i==0)
{
out.println("Number is not prime");
count=1;
break;
}
}
if(count==0)
out.println("Number is prime");
}
}
if(op.equals("pali"))
{
int r,sum=0,temp;
temp=n;
while(n>0)
{
r=n%10;
sum=(sum*10)+r;
n=n/10;
}
if(temp==sum)
out.println("Number is palindrome");
else
out.println("Number is not palindrome");
}
if(op.equals("arms"))
{
int temp,digits=0,last=0,sum=0;
temp=n;
while(temp>0)
{
temp=temp/10;
digits++;
}
temp=n;
while(temp>0)
{
last=temp%10;
sum+=Math.pow(last,digits);
temp=temp/10;
}
if(n==sum)
out.println("Number is Armstrong");
else
out.println("Number is Not Armstrong");
}
if(op.equals("fibo"))
{
int count=0;
if(n==0 || n==1)
{
out.println("Number is in Fibonacci Series");
}
else
{
int a=0,b=1,c;
while(b<=n)
{
c=a+b;
if(c==n)
{
out.println("Number is in Fibonacci Series");
count=0;
break;
}
a=b;
b=c;
count++;
}
if(count>0)
out.println("Number is Not in Fibonacci Series");
}
}
if(op.equals("exit"))
{
out.println("Select Proper Option");
RequestDispatcher rd=request.getRequestDispatcher("/pro14_first.html");
rd.forward(request,response);
} }
}
