LAPORAN MODUL I

Oleh : Rizal Zuliansyah Affan Twerik 201210370311088 Adhik Wahyu Santoso 201210370311076

Algoritma & Struktur Data

PROGRAM STUDI TEKNIK INFORMATIKA UNIVERSITAS MUHAMMADIYAH MALANG 2013

A. Source Code Soal 1 package modul1_1; public class Modul1_1 { public static void main(String[] args) { int A[]= new int[11]; int k=0; for(int I=0; I<A.length; I++) { A[I]=k; System.out.print(+A[I]); k++; } } } Soal 2 package Modu1_5; import java.util.Scanner; public class Modu1_5 { public static void main(String[] args) { Scanner kata = new Scanner(System.in); System.out.println("Masukan Kalimat : "); String P = kata.nextLine(); String h = P; char[] s = P.toCharArray(); System.out.println("Hasil urutan : "); for(int i=0;i<h.length();i++){ for(int k=i;k<P.length();k++){ if((int)s[i]>(int)s[k]){ char simpan = s[i]; s[i]=s[k]; s[k]=simpan; } } } h = new String(s); System.out.println(h); } }

Soal 3 package modul1_3; public class Modul1_3 { public static void main(String[] args) { int [][] kotak=new int[4][]; int baris,kolom; for(baris=0;baris<kotak.length;baris++){ kotak[baris]=new int[baris+1]; for(kolom=0;kolom<kotak[baris].length;kolom++){ kotak[baris][kolom]=baris+kolom; System.out.print(kotak[baris][kolom]+" "); } System.out.println(""); } } } Soal 4 package modul1_4; import java.util.Scanner; public class Modul1_4 { public static void main(String[] args) { String[][] kata = {{"ilmu","bidang","keahlian","sains","kepandaian","keterampilan"}, {"mimpi","angan-angan","delusi","ilusi","lamunan","khayalan"}, {"usaha","bisnis","cara","daya","jalan","upaya"}, {"musik","irama","nada","musisi","harmoni","lagu"}, {"bahasa","berkata","bercakap","menuturkan","gaya","perumpamaan"}}; for(int i=0;i<kata.length;i++) {System.out.println("" + (i+1)+ "." + kata[i][0]);} Scanner scan = new Scanner(System.in); System.out.println("Masukkan pilihan : "); int pilihan = scan.nextInt(); for(int u=1;u<kata.length+1;u++){ System.out.println("Sinonim : " + kata[pilihan-1][u]); } } }

Soal 5 package arraylinearlist; public class ArrayLinearList implements ArrayLinearList5{ protected Object [] element; // array of elements protected int size; // number of elements in array public ArrayLinearList(int initialCapacity) {if (initialCapacity < 1) { throw new IllegalArgumentException ("initialCapacity must be >= 1"); } element = new Object [initialCapacity];} public ArrayLinearList() {this(10);} @Override public boolean isEmpty() {return size == 0;} @Override public int size() {return size;} void checkIndex(int index) { if (index < 0 || index >= size) { throw new IndexOutOfBoundsException ("index = " + index + " size = " + size); } } @Override public Object get(int index) { checkIndex(index); return element[index]; } @Override public int indexOf(Object theElement) { int cari = 0; for (int i = 0; i < size; i++) { if (element[i].equals(theElement)) { cari++;} } return cari; } @Override public Object remove(int index) { checkIndex(index); Object removedElement = element[index];

for (int i = index + 1; i < size; i++) { element[i-1] = element[i];} element[--size] = null; // enable garbage collection return removedElement;} @Override public void add(int index, Object obj){ if (index < 0 || index > size) { throw new IndexOutOfBoundsException ("index = " + index + " size = " + size); } if (size == element.length) { // no space, double capacity Object [] newArr = new Object[2*size]; System.arraycopy(element, 0,newArr,0,size); element = newArr; } for (int i = size - 1; i >= index; i--) { element[i + 1] = element[i]; } element[index] = obj; size++; } public static void main(String[] args) { ArrayLinearList a = new ArrayLinearList(); a.add(0,"i"); a.add(1,"s"); a.add(2,"s"); a.add(3,"r"); a.add(4,"r"); a.add(5,"e"); a.add(6,"s"); System.out.println(a.indexOf("s")); } } package arraylinearlist; public interface ArrayLinearList5 { public boolean isEmpty(); public int size(); public Object get(int index); public int indexOf(Object theElement); public Object remove(int index); public void add(int index, Object theElement); public String toString(); }

Soal 1

Soal 2

Soal 3

Soal 4

Soal 5