Scribd
Upload
12 views8 pages

Java Practicals

The document describes a Java program to find the longest palindrome substring in a given string. It defines a longestPalSubstr method that takes a string as input, initializes a 2D boolean table to store results of substring comparisons, and iterates through the string to find the longest palindrome by comparing characters at different offsets. It returns the length of the longest palindrome found. The main method calls this method on a sample input string and prints the output.

Uploaded by

mehaksamra777
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
12 views8 pages

Java Practicals

The document describes a Java program to find the longest palindrome substring in a given string. It defines a longestPalSubstr method that takes a string as input, initializes a 2D boolean table to store results of substring comparisons, and iterates through the string to find the longest palindrome by comparing characters at different offsets. It returns the length of the longest palindrome found. The main method calls this method on a sample input string and prints the output.

Uploaded by

mehaksamra777
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

Practical No:- 9

AIM: Create a Servlet/ application with a facility to print any message on web
browser.

Java Code:-
import [Link].*;

import [Link].*;

import [Link].*;

public class HelloWorld extends HttpServlet

private String message;

public void init() throws ServletException {

message = "Hello World";

public void doGet(HttpServletRequest request, HttpServletResponse response)

throws ServletException, IOException

[Link]("text/html");

PrintWriter out = [Link]();

[Link]("<h1>" + message + "</h1>");

Abhishek Kanna 16BCS8034


HTML Code:-

<servlet>

<servlet-name>HelloWorld</servlet-name>

<servlet-class>HelloWorld</servlet-class>

</servlet>

<servlet-mapping>

<servlet-name>HelloWorld</servlet-name>

<url-pattern>/HelloWorld</url-pattern>

</servlet-mapping>

Output:-

Abhishek Kanna 16BCS8034


Practical No:- 10
AIM: Create JSP application for addition, multiplication and division

HTML Code:-
<html>

<title>calculator</title>

<head><h1><center>Basic Calculator</center></h1></head>

<body>

<center>

<form action="[Link]" method="get">

<label for="num1"><b>Number 1</b></label>

<input type="text" name ="num1"><br><br>

<label for = "num2"><b>Number 2</b></label>

<input type="text" name="num2"><br><br>

<input type ="radio" name = "r1" value="Add">+

<input type = "radio" name = "r1" value="Sub">-<br>

<input type="radio" name="r1" value ="mul">*

<input type = "radio" name="r1" value="div">/<br><br>

<input type="submit" value="submit">

</center>

</body>

</html>

Abhishek Kanna 16BCS8034


JSP Code:-
<html>

<title>calculator</title>

<head></head>

<body>

<%@page language="java"%>

<%

int num1 = [Link]([Link]("num1"));

int num2 = [Link]([Link]("num2"));

String operation = [Link]("r1");

if([Link]("Add")){

int add=num1+num2;

[Link]("Addition is: "+add);

else if([Link]("Sub")){

int sub=num1-num2;

[Link]("Substraction is: "+sub);

else if([Link]("mul")){

int mul=num1*num2;

[Link]("multiplication is: "+mul);

else if([Link]("div"))

int div = num1/num2;

Abhishek Kanna 16BCS8034


if(num1>=num2)

[Link]("division is: "+div);

else

[Link]("The division cannot be performed");

%>

</body>

</html>

OUTPUT:-

Abhishek Kanna 16BCS8034


Practical No:- 8
AIM: Create a palindrome creator application for making a longest possible
palindrome out of given input string.

Code:-
public class LongestPalinSubstring

static void printSubStr(String str, int low, int high) {

[Link]([Link](low, high + 1));

static int longestPalSubstr(String str) {

int n = [Link](); // get length of input string

boolean table[][] = new boolean[n][n];

int maxLength = 1;

for (int i = 0; i < n; ++i)

table[i][i] = true;

int start = 0;

for (int i = 0; i < n - 1; ++i) {

if ([Link](i) == [Link](i + 1)) {

table[i][i + 1] = true;

start = i;

maxLength = 2;

for (int k = 3; k <= n; ++k)

Abhishek Kanna 16BCS8034


{

for (int i = 0; i < n - k + 1; ++i)

int j = i + k - 1;

if (table[i + 1][j - 1] && [Link](i) == [Link](j))

table[i][j] = true;

if (k > maxLength) {

start = i;

maxLength = k;

[Link]("Longest palindrome substring is; ");

printSubStr(str, start, start + maxLength - 1);

return maxLength;

public static void main(String[] args)

String str = "forabhishekkehsihbafor";

[Link]("Length is: " + longestPalSubstr(str));

Abhishek Kanna 16BCS8034


Output:-

Abhishek Kanna 16BCS8034

You might also like