Showing posts with label program jeliot. Show all posts
Showing posts with label program jeliot. Show all posts

Saturday, March 3, 2012

program statik

import jeliot.io.*;

public class Statistik {

public static int nilai_Maksimum(int data[]) {
    int maks = data[0];
    int n = data.length;
    int modus;
   
    for (int i=1; i<n; i++)
        if (maks < data[i]) {
            maks = data[i];
            modus = i;       
        }
    System.out.println("Modusnya adalah " + modus);
    return maks;
}

public static void hitung_Frekuensi() {
     int data[] = {1,1,2,2,2,2,2,3,3,4,5,5,5,5};
     int i, n = data.length;    
     int [] f = new int[10];
     int nilai_terbesar;

     for (i=0; i<n; i++) ++f[data[i]];
     for (i=0; i<10; i++)
         System.out.println("Data " + i + " sebanyak " + f[i]);
     nilai_terbesar = nilai_Maksimum(f);
     System.out.println("Dengan frekuensi = " + nilai_terbesar);
}

    public static void main() {
    hitung_Frekuensi();

    }
}

Friday, February 24, 2012

program swapreference

import jeliot.io.*;

public class SimulasiReference {
public static void main()  {
        System.out.print("\nPakai kelas\n");
        Bilangan x1 = new Bilangan(5);
        Bilangan y1 = new Bilangan(6);
        x1.keluaran();
        y1.keluaran();
        x1.swap(x1, y1);
        System.out.print("\nSetelah swap pakai kelas : \n");
        x1.keluaran();
        y1.keluaran();
    }
}

public class Bilangan {
     public Bilangan (int x) {  // konstruktor
         a = x;
     }
     public final void swap(Bilangan a, Bilangan b) {
          int temp;
          temp = a.a;
          a.a = b.a;
          b.a = temp;
     }
     public final void keluaran() {
          System.out.println("Bilangannya : " + a);
     }
     private int a;
}

program statik

import jeliot.io.*;

public class Statistik {

public static int nilai_Maksimum(int data[]) {
    int maks = data[0];
    int n = data.length;
    int modus;
   
    for (int i=1; i<n; i++)
        if (maks < data[i]) {
            maks = data[i];
            modus = i;       
        }
    System.out.println("Modusnya adalah " + modus);
    return maks;
}

public static void hitung_Frekuensi() {
     int data[] = {1,1,2,2,2,2,2,3,3,4,5,5,5,5};
     int i, n = data.length;    
     int [] f = new int[10];
     int nilai_terbesar;

     for (i=0; i<n; i++) ++f[data[i]];
     for (i=0; i<10; i++)
         System.out.println("Data " + i + " sebanyak " + f[i]);
     nilai_terbesar = nilai_Maksimum(f);
     System.out.println("Dengan frekuensi = " + nilai_terbesar);
}

    public static void main() {
    hitung_Frekuensi();

    }
}

program primefactor

import jeliot.io.*;

public class MyClass {
    public static void main() {
    int nUserInput;
    nUserInput = Input.readInt();
    for(int nIterator = 2; nIterator <= nUserInput; nIterator++)
    {
             if((nUserInput % nIterator) == 0)
             {
                            System.out.print(nIterator);
                            nUserInput /= nIterator;
                            nIterator = 1;
                            if(nIterator != nUserInput)
                            {
                                         System.out.print(" * ");
                            }
             }
    }

    }
}

program polyndrome

import jeliot.io.*;

public class MyClass {

public static boolean isPalindrome(String word) {
    int left  = 0;                 // index of leftmost unchecked char
    int right = word.length() -1;  // index of the rightmost
 
    while (left < right) {         // continue until they reach center
        if (word.charAt(left) != word.charAt(right)) {
            return false;          // if chars are different, finished
        }
        left++;                    // move left index toward the center
        right--;                   // move right index toward the center
    }
 
    return true;                   // if finished, all chars were same
}

    public static void main() {
    if (isPalindrome("Kasur rusaK"))
        System.out.println("Palindrome");
    else
        System.out.println("Bukan Palindrome");

    }
}

program modus

import jeliot.io.*;

public class Modus {
    public static void main(String[] args) {
        int a[]={2,2,3,3,3,3,3,3,3,4,4,4,4,5,5,5,5,5,5};
        int c=a[0];
        int b=0;
        int hasil=0,besar=0;
        for (int i=0; i<a.length ;i++){
            if(a[i]==c){
                System.out.print(a[i]+" ");
                System.out.println(++b);
                    if(b>besar){
                    besar=b;
                    hasil=c;
                    }
            }else{
                c=a[i];
                b=1;
                System.out.print(a[i]+" ");
                System.out.println(b);
            }
        }
        System.out.println("Modus = "+hasil);
    }
}

program fungsi

import jeliot.io.*;

public class MyFunction {
public static int tambah5(int xmasuk)
{
    return (xmasuk+5);
}

public static void main() {
     int x;
     int y;
     System.out.print("Masukkan harga x : ");
     x = Input.readInt();
     y = tambah5(x);
     System.out.print("Setelah masuk fungsi bernilai : ");
     System.out.print(y);
     }
}

program cek kata

import jeliot.io.*;

public class Cek_Kata {

public static boolean cek() {
    String kata1 = "Algo";
    char huruf = 'g';
    int len = kata1.length();

    for (int i=0; i< len; i++) {
        if (kata1.charAt(i) == huruf) {
            return true;
        }
    }
    return false;
}

    public static void main() {
        if (cek())
            System.out.print("Ada");
        else System.out.print("Tidak Ada");
    }
}