មេរៀនទី៨: ប្រមាណវិធីក្នុង java
ប្រមាណវិធី ក្នុង java គឺជានិម្មសញ្ញា ដែលត្រូវបានប្រើ
ដើម្បីកំណត់ ប្រត្តិបត្តិការ។ មានប្រភេទប្រមាណវិធីក្នុង java ដូចជា
ប្រមាណវិធី arithmetic, ប្រមាណវិធី relational, ប្រមាណវិធី shift,
ប្រមាណវិធី bitwise, ប្រមាណវិធី ternary និងប្រមាណវិធី assignment។
ប្រយោជន៍ក្នុងកម្មវិធី Programs:
ដូចជាចំនួន ហ្វាក់តូរីយ៉ែល factorial number, prime number, សេរី fibonacci series ។ល។
1) Program នៃចំនួន factorial number
class Operation{
static int fact(int number){
int f=1;
for(int i=1;i<=number;i++){
f=f*i;
}
return f;
}
public static void main(String args[]){
int result=fact(5);
System.out.println(“Factorial of 5=”+result);
}
}
2) Program នៃសេរី fibonacci series.
class Fabnoci{
public static void main(String[] args)
{
int n=10,i,f0=1,f1=1,f2=0;
for(i=1;i<=n;i++)
{
f2=f0+f1;
f0=f1;
f1=f2;
f2=f0;
System.out.println(f2);
}
}
}
3) Program នៃចំនួន armstrong number។
class ArmStrong{
public static void main(String…args)
{
int n=153,c=0,a,d;
d=n;
while(n>0)
{
a=n%10;
n=n/10;
c=c+(a*a*a);
}
if(d==c)
System.out.println(“armstrong number”);
1. else
2. System.out.println(“it is not an armstrong number”);
3.
4. }
5. }
4) Program ឆែកនៃចំនួន palindrome number។
class Palindrome
{
public static void main( String…args)
{
int a=242;
int n=a,b=a,rev=0;
while(n>0)
{
a=n%10;
rev=rev*10+a;
n=n/10;
}
if(rev==b)
System.out.println(“it is Palindrome”);
else
System.out.println(“it is not palinedrome”);
}
}
5) Program of swapping two numbers without using third variable.
class SwapTwoNumbers{
public static void main(String args[]){
int a=40,b=5;
a=a*b;
b=a/b;
a=a/b;
System.out.println(“a= “+a);
System.out.println(“b= “+b);
}
}
6) Program of factorial number by recursion
class FactRecursion{
static int fact(int n){
if(n==1)
return 1;
return n*=fact(n-1);
}
public static void main(String args[]){
int f=fact(5);
System.out.println(f);
}
}
ប្រមាណវិធី
|
អាទិភាព
|
postfix | expr++ expr– |
unary | ++expr –expr +expr -expr ~ ! |
multiplicative | * / % |
additive | + - |
shift | << >> >>> |
relational | < > <= >= instanceof |
equality | == != |
bitwise AND | & |
bitwise exclusive OR | ^ |
bitwise inclusive OR | | |
logical AND | && |
logical OR | || |
ternary | ? : |
assignment | = += -= *= /= %= &= ^= |= <<= >>= >>>= |
ដូចជាចំនួន ហ្វាក់តូរីយ៉ែល factorial number, prime number, សេរី fibonacci series ។ល។
1) Program នៃចំនួន factorial number
class Operation{
static int fact(int number){
int f=1;
for(int i=1;i<=number;i++){
f=f*i;
}
return f;
}
public static void main(String args[]){
int result=fact(5);
System.out.println(“Factorial of 5=”+result);
}
}
2) Program នៃសេរី fibonacci series.
class Fabnoci{
public static void main(String[] args)
{
int n=10,i,f0=1,f1=1,f2=0;
for(i=1;i<=n;i++)
{
f2=f0+f1;
f0=f1;
f1=f2;
f2=f0;
System.out.println(f2);
}
}
}
3) Program នៃចំនួន armstrong number។
class ArmStrong{
public static void main(String…args)
{
int n=153,c=0,a,d;
d=n;
while(n>0)
{
a=n%10;
n=n/10;
c=c+(a*a*a);
}
if(d==c)
System.out.println(“armstrong number”);
1. else
2. System.out.println(“it is not an armstrong number”);
3.
4. }
5. }
4) Program ឆែកនៃចំនួន palindrome number។
class Palindrome
{
public static void main( String…args)
{
int a=242;
int n=a,b=a,rev=0;
while(n>0)
{
a=n%10;
rev=rev*10+a;
n=n/10;
}
if(rev==b)
System.out.println(“it is Palindrome”);
else
System.out.println(“it is not palinedrome”);
}
}
5) Program of swapping two numbers without using third variable.
class SwapTwoNumbers{
public static void main(String args[]){
int a=40,b=5;
a=a*b;
b=a/b;
a=a/b;
System.out.println(“a= “+a);
System.out.println(“b= “+b);
}
}
6) Program of factorial number by recursion
class FactRecursion{
static int fact(int n){
if(n==1)
return 1;
return n*=fact(n-1);
}
public static void main(String args[]){
int f=fact(5);
System.out.println(f);
}
}
Post a Comment