-->

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 Display First 100 Prime Numbers

 

















Java Program to Display First 100 Prime Numbers 

In this Java Program, first 100 prime numbers 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 

Step 2 : Initialize variables n, status and num

Step 3 : Print "First 100 prime numbers are:" using System.out.println method 

Step 4 : Apply for loop in which i is equal to 2 and i should be greater and equal to 100

Step 5 : Apply nested for loop in which j is equal to 2 and j is less than equal to Math.sqrt(num)                          and increment j by 1.

Step 6 : Apply if statement inside nested for loop in which num mod of j should be equal to zero

Step 7 : Store zero in the status variable and break the if statement and close the nested for loop.

Step 8 : Apply if statement in which status is not equal to zero

Step 9 : Print the num and increment the i by 1

Step 10: Store 1 in the status variable and increment num by 1

Program :

public class PrimeNumberDemo2 {

    public static void main (String[] args)
    {
        int n;
        int status = 1;
        int num = 3;
        System.out.println("First 100 prime numbers are:");
        System.out.println(2);
        for(int i = 2; i <= 100;)
        {
            for(int j = 2; j <= Math.sqrt(num);j++)
             {
               if(num%j == 0)
                 {
                status = 0;
                break;
                 }
               
             }
            if(status !=0)
            {
                System.out.println(num);
                i++;
            }
            status = 1;
            num++;
        }
    }
}

Output :

First 100 prime numbers 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
151
157
163
167
173
179
181
191
193
197
199
211
223
227
229
233
239
241
251
257
263
269
271
277
281
283
293
307
311
313
317
331
337
347
349
353
359
367
373
379
383
389
397
401
409
419
421
431
433
439
443
449
457
461
463
467
479
487
491
499
503
509
521
523
541

For execution of the same do visit my You Tube Channel :

https://youtu.be/seUJ8P4dNqM






Java Program to Display First n Prime Numbers using Scanner

















Java Program to Display First n Prime Numbers using Scanner

In this Java Program, first n prime numbers are displayed using scanner.

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 : Import Scanner class

Step 2 : Create main method 

Step 3 : Initialize variables n, status and num for capturing the value of n

Step 4 : Create object of Scanner

Step 5 : Ask the user to enter the value of n

Step 6 : Store the enter value in the variable n

Step 7 : Apply if statement

Step 8 : Apply for loop of i & j

Step 9 : Print the Results

Program :

import java.util.Scanner;

public class PrimeNumberDemo {
    public static void main(String args[])
    {
        int n;
        int status = 1;
        int num = 3;
        //for capturing the value of n
        Scanner sc = new Scanner(System.in);
        System.out.println("Enter the value of n:");
        //The entered value is stored in the var n
        n = sc.nextInt();
        if( n >= 1)
        {
            System.out.println("First "+n+" prime numbers are:");
            // 2 is prime number
            System.out.println(2);
            
        }
        for (int i = 2; i <= n;)
        {
            for (int j = 2; j <= Math.sqrt(num); j++)
            {
                if (num % j == 0)
                {
                    status = 0;
                    break;
                }
            }
            if( status != 0)
            {
                System.out.println(num);
                i++;
                
            }
            status = 1;
            num++;
        }
           
       
    }
    
}

Output :

Enter the value of n:

15

First 15 prime numbers are:

2
3
5
7
11
13
17
19
23
29
31
37
41
43
47

For execution of the same do visit my You Tube Channel :







Java Program To Find The Factorial Of A Number Using Recursion

  

Java Program To Find The Factorial Of A Number Using Recursion

In this Java Program, we calculate the factorial of the number using recursion.

Factorial of n is the product of all the positive descending integers. It is denoted by n!

For example : 4! = 4 * 3 * 2 * 1 = 24

Logic : fact = fact * i;

Step 1 : Create main method

Step 2  : Create variable factorial and store factorial of 4 in it.

Step 3  : Print the number

Step 4 : Create a static function which returns 1

Step 5 : Create recursion function which calls itself

Program :

public class FactorialDemo2 {

    public static void main(String[] args){

        int factorial = fact(4);

        System.out.println("Factorial of 4 is:"+factorial);

    }

    static int fact(int n)

    {

    int output;

    if(n==1){

        return 1;

    }

    //Recursion : Function calling itself

    output = fact(n-1)*n;

    return output;

    }

}

Output :

Factorial of 4 is : 24

For execution of the same do visit my YouTube Channel :

https://youtu.be/xGJ2VBxZuRc


ITEngineer8995
India

SEND ME A MESSAGE

Search This Blog
Powered by Blogger.

Pages