99 java source codes

7/23/2019 99 Java Source Codes

http://slidepdf.com/reader/full/99-java-source-codes 1/69

99 JAVA SOURCE

CODES by

Dr. Dheeraj Mehrotra

(Author & National Awaree!

PROGRAM #1: to compute and print all prime numbers between 100 and 500class test1 {void prime({ int i!"!s0!d0$%or(i100$i&500$i''{ s0$

%or("1$"&i$"''{ i%(i"0ss'1$ )i%(s*{ +,stem-out-println(i'. .$dd'1$ )

)+,stem-out-println($+,stem-out-println(.t/e no- o% prime no- are .'d$ ) )

PROGRAM #*: to input a number and print its even %actorsclass compute

{ public void worin(int number



{ int i!"$%or(i1$i&number$i''{ i% (numberi0

{ i%(i*0+,stem-out-println(i'. is an even %actor o% .'number$ ) ) ) )

PROGRAM #2: to de%ine a %unction %act( to compute t/e %actorial o% an, enterednumber- class compute { public void %act( int a{ int s1$%or(int i1$i&a$i''ss3i$+,stem-out-println(.4/e %actorial o% .'a'. is .'s$

) )

PROGRAM #: to de%ine a %unction %ound( 66 to print t/e 7i/est 8ommon 9actor o% an, two numbers- class compute { public void %ound(int a! int b 66 declaration o% t/e %unction{ int p!/0$ pa3b$%or (int i1$i&p$i''{ i% (ai0 bi0/i$ )+,stem-out-println(.4/e 789 o% t/e iven two numbers is .'/$ )

)



PROGRAM #5: to de%ine and utili;e a %unction per%ect(! to print all per%ect numbers%rom 1 to 100- ( A per%ect number is a number w/ic/ is e<ual to t/e sum o% its %actors e- =1'*'2! /ence = is a per%ect number-

class compute { public void per%ect({ int sum0$%or (int i1$i&100$i''{ %or(int "1$"&i>1$"''{ i% (i"0sum sum ' "$ )i% (sumi+,stem-out-println(i'. is a per%ect number.$sum 0$ )+,stem-out-println($ ) )

PROGRAM #=: to compute prime %actors o% an, entered number wit/ t/e /elp o% a%unction p%act(-class compute { void p%act(int n 66 ?e%inition{ int t>1$ int anum@new int@10$%or (int i1$i&n>1$i''{ i% (ni0{ tt'1$anum@ti$ ) )%or (int count 0! 0$&t$''

{ +,stem-out-println(anum@'. is a %actor o% .'n$



%or (int m1$m&anum@$m''{ i% (anum@m0 count count ' 1$ )i% (count* +,stem-out-println(anum@'. is also prime.$

count 0$ ) ) )

PROGRAM #B: input a number and print its binar, e<uivalent-class compute

{ public void wor(int n { int a@new int @10$ int c>1!p$ w/ile(nC0 { cc'1$ pn*$

i% (p0{ a@c0$)else {a@c1$)nn6*$ )%or(int ic$iC0$i>>{ +,stem-out-print(a@i$

) ) )

PROGRAM #D : +ortin strin usin Eubble +ortin 4ec/ni<ueclass sortin { public void worin( {

+trin name@ { .+/ruti.!.+/as/an.!.Foita.!.?/eera".!.Ratnes/.!.+/arad.!.an,a.)$



%or(int "0$"&name-lent/$"'' { %or(int i"'1$i&name-lent/$i'' { i%(name@i-compare4o(name@"&0

{ +trin temp name@"$ name@"name@i$ name@itemp$ ) ) +,stem-out-println(name@"$ ) ) )

PROGRAM # H :?escription: Its a simple proram w/ic/ calculates t/e da, o% t/e wee%or an, iven date mont/ o% t/e ,ear *00*-

class dateone{

public void compute(int opt!int date!int da, {

c/ar b$

switc/(opt{case 1: i%(date&21{da,(D'dateB$)else+,stem-out-println(.Jn9or uKr ind in%ormation "anuar, /as onl, 21da,s-Jn.$

brea$

case *: i%(date&*D{da,(11'dateB$)else+,stem-out-println(.Jn9or uKr ind in%ormation %ebruar, /as onl, *Dda,s-Jn.$brea$

case 2: i%(date&21

{da,(11'dateB$)else



+,stem-out-println(.9or uKr ind in%ormation marc/ /as onl, 21da,s-Jn.$brea$

case : i%(date&20

{da,(B'dateB$)else+,stem-out-println(.Jn9or uKr ind in%ormation april /as onl, 20da,s-Jn.$brea$

case 5: i%(date&21{da,(H'dateB$)else+,stem-out-println(.Jn9or uKr ind in%ormation ma, /as onl, 21

da,s-Jn.$brea$

case =: i%(date&20{da,(1*'dateB$)else+,stem-out-println(.Jn9or uKr ind in%ormation "une /as onl, 20da,s-Jn.$brea$

case B: i%(date&21{da,(B'dateB$)else+,stem-out-println(.Jn9or uKr ind in%ormation "ul, /as onl, 21 da,s-Jn.$brea$

case D: i%(date&21{da,(10'dateB$)else+,stem-out-println(.Jn9or uKr ind in%ormation auust /as onl, 21

da,s-Jn.$brea$

case H: i%(date&20{da,(='dateB$)else+,stem-out-println(.Jn9or uKr ind in%ormation september /as onl, 20da,s-Jn.$brea$

case 10: i%(date&21{da,(D'dateB$)



else+,stem-out-println(.Jn9or uKr ind in%ormation october /as onl, 21da,s-Jn.$brea$

case 11: i%(date&20{da,(11'dateB$)else+,stem-out-println(.Jn9or uKr ind in%ormation november /as onl, 20da,s-Jn.$brea$

case 1*: i%(date&21{da,(='dateB$)else

+,stem-out-println(.Jn9or uKr ind in%ormation december /as onl, 21da,s-Jn.$brea$ )

i%(da,0{+,stem-out-println(.JnIts +L?AF-Jn.$)

i%(da,1{+,stem-out-println(.JnIts MO?AF-Jn.$)

i%(da,*{+,stem-out-println(.JnIts 4LN+?AF-Jn.$)

i%(da,2{+,stem-out-println(.JnIts N?N+?AF-Jn.$)

i%(da,{+,stem-out-println(.JnIts 47LR+?AF-Jn.$)

i%(da,5{+,stem-out-println(.JnIts 9RI?AF-Jn.$)

i%(da,={+,stem-out-println(.JnIts +A4LR?AF-Jn.$)

) )

PROGRAM #10 : to displa, t/e Pascals 4rianle



66 pascal trianleclass pascal { public void pascalw(int n { int @ pas new int @n'1$

pas@0 1$ %or (int i0$ i&n$ i'' { %or (int "0$ "&i$ ''" +,stem-out-print(pas@"'. .$ +,stem-out-println( $ %or (int "i'1$ "C0$ ">> pas@"pas@"'pas@">1$ ) )

)

PROGRAM #11 :?evelop a proram to input an, number 66 and print t/em in descendin order wit/out usin t/e sortintec/ni<ueclass numsort { public void wor(int number

{ int c@new int@=$ int diit! sum0!i0$ do{ diit number10$i''$c@idiit$number number610$

)w/ile (numberQ0$ 66 displa, in sorted manner +,stem-out-println(.4/e sorted diit %ormat is .$%or(int mH$mC0$m>>{ %or(int "1$"&i$"''{ i% (c@"m +,stem-out-print(c@"$ )

) )



)

PROGRAM #1* :

8ode a proram to compute t/e prime %actors o% an, number 66 usin a %unctionclass prime%actors { void %act(int n 66 ?e%inition{ int cc0$%or (int i1$i&n>1$i''{ i% (ni 0{ 66 c/ecin prime%or(int 1$&i$''{ i% (i0 cc''$ )i% (cc* +,stem-out-println(i'. is a prime %actor o% .'n$cc0$ ) )

) )

PROGRAM #12 :Proram to displa, all prime %ibonacci series between 1 to 10000class prime%ibonacci { public void wor( { +,stem-out-println(.All prime %ibonacci series in t/e rane o% 1 to 10000are.$int r$int a1!b*!c0$risprime(a$i% (r1 +,stem-out-print((a'. .$risprime(b$i% (r1 +,stem-out-print((b'. .$w/ile (c&10000

{ ca'b$



risprime(c$i% ((r1 (c&10000+,stem-out-print(c'. .$ab$bc$

) )int isprime(int { int i$i% (1 return 0$else{ int p1$

%or(i*$i&$i''{ i% (i0 p*$ )return (p$ ) ) )

PROGRAM #1 :Proram to input an, strin and displa, t/e number o% vowels- public class vowels{

private int !i$

633

3 8onstructor %or ob"ects o% class vowels

36 public vowels( { 66 initialise instance variables 0$ )

public void vowel(+trin a {



%or(i0$i&a-lent/($i'' { c/ar ba-c/arAt(i$ i%(bKaK SS bKeK SS bKiK SSbKoK SS bKuK ''$

) +,stem-out-println($

) )

PROGRAM # 15 :Proram w/ic/ replaces eac/ c/aracter in s b, t/e c/aracter w/ic/ is at adistance o% move a/ead! i% move is positive- I% move is 0 t/e oriinalstrin is returned unc/aned- I% move is neative! t/en eac/ c/aracter isreplaced b, a c/aracter at a distance move be/ind it- 9or eample:/en sTAE8UFUT! encode?ecode(* returns V8?NWAET and /en sTAE8?NT! encode?ecode(>2 returns VUFWAET @I8+N+ample Paper>*005 class decode {

public void compute(+trin name!int n { int "!i!l!c0!,!n1$ lname-lent/($ +,stem-out-println(.oriinal strin is .'name$%or(i0$i&l$i''{

c/ar c1name-c/arAt(i$

tr, { c(intc1 $ ) catc/(umber9ormatNception e {) i%(nC0 {

i%((c'n&H0 +,stem-out-print((c/ar(c'n$



else { cc'n$cc10$ c=5'(c>1$ +,stem-out-print((c/ar(c$

) ) else i%(n&0 { n1Mat/-abs(n$ i%((c>n1 C=5 +,stem-out-print((c/ar (c>n1$ else { i%(cC=5 cc>=5$

else cn1$ +,stem-out-print((c/ar(H0>(c>1$ ) ) else i% (n0 { +,stem-out-println(.no c/ane .'name$ brea$ )

) ) )

PROGRAM # 1= : Proram to input a strin and print eac/ word in reverse- public class reverse

{ 66 instance variables > replace t/e eample below wit/ ,our own private int i!a1!l!p!"$

633 3 8onstructor %or ob"ects o% class reverse 36 public reverse( { p0$ 66 initialise instance variables

)



public void sampleMet/od(+trin str { lstr-lent/($ +,stem-out-print(str$ %or(i0$i&l$i''

{ c/ar astr-c/arAt(i$ 63 +,stem-out-print(a$36 a1(int a$ i%(a12* SS il>1 {

%or("i$"Cp$">> { c/ar bstr-c/arAt("$

+,stem-out-print(b$ ) +,stem-out-print(. .$ pi$ )

)

) )

PROGRAM #1B :Proram to print t/e %re<uenc, o% all t/e c/aracters wit/in a strin- public class %re<uenc, { 66 instance variables > replace t/e eample below wit/ ,our own private int i!a1!l!p!"!%re<$

633 3 8onstructor %or ob"ects o% class reverse 36 public %re<uenc,( { p0$

%re<0$66 initialise instance variables

)

public void sampleMet/od(+trin str



{ int ii$ lstr-lent/($ +,stem-out-print(str$ %or(i0$i&l$i''

{ c/ar astr-c/arAt(i$ %or(ii0$ii&l$ii'' { c/ar b str-c/arAt(ii$ i% (ab %re<%re<'1$ ) +,stem-out-println(a'. occurs .'%re<'. times.$ %re<0$

) ) )

PROGRAM # 1D : Proram to displa, t/e output as: 66 55555 66 5

66 5222 66 52** 66 52*1class summation { public void displa,( { int a5!c5$%or (int i5$iC1$i>>{

%or (int a$Ci$>>{ +,stem-out-print($ )%or (int "1$"&c>1$"''{ +,stem-out-print(c$ )+,stem-out-println($cc>1$

) )



)

PROGRAM #1H :Proram to +ort an arra, usin Eubble +ort Met/od class linear{ protected int M@ new int@10$ public void input(int num@66 Nntr, o% arra, elements{ %or(int i0$i&10$i''M@inum@i$ ) public void sort( { int 0!i0!"0!n10!%la0$ 66 ?ispla, o% arra, +,stem-out-println(.4/e Arra, is .$%or(i0$i&n$i''{ +,stem-out-print(M@i$ )+,stem-out-println($

66 Eubble +ort%or(int 0$&n$'' { %or(int 0$&n>1$'' { i%(M@CM@'1 { %la M@$ M@M@'1$ M@'1%la$

)

) )

+,stem-out-println(.4/e sorted arra, is .$ %or(i0$i&n$i'' { +,stem-out-println(M@i' . .$ ) )

)



PROGRAM #*0 :Proram to sort numbers usin +election +ort Met/od class linear{

protected int M@ new int@10$ public void input(int num@66 Nntr, o% arra, elements{ %or(int i0$i&10$i''M@inum@i$ ) public void sort( { int 0!i0!"0!n10!%la0$ 66 ?ispla, o% arra, +,stem-out-println(.4/e Arra, is .$%or(i0$i&n$i''{ +,stem-out-print(M@i$ )+,stem-out-println($ 66 +election +ort%or(int 0$&n>1$'' { %or(int '1$&n$''

{ i%(M@CM@ { %la M@$ M@M@$ M@%la$ )

) )

+,stem-out-println(.4/e sorted arra, is .$ %or(i0$i&n$i'' { +,stem-out-println(M@i' . .$ ) ) )

PROGRAM #*1 :Proram to sort an, arra, o% numbers usin Insertion +ort Met/od



class linear{ protected int M@ new int@10$ public void input(int num@66 Nntr, o% arra, elements{ %or(int i0$i&10$i''

M@inum@i$ ) public void sort( { int 0!i0!"0!n10!%la0$ 66 ?ispla, o% arra, +,stem-out-println(.4/e Arra, is .$%or(i0$i&n$i''{

+,stem-out-print(M@i$ )+,stem-out-println($%or(int 1$&n$'' { %la M@$ ">1$ w/ile(%la&M@" { M@"'1 M@"$

"">1$ i% ("&0 brea$ ) M@"'1%la$ )

+,stem-out-println(.4/e sorted arra, is .$ %or(i0$i&n$i'' { +,stem-out-println(M@i' . .$

) ) )

PROGRAM #** :Proram to per%orm Einar, +earc/ in an arra, o% numbers: class %illarra, { protected int M@ new int@10$

public void %ill(int s66 arument s to be t/e element to be searc/ed {



int 0!i0!n10!middle0!pos0!%irst0$%or(i0$i&n$i''{ M@ii'1$ )

66 ?ispla, o% arra, %or(i0$i&n$i''{ +,stem-out-println(M@i$ )int last n>1$ pos>1$w/ile((pos>1(%irst&last{ 66 Application o% binar, searc/

middle(%irst'last6*$i% (M@middles{ posmiddle$ )i%(M@middle&s%irstmiddle'1$elselastmiddle>1$ )

i% (pos>1+,stem-out-println(.+orr, not present in t/e list.$else+,stem-out-println(.4/e element lies in t/e arra, at position.'(pos'1$ ) )

PROGRAM #*2 :Proram to per%orm Xinear +earc/ in a iven arra, o% numbers:

class linear{ protected int M@ new int@10$ public void %ill(int s66 arument s to be t/e element to be searc/ed { int 0!i0!n10!middle0!pos0!%irst0$%or(i0$i&n$i''{ M@ii'1$ ) 66 ?ispla, o% arra,

%or(i0$i&n$i''



{ +,stem-out-println(M@i$ ) %or(i0$i&n$i''

{ i% (M@is+,stem-out-println(M@i'. occurs at position .'(i'1$ ) ) )

PROGRAM #* : ?ispla,in t/e sum o% row and columns o% a double dimension arra,- class arra,c/ec { int a@@new int@2@2$int l@@new int@2@2$arra,c/ec({ int c1$ %or(int i0$i&2$i''

{ %or(int "0$"&2$"'' {a@i@"c$ c''$) ) )void cal({ int srow0!scol0$ 66 ?ispla, o% t/e arra,

+,stem-out-println(.4/e oriinal arra, is .$ +,stem-out-println($ %or(int i0$i&2$i'' {

%or(int "0$"&2$"'' { +,stem-out-print(a@i@"'. .$ ) +,stem-out-println($ )

66 8omputin sum o% rows %or(int i0$i&2$i''



{%or(int "0$"&2$"''

{ srowsrow'a@i@"$ )

+,stem-out-println(.4/e sum o% row .'(i'1' . is .'srow$srow0$ ) int 0$ %or(int i0$i&2$i'' { %or(int "0$"&2$"'' { scolscol'a@"@i$

"'1$ )+,stem-out-println(.4/e sum o% column .'' . is .'scol$scol0$ )

)

)

PROGRAM #*5 :Proram to enter a number and sort t/e diits in ascendin 66 order- ?ispla, t/e new diit so obtained- class wor { public void compute(int n { int a@ new int @10$

int "s!b!d!s0$ w/ile(nC0{ dn10$a@sd$ss'1$nn610$ )

%or(int i0$i&s>1$i''{ %or(int "i'1$"&s$"''



{i% (a@iCa@"{"sa@i$a@ia@"$a@""s$) )

)%or(int 0$&s$''{+,stem-out-print(a@$ ) ) )

PROGRAM #*= :+tore elements in an arra, ORY and compute t/e total number o% 66 times M occurs in ORY- /ere and M are t/e inputs alonwit/ t/e 66 elements o% t/e arra,- Proram to print t/e %re<uenc, o% M inan 66 arra, o% elements- class %re<arra, { private int a@new int@10$ private int nnn!mmm$ public void cal(

{ nnn10$int c0!i$%or(i0$i&nnn$i''i% (a@immm cc'1$+,stem-out-println(.4/e %re<uenc, o% .'mmm'. in t/e arra, is .'c$ ) public void wor1(int nn!int mm!int num@{

%or(int i0$i&nn$i''{a@inum@i$ )nnnnn$ mmmmm$ ) )

PROGRAM #*B :Proram to input an, number and c/ec i% it is a prime- Also implementt/e loic o% displa, o% all twin primes wit/in a iven limit-



+olution: public class Primes{

public boolean isPrime(int n{ 66 Returns true i% n is a prime %alse ot/erwise 66 assume n is C1 66 initialise instance variablesint 0$int count 0$%or(*$&n$''{ i% (n0

count''$ )i% (count 0return true$elsereturn %alse$ ) public void twinPrime(int limit{

int num0!i0$%or(i*$i&limit>*$i''{ numi'*$i%(isPrime(i isPrime(num+,stem-out-println(i'T V'num'T are twin primesT$ ) ) )

PROGRAM #*D : Proram to compute t/e middle diit o% an, entered number- I% t/enumber does not /ave a middle diit! it /as to return t/e averae o% t/emiddle two diits-

class number { int nt/no(int m!int n

{ int a@ new int @100$



int b@ new int @100$ int !mm!i0$ mmm$ w/ile(mmQ0 {

ii'1$ mm10$ a@i$ mmmm610$ ) %or(int "0$"&i$"'' { b@"'1a@i>"$ ) b@n$

return($ )void inputnumber(int m{ int ;!s!c0$ ;m$ w/ile(;Q0 { ;;610$ cc'1$

) i%((c*0 { int s1!s*$ s1nt/no(m!c6*$ s*nt/no(m!(c'*6*$ s(s1's*6*$ ) else {

snt/no(m!(c'16*$ ) +,stem-out-println(.Middle term is.'s$ ) )

PROGRAM # *H : A palindrome number is one t/at reads same %rom le%t to ri/t or ri/t to

le%t- 4/ere is an inenious met/od to et a palindrome %rom an, positiveinteer- 4/e procedure is as %ollows: +tart wit/ an, positive number o% *



or more diits- Obtain anot/er positive number b, reversin t/e diits o%t/e startin number- Add t/e two numbers toet/er- Repeat t/e w/ole procedure wit/ t/e sum as t/e startin number till ,ou et a sum w/ic/ isa palindrome number-

66 Proram to calculate t/e palindrome o% a iven number in maimum 15 terms- Assume t/at t/e startin number is not a palindrome- +ampleInput: DB- Output: DD +teps: class number { int reverse(int { int s!t0$

w/ile(Q0 { s10$ t(t310's$ 610$ ) return(t$ )int palin(int {

int s!t0!r$ r$ w/ile(rQ0 { sr10$ t(t310's$ rr610$ ) i%(t {

return(1$ ) else { return(0$ ) )void palcal(int n{ int r!c1!p!n1$

n1n$ int %la1$



%or(int i0$i&15$i'' { rreverse(n1$ ppalin(r'n1$ i%(p1

{ +,stem-out-println(.Initial umber:.'n$ +,stem-out-println(.umber is:.'(r'n1 ' .w/ic/ is palindrome in step .'c$ %la0$ brea$ ) else { cc'1$

n1n1'r$ ) ) i% (%la1+,stem-out-println(.4/e Proram is 4erminated because it /as eceded15 steps and Palindrome was not ac/ievedQ.$ ) )

PROGRAM #20 : Proram to print t/e sum o% %actorial o% t/e diits o% an entered number-class wor { void worin(int a{ lon %act 1!i!"!sum0$int numa$int diit$w/ile(numC0{

diit num10$%or(i1$i&diit$i''{ %act %act 3 i$ )sum sum ' %act$num num610$%act 1$ )+,stem-out-println(V4/e sum o% %actorials o% t/e diits o%T'a'T is V'sum$

) )



PROGRAM #21 : Nample class to demostrate t/e s/ort/and notation

public class s/ort/and { public void wor({ int a10$%loat b*0$a'10$b>10$+,stem-out-println(Va is V'a$+,stem-out-println(Vb is V'b$a3*$b6*$+,stem-out-println(Vow a is V'a$+,stem-out-println(Vow b is V'b$a10$b10$+,stem-out-println(Vow a is V'(''a$+,stem-out-println(Vow b is V'(''b$ )

)

PROGRAM #2* : Proram to displa, t/e output as: 66 55555 66 5 66 5222 66 52** 66 52*1class summation { public void displa,( { int a5!c5$%or (int i5$iC1$i>>{ %or (int a$Ci$>>{ +,stem-out-print($

)%or (int "1$"&c>1$"''



{ +,stem-out-print(c$ )+,stem-out-println($cc>1$

) ) )

PROGRAM #22 :Proram to sort a list o% numbers enerated randoml,- public class +ortumbers { public static void sort(double@ nums { %or(int i 0$ i & nums-lent/$ i'' { int min i$ 66 /olds t/e inde o% t/e smallest element 66 %ind t/e smallest one between i and t/e end o% t/e arra, %or(int " i$ " & nums-lent/$ "'' { i% (nums@" & nums@min min "$ ) 66 +wapin bein done usin t/e t/ird variable tmp- double tmp$ tmp nums@i$

nums@i nums@min$ nums@min tmp$ ) ) public void wor({ double@ nums new double@10$ 66 8reate an arra, to /oldnumbers %or(int i 0$ i & nums-lent/$ i'' 66 Generate random numbers nums@i Mat/-random( 3 100$

sort(nums$ 66 +ort t/em %or(int i 0$ i & nums-lent/$ i'' 66 Print t/em out +,stem-out-println(nums@i$ ) )

PROGRAM #2 : Proram to %rame a simple calculator wit/ %unctions lie add! sub! mult!divide-

public class 8alculator {



66 instance variables > replace t/e eample below wit/ ,our own private double result$

633 3 8onstructor %or ob"ects o% class 8alculator

36 public 8alculator( { 66 initialise instance variables result 0$ )

public double add( double value { 66 put ,our code /ere

return result'value$ ) public double subtract( double value { 66 put ,our code /ere return result>value$ ) public double multipl,E,( double value { 66 put ,our code /ere

return result3value$ ) public double divideE,( double value { 66 put ,our code /ere i%(value0-0 return result$66can not divide b, 0! returnin last result else return result6value$

)

public double clear( { 66 put ,our code /ere return result0$ ) )

PROGRAM #25 : Proram to input name and mars in %ive sub"ects and compute av- and

select t/e sub"ects available- public class student



{ private int $

public void result(+trin n!int a!int b!int c!int d!int e

{ (a'b'c'd'e65$ i%(CH0 +,stem-out-println(.science wit/ computers.$ else i%(CD0 &DH +,stem-out-println(.science wit/out computers.$ else i%(CB0 &BH +,stem-out-println(.commerce wit/ mat/s.$ else i%(C=0 &=H +,stem-out-println(.commerce wit/out mat/s.$

+,stem-out-println(n$ ) )

PROGRAM #2= : Proram to print t/e reverse o% an, entered strin- public class reverse{

private int !i!l$

public reverse( {

0$ )

public void arra,1(+trin a {

la-lent/($ +,stem-out-print(.t/e reverse strin is .$ %or(il>1$iC0$i>> +,stem-out-print(a-c/arAt(i$ ) )

PROGRAM #2B : Proram to arrane an entered strin in Alp/abetical order- public class alp/abet



{ private int !l!i!"$ c/ar b$

public alp/abet(

{ 66 initialise instance variables 0$ )

public void arrane(+trin a { la-lent/($ %or(i=5$i&H0$i''

{ %or("0$"&l$"'' { ba-c/arAt("$ b$ i%(i SS i'2* +,stem-out-print(b$ ) )

)

)

PROGRAM #2D : ?evelop a proram to input a list o% elements in a double dimensionalarra, o% 22 and print t/e maimum and t/e minimum elementsalonwit/ t/eir location wit/in t/e arra,- class maminarra, {

protected int number@@ new int@2@2$ private int sm!l!p1!p*!<1!<*$ public void inputvalues(int num@@ { %or(int i0$i&2$i'' { %or (int "0$"&2$"'' { number@i@"num@i@"$ )

) )



public void comp( { int manumber@0@0$

int minnumber@0@0$ %or(int i0$i&2$i''

{ %or (int "0$"&2$"'' {i%(ma&number@i@" { p1i$ p*"$ lnumber@i@"$ ) else {

<1i$<*"$smnumber@i@"$ ) ) ) +,stem-out-println(.larest.'l'.position in row.'p1'.column .'p*$ +,stem-out-println(.smallest .'sm'.position in row.'<1'.column.'<*$ ) )

PROGRAM #2H :Proram to +ort a iven Arra, in ?escendin Order class Arra,+ort { public void wor({ int number @ {15!D!1*!2*!5*)$int n number-lent/$

+,stem-out-print(.4/e elements o% arra, are:.$%or (int i 0$ i&n$ i''{ +,stem-out-println(number@i$ ) %or (int i 0$ i&n$ i''{ %or (int " i'1$ "&n$ "''{

i% (number @i &number @"{



int temp number@i$number@i number@"$number @" temp$ ) )

) +,stem-out-print(.+orted Nlements o% t/e Arra, are: .$%or (int i 0$ i&n$ i''{ +,stem-out-println(number@i$ ) ) )

PROGRAM #0 : 4/is %unction allows t/e user to enter a number and t/an rounds it o%%! 66 correct to t/e nearest inteer- class roundo%% { public void worin(double input {

double remainder0$ 66 II4IAXIWA4IO A? ?N8XARA4IO O9 int w/ole0!answer0$ 66 ARIAEXN+

w/ole (intinput$ 66 47I+ XIN +4ORN+ 47N I4NGNR PAR4 O947N AXLN 66 I4O A +NPNRA4N ARIAEXN

remainder input > w/ole$ 66 RNMAI?NR I+ 47N AXLN A94NR 47N ?N8IMAX 66 POI4

i% (remainder C 0-5 66 I9 RNMAI?NR I+ GRNA4NR 47A 0-5

answer w/ole ' 1$ 66 A?? 1 4O 47N AXLN

else 66 O47NRI+N

answer w/ole$ 66 YNNP 47N I4NGNR PAR4 A+ I4 I+

+,stem-out-println(.Rounded O%% umber Is : . 'answer$ 66

?I+PXAF 47N A+NR



) 66 N? O9 9L84IO

)

PROGRAM #1 : Proram to displa, a 4rianle o% numbers called t/e PascalKs 4rianle!

w/en provided wit/ t/e number o% rows-class pascal { public void worin(int n

{ int pal@@ new int@50@50$int i!"!$%or (i0$i&n$i''{ pal@i@01$ pal@i@i1$%or ("1$"&i$"''{ pal@i@"pal@i>1@">1'pal@i>1@"$

)%or ("1$"&(n>(i'1$"''{+,stem-out-print(. .$ )%or (0$&i$''{+,stem-out-print(pal@i@$ )+,stem-out-println($ ) ) )

PROGRAM #* :4/is proram creates a maic s<uare bo o% order n n- 66 4/e specialit, o% a maic s<uare bo is t/at t/e sum o% elements o% 66an, row or an, column 66 is alwa,s e<ual-

66 Nnter t/e row o% matri and t/e startin inde o% matri number

eneration



class maics<uare { int arr@@new int@10@10$ public void worin(int n! int {

int a!b!i$int "!$%or (i0$ i&n$ i''{%or (0$ &n$ ''{arr@i@>1$ ) )arr@0@n6*$

maic(0!n6*! ! n$%or (i0$ i&n$ i''{%or (0$ &n$ ''{+,stem-out-print(arr@i@'. .$ )+,stem-out-println($ )

)

void maic( int a! int b! int ! int n{int c$c1$ int i$%or ('1!i*$ i&n3n$ i''!c''!''{

i%(c&n{aa>1$bb>1$i% (a>1an>1$i% (b>1bn>1$ )else

{aa'1$



c0$ )arr@a@b$ )

)

)

PROGRAM # 2 : Proram to c/ec i% an, entered number is a Maic umber class maic { public void worin(int num{ int num1!i!"!!%la0!n!sum0!c0$num1num$w/ile(%la0{ w/ile(numQ0{ nnum10$

sumsum'n$numnum610$cc'1$ )i% (c1{ i% (sum1 +,stem-out-println(num1'. is a maic number.$else+,stem-out-println(num1'. is not a maic number.$%la1$)

numsum$sum0$c0$ )

) )

PROGRAM # : Proram to input an, number and displa, t/e sum o% its diitsclass sumdiit



{ public void sum(int n{ int sum0!<1!r$

w/ile(nQ0{ rn10$sumsum'r$nn610$ )+,stem-out-println(.sum o% diits is.'sum$ ) )

PROGRAM #5 :Proram to print a trianle as %ollows: 661 661* 661*2 661*2 661*25 class displa,

{ public void worin( { int a!b!i!"$%or(i1$i&5$ii'1{ %or("1$"&i$""'1{ +,stem-out-print(. .'"$ )

+,stem-out-println($ ) ) )

PROGRAM #= : Proram to enter an, number (ma- 2 diits and c/ec t/e nature o% itsdiits-class c/ecdiit {

public void compute(int a {



i%(a&10{ +,stem-out-println(a'.is sinle diit no-.$ )i%(aC10 a&100

{ +,stem-out-println(a'.is double diit no-.$ )i%(aC100{ +,stem-out-println(a'.is triple diit no-.$ ) ) )

PROGRAM #B :Proram to input a number and print its binar, e<uivalent-class binconversion { public void calculate(int n { int a@new int@10!c>1!p$ w/ile(nC0

{ cc'1$ pn*$i% (p0{ a@c0$)else {a@c1$)nn6*$

)%or(int ic$iC0$i>>{+,stem-out-print(a@i$) ) )

PROGRAM #D : Proram to enter a number and sort t/e diits in ascendin 66 order- ?ispla, t/e new diit so obtained-

class sortdiit {



public void wor(int n { int "s!b$ int a@new int@10!d!s0$w/ile(nC0

{ dn10$a@sd$ss'1$nn610$ ) %or(int i0$i&s>1$i''{ %or(int "i'1$"&s$"''{i% (a@iCa@"

{"sa@i$a@ia@"$a@""s$) ) )%or(int 0$&s$''{+,stem-out-print(a@$ ) ) )

PROGRAM #H : to etract and displa, t/e maimum prime diit %rom a number class maprimediit { public void compute(int c { int b$ int n!bi0!d!count0!i$

do{

nc10$ %or(i1$i&n$i'' { i%(ni0 countcount'1$) i%(count* { i%(bi&n bin$

count0$ )



count0$ cc610$ )

w/ile(cQ0$

+,stem-out-println(bi'.is t/e maimum prime diit number.$ ) )

PROGRAM #50 : Proram to displa, t/e %ollowin output: 66 11 66 1* ** 66 12 *2 22 class out

{ public void worin( { int a!b!i!"$%or(i1$i&2$ii'1{

%or("1$"&i$""'1{ +,stem-out-print(. .'"'i$ )+,stem-out-println($ ) ) )

PROGRAM #51 : Proram to print t/e c/aracters o% t/e strin present at odd positions- public class odd {

private int !i!l$

public odd( {

0$ )



public void arra,1(+trin a

{ la-lent/($ +,stem-out-print(.t/e c/aracters o% t/e strin .'a'. at odd

positions are:.$ %or(i0$i&l$i'' { i% (i*Q0 +,stem-out-print(a-c/arAt(i$) ) )

PROGRAM #5* : Proram to print t/e c/aracters o% t/e strin present at even positions- public class even {

private int !i!l$

public even( {

0$

)

public void arra,1(+trin a { la-lent/($ +,stem-out-print(.t/e c/aracters o% t/e strin .'a'. at even positions are:.$ %or(i0$i&l$i'' { i% (i*0

+,stem-out-print(a-c/arAt(i$) ) )

PROGRAM #52 :Proram to input a number and print its sum and averae o% diitsclass sd {

public void input(int number



{int sum0! av! i!"$int diit!n!nn0$nnumber$w/ile(nC0{

diitn10$sum sum'diit$nnnn'1$nn610$ )+,stem-out-println(.4/e number entered is .'number$+,stem-out-println(.4/e sum o% diits is .'sum$+,stem-out-println(.4/e averae o% diits is .'sum6nn$ ) )

PROGRAM #5 : Proram to compute t/e sum o% %actorial o% all t/e diits o% an, enterednumber- public class diit%act{ 633 8ompute and return Q! t/e %actorial o% 36 public int %actorial(int { int %act 1$ int num ! diit! sum%act0$ 66 etractin diits o%

w/ile(numC0 { diit num10$

%or(int i 1$ i & diit$ i'' 66 loop %act 3 i$ 66 s/ort/and %or: %act %act 3 i$ sum%act sum%act'%act$ +,stem-out-println(.4/e %actorial o% diit etracted is.'%act$ numnum610$ %act1$

) return sum%act$ ) )

PROGRAM #55 : Proram to input an, number and print t/e %actorial o% its prime diits- public class pro{

public void wor(int n {



int diit!c0$ int %act1$ w/ile(nC0 { diit n10$

66 c/ecin i% diit is prime %or(int "1$"&diit$"'' {i% (diit"0 cc'1$) i% (c* { 66 computin %actorial o% diit %or (int i1$i&diit$i'' %act%act3i$ +,stem-out-println(.4/e %actorial o% diit.' diit' . is .'%act$ %act1$

) c0$ nn610$ ) ) )

PROGRAM #5= : Proram to displa, t/e sum o% t/e %ollowin series 66 + 1'2'5'B---- w/ere is t/e input- public class pro{ public void wor(int n { int s0$ %or (int i1$i&n$ii'* { s s'i$

) +,stem-out-println(.4/e sum o% t/e series is .'s$

) )

PROGRAM # 5B :Proram to displa, t/e %ollowin series 66 >1'*>2'---- w/ere is t/e input- public class pro

{ public void wor(int n



{ %or (int i1$i&n$i'' { i% (i*0 +,stem-out-print(.'.'i$

else +,stem-out-print(.>.'i$ ) ) )

PROGRAM #5D : Proram to print t/e sum o% t/e even diits o% an entered number

public class pro{ public void wor(int n { int diit! sum0$ w/ile(nC0 { diit n10$ 66 c/ecin diit even i% (diit*0

sum sum ' diit$ nn610$ ) +,stem-out-println(.4/e sum o% t/e even diits o% t/e number is.'sum$

) )

PROGRAM #5H : Proram to print t/e number o% t/e prime diits o% an entered number

public class pro{ public void wor(int n { int diit! sum0$ w/ile(nC0 {

diit n10$ 66 c/ecin diit even



i% (diit1 SS diit2 SS diit 5 SS diitB sum sum ' 1$ nn610$ ) +,stem-out-println(.4/e number o% t/e prime diits o% t/e

number is .'sum$

) )

PROGRAM #=0 :Proram to print t/e maimum diit o% an entered number-

public class pro{ public void wor(int n { int diit!ma0$ w/ile(nC0 { diit n10$ { i% (diitCma madiit$)

nn610$ ) +,stem-out-println(.4/e maimum diit is .'ma$ ) )

PROGRAM #=1 : Proram to input an, number and print t/e %actorial o% its diits- public class pro{ public void wor(int n { int diit$ int %act1$ w/ile(nC0 { diit n10$ 66 computin %actorial o% diit %or (int i1$i&diit$i''

%act%act3i$ +,stem-out-println(.4/e %actorial o% diit.' diit' . is .'%act$



%act1$

nn610$ ) )

)

PROGRAM #=* : Proram to displa, t/e %ollowin series 66 1'2'5'B---- w/ere is t/e input- public class pro{ public void wor(int n { int s0$ %or (int i1$i&n$ii'* { +,stem-out-print(i$ ) ) )

PROGRAM #=2 : Proram to displa, t/e sum o% t/e %ollowin series 66 + 1>*'2>----- w/ere is t/e input- public class pro{ public void wor(int n { int s0$ %or (int i1$i&n$i'' { i% (i*0 s s'i$ else s s>i$ ) +,stem-out-println(.4/e sum o% t/e series is .'s$

) )

PROGRAM # = :



Proram to displa, t/e %ollowin series 66 1 ** 222 55555--- public class pro{ public void wor(int n

{ %or (int i1$i&n$i'' { %or (int "1$"&i$"'' { +,stem-out-print(i$ ) +,stem-out-print(. .$ ) )

)

PROGRAM #=5 :Proram to print t/e sum o% t/e prime diits o% an entered number

public class pro{ public void wor(int n { int diit! sum0$

w/ile(nC0 { diit n10$ 66 c/ecin diit even i% (diit1 SS diit2 SS diit 5 SS diitB sum sum ' diit$ nn610$ ) +,stem-out-println(.4/e sum o% t/e prime diits o% t/e number is.'sum$

)

)

PROGRAM #== :Proram to print t/e sum %actors o% eac/ diit o% an entered number

public class pro{




int diit!sum0$ w/ile(nC0 { diit n10$ 66 c/ecin diit even

%or(int i1$i&diit$i'' { i% (diiti0 sum sum'i$) +,stem-out-println(sum' . is t/e sum o% %actor o% diit .'diit$ sum0$

nn610$ ) ) )

PROGRAM #=B : Proram to print t/e minimum diit o% an entered number-

public class pro{ public void wor(int n { int diit!minH$

w/ile(nC0 { diit n10$ { i% (diit&min min diit$) nn610$ ) +,stem-out-println(.4/e minimum diit is .'min$ ) )

PROGRAM #=D :Proram to print w/et/er t/e sum o% diits o% an entered number is oddor even-

public class pro{ public void wor(int n

{ int diit!sum0$



w/ile(nC0 { diit n10$ sumsum'diit$ nn610$

) i% (sum*0 +,stem-out-println(.4/e sum o% diits is even.$ else +,stem-out-println(.4/e sum o% diits is odd.$ ) )

PROGRAM #=H : Proram to print t/e %actors o% eac/ diit o% an entered number

public class pro{ public void wor(int n { int diit$ w/ile(nC0 {

diit n10$ 66 c/ecin diit even %or(int i1$i&diit$i'' { i% (diiti0 +,stem-out-println(i' . is t/e %actor o% diit .'diit$ ) nn610$ ) ) )

PROGRAM #B0 : Proram to print t/e sum o% t/e odd diits o% an entered number

public class pro{ public void wor(int n { int diit! sum0$

w/ile(nC0 {



diit n10$ 66 c/ecin diit even i% (diit*Q0 sum sum ' diit$ nn610$

) +,stem-out-println(.4/e sum o% t/e odd diits o% t/e number is.'sum$

) )

PROGRAM #B1 : Proram to displa, t/e %ollowin series 66 1 1* 1*2 1*2 1*25

public class pro{ public void wor(int n { %or (int i1$i&n$i'' { %or (int "1$"&i$"'' {

+,stem-out-print("$ ) +,stem-out-print(. .$ ) ) )

PROGRAM #B* :Proram to displa, t/e %ollowin series 66 '1>*'2>---- w/ere is t/e input- public class pro{ public void wor(int n { %or (int i1$i&n$i'' { i% (i*Q0 +,stem-out-print(.'.'i$ else +,stem-out-print(.>.'i$

) )



)

PROGRAM #B2 :Proram to displa, t/e sum o% t/e %ollowin series 66 + >1'*>2'----- w/ere is t/e input- public class pro{ public void wor(int n { int s0$ %or (int i1$i&n$i'' { i% (i*0 s s>i$ else s s'i$ ) +,stem-out-println(.4/e sum o% t/e series is .'s$

) )

PROGRAM #B : Proram to compute t/e sum o% %actors o% all t/e diits o% an, enterednumber- public class diitsum%act{ public void %actor(int { int % 0$ int num ! diit! sum%act0$ 66 etractin diits o% w/ile(numC0 { diit num10$

%or(int i 1$ i & diit$ i'' 66 loop {%i'1$ i%(diiti0 sum%act sum%act'i$ ) +,stem-out-println(.4/e sum o% %actors o% .'%'. is .'sum%act$ sum%act0$ numnum610$ ) ) )



PROGRAM #B5 : 633 3 proram %or printin number o% words in a iven strin- 3

3336

public class strin*{ 66 instance variables > replace t/e eample below wit/ ,our own private int !l!i!b!c$

633 3 8onstructor %or ob"ects o% class strin*

36 public void strin*( { 66 initialise instance variables l bc0$ ) public void convertZcase(+trin a { la-lent/($

%or(i0$i&l$i'' { c/ar ;a-c/arAt(i$ i%(;K K b''$ ) bb'1$ +,stem-out-println(.4/e total number o% words in t/e strin is .'b$ )

)

PROGRAM #B= : 633 3 proram %or printin t/e reverse o% a iven strin- 33 3 36

public class strin*

{ private int !l!i!b!c$



633

3 8onstructor %or ob"ects o% class strin* 36 public void strin*(

{ 66 initialise instance variables l bc0$ ) public void convertZcase(+trin a { la-lent/($ %or(il>1$iC0l$i>> {

+,stem-out-print(a-c/arAt(i$ ) ) )

PROGRAM # BB : 66 lent/ o% eac/ word o% a sentence 66 print lonest word

class strin {

private int i!l!c$ c/ar ;$

public strin( { 66 initialise instance variables

c0$ )

public void wor(+trin s {ss'. .$ ls-lent/($ %or(i0$i&l$i'' { ;s-c/arAt(i$ c''$

+,stem-out-print(;$ i%(;K K



{c>>$ +,stem-out-print(. :.'c'. .$ c0$ +,stem-out-println($ )

)

) )

PROGRAM #BD : 66 print t/e smallest word o% an entered strin

class strin {

private int i!l!c!bi!m!n$ c/ar ;$ +trin $

public strin( { 66 initialise instance variables

c0$ biHHH$ )

public void wor(+trin s {ss'. .$ ls-lent/($ m0$ %or(i0$i&l$i'' {

;s-c/arAt(i$ c''$

i%(;K K { ni$ c>>$ 66+,stem-out-print(. :.'c'. .$ i%(c&bi {

bic$ s-substrin(m!n$



mn$ ) c0$ ) )

+,stem-out-println(.4/e smallest word is .'$

) )

PROGRAM #BH : 633 3 proram %or printin number o% spaces in a iven strin-

33336

public class strin*{ 66 instance variables > replace t/e eample below wit/ ,our own private int !l!i!b!c$

633

3 8onstructor %or ob"ects o% class strin* 36 public void strin*( { 66 initialise instance variables l bc0$ ) public void convertZcase(+trin a {

la-lent/($ %or(i0$i&l$i'' { c/ar ;a-c/arAt(i$ i%(;K K b''$ ) +,stem-out-println(.4/e total number o% spaces in t/e strin is .'b$ )

)



PROGRAM #D0 : 633 3 convert %irst letter o% eac/ word to capital

33336

public class strin2{

private int i!l!b$ c/ar ;$

public strin2( { 66 initialise instance variables

)

public void convert(+trin a { la-lent/($

;a-c/arAt(0$ i%(;CKaK ;&K;K {+trin new +trin(. .$ ';$

+,stem-out-print(-toLpper8ase($ )

%or(i1$i&l$i'' { ;a-c/arAt(i$

i%(;K K { ;a-c/arAt(i'1$ i%(;CKaK ;&K;K { +trin new +trin(. .$ ';$

+,stem-out-print(-toLpper8ase($i''$ )

)

else +,stem-out-print(;$



) ) )

PROGRAM # D1 : 66 lent/ o% eac/ word o% a sentence 66 print lonest word

class strin {

private int i!l!c!bi!m!n$ c/ar ;$ +trin $

public strin( { 66 initialise instance variables c0$ bi0$ )

public void wor(+trin s

{ss'. .$ ls-lent/($ m0$ %or(i0$i&l$i'' { ;s-c/arAt(i$ c''$

i%(;K K { ni$ c>>$ 66+,stem-out-print(. :.'c'. .$ i%(cCbi { bic$ s-substrin(m!n$ mn$

) c0$



) )

+,stem-out-println(.lonest word is .'$ )

) PROGRAM # D* :

66 pascal trianleclass pascal { public void pascalw(int n { int @ pas new int @n'1$

pas@0 1$ %or (int i0$ i&n$ i'' { %or (int "0$ "&i$ ''" +,stem-out-print(pas@"'. .$ +,stem-out-println( $ %or (int "i'1$ "C0$ ">> pas@"pas@"'pas@">1$ ) )

)

PROGRAM # D2 :

633 3 proram %or countin number o% upper csae and lower case- 333

36 public class strin*{ 66 instance variables > replace t/e eample below wit/ ,our own private int !l!i!b!c$

633 3 8onstructor %or ob"ects o% class strin* 36 public void strin*(

{ 66 initialise instance variables



l bc0$ ) public void convertZcase(+trin a {

la-lent/($ %or(i0$i&l$i'' { c/ar ;a-c/arAt(i$ i%(;CKAK ;&KWK b''$ ) +,stem-out-println(.upper caase c/aracters are. 'b$ ) )

PROGRAM # D : 66 Proram to print t/e %re<uenc, o% most occurrin diit o% an enterednumber-

public class pro{ public void wor(int n {

int numb@new int @H$ int diit!s0$ int mostoccurrindiit0$ int %re<uenc,0$ int number0$ +,stem-out-println(.4/e entered number is .'n$ w/ile(nC0 { diit n10$ ss'diit$

nn610$ numb@numberdiit$ numbernumber'1$ ) int c0$ %or(int 0$&H$'' { %or(int i0$i&number$i'' {

{ i% (numb@i



c''$ ) i% (cC%re<uenc, {mostoccurrindiitnumb@i$ %re<uenc,c$)

) c0$ ) +,stem-out-println(.4/e most occurrin diit is.'mostoccurrindiit$ +,stem-out-println(.ItKs %re<uenc, is .'%re<uenc,$ ) ) PROGRAM # D5 :

66 Proram to print t/e %re<uenc, o% least occurrin diit o% an enterednumber-

public class pro{ public void wor(int n { int numb@new int @H$ int diit!s0$

int leastoccurrindiit0$ int %re<uenc,H$ int number0$ +,stem-out-println(.4/e entered number is .'n$ w/ile(nC0 { diit n10$ ss'diit$ nn610$ numb@numberdiit$

numbernumber'1$ ) int c0$ %or(int 0$&H$'' { %or(int i0$i&number$i'' {

{ i% (numb@i

c''$ )



i% (c&%re<uenc, {leastoccurrindiitnumb@i$ %re<uenc,c'1$) ) c0$

) +,stem-out-println(.4/e least occurrin diit is.'leastoccurrindiit$ +,stem-out-println(.ItKs %re<uenc, is .'%re<uenc,$ ) ) PROGRAM # D= : 66 Proram to print t/e %re<uenc, o% diits o% an entered number-

public class pro

{ public void wor(int n { int numb@new int @H$ int diit!s0$ int number0$ +,stem-out-println(.4/e entered number is .'n$ w/ile(nC0

{ diit n10$ ss'diit$ nn610$ numb@numberdiit$ numbernumber'1$ ) int c0$ %or(int 0$&H$'' {

%or(int i0$i&number$i'' {

{ i% (numb@i c''$ ) ) +,stem-out-println(.4/e diit.''. occurs .'c'. times .$ c0$

) )



) PROGRAM # DB : 66 Proram to print t/e averae o% diits o% an entered number-

public class pro

{ public void wor(int n { int diit!s0$ int number0$ +,stem-out-println(.4/e entered number is .'n$ w/ile(nC0 {

diit n10$ ss'diit$ nn610$ numbernumber'1$ ) +,stem-out-println(.4/e sum o% diits is .'s$ +,stem-out-println(.4/e number o% diits is .'number$ double av s6number$ +,stem-out-println(.4/e averae o% all t/e diits o% t/e numberis.'av$

) )

PROGRAM # DD : 66 Proram to print t/e sum o% cubes o% eac/ diit o% an entered number-

public class pro

{ public void wor(double n { double diit!s0$ +,stem-out-println(.4/e entered number is .'n$ w/ile(nC0 { diit n10$ ss'Mat/-pow(diit!2$ nn610$

) +,stem-out-println(.4/e sum o% cubes o% all t/e diits o% t/e



number is.'s$ ) )

PROGRAM # DH : 66 Proram to print t/e sum o% s<uare roots o% eac/ diit o% an enterednumber-

public class pro{ public void wor(double n {

double diit!s0$ +,stem-out-println(.4/e entered number is .'n$ w/ile(nC0 { diit n10$ ss'Mat/-s<rt(diit$ nn610$ ) +,stem-out-println(.4/e sum o% s<uare roots all t/e diits o% t/enumber is.'s$

) )

PROGRAM # H0 : 66 Proram to print t/e diits o% an entered number in ascendin order-

public class pro

{ public void wor(int n { int diit!numn$ +,stem-out-println(.4/e entered number is .'n$ +,stem-out-println(.4/e sorted diits in ascendin order is .$ %or(int i0$i&H$i'' { w/ile(nC0 {

diit n10$ i% (diiti



+,stem-out-print(diit$ nn610$ ) nnum$ )

) )

PROGRAM # H1 : 66 Proram to print t/e sum o% %actors o% eac/ diit o% an entered number-

public class pro

{ public void wor(int n { int diit!numn$ +,stem-out-println(.4/e entered number is .'n$ +,stem-out-println(.4/e %actors o% eac/ diit are: .$ w/ile(nC0 { diit n10$ +,stem-out-println(.4/e %actors o% diit .'diit '. are .$

%or(int i1$i&diit$i'' { i% (diiti0 +,stem-out-print(i$ ) +,stem-out-println($ nn610$ ) )

)

PROGRAM # H* : 66 Proram to print t/e diits o% an entered number in descendin order-

public class pro{




int diit!numn$ +,stem-out-println(.4/e entered number is .'n$ +,stem-out-println(.4/e sorted diits in descendin order is .$ %or(int iH$iC0$i>> {

w/ile(nC0 { diit n10$ i% (diiti +,stem-out-print(diit$ nn610$ ) nnum$ )

) )

PROGRAM # H2 : 66 Proram to print t/e sum o% s<uares o% eac/ diit o% an enterednumber-

public class pro

{ public void wor(double n { double diit!s0$ +,stem-out-println(.4/e entered number is .'n$ w/ile(nC0 { diit n10$ ss'(diit3diit$ nn610$

) +,stem-out-println(.4/e sum o% s<uares o% all t/e diits o% t/enumber is.'s$ ) )

PROGRAM # H :

66 Proram to displa, t/e %ollowin series: 66 0 2 D 15 * ---- terms! w/ere is t/e input-



class series { public void wor(int n {

double i!"$ %or(i1$i&n$i'' {

+,stem-out-print(Mat/-pow(i!*>1$ ) +,stem-out-print(. .$ ) )

PROGRAM # H5 : 66 Proram to c/ec i% t/e entered strin is a prime palindrome- class palind { public void computin(+trin s { int i!"!0$ +trin ss..$ c/ar s1$

s-lent/($ 66 c/ecin i% t/e strin is a prime lent/- int nc$ int cc0$ %or(i1$i&nc$i'' { i% (nci0 cccc'1$ ) i% (cc* +,stem-out-println(.4/e strin is a prime.$

else +,stem-out-println(.4/e strin is not a prime.$ %or(i>1$iC0$i>> { s1s-c/arAt(i$ ssss's1$ ) +,stem-out-println(.4/e strin is .'s$ +,stem-out-println(.4/e strin in reverse is .'ss$

i%(s-e<uals(ss

+,stem-out-println(.4/e strin is a palindrome.$ else



+,stem-out-println(.4/e strin is not a palindrome.$ ) ) PROGRAM # H= :

public class AE8 {66pilatin> s/i%t all t/e c/aracters to end o% t/e strin till vowel does notcome t/en add KaK private int !,!c!l$+trin a$ c/ar b$ public AE8( { c0$ 0$,0$

)

public void sampleMet/od(+trin a {

a-lent/($ %or(,0$,&$,'' { ba-c/arAt(,$ i%(bKaK SS bKeK SS bKiK SS bKoK SS b KuK

{ brea$ ) else { c''$ aa'b$ 66a@,K K$ ) )

aa'KaK$ +,stem-out-print(.pilatin o% t/e word is .$ l'c'1$ %or(,c$,&l$,'' { ba-c/arAt(,$ +,stem-out-print(b$ )

)

)



PROGRAM # HB : 66 Proram to print t/e sum o% t/e %ollowin series:

66 + 13* ' *32 ' 23 ' 35---- n terms- /ere n is t/e input-class sumseries

{ public void sum(int n { int s0! i1!"*$ %or(i1$i&n$i'' { s s'i3"$ ""'1$

) +,stem-out-println(.4/e sum o% t/e series is .'s$ ) ) PROGRAM # HD : 66 Proram to convert a iven decimal number into binar,- class decbin {

public void convert(int n { int num@new int@*0$ int s0! c0!i1!"*!d$ w/ile(nC0 { dn*$ num@cd$ nn6*$ cc'1$

)

%or( i0$i&c$i'' +,stem-out-print(num@i$

) ) PROGRAM # HH :

66 4/is proram will displa, all per%ect numbers %or numbers between 1and 1000



66 4/e proram s/ould displa, t/e per%ect number alonwit/ t/e %actors- 66 e- = 1 ' * ' 2class per%ect { public void per%ect( 669unction t/at %inds all t/e per%ect numbers

{ int %actorZsum0$ 664/e sum o% t/e %actors

66Main loop to c/ec i% it is a per%ect number %or (lon loop *$ loop &1000$ loop'' { %actorZsum 0$

66I% it is a per%ect number! it adds t/e sums to%actorZsum

%or (lon %actor 1$ %actor & loop$ %actor'' {

i% (loop %actor 0 %actorZsum ' %actor$ )

i%(%actorZsumloop {

+,stem-out-print(%actorZsum' . 1.$

66loop* displa,s all t/e %actors

%or (lon loop**$ loop* & loop$ loop*'' { i%(looploop*0 +,stem-out-print( .'.' loop*$ ) +,stem-out-println($ )

) ) )

99 java source codes

Documents