Practical Exam
Practical Exam
Procedure Steps/Algorithm:
1. Start the program.
2. Read the values for variables n by default passing 5.
3. Find the rational of numbers 5.
4. Using while loop calculate the of function cal
5. Print the rational value.
6. Stop the program.
Program
Import java.util.arraylist;
Import java utils.list;
Class pr
{
Private static class prn
{
Private int numerator;
Private int denominator;
}
@Override
Public String tostring()
{
If (denominator==1)
{
Integer.tostring(numerator);
}
Else
{
Return Integer.tostring(numerator)
+Integer.toString(denominator);
}
}
Jump=2;
Else
Jump=1;
For (int r=1; r<=i-1; r+=jump)
{
If cal (r,i)==1
{
Prn r1= new prn(r,i);
List.add(r1);
}
}
}
}
}
Return list;
}
Result /Output
INPUT
5
OUTPUT
Result:
Thus the program to perform rational number of 5;
Aim:
Write a program to print date and time
Procedure Steps/Algorithm:
Program:-
Import java.text.* ;
Import java.utils.* ;
Fd.settimezone(timezone.gettimezone("IST"))
System.out.println(fd.format(date));
}
}
Result:
Thus the program to perform current date and time;
Aim:
Write a program to demonstrate inheritance
Procedure Steps/Algorithm:
Program:-
}
Public class test1 extends testexe
{
@Override
Public void executeaction()
{
--Print any message to check
System.out.println(‘check test 1’);
}
}
}
}
Program:-
Import java.awt.event.*;
Import java swing.*;
Import java awt.*;
Calculator()
{
S0= s1=s2= "";
}
}
Try
{
UIManager.setlookandfeel(UIManger.getSystemLookandFeel
ClassName());
}
Catch(Exception e)
{
System.err.println(e.getmessage());
}
Bm.addactionlistener(c);
Bd.addactionlistener(c);
Bs.addactionlistener(c);
Ba.addactionlistener(c);
B9.addactionlistener(c);
B8.addactionlistener(c);
B7.addactionlistener(c);
B6.addactionlistener(c);
B5.addactionlistener(c);
B4.addactionlistener(c);
B3.addactionlistener(c);
B2.addactionlistener(c);
B1.addactionlistener(c);
B0.addactionlistener(c);
Be.addactionlistener(c);
Beq.addactionlistener(c);
Beq1.addactionlistener(c);
p.add(1);
p.add(ba);
p.add(b1);
p.add(b2);
p.add(b3);
p.add(b4);
p.add(b5);
p.add(b6);
p.add(b7);
p.add(b8);
p.add(b9);
p.add(b0);
p.add(bm);
p.add(bs);
p.add(bd);
p.add(be);
p.add(beq);
p.add(beq1);
f.add(p);
f.show();
}
Else if (S.CHARAT(0)>= ‘C’)
{
S0=s1-s2="";
}
Else if (S.CHARAT(0)== ‘=’)
{
If (!s1.equals("+"))
Te=(Double.parseDouble(s0)+
Double.parseDouble(s2));
elseif (!s1.equals("-"))
Te=(Double.parseDouble(s0)-
Double.parseDouble(s2));
Elseif (!s1.equals("/"))
Te=(Double.parseDouble(s0)/
Double.parseDouble(s2));
else (!s1.equals("*"))
Te=(Double.parseDouble(s0)*
Double.parseDouble(s2));
S0=double.toString(te);
S1=s;
S2="";
l.Settext(s0+s1+s2);
}
}
Procedure Steps/Algorithm:
PROGRAM :-
Return list;
}
Public static void main(String args[])
{
List<integer>l= new arraylist<integer>();
l.add(3);
l.add(0);
l.add(2);
l.add(5);
}
}