JAVA
JAVA
UGC 2(f) & 12(B) approved & Accredited with ‘B’ Grade by NAAC
REGISTER NO :
NAME :
CLASS :
SYED HAMEEDHA ARTS AND SCIENCE COLLEGE
UGC 2(f) & 12(B) approved & Accredited with ‘B’ Grade by NAAC
Promoted by Mohamed Sathak Trust & Affiliated to Alagappa University, Karaikudi
CERTIFICATE
REGISTER NO.:
year 2024
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
16.
EX:NO:
DATE :
AIM:
PROGRAM:
import java.io.*;
class CommandLine
{
c=Integer.parseInt(args[2]);
if(a>b && a>c)
{
System.out.println(a+"is largest number");
}
else if(b>a && b>c)
{
C:\jdk1.3\bin>java CommandLine 67 90 89
90 is largest number
EX:NO:
DATE :
AIM:
PROGRAM:
import java.io.*;
import java.util.*;
class Sum
int n,r,s=0;
n=sc.nextInt();
while(n>0)
r=n%10;
s=s+r;
n=n/10;
}
OUTPUT:
C:\jdk1.3\bin>javac Sum.java
C:\jdk1.3\bin>java Sum
Enter the number :
4567
sum of digit 22
EX:NO:
DATE :
AIM:
PROGRAM:
import java.io.*;
import java.util.*;
class Prime11
{
public static void main(String args[])throws IOException
{
int n,i,m=0,flag=0;
Scanner sc=new Scanner(System.in);
System.out.println("Enter the number to check prime:");
n=sc.nextInt();
m=n/2;
for(i=2;i<=m;i++)
{
if(n%i==0)
C:\jdk1.3\bin>javac Prime11.java
C:\jdk1.3\bin>java Prime11
Enter the number to check prime:
12
number is not a prime
C:\jdk1.3\bin>java Prime11
Enter the number to check prime:
7
number is a prime
EX:NO:
DATE :
AIM:
PROGRAM:
import java.io.*;
class Room
{
int length;
int breadth;
Room(int x,int y)
{
length=x;
breadth=y;
}
int area()
{
return(length*breadth);
}
}
class StoreRoom extends Room
{
int height;
StoreRoom(int x,int y,int z)
{
super(x,y);
height=z;
}
int volume()
{
return(length*breadth*height);
}
}
class RectArea11
{
public static void main(String args[])throws IOException
{
C:\jdk1.3\bin>javac RectArea11.java
C:\jdk1.3\bin>java RectArea11
Single Inheritance
Area1=168
Volume=1680
EX:NO:
DATE :
AIM:
PROGRAM
import java.io.*;
import java.util.Scanner;
class Palindrome
{
public static void main(String args[])
{
int r,sum=0,temp,n;
while(n>0)
{
r=n%10;
sum=(sum*10)+r;
n=n/10;
}
if(temp==sum)
{
System.out.println("palindrome number");
}
else
{
System.out.println("not palindrome");
}
}
}
OUTPUT:
C:\jdk1.3\bin>javac Palindrome.java
C:\jdk1.3\bin>java Palindrome
palindrome program
567
not palindrome
C:\jdk1.3\bin>java Palindrome
palindrome program
767
EX:NO:
DATE :
AIM:
PROGRAM:
import java.io.*;
class StringManipulation
{
System.out.println("original string:"+str);
System.out.println("length string:"+str.length());
for(int i=0;i<str.length();i++)
{
int p=i+1;
System.out.println("character at position:"+p+"is"+str.charAt(i));
}
String astring=new String(str.toString());
int pos=astring.indexOf("language");
str.insert(pos,"oriented");
System.out.println("modified string:"+str);
str.setCharAt(6,'-');
System.out.println("String now"+str);
str.append("improve security");
System.out.println("Append String"+str);
}
}
OUTPUT:
C:\jdk1.3\bin>javac StringManipulation.java
C:\jdk1.3\bin>java StringManipulation
length string:15
character at position:1 is o
character at position:2 is b
character at position:3 is j
character at position:4 is e
character at position:5 is c
character at position:6 is t
character at position:7 is
character at position:8 is l
character at position:9 is a
character at position:10 is n
character at position:11 is g
character at position:12 is u
character at position:13 is a
character at position:14 is g
character at position:15 is e
DATE :
AIM:
PROGRAM:
import java.io.*;
class Factorial
{
}
}
OUTPUT:
C:\jdk1.3\bin>javac Factorial.java
Note: Factorial.java uses or overrides a deprecated API.
Note: Recompile with -Xlint:deprecation for details.
C:\jdk1.3\bin>java Factorial
Factorial
5
Factorial=120
EX:NO:
DATE :
AIM:
PROGRAM:
import java.io.*;
class Marklist
{
m2=Integer.parseInt(ds.readLine());
m3=Integer.parseInt(ds.readLine());
total=m1+m2+m3;
avg=total/3;
if((m1>=40)&&(m2>=40)&&(m3>=40))
{
result="pass";
System.out.println("Result="+result);
if(avg>90)
{
grade="A";
System.out.println("Grade="+grade);
}
else if((avg<=80)&&(avg>60))
{
grade="B";
System.out.println("Grade="+grade);
}
else if((avg<=60)&&(avg>40))
{
grade="c";
System.out.println("Grade="+grade);
}
}
else
{
result="fail";
}
}
OUTPUT:
C:\jdk1.3\bin>javac Marklist.java
C:\jdk1.3\bin>java Marklist
67
Result=pass
C:\jdk1.3\bin>javac Marklist.java
C:\jdk1.3\bin>java Marklist
student mark list
Grade=....
EX:NO:
DATE :
AIM:
PROGRAM:
import java.awt.*;
import java.applet.*;
//<APPLET CODE=face WIDTH=300 HEIGHT=200></applet>
g.drawOval(25,92,15,30);
g.drawOval(160,92,15,30);
}
}
OUTPUT:
C:\jdk1.3\bin>javac face.java
C:\jdk1.3\bin>appletviewer face.java
EX:NO:
DATE :
AIM:
PROGRAM:
import java.util.*;
class Armstrong
{
temp=n;
while(n>0)
{
r=n%10;
s=s+(r*r*r);
n=n/10;
}
if(temp==s)
{
System.out.println("Armstrong number:");
}
else
{
System.out.println("not a Armstrong number:");
}
}
}
OUTPUT:
C:\jdk1.3\bin>javac Armstrong.java
C:\jdk1.3\bin>java Armstrong
Enter the number :
153
Armstrong number:
C:\jdk1.3\bin>javac Armstrong.java
C:\jdk1.3\bin>java Armstrong
Enter the number :
678
not a Armstrong number:
EX:NO:
DATE :
AIM:
PROGRAM:
import java.awt.*;
import java.applet.*;
g.setColor(Color.blue);
g.fillRect(50,20,5,300);
g.setColor(Color.black);
g.drawRect(50,18,3,300);
g.setColor(Color.orange);
g.fillRect(55,20,120,30);
g.setColor(Color.black);
g.drawRect(55,20,118,28);
g.setColor(Color.green);
g.fillRect(55,80,119,30);
g.setColor(Color.black);
g.drawRect(55,80,117,28);
g.setColor(Color.black);
g.drawOval(100,50,30,30);
}
}
/*<applet code="flag"height="300"width="300"></applet>*/
OUTPUT:
C:\jdk1.3\bin>javac Flag.java
C:\jdk1.3\bin>appletviewer Flag.java
EX:NO:
DATE :
AIM:
PROGRAM:
import java.io.*;
import java.util.*;
class Perfect
long n,sum=0;
n=sc.nextLong();
int i=1;
while(i<=n/2)
if(n%i==0)
sum=sum+i;
i++;
if(sum==n)
{
else
}
OUTPUT:
C:\jdk1.3\bin>javac Perfect.java
C:\jdk1.3\bin>java Perfect
28
28is a perfect number
C:\jdk1.3\bin>javac Perfect.java
C:\jdk1.3\bin>java Perfect
Enter the number
4558
4558is not a perfect number
EX:NO:
DATE :
AIM:
PROGRAM:
import java.io.*;
import java.util.*;
class Vowels
{
public static void main(String arg[])throws IOException
{
int count=0;
char[] vowels=new char[]{'a','e','i','o','u'};
Scanner sc=new Scanner(System.in);
System.out.print("Enter a string");
String str=sc.nextLine();
for(int i=0;i<str.length();i++)
{
for(int j=0;j<5;j++)
if(str.charAt(i)==vowels[j])
{
count++;
}
}
}
if(count>0)
{
System.out.println("Total vowel present in given string:"+count);
}
else
{
System.out.println("no vowel present in given string:");
}
}
OUTPUT:
C:\jdk1.3\bin>javac Vowels.java
C:\jdk1.3\bin>java Vowels
C:\jdk1.3\bin>java Vowels
Enter a string 78
no vowel present in given string:
EX:NO:
DATE :
AIM:
PROGRAM:
import java.io.*;
import java.util.*;
class ElecBill
if(units<=100)
return units*10;
else if(units<=200)
return (100*10)+(units-100)*15;
else if(units<=300)
return (100*10)+(100*15)+(units-200)*20;
else if(units>300)
return (100*10)+(100*15)+(100*20)+(units-300)*25;
}
return 0;
int units=250;
System.out.println(calculateBill(units));
}
OUTPUT
C:\jdk1.3\bin>javac ElecBill.java
C:\jdk1.3\bin>java ElecBill
3500
C:\jdk1.3\bin>
EX:NO:
DATE :
AIM:
PROGRAM:
import java.io.*;
class Fibonacci
int n1=0,n2=1,n3,i,count=10;
System.out.println("fibonacci series");
for(i=2;i<count;++i)
n3=n1+n2;
System.out.println(" "+n3);
n1=n2;
n2=n3;
}
OUTPUT
C:\jdk1.3\bin>javac Fibonacci.java
C:\jdk1.3\bin>java Fibonacci
fibonacci series
13
21
34
EX:NO:
DATE :
AIM:
PROGRAM:
import java.io.*;
class Multiplication
int num=9,i=1;
while(i<=10)
System.out.println(num*i);
i++;
}
OUTPUT
C:\jdk1.3\bin>javac Multiplication.java
C:\jdk1.3\bin>java Multiplication
18
27
36
45
54
63
72
81
90
C:\jdk1.3\bin>