0% found this document useful (0 votes)
52 views10 pages

Java Servlet Prime and GCD Finder

The document describes two servlet programs - one to find prime numbers between two user-input numbers, and another to find the greatest common divisor (GCD) of two user-input numbers. For each program, the document provides the necessary code snippets, including the web.xml configuration, HTML form, and Java servlet class. The prime number servlet uses a for loop to check if each number from the input range is prime, while the GCD servlet uses a for loop to find the largest number that divides both inputs.

Uploaded by

019bim017
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
52 views10 pages

Java Servlet Prime and GCD Finder

The document describes two servlet programs - one to find prime numbers between two user-input numbers, and another to find the greatest common divisor (GCD) of two user-input numbers. For each program, the document provides the necessary code snippets, including the web.xml configuration, HTML form, and Java servlet class. The prime number servlet uses a for loop to check if each number from the input range is prime, while the GCD servlet uses a for loop to find the largest number that divides both inputs.

Uploaded by

019bim017
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Question 1:

Write a servlet program to find the prime number between a and b where a and b is user input
provided by HTML form.

Code:
In [Link]
<?xml version="1.0" encoding="UTF-8"?>
<web-app version="3.1" xmlns="[Link]
xmlns:xsi="[Link]
xsi:schemaLocation="[Link] [Link]
app_3_1.xsd">
<servlet-mapping>
<servlet-name>Faces Servlet</servlet-name>
<url-pattern>/faces/*</url-pattern>
</servlet-mapping>

<servlet>
<servlet-name>display</servlet-name>
<servlet-class>display</servlet-class>
</servlet>
<welcome-file-list>
<welcome-file>faces/[Link]</welcome-file>
</welcome-file-list>
<servlet>
<servlet-name>prime</servlet-name>
<servlet-class>prime</servlet-class>
<load-on-startup>1</load-on-startup>
</servlet>
<servlet-mapping>
<servlet-name>prime</servlet-name>
<url-pattern>/prime</url-pattern>
</servlet-mapping>
</web-app>
In [Link]
<!DOCTYPE html>
<html>
<head>
<title>TODO supply a title</title>
<meta charset="UTF-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
</head>
<body>

<div>TODO write content</div>


<form action="prime" method="post">
<input type="number" name="no1">
<input type="number" name="no2">
<input type="submit">
</form>
</body>
</html>
Output:
In [Link]

import [Link];
import [Link];
import [Link];
import [Link];
import [Link];
import [Link];
import [Link];

@WebServlet(urlPatterns = {"/prime"})
public class prime extends HttpServlet {

protected void doPost(HttpServletRequest request, HttpServletResponse response)


throws ServletException, IOException {
try (PrintWriter out = [Link]()) {
Integer no1=[Link]([Link]("no1"));
Integer no2=[Link]([Link]("no2"));
[Link]("The prime numbers are");
for(int i=no1;i<=no2;i++)
{
int c=0;
for(int j=2;j<=i/2;j++)
{
if(i%j==0)
{
c++;
}
}
if(c==0)
{
[Link](i);
[Link]("<br>");
}
}

}
}
}

Output:
Question 2:

Write a servlet program to find the GCD of two numbers where these two numbers should be
provided by the HTML form.

Code:
In [Link]
<?xml version="1.0" encoding="UTF-8"?>
<web-app version="3.1" xmlns="[Link]
xmlns:xsi="[Link]
xsi:schemaLocation="[Link] [Link]
app_3_1.xsd">
<servlet-mapping>
<servlet-name>Faces Servlet</servlet-name>
<url-pattern>/faces/*</url-pattern>
</servlet-mapping>
<session-config>
<session-timeout>
30
</session-timeout>
</session-config>
<context-param>
<param-name>[Link].PROJECT_STAGE</param-name>
<param-value>Development</param-value>
</context-param>
<servlet>
<servlet-name>display</servlet-name>
<servlet-class>display</servlet-class>
</servlet>
<servlet>
<servlet-name>Faces Servlet</servlet-name>
<servlet-class>[Link]</servlet-class>
<load-on-startup>1</load-on-startup>
</servlet>
<servlet-mapping>
<servlet-name>display</servlet-name>
<url-pattern>/display</url-pattern>
</servlet-mapping>
<welcome-file-list>
<welcome-file>faces/[Link]</welcome-file>
</welcome-file-list>
<servlet>
<servlet-name>findingGCD</servlet-name>
<servlet-class>findingGCD</servlet-class>
<load-on-startup>1</load-on-startup>
</servlet>
<servlet-mapping>
<servlet-name>findingGCD</servlet-name>
<url-pattern>/findingGCD</url-pattern>
</servlet-mapping>
</web-app>
In [Link]
<!DOCTYPE html>
<html>
<head>
<title>Finding GCD</title>
<meta charset="UTF-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
</head>
<body>

<form action="findingGCD" method="post">


<input type="number" name="no1">
<input type="number" name="no2">
</br>
<input type="submit">

</form>
</body>
</html>
Output:
In findingGCD

import [Link];
import [Link];
import [Link];
import [Link];
import [Link];
import [Link];
import [Link];

@WebServlet(urlPatterns = {"/findingGCD"})
public class findingGCD extends HttpServlet {

protected void doPost(HttpServletRequest request, HttpServletResponse response)


throws ServletException, IOException {
try (PrintWriter out = [Link]()) {
Integer no1=[Link]([Link]("no1"));
Integer no2=[Link]([Link]("no2"));

int gcd=1;
for(int i=1;i<=no1 && i<=no2;i++)
{

if(no1%i==0 && no2%i==0)


{
gcd=i;
}
}
[Link]("The gcd is:"+gcd);
}

}
}

Output:

You might also like