|
LAPORAN STRUKTUR
DATA
ILHAM JAYA PRATAMA
NIM: 125610032
NIM: 125610032
JURUSAN SISTEM INFORMASI
SEKOLAH TINGGI MANAJEMEN INFOMATIKA DAN
KOMPUTER
AKAKOM
YOGYAKARTA
2012/2013
LATIHAN MODUL 2
SCRIPT PROGRAM :
import
java.util.Scanner;
public class Skuensial{
private static int N;
public static void tampilkan_data(String
nama[], String umur[],char jk[])
{
System.out.println("------------------------------------------");
System.out.println(" posisi nama
umur ");
System.out.println("------------------------------------------");
for (int i=0; i <= 9 ; i++)
{
System.out.println(""+i+" \t
"+nama[i] + "\t" + umur[i]+ "\t" +jk[i] );
}
System.out.println("------------------------------------------");
}
public static void cari_data(String nama[],
String umur[],char jk[])
{
String namacari;
int posisi = 0;
Scanner masukan = new Scanner(System.in);
String ketemu = "tidak";
System.out.print("silakan masukkan
nama yang anda cari : ");
namacari = masukan.next();
for (int i=0; i<=9; i++)
{ if
(nama[i].equals(namacari))
{
ketemu = "iya";
posisi = i;
break;
}
}
if (ketemu == "iya")
{
System.out.println("Data yang anda
cari KETEMU : "+namacari+" Pada Posisi " + posisi);
}
else
{
System.out.println("maap, nama yang
anda cari tidak ada");
}
}
public static void main (String[] args)
{
String nama[] =
{"gina","cici","beni","heru","dedi","eko","feri","janu","abud","iwan"};
String umur[] =
{"12","13","14","15","16","17","18","19","20","21"};
char jk[] =
{'P','P','L','L','L','L','L','L','L','L',};
int N = nama.length -1;
tampilkan_data (nama, umur,jk);
cari_data(nama, umur,jk);
}
}
OUTPUT :
LATIHAN MODUL 3 :
SCRIPT PROGRAM :
class Program_tumpukan
{
static int atas = -1;
static int batasatas =19;
public static void push(String
tumpukan[],String data)
{
if (atas >= batasatas)
System.out.println("Maaf,tumpukan
penuh");
else
{
System.out.println("push :
"+data);
atas = atas + 1;
tumpukan[atas] =data;
}
}
public static String pop(String tumpukan[])
{
String hasilpop="";
if (atas < 0)
hasilpop = "maaf,tumpukan
kosong";
else
{
hasilpop = tumpukan[atas];
tumpukan[atas] = null;
atas--;
}
return (hasilpop);
}
public static void bacatumpukan(String
tumpukan[])
{
System.out.println("kondisi
tumpukan:");
for (int i= batasatas ; i>=0; i--)
{
if (i==atas)
System.out.println(i+ "," +
tumpukan[i] +" atas");
else
System.out.println(i +"."+
tumpukan[i]);
}
}
public static void main(String args[])
{
String tumpukan[] = new String[20];
push (tumpukan, "buku A");
push (tumpukan, "buku B");
push (tumpukan, "buku C");
push (tumpukan, "buku D");
push (tumpukan, "buku E");
push (tumpukan, "buku F");
push (tumpukan, "buku G");
push (tumpukan, "buku H");
push (tumpukan, "buku I");
push (tumpukan, "buku J");
push (tumpukan, "buku K");
push (tumpukan, "buku L");
bacatumpukan(tumpukan);
System.out.println("pop : "
+pop(tumpukan));
System.out.println("pop : "
+pop(tumpukan));
System.out.println("pop : "
+pop(tumpukan));
System.out.println("pop : "
+pop(tumpukan));
System.out.println("pop : "
+pop(tumpukan));
System.out.println("pop : "
+pop(tumpukan));
System.out.println("pop : "
+pop(tumpukan));
System.out.println("pop : "
+pop(tumpukan));
System.out.println("pop : "
+pop(tumpukan));
System.out.println("pop : "
+pop(tumpukan));
System.out.println("pop : "
+pop(tumpukan));
System.out.println("pop : "
+pop(tumpukan));
bacatumpukan(tumpukan);
}
}
OUTPUT :
LATIHAN MODUL 4
SCRIPT PROGRAM :
class Program_Antrian
{
static int ekor = -1;
static int maxEkor = 15;//MENENTUKAN BATAS
ANTRIAN
public static void addQueue(String
antrian[], String data)
{
if (ekor >= maxEkor)
{
System.out.println("Maaf, antrian penuh");
}
else
{
System.out.println("addQueue: " + data);
ekor++;
antrian[ekor] = data;
}
}
public static String deQueue(String
antrian[])
{ String
hasil="";
if (ekor < 0) // antrian kosong
{ hasil = "maaf, antrian kosong
";
}
else
{ hasil = antrian [0];
antrian[0] = null;
//menggeser antrian 1 langkah kedepan
for (int i=1; i<=ekor; i++)
{ antrian[i-1] = antrian [i];
antrian[i] = null;
}
ekor--;
}
return (hasil);
}
public static void bacaAntrian(String
antrian[])
{
System.out.println("KONDISI ANTRIAN : ");
for (int i =0; i<=maxEkor; i++)
{ if (i == ekor)
System.out.println(i + ". " +
antrian[i] + " ekor");
else
System.out.println(i + ". " + antrian[i]);
}
}
public static void main(String[] args)
{
String antrian[] = new String[100];
addQueue (antrian, "Mobil A");
addQueue (antrian, "Mobil B");
addQueue (antrian, "Mobil C");
addQueue (antrian, "Mobil D");
addQueue (antrian, "Mobil E");
addQueue (antrian, "Mobil F");
addQueue (antrian, "Mobil G");
addQueue (antrian, "Mobil H");
addQueue (antrian, "Mobil I");
addQueue (antrian, "Mobil J");
addQueue (antrian, "Mobil K");
addQueue (antrian, "Mobil L");
addQueue (antrian, "Mobil M");
addQueue (antrian, "Mobil N");
addQueue (antrian, "Mobil O");
addQueue (antrian, "Mobil P");
addQueue (antrian, "Mobil Q");
addQueue (antrian, "Mobil R");
addQueue (antrian, "Mobil S");
System.out.println(" ");
System.out.println("deQueue: " +
deQueue(antrian));
System.out.println("deQueue: " +
deQueue(antrian));
System.out.println("deQueue: " +
deQueue(antrian));
System.out.println("deQueue: " +
deQueue(antrian));
System.out.println("deQueue: " +
deQueue(antrian));
System.out.println("deQueue: " + deQueue(antrian));
System.out.println("deQueue: " +
deQueue(antrian));
System.out.println("deQueue: " +
deQueue(antrian));
System.out.println("deQueue: " +
deQueue(antrian));
System.out.println("deQueue: " +
deQueue(antrian));
System.out.println("deQueue: " +
deQueue(antrian));
System.out.println("deQueue: " +
deQueue(antrian));
bacaAntrian(antrian);
System.out.println(" ");
}
}
OUTPUT :
No comments:
Post a Comment