-->

Hello,This is me!

ITEngineer8995

Professional Coder Coding is my passion

About me

Hello

I'mITEngineer8995

Spatial Data Specialist

Do you want all of your codes in one place?? Then you are landed on the right blog... Here you will find varieties of codes of various languages starting from noob to advance with their samples. Do learn, execute and share your knowledge with others. Do visit my YouTube Channel for execution of these codes .

YouTube Channel

Experience

Video Clone Detector using Hadoop

2017-2018

A detector which differentiates copied videos from the original ones using Hadoop.

Portfolio

Java Program To Check Prime Number using While Loop

  

Java Program To Check Prime Number using While Loop

In this java program, we check whether the user input number is prime or not.

A prime number is a natural number greater than 1 that is not a product of two small natural numbers.

E.g. 2, 3, 5 etc are prime numbers.

Steps :

Step 1 : Import Scanner class

Step 2 : Create class PrimeChec

Step 3 : Create main method

Step 4 : Create variable temp

Step 5 : Create object of Scanner 

Step 6 : Ask the user to enter any number by using System.out.print method

Step 7 : Create variable num and store the user entered number in it.

Step 8 : Close the Scanner class

Step 9 : Initialize int i equals to 2

Step 10 : Apply while loop where i is smaller than equal to num divide by 2

Step 11 : Apply if where num mod i is equals equals to zero

Step 12 : Initialize isPrime to False

Step 13 : If isPrime is true then the number is prime else not

Step 14 : Print the number

Program :

import java.util.Scanner;

public class PrimeChecWhile 

    {

        public static void main(String[] args)

        {

            int temp;

            boolean isPrime = true;

            Scanner sc = new Scanner(System.in);

            System.out.println("Enter any number:");

            //capture the input in an integer

            int num = sc.nextInt();

            sc.close();

            int i = 2;

            while(i<=num/2)

            {

                if(num%i==0)

                {

                    isPrime = false;

                    break;

                }

                i++;

            }

            //If isPrime is true then the number is prime else not

        if(isPrime)

        System.out.println(num+"is a Prime Number");

        else

        System.out.println(num+"is not a Prime Number");

        }

        }

Output :

Enter any number:
19
19is a Prime Number

For execution of the same do visit my YouTube Channel :

https://youtu.be/jYxikmPpNb4

Java Program To Check Prime Number

 

Java Program To Check Prime Number

In this java program, we check whether the user input number is prime or not.

A prime number is a natural number greater than 1 that is not a product of two small natural numbers.

E.g. 2, 3, 5 etc are prime numbers.

Steps :

Step 1 : Import Scanner class

Step 2 : Create class PrimeChec

Step 3 : Create main method

Step 4 : Create variable temp

Step 5 : Create object of Scanner 

Step 6 : Ask the user to enter any number by using System.out.print method

Step 7 : Create variable num and store the user entered number in it.

Step 8 : Close the Scanner class

Step 9 : Apply for loop where i is equal to 2, i is greater than equal to num divide by 2 and increment i by 1
Step 10 : Store num % i in the variable temp

Step 11 : Apply if where temp is equal to zero

Step 12 : Initialize isPrime to False

Step 13 : If isPrime is true then the number is prime else not

Step 14 : Print the number

Program :

import java.util.Scanner;

public class PrimeChec 

    {

        public static void main(String[]args)

        {

            int temp;

            boolean isPrime = true;

            Scanner sc = new Scanner(System.in);

            System.out.println("Enter any number:");

            //capture the input in an integer

            int num = sc.nextInt();

            sc.close();

            for(int i=2; i<=num/2; i++)

            {

                temp = num%i;

                if(temp==0)

                {

                    isPrime=false;

                    break;

                }

            }

            //If isPrime is true then the number is prime else not

            if(isPrime)

                System.out.println(num + "is a Prime Number");

            else

                System.out.println(num + "is not a Prime Number");  

        }

}

Output :

Enter any number:
6
6is not a Prime Number

For execution of the same do visit my YouTube Channel :

Java Program To Break Integer into Digits

 

Java Program To Break Integer into Digits

In this Java Program, we break Integers into Digits

Here we use Scanner class to get input from the user. First While loop is use to count the digits in the input number and second while loop is use to extract the digits from the input number using modulus operator.

Step 1 : Import Scanner Class

Step 2 : Create a Class IntegerToDigit

Step 3 : Create main method

Step 4 : Initialize num, temp, digit and count and store 0 in count

Step 5 : Ask the user to enter any number

Step 6 : Store the user entered number into num variable

Step 7 : Close the Scanner class to avoid memory leaks

Step 8 : Create a copy of input number

Step 9 : Store the num into temp

Step 10 : Count the digits into the input number

Step 11 : Apply While loop where num is greater than zero

Step 12 : Divide num by 10 and store the result into num variable

Step 13 : Increment count by one.

Step 14 : Apply another while loop where temp is greater than zero and store the result of temp % 0 into digit.

Step 15 : Print the Digit

Step 16 : Divide temp by 10 and store the result into temp variable

Step 17 : Decrement count by one.

Program :

import java.util.Scanner;

public class IntegerToDigit {

    public static void main(String[]args)

    {

        int num, temp, digit, count = 0;

        //getting the number from user

        Scanner sc = new Scanner(System.in);

        System.out.print("Enter any number:");

        num = sc.nextInt();

        sc.close();

        //creating a copy of the input number

        temp = num;

        //counting digits int the input number

        while(num > 0)

        {

            num = num / 10;

            count++;

        }

        while(temp > 0)

        {

            digit = temp % 10;

            System.out.println("Digit at place "+count+" is:"+digit);

            temp = temp / 10;

            count --;      

        }

    }    

}

Output :

Enter any number:7891

Digit at place 4 is:1

Digit at place 3 is:9

Digit at place 2 is:8

Digit at place 1 is:7

For execution of the same do visit my YouTube Channel :

https://youtu.be/yYfE4xFPj4s

Java Program to Display Prime Numbers from 1 to n

 

















Java Program to Display Prime Numbers from 1 to n

In this Java Program, prime numbers from 1 to n are displayed to the user.

A prime number is a natural number greater than 1 that is not a product of two small natural numbers.

E.g. 2, 3, 5 etc are prime numbers.

Step 1 : Create main method and create the object of  Scanner.

Step 2 : Initialize i to zero and num to zero.

Step 3 : Create an empty String named primeNumbers

Step 4 : Ask the user to enter the value of n using System.out.print method

Step 5 : Store the object of Scanner class in  variable n

Step 6 : Close the Scanner 

Step 7 : Apply For loop where i is equal to 1,  i is less than equal to n and increment i by 1

Step 8 : Initialize counter to 0

Step 9 : Apply another for loop where num is equal to i, num is greater than equal to 1 and decrement num by 1 

Step 10 : Apply if statement where i % num == 0

Step 11 : Increment counter by 1 and store it in variable counter

Step 12 : Close both the for loops

Step 13 : Apply if statement where counter == 2

Step 14 : Append the Prime number to the String

Step 15 : Print the output

Program :

import java.util.Scanner;
public class PrimeNumbersTwo 
    {
        public static void main(String[]args)
        {
            Scanner sc = new Scanner(System.in);
            int i = 0;
            int num = 0;
            //Empty String
            String primeNumbers = "";
            System.out.println("Enter the value of n:");
            int n = sc.nextInt();
            sc.close();
        for(i = 1; i <= n; i++)
        {
            int counter = 0;
            for(num = i; num>=1; num--)
            {
                if(i%num == 0)
                {
                    counter = counter + 1;
                   
                }
            }
            if (counter == 2)
                
            {
                //Appended the Prime number to the String
                primeNumbers = primeNumbers + i + " ";
            }
        }
            System.out.println("Prime numbers from 1 to n are:");
            System.out.println(primeNumbers);
    
}
}

Output:

Enter the value of n:
150
Prime numbers from 1 to n are:
2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 

For execution of the same do visit my YouTube Channel :


Java Program to Display Prime Numbers from 1 to 100

  

















Java Program to Display Prime Numbers from 1 to 100

In this Java Program, prime numbers from 1 to 100 are displayed to the user.

A prime number is a natural number greater than 1 that is not a product of two small natural numbers.

E.g. 2, 3, 5 etc are prime numbers.

Step 1 : Initialize i to zero

Step 2 : Initialize num to zero

Step 3 : Create an empty string named as primeNnumbers

Step 4 : Apply for loop where num is equal to i, num is greater than equal to 1 and decrement num

Step 5 : Apply if statement inside for loop where i mod num is equal equal to zero

Step 6 : Increment counter by one and store it in counter variable

Step 7 : Close the for loop

Step 8 : Apply if statement where counter is equal equal to 2

Step 9 : Append the prime number to the string

Step 10 : Print the output by using System.out.println method

Program :

public class PrimeNumbers {
    
    public static void main (String[] args)
    {
        int i =0;
        int num =0;
        //Empty String
        String primeNumbers = "";
        
        for(i = 1; i<=100; i++)
        {
            int counter = 0;
            for(num = i; num>= 1; num--)
            {
                if(i%num==0)
                {
                    counter= counter + 1;
                }
            }
            if(counter == 2)
            {
                //Appended the Prime number to the String
                        primeNumbers = primeNumbers + i + "";
               
            }
        }
        System.out.println("Prime numbers from 1 to 100 are:");
        System.out.println(primeNumbers);
    }
    
}

Output:

Prime numbers from 1 to 100 are:
2357111317192329313741434753596167717379838997

For execution of the same do visit my YouTube Channel :





ITEngineer8995
India

SEND ME A MESSAGE

Search This Blog
Powered by Blogger.

Pages