KONEKSI KE DATABASE

import java.sql.*;
public class MySQLDemo
{
public static void main(String[] args)
{
try {
Class.forName(“com.mysql.jdbc.Driver”).newInstance();
String cs = “jdbc:mysql://localhost:3306/shop?user=test&password=test”;
Connection cn = DriverManager.getConnection(cs);
String qry = “INSERT INTO Customer ”;
qry += “VALUES (null, 'Endy', 'Surabaya', 'endy@artivisi.com')”;
Statement stm = cn.createStatement();
int result = stm.executeUpdate(qry);

if (result == 0) {
System.out.println(“Insert Gagal”);
}
else
{
System.out.println(“Insert Sukses”);
}

}
catch (Exception err) {err.printStackTrace();}
}
} Read More..

LINKED LIST

/* SOURCE CODE LINKED LIST
ditulis ketika praktikum STRUKTUR DATA
HIDUP ILKOM IPB*



# include
# include
# include
# include

typedef struct mahasiswa {
char nrp [10];
char nama [30];
struct mahasiswa * next;
} mahasiswa;
typedef mahasiswa *mhs;
mhs head, tail, ptr_new;


int main () {
int pilihan;
mhs cetak;
back: ;
printf ("\n 1. Cetak Linked List");
printf ("\n 2. Tambah Belakang");
printf ("\n 3. Keluar");
printf ("\n masukan pilihan: ");
scanf ("%d,", &pilihan);
switch (pilihan){
case 1:
if (head == null)
printf ("Linked List Kosong!")
else {
cetak=head;
while (cetak!=null){
printf ("Nama= %s nrp= %s", cetak -> nama, cetak -> nrp);
cetak=cetak -> next}
}
getche (), goto back;

case 2:
ptr_new=(mhs) malloc (size of (mahasiswa));
if (ptr_new==null);
printf ("\n memmory tidak cukup");
else {
printf ("\n Nama");
gets (ptr_new -> nama);
printf ("\n NRP");
gets (ptr_new -> nrp);
ptr_new -> next = null;
if (head==null)
head = ptr_new;
else
tail -> next = ptr_new;
}
tail=ptr_new;
goto back;

case 3: break;
}
}


Read More..