Source Code Java Netbeans Menjumlahkan Dua Buah Bilangan

Source Code Java Netbeans Menjumlahkan Dua Buah Bilangan - Menjumlahkan Dua Buah Bilangan menggunakan kompiler Java Netbeans, berikut ini Source Code Program yang bisa langsung diterapkan ke dalam kompiler Java Netbeans.

import java.util.Scanner;
public class Prak_402 {

public static void main(String[] args) {
Scanner masukan = new Scanner(System.in);
int bil1, bil2, bil3;
System.out.println("Program menjumlahkan dua bilangan");
System.out.print("Masukan bilangan pertama :");
bil1 = masukan.nextInt();
System.out.print("Masukan bilangan kedua :");
bil2 = masukan.nextInt();
System.out.print("Masukan bilangan ketiga :");
bil3 = masukan.nextInt();
System.out.println();
System.out.println("Jumlah bil1+bil2 :" +(jumlah(bil1,bil2)));
System.out.println("Jumlah bil2+bil3 :" +(jumlah(bil2,bil3)));
System.out.println("Jumlah bil1+bil3 :" +(jumlah(bil1,bil3)));
}
private static int jumlah(int a, int b) {
int hasil = a + b;

return hasil;
    }
}

Berikut hasil output Program Menjumlahkan Dua Buah Bilangan yang dihasilkan.

Sekian program tentang tes, semoga bermanfaat.Sekian source program tentang Source Java Netbeans Menjumlahkan Dua Buah Bilangan semoga bermanfaat.

Source Code Java Netbeans Menghitung Luas Persegi Panjang dan Luas Lingkaran

Source Code Java Netbeans Menghitung Luas Persegi Panjang dan Luas Lingkaran - Menghitung Luas Persegi Panjang dan Luas Lingkaran menggunakan kompiler Java Netbeans, berikut ini Source Code Program yang bisa langsung diterapkan ke dalam kompiler Java Netbeans.

import java.util.Scanner;
public class Prak_401 {
public static void main(String[] args) {
Scanner masukan = new Scanner(System.in);
int pilihan=9;
do {
System.out.println("\nMenu\n");
System.out.println("1. Menghitung Luas Persegi Panjang");
System.out.println("2. Menghitung Luas Lingkaran");
System.out.println("0. Keluar");
System.out.print("Masukan Pilihan anda :");
pilihan = masukan.nextInt();
switch (pilihan){
case 1: luasPersegiPanjang();break;
case 2: luasLingkaran();break;
}

} while (pilihan != 0);
}
private static void luasPersegiPanjang() {
Scanner masukan = new Scanner(System.in);
float luas;
System.out.print("Masukan nilai panjang :");
float panjang = masukan.nextFloat();
System.out.print("Masukan nilai lebar :");
float lebar = masukan.nextFloat();
luas = panjang * lebar;
System.out.println("Luas Persegi Panjang :" + luas);
}
private static void luasLingkaran() {
Scanner masukan = new Scanner(System.in);
float jari2, luas;
System.out.print("Masukan nilai jari2 :");
jari2 = masukan.nextFloat();
luas = 3.14f * jari2 * jari2;

System.out.println("Luas Lingkarang :" + luas);
    }
}

Berikut hasil output Program Menghitung Luas Persegi Panjang dan Luas Lingkaran yang dihasilkan.

Sekian program tentang Source Code Java Netbeans Menghitung Luas Persegi Panjang dan Luas Lingkaran, semoga bermanfaat.

Program Always On Top Java Netbeans

Program Always On Top Java Netbeans - Berikut cara menjadikan menu Always On Top di Java Netbeans yang artinya selalu di atas bila kita membuka menu lainnya.

Berikut tampilan programnya:

Sebenarnya sourcenya sangat sederhana cuma hanya menambahkan code di bawah ini pada buttonnya:

Always On Top

this.setAlwaysOnTop(true);

Normal Windows

this.setAlwaysOnTop(false);

Sekian artikel tentang Program Always On Top Java Netbeans semoga bermanfaat.

Program Sequential Search Java Netbeans

Program Sequential Search Java Netbeans - Berikut program yang membahas tentang pencarian dengan menggunakan Metode Sequential Search.

Sebelumnya udah di bahas tentang program yang menggunakan Binary Search yang pasti hasilnya akan berbeda karena menggunakan metode yang berbeda.

Berikut source programnya, saya menggunakan kompiler Java Netbeans:

import java.util.Arrays;
import java.util.Scanner;
import static java.lang.Math.*;
public class Sequential_Search
{
public static void main(String... args)
{
Scanner sc = new Scanner(System.in);
int j, k, number, size;
boolean found = false;
System.out.print("Masukan Ukuran Array = ");
size = sc.nextInt();
int[] intArray = new int[size];
for (j=0; j<size; j++)
intArray[j] = (int) (random()*10);
System.out.println("Element bertipe data integer dengan Array of Random di antara kumpulan data 0 - " + size);
System.out.print("Masukan nomor yang di cari = ");
number = sc.nextInt();
k=0;
while (!found && k<size)
if (intArray[k]==number)
found=true;
else
k +=1;
System.out.println();
if (found)
System.out.println("Posisi Data Ditemukan = " + k);
else
System.out.println("Nomor yang dicari tidak ditemukan");
System.out.println("\nDeret Array of Ramdom\n");
System.out.println(Arrays.toString(intArray));
    }
} 

Source code di atas menggunakan Array of Random artinya kumpulan array dengan nilai angka secara acak dengan "10" angka, bisa di ubah sourcenya sesuai keinginan.

Berikut output yang dihasilkan dengan menggunakan 9 Array of Random:

Sekian source program Java Netbeans tentang Program Sequential Search Java Netbeans semoga bermanfaat.

Program Sederhana MVC Java Netbeans

Program Sederhana MVC Java Netbeans - MVC merupakan Model View dan Controller

Disini saya gak akan ngebahas lebih jauh tentang MVC hanya sekedar share contoh source sederhana netbean yang menggunakan metode MVC.

Program Tampil Nama Menggunakan Metode MVC

Struktur File MVC

Download:
Program Sederhana MVC

Sekian artikel tentang Program Sederhana MVC Java Netbeans, semoga bermanfaat.

Program Sederhana Menghitung Bunga Java Netbeans

Program Sederhana Menghitung Bunga Java Netbeans - Program berikut untuk menghitung bunga dari nilai pinjaman yang diinputkan, berikut source codenya.

Berikut source programnya, ane menggunakan kompiler Java Netbeans:

import java.util.Scanner;

/**
 *
 * @author Tian
 */
public class Bunga {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        Scanner masukan = new Scanner(System.in);
        // TODO code application logic here
        float bunga;
        float pinjam;
        float hasil;
        System.out.print("Masukan Bunga (Persen %) : ");
        bunga = masukan.nextFloat();
        System.out.print("Masukan Pinjam (Rp.) : ");
        pinjam = masukan.nextFloat();
        hasil = (bunga/100)*pinjam;
        System.out.println("Total : "+ hasil);
        
    }
}

Sekian artikel tentang Program Sederhana Menghitung Bunga Java Netbeans, semoga bermanfaat.

Program Insertion Sorting Java Netbeans

Program Insertion Sorting Java Netbeans - Program pengurutan (Sorting) menggunakan metode Insertion.

Berikut source code programnya, ane menggunakan kompiler Java Netbeans:

public class Insertion_Sorting_TianChan {

    public static void main(String[] args) {
    int i;
    int[] tian = {899,235,359,871,682,239,694,492,783,257,779,526,332,687,723,545,858,119,909,894,182,502,837,826,937,556,146,52,893,496,135,952,947,100,39,348,25,429,729,670,328,409,243,160,508,340,403,761,949,409,593,593,995,114,224,697,102,69,923,461,723,883,852,167,186,357,232,657,836,821,966,735,83,654,510,423,233,217,918,581,938,710,200,791,614,915,919,73,310,28,976,958,232,327,702,325,470,450,525,68,136,708,288,339,418,204,742,767,120,722,527,841,125,49,341,914,755,509,326,630,805,486,725,611,225,969,352,460,121,248,956,342,616,885,844,950,257,648,537,116,707,666,515,273,738,198,446,681,7,899,160,908,7,304,822,639,1,453,38,665,616,473,784,293,768,957,814,868,966,309,274,179,952,966,134,536,596,801,870,237,309,818,634,975,351,853,967,30,628,574,422,648,407,867,380,348,229,968,56,408,483,927,852,168,331,946,123,644,128,494,424,660,41,574,335,890,291,233,965,108,222,505,113,485,233,81,462,56,530,506,553,504,54,394,989,326,862,745,590,23,858,377,826,817,823,466,315,427,685,232,658,135,284,330,533,36,228,415,545,492,179,542,315,654,792,218,968,809,455,96,116,919,990,719,559,289,868,795,764,588,169,798,771,800,153,860,902,369,42,585,97,364,500,169,258,56,608,931,712,262,985,571,920,710,592,531,475,895,763,957,995,627,973,903,260,629,113,356,95,144,880,459,562,669,986,350,787,80,609,393,483,912,176,237,496,753,523,208,290,152,201,75,975,322,483,272,105,289,560,877,157,892,201,402,968,634,224,50,282,931,806,577,316,603,921,211,709,28,484,693,280,647,912,18,633,886,729,796,559,977,635,189,916,371,387,288,574,328,226,841,354,653,716,894,199,700,567,25,781,123,231,915,465,384,198,62,168,355,17,870,704,472,157,54,846,455,552,203,754,386,445,423,416,610,439,172,935,279,126,242,916,674,432,951,345,880,126,770,390,605,319,716,841,450,675,212,858,406,197,918,39,980,779,327,551,670,914,655,562,486,43,131,101,789,874,702,476,818,565,635,463,520,225,674,463,820,167,380,506,378,6,277,273,739,867,350,811,269,379,707,579,191,217,695,845,223,778,34,358,571,941,989,272,528,689,370,884,18,567,298,594,952,847,676,636,203,934,943,2,67,460,949,494,558,308,764,503,894,460,217,531,278,372,859,541,825,356,570,230,734,230,26,95,908,963,968,253,694,714,95,757,780,474,391,647,798,296,27,896,253,636,406,319,439,742,506,49,798,158,708,663,87,577,471,917,18,607,515,430,323,921,226,595,179,657,599,66,795,490,787,923,423,486,957,966,251,629,253,952,309,59,238,325,678,35,870,175,438,287,211,540,451,666,867,661,46,596,200,883,538,28,54,765,425,709,667,12,789,895,946,847,168,318,419,570,401,40,666,425,468,735,347,67,188,198,655,922,639,305,590,854,382,429,361,81,456,46,722,581,658,223,867,290,477,788,271,156,243,860,9,344,447,730,95,111,457,355,106,60,235,898,765,367,996,86,280,148,790,381,640,93,133,450,652,948,342,953,566,837,961,956,276,720,837,646,659,596,87,692,759,447,71,284,457,386,191,821,478,401,912,902,799,945,346,74,834,377,272,425,389,507,518,979,762,540,433,493,219,47,17,957,755,72,53,794,695,883,211,861,711,637,746,68,781,555,94,37,193,319,7,112,438,41,503,549,85,449,654,636,788,306,988,963,426,418,938,66,426,671,77,90,241,252,632,820,949,144,92,847,517,319,799,913,31,90,735,22,58,946,377,526,432,474,699,329,615,530,922,398,397,848,792,273,126,489,405,834,908,173,505,802,169,824,652,201,67,292,834,739,932,140,134,585,357,956,986,35,127,452,232,123,566,875,737,653,763,392,591,650,4,860,568,628,530,51,658,348,990,954,997,911,560,170,618,511,774,906,878,365,494,371,250,213,464,92,627,362,891,46,89,216,315,554,246,72,595,231,828,294,956,216,899,582,474,17,735,741,615,793,18,676,167,675,91,727,872,624,474,316,731,871,158,359,139,404,165,522,873,622,544,850,642,801,513,693,230,980,26,687,925,414,619,315,87,178,790,559,376,321,707,976,815,390,323,604,386,116,52,871,424,652,32,581,74,371,234,159,727,600,502,64,922,19,780,943,730,137,9,71,478,500,585,73,427,112,725,523,299,912,732,42,971,326,466,771,698,985,90,0,33,953,457,6,676,550,633,18,11,454,262};
    urutkan(tian, tian.length);
    System.out.println("SEPTIAN MAULANA");
    System.out.println("1141177004039");
    System.out.println("*** Tian Chan ***");
    System.out.println();
    System.out.println("Insertion Sorting");
    System.out.println();
    System.out.println("Sebelum Pengurutan Data = ");
    System.out.println("899,235,359,871,682,239,694,492,783,257,779,526,332,687,723,545,858,119,909,894,182,502,837,826,937,556,146,52,893,496,135,952,947,100,39,348,25,429,729,670,328,409,243,160,508,340,403,761,949,409,593,593,995,114,224,697,102,69,923,461,723,883,852,167,186,357,232,657,836,821,966,735,83,654,510,423,233,217,918,581,938,710,200,791,614,915,919,73,310,28,976,958,232,327,702,325,470,450,525,68,136,708,288,339,418,204,742,767,120,722,527,841,125,49,341,914,755,509,326,630,805,486,725,611,225,969,352,460,121,248,956,342,616,885,844,950,257,648,537,116,707,666,515,273,738,198,446,681,7,899,160,908,7,304,822,639,1,453,38,665,616,473,784,293,768,957,814,868,966,309,274,179,952,966,134,536,596,801,870,237,309,818,634,975,351,853,967,30,628,574,422,648,407,867,380,348,229,968,56,408,483,927,852,168,331,946,123,644,128,494,424,660,41,574,335,890,291,233,965,108,222,505,113,485,233,81,462,56,530,506,553,504,54,394,989,326,862,745,590,23,858,377,826,817,823,466,315,427,685,232,658,135,284,330,533,36,228,415,545,492,179,542,315,654,792,218,968,809,455,96,116,919,990,719,559,289,868,795,764,588,169,798,771,800,153,860,902,369,42,585,97,364,500,169,258,56,608,931,712,262,985,571,920,710,592,531,475,895,763,957,995,627,973,903,260,629,113,356,95,144,880,459,562,669,986,350,787,80,609,393,483,912,176,237,496,753,523,208,290,152,201,75,975,322,483,272,105,289,560,877,157,892,201,402,968,634,224,50,282,931,806,577,316,603,921,211,709,28,484,693,280,647,912,18,633,886,729,796,559,977,635,189,916,371,387,288,574,328,226,841,354,653,716,894,199,700,567,25,781,123,231,915,465,384,198,62,168,355,17,870,704,472,157,54,846,455,552,203,754,386,445,423,416,610,439,172,935,279,126,242,916,674,432,951,345,880,126,770,390,605,319,716,841,450,675,212,858,406,197,918,39,980,779,327,551,670,914,655,562,486,43,131,101,789,874,702,476,818,565,635,463,520,225,674,463,820,167,380,506,378,6,277,273,739,867,350,811,269,379,707,579,191,217,695,845,223,778,34,358,571,941,989,272,528,689,370,884,18,567,298,594,952,847,676,636,203,934,943,2,67,460,949,494,558,308,764,503,894,460,217,531,278,372,859,541,825,356,570,230,734,230,26,95,908,963,968,253,694,714,95,757,780,474,391,647,798,296,27,896,253,636,406,319,439,742,506,49,798,158,708,663,87,577,471,917,18,607,515,430,323,921,226,595,179,657,599,66,795,490,787,923,423,486,957,966,251,629,253,952,309,59,238,325,678,35,870,175,438,287,211,540,451,666,867,661,46,596,200,883,538,28,54,765,425,709,667,12,789,895,946,847,168,318,419,570,401,40,666,425,468,735,347,67,188,198,655,922,639,305,590,854,382,429,361,81,456,46,722,581,658,223,867,290,477,788,271,156,243,860,9,344,447,730,95,111,457,355,106,60,235,898,765,367,996,86,280,148,790,381,640,93,133,450,652,948,342,953,566,837,961,956,276,720,837,646,659,596,87,692,759,447,71,284,457,386,191,821,478,401,912,902,799,945,346,74,834,377,272,425,389,507,518,979,762,540,433,493,219,47,17,957,755,72,53,794,695,883,211,861,711,637,746,68,781,555,94,37,193,319,7,112,438,41,503,549,85,449,654,636,788,306,988,963,426,418,938,66,426,671,77,90,241,252,632,820,949,144,92,847,517,319,799,913,31,90,735,22,58,946,377,526,432,474,699,329,615,530,922,398,397,848,792,273,126,489,405,834,908,173,505,802,169,824,652,201,67,292,834,739,932,140,134,585,357,956,986,35,127,452,232,123,566,875,737,653,763,392,591,650,4,860,568,628,530,51,658,348,990,954,997,911,560,170,618,511,774,906,878,365,494,371,250,213,464,92,627,362,891,46,89,216,315,554,246,72,595,231,828,294,956,216,899,582,474,17,735,741,615,793,18,676,167,675,91,727,872,624,474,316,731,871,158,359,139,404,165,522,873,622,544,850,642,801,513,693,230,980,26,687,925,414,619,315,87,178,790,559,376,321,707,976,815,390,323,604,386,116,52,871,424,652,32,581,74,371,234,159,727,600,502,64,922,19,780,943,730,137,9,71,478,500,585,73,427,112,725,523,299,912,732,42,971,326,466,771,698,985,90,0,33,953,457,6,676,550,633,18,11,454,262");
    System.out.println();
    System.out.println("Hasil Pengurutan Data = ");
    tampilkan(tian, tian.length);
    }
    
    private static void tampilkan(int[] tian, int n) {
        for (int i=0; i<n; i++)
            System.out.print(tian[i]+" ");
            System.out.println();
    }
    
    private static void urutkan(int[] tian, int n) {
        int i, k;
        int x;
        boolean ketemu;
        for (k=1; k<n; k++){
            x = tian[k];
    //Sisipkan X Kedalam Data [0 ... K-1]
            i = k-1;
            ketemu = false;
            while ((i>=0)&&(!ketemu)){
                if (x<tian[i]){
                    tian[i+1]=tian[i];
                    i--;
                }
                else
                    ketemu=true;
                tian[i+1]=x;
                }
            }
        }
    }

Berikut hasil outputnya:

Sekian artikel tentang Program Insertion Sorting Java Netbeans, semoga bermanfaat.

Program Deret Bilangan Prima Java Netbeans

Program Deret Bilangan Prima Java Netbeans - Sebenarnya disini ada 2 program yang ane jadiin satu, pertama program menentukan bilangan prima yang kedua program membuat deret bilangan prima.

Masih inget kan bilangan prima itu seperti apa? iya ane juga lupa wkwk, intinya bilangan prima itu bilangan yang tidak bisa di bagi lagi, pokonya gitu deh.

Berikut source code programnya, ane menggunakan kompiler Java Netbeans:

import java.util.Scanner;

public class Deret_Bilangan_Prima {
  
public static void main(String[] args) {
System.out.println(" ****TIAN CHAN**** ");
System.out.println("**SEPTIAN MAULANA**");
System.out.println("========================================================");
System.out.println("Program Menentukan Bilangan Prima & Deret Bilangan Prima");
System.out.println("========================================================");

int angka;        

Scanner input = new Scanner (System.in);        
System.out.print("Angka = ");
angka = input.nextInt();        
boolean prima = true;        
for (int i=2;i < angka;i++){

if (angka%i==0){
prima=false;
System.out.println("Hasil = "+angka+" Merupakan Bukan Bilangan Prima");        
break;
    }
}        

if (prima && ! (angka==1) && ! (angka==0)){
System.out.println("Hasil = "+angka+" Merupakan Bilangan Prima");
}

int i, j, min, max;
boolean tian;
System.out.println("========================================================");
System.out.print("Masukkan Nilai Batas Awal = ");
min = input.nextInt();
System.out.print("Masukkan Nilai Batas Akhir = ");
max = input.nextInt();

while (min > max)
{
System.out.print("Batas akhir harus lebih besar dari batas awal.\nMasukkan nilai batas akhir lagi = ");
max = input.nextInt();
}
System.out.println();
System.out.println("Deret Bilangan Prima dari "+min+"-"+max+"");

for (i=min;i<=max;i++)
{
tian=false;
if (i==2)
tian=true;
else
{
for (j=2;j<i;j++)
    {
if (i%j==0)
        {
tian=false;
break;
        }
else
tian=true;
    }
}

if (tian)
{
System.out.printf(i+",");
}
        }
    }
}

Berikut hasil output program:

Sekian artikel tentang Program Deret Bilangan Prima Java Netbeans, semoga bermanfaat.

Program Deret Angka Java Netbeans

Program Deret Angka Java Netbeans - Untuk melakukan deret angka bisa menggunakan pengulangan kondisional for.

Berikut source code programnya, ane menggunakan kompiler Java Netbeans:

public class DeretAngka {
public static void main(String[] args) {
int x;
for (x=0;x<=100;x=x+1){
if (x==0)
continue;
System.out.print(x+",");
}
}
}

Nanti akan menghasilkan deret angka dari 1-100, seperti output berikut ini:

Sekian artikel tentang Program Deret Angka Java Netbeans, semoga bermanfaat.

Source Code Java Netbeans Menentukan Berat Badan Ideal

Source Code Java Netbeans Menentukan Berat Badan Ideal - Menentukan berat badan secara ideal dengan menggunakan Java Netbeans.

Sebenarnya source ini sudah pernah saya bagikan ke postingan Cara Menginputkan Format Desimal tapi gak masalah deh di share ulang.

Berikut source code programnya, ane menggunakan kompiler Java Netbeans:

import java.util.Scanner;

import java.text.DecimalFormat;

public class Berat_Badan_Ideal {

    public static void main(String[] args) {

        Scanner masukan = new Scanner(System.in);

        DecimalFormat koma = new DecimalFormat("#.##");

        float tinggi, berat, IMT, O;

        System.out.println("SEPTIAN MAULANA");

        System.out.println("1141177004039");

        System.out.print("Masukan Tinggi Badan Anda (M) = ");

        tinggi = masukan.nextFloat();

        String X = koma.format(tinggi).replace(',','.');

        float Z = Float.parseFloat(X);

        System.out.print("Masukan Berat Badan Anda (Kg) = ");

        berat = masukan.nextFloat();

        O = (float) (Z*Z);

        IMT = (float) (berat/O);

        System.out.println();

        System.out.println("Berat Badan Anda Sesuai IMT = "+ IMT);

        System.out.println();

        if(IMT > 30)

        System.out.println("Berat Badan Anda = Kegemukan (Obesitas) ");    

        else if(IMT > 25)

        System.out.println("Berat Badan Anda = Gemuk");      

        else if(IMT > 18.5)

        System.out.println("Berat Badan Anda = Normal");     

        else

        System.out.println("Berat Badan Anda = Kurus");

        System.out.println();

        System.out.println("***Tian~Chan***");

    }

}

Berikut hasil output nya:

 

Ane termasuk kurus, kurang makan kali yak depan komputer terus.

Sekian artikel tentang Source Code Java Netbeans Menentukan Berat Badan Ideal, semoga bermanfaat.