Java Operators - The Coding Shala

Home >> Learn Java >> Java Operators

Java Operators

In Java, operators are used for the evaluation of expressions. There are many types of operators available in Java-like arithmetic, bitwise, relational, logical, assignment operators, etc.

Arithmetic Operators

To calculate mathematical expression we use arithmetic operators. The following image shows the Java arithmetic operators: 
Java Arithmetic Operators - The Coding Shala

These operators are used on numeric operands and char types in Java. We cannot use them on boolean.



The modulus operator, % returns the remainder of a division operation. In Java, Increment (++) and Decrement (--) operators can be used as prefix and postfix. In the Prefix form, the operand is incremented or decremented before the value is obtained for the use in the expression. In the postfix form, the previous value is used in the expression, and then the operand is modified. For example: 

a = 11;
b = ++a;

//is similar to 
a = a+1;
b = a;

//and
a = 11;
b=a++;

//that means
b=a;
a=a+1;

The following Java Program explains the Arithmetic Operators: 


class ArithmeticOp{
    public static void main(String[] args){
        int a = 10;
        int b = 20;
        double aa = 12.04;
        double bb = 23.97;
        
        int c = a + b;
        int d = a-b;
        System.out.println("Addition of "+a+" and "+b+" is: "+c);
        System.out.println("Substraction of "+a+" and "+b+" is: "+ d);
        System.out.println("Multiplication of "+a+" and "+b+" is: "+a*b);
        System.out.println("Divison of "+b+" and "+a+" is: "+b/a);
        
        System.out.println("Modulus of "+a+" and "+b+" is: "+a%b);
        System.out.println("Modulus of "+aa+" and "+a+" is: "+aa%a);

       a = a + 1;
       System.out.println("Value of a is "+ a);
       a += 2;
       System.out.println("Value of a is "+ a);
       
       b = ++a;
       System.out.println("Value of a and b is "+ a+ " " + b);
       b = a++;
       System.out.println("Value of a and b is "+ a+ " " + b);
        
    }
}



<<<<<The Output of this Program is >>>>>>>>>

Addition of 10 and 20 is: 30
Substraction of 10 and 20 is: -10
Multiplication of 10 and 20 is: 200
Divison of 20 and 10 is: 2
Modulus of 10 and 20 is: 10
Modulus of 12.04 and 10 is: 2.039999999999999
Value of a is 11
Value of a is 13
Value of a and b is 14 14
Value of a and b is 15 14

Note: Here, '=' is an assignment operator.

Java Bitwise Operators

These bitwise operators work on the individual bits of their operands and can be applied to the integer types, int, long, short, byte, and char. The Java bitwise operators are shown below: 
Java Bitwise Operators - The Coding Shala
Note: All these operators can be used with assignment operators.

The following image shows the outcome of these bitwise logical operators: 
Java Bitwise Logical Operators - The Coding Shala
The left shift operator(<<) shifts all of the bits of the value to the left by a specified number of times. Every time we shift to left, the high order bit(left bit) is shifted out(lost) and a zero(0) is added to the right. 

The Right shift(>>), shifts all of the bits of the value to the right by a specified number of times. for every time we shift a bit to right, the top bit(leftmost) is filled in with the previous contents of the top bit. This is called sign extension and the rightmost bit is lost.

Note: The unsigned shift right operator (>>>) always shifts zeros into the high-order bit.

Java Relational Operators

 The relational operators are used to determine the relationship between the operands. The relational operators are shown below: 
Java Relational Operators - The Coding Shala
The outcome of these operations is a boolean value. These operators are often used with if and loop statements.

Java Boolean Logical Operators

These boolean logical operators are used with only boolean operands. The boolean logical operators are shown below: 
Java Boolean Logical Operators - The Coding Shala
These operators work on boolean values in the same way that they work on the bits of an integer.

Other Posts You May Like
Please leave a comment below if you like this post or found some error, it will help me to improve my content.
By

Comments

Post a Comment

Popular Posts from this Blog

Java Program to Convert Binary to Decimal - The Coding Shala

Home >> Java Programs >> Convert Binary to Decimal  Hey there, welcome back to another post. In this post, we will learn how to convert Binary to Decimal in Java. Java Program to Convert Binary to Decimal You have given a binary number, convert it to a decimal number. Example:  Input: 101 Output: 5 Input: 111 Output: 7 Binary to Decimal Conversion in Java Approach We will the below formula to convert binary to decimal: decimal number = (2^0) * (rightmost digit) + (2^1) * (second rightmost digit) + ...  for example:  binary number = 110 decimal number = 2^0 * 0 + 2^1 * 1 + 2^2 * 1 = 1 * 0 + 2 * 1 + 4 * 1 = 0 + 2 + 4 = 6 Java Program:  import java.util.Scanner; /** * https://www.thecodingshala.com/ */ public class Main { public static void printDecimal( int num) { int decimal = 0; int twos = 1; // 2^0 = 1 initial value while (num > 0) { ...
Read more

Shell Script to Create a Simple Calculator - The Coding Shala

Home >> Scripting >> simple calculator Shell Script to Create a Simple Calculator Write a shell script to create a simple calculator using a switch-case statement? Code:  #! / bin / bash echo "simple calculator" sum = 0 i = "y" echo "enter first number" read n1 echo "enter second number" read n2 while [ $ i = "y" ] do echo "1.Addition" echo "2.Subtraction" echo "3.Multiplication" echo "4.Division" echo "Enter choice" read ch case $ch in 1 ) sum =$(echo " $n1 + $n2" | bc - l) echo "Addition is =" $ sum ;; 2 ) sum =$(echo "$n1 - $n2" | bc - l) echo "Sub is =" $ sum ;; 3 ) sum =$(echo "$n1 * $n2" | bc - l) echo "Mul is =" $ sum ;; 4 ) sum =$(echo "$n1 / $n2" | bc - l) echo "div is =" $ sum ;; * )echo "invalid choice" esac echo "Do y...
Read more

N-th Tribonacci Number Solution - The Coding Shala

Home >> Programming >> N-th Tribonacci Number  Hey there, welcome back to another post. In this post, we will learn how to solve the N-th Tribonacci Number problem and will implement its solution in Java. N-th Tribonacci Number Problem Statement The Tribonacci sequence Tn is defined as follows: T0 = 0, T1 = 1, T2 = 1, and Tn+3 = Tn + Tn+1 + Tn+2 for n >= 0. Given n, return the value of Tn.  Example 1:  Input: n = 4 Output: 4 Explanation: T_3 = 0 + 1 + 1 = 2 T_4 = 1 + 1 + 2 = 4 N-th Tribonacci Number Java Solution using Bottom-Up DP This problem is similar to the Fibonacci series. We can solve it using the Bottom-Up approach of dynamic programming. Time Complexity: O(n) Space Complexity: O(n) The space complexity can be reduced to O(1) by using variables to store the previous three values instead of using an array. Java Program:  class Solution { public int tribonacci( int n) { if (n == 0) return 0; ...
Read more

LeetCode - Shuffle the Array Solution - The Coding Shala

Home >> LeetCode >> Shuffle the Array  In this post, we will learn how to solve LeetCode's Shuffle the Array problem and will implement its solution in Java. Shuffle the Array Given the array nums consisting of 2n elements in the form [x1,x2,...,xn,y1,y2,...,yn]. Return the array in the form [x1,y1,x2,y2,...,xn,yn]. Example 1: Input: nums = [2,5,1,3,4,7], n = 3 Output: [2,3,5,4,1,7]  Explanation: Since x1=2, x2=5, x3=1, y1=3, y2=4, y3=7 then the answer is [2,3,5,4,1,7]. Example 2: Input: nums = [1,2,3,4,4,3,2,1], n = 4 Output: [1,4,2,3,3,2,4,1] Practice this problem on LeetCode: Click Here. Shuffle the Array Java Solution Approach 1: Using a new Array. Space complexity: O(n). Java Program:  class Solution { public int [] shuffle ( int [] nums , int n ) { int [] ans = new int [ 2 * n ]; int j = 0 ; for ( int i = 0 ; i < 2 * n ; i = i + 2 ){ ans [ i ] = nums [ j ]; ans...
Read more

Java Program to Find GCD or HCF of Two Numbers - The Coding Shala

Home >> Java Programs >> Find GCD of Two Numbers  Hey there, welcome back to another post. In this post, we will learn how to find GCD or HCF of Two Numbers in Java. Java Program to Find GCD or HCF of Two Numbers The GCD (Greatest Common Divisor) or HCF (Highest Common Factor) of two numbers is the largest number that divides both of them. For example:  Number1: 6 (2 * 3) Number2: 9 (3 * 3) GCD or HCF of 6 and 9 is: 3 Find GCD of Two Numbers in Java using for Loop As we already know, GCD is the largest number that divides both numbers. We can start a for loop from 1 (because 1 divides all the numbers) to both numbers and if it divides both numbers then update GCD. Java Program:  import java.util.Scanner; /** * https://www.thecodingshala.com/ */ public class Main { public static void findGCD( int num1, int num2) { int gcd = 1; if (num1 == 0) { gcd = num2; } if (num2 == 0) { ...
Read more