32 OPERATORS, OPERANDS AND EXPRESSIONS

  

//OPERATORS
int myVar = 15 +2;
    +--->operator
            15 & 12 are operands
 
//EXPRESSION
15+12 is the expression which returns 27

package com.cnc;
public class Main {
    public static void main(String[] args) {
        int result = 1 + 2; // 1 + 2 = 3
        System.out.println("1 + 2 = "+result);
        int previousResult = result;
        System.out.println("previousRESULT = "+previousResult);

        result = result -1; // 3 - 1 = 2
        System.out.println("3 -1 = "+result);
        System.out.println("previousRESULT = "+previousResult);

        result = result*10; // 2 * 10 = 20
        System.out.println("2 * 10 = "+result);

        result = result/5; // 20 / 5 = 4
        System.out.println("20 / 5 = "+result );

        result = result % 3; // remainder of (4 % 3) = 1
        System.out.println("4 % 3 = "+result);

        //ABBREVIATING OPERATORS
                 //result = result + 1
             result++; // 1+1=2
             System.out.println("1 + 1 = "+result);

             result--;// 2-1 = 1
             System.out.println("2 - 1 = "+result);

                 //result = result +2
             result +=2; // 1 + 2 = 3
             System.out.println("1 + 2 = "+result);

                //result = result * 10
             result *= 10; // 3 * 10 = 30
             System.out.println("3 * 10 ="+result);

                //result = result/3
            result /= 3;
            System.out.println("result / 3 = "+result);

                //result = result - 2
            result -=2; // 10 - 2 = 8
            System.out.println(result);
    }
}

OUTCOME
1 + 2 = 3
previousRESULT = 3
3 -1 = 2
previousRESULT = 3
2 * 10 = 20
20 / 5 = 4
4 % 3 = 1
1 + 1 = 2
2 - 1 = 1
1 + 2 = 3
3 * 10 =30
result / 3 = 10
8

Popular posts from this blog

NUMBER PALINDROME CHALLENGE

  package com.cnc ; public class Main { public static void main ( String [] args) { System . out .println( isPalindrome ( 101 )); } public static boolean isPalindrome ( int number) { int reverse = 0 ; int temporaryNumber =number; while (number!= 0 ){ reverse = reverse* 10 + number% 10 ; number = number/ 10 ; } if (reverse== temporaryNumber ) return true ; else return false ; } }
Read more

ENCAPSULATION CHALLENGE

package com.cnc ; public class Main { public static void main ( String [] args) { Printer printer = new Printer( 50 , true ); System . out .println( "Initial Page count is " + printer .getNumberOfPages()); int pagesPrinted = printer .getNumberOfPages( 4 ); } } package com.cnc ; public class Printer { private int tonerLevel = 100 ; private int numberOfPages ; private boolean isDuplex ; public Printer ( int tonerLevel, boolean isDuplex) { if (tonerLevel>=- 1 && tonerLevel<= 100 ) { this . tonerLevel = tonerLevel; } else { this . tonerLevel =- 1 ; } this . isDuplex = isDuplex; this . numberOfPages = 0 ; } public int addToner ( int tonerAmount){ if (tonerAmount> 0 && tonerAmount<= 100 ){ if ( this . tonerLevel +tonerAmount > 100 ){ return - 1 ; } this . tonerLevel += tonerAmount
Read more

LARGEST PRIME FACTOR OF A NUMBER

package com.cnc ; public class Main { public static void main ( String [] args) { System . out .println( getLargestPrime ( 20 )); System . out .println( getLargestPrime ( 7 )); } public static int getLargestPrime ( int number){ int i,stored=number; if (number<= 0 ) return - 1 ; else if ( isPrime (number)){ number=stored; } else { for ( i = 2 ; i < number; i++){ if (number%i== 0 ){ stored=i; } } } return stored; } public static boolean isPrime ( int n){ for ( int j = 2 ; j <n; j ++){ if (n% j == 0 ) return false ; else return true ; } return false ; } } ☑ Here i created a new method isTrue. if the number is prime then the number will return the same as output. but if it is not a prime then it will return the largest number excluding itself.
Read more