Assalamualaikum Wr Wb...

Senin, 17 Mei 2010

INSERT LINK LIST

<html>
<head>
<title>Linked List</title></head>
<body>
<script language = "JavaScript">
<!--
function LinkedList()
{
this._panjang = 0;
this._kepala = null;
}

LinkedList.prototype =
{
constructor : LinkedList,

tambah : function(data)
{
var node = {data : data, next:null};
var NodeTanda;

if (this._kepala === null)
{

this._kepala = node;
} else
{
NodeTanda = this._kepala;
while (NodeTanda.next)
{

NodeTanda = NodeTanda.next;
}
NodeTanda.next = node;

}
this._panjang++;
},

Item : function(index)
{
if (index > -1 && index < this._panjang)
{
var NodeTanda = this._kepala,
i=0;
while (i++ < index)
{
NodeTanda = NodeTanda.next;
}
return NodeTanda.data;
} else
{
return null;
}
},


Buang : function(index)
{
if( index > -1 && index < this._panjang)
{
var NodeTanda = this._kepala,previous, i=0;
if (index === 0)
{
this._kepala = NodeTanda.next;
} else
{
while(i++ < index)
{

previous = NodeTanda;
NodeTanda = NodeTanda.next;
}

previous.next = NodeTanda.next;
}
this._panjang--;

} else
{
return null;
}
},

insert : function(index,data)
{

var node = {data : data, next:null};
var temp = "";
if( index > -1 && index < this._panjang)
{

var NodeTanda = this._kepala, i=0;
this.tambah("x");

//posisi index
while(i++ < index)
{
NodeTanda = NodeTanda.next;

}

while(index++ < this._panjang)
{

temp = NodeTanda.data;
NodeTanda.data = data;
NodeTanda = NodeTanda.next;
data = temp;
}

}

this._panjang++;
},

Ukuran : function()
{
return this._panjang;
},

toArray : function()
{
var result = [],
NodeTanda = this._kepala;
while (NodeTanda)
{
result.push(NodeTanda.data);
NodeTanda = NodeTanda.next;
}
return result;
},

toString : function()
{
return this.toArray().toSring();
}

}

var list = new LinkedList();
list.tambah("Teknik Informatika");
list.tambah("Teknik Komputer");
list.tambah("Komputer Akutansi");
list.tambah("Computer Nerworking");

document.write("Isi LinkedList <br>");
document.write("--------------- <br>");
for (i=0;i<4;i++)
{

document.write(list.Item(i) + "<br>");
}
document.write("----------------<br>");

alert("Isi LinkedList awal = " + list.Item(0));
alert("Item 1 pada LinkedList dibuang, yaitu = " + list.Item(1));
list.Buang(1);
document.write("<br><br>");
document.write("Isi LinkedList Terakhir <br>");
document.write("--------------- <br>");
for (i=0;i<4;i++)
{
if (list.Item(i) == null)
{
document.write("--");
} else {
document.write(list.Item(i) + "<br>");
}
}
document.write("--------------- <br>");
document.write("<br>");
document.write("--------------- <br>");
document.write("Isi Link list disisipkan lagi <br>");
document.write("--------------- <br>");
list.insert(2,"BAKAMONO");

for (i=0;i<4;i++)
{
document.write(list.Item(i) + "<br>");
}
document.write("----------------<br>");
//-->
</script>
</body>
</html>
Diposting oleh di Tidak ada komentar:

Jumat, 14 Mei 2010

Prototype

Tambah : function (data)
{
prototype Tambah
},
Item : function(index)
{
prototype Item
},
Buang : function(index)
{
prototype Buang
},
Ukuran : function()
{
prototype Ukuran
},
toArray : function()
{
prototype toArray
},
toString : function()
{
prototype toString
};
Diposting oleh di Tidak ada komentar:

LinkedList

<html>
<head>
<title>Linked List</title></head>
<body>
<script language = "JavaScript">
<!--
function LinkedList()
{
this._panjang = 0;
this._kepala = null;
}
LinkedList.prototype =
{
constructor : LinkedList,

Tambah : function (data)
{
var node = {data : data, next:null},NodeTanda;

if (this._kepala === null)
{
this._kepala = node;
}
else
{
NodeTanda = this._kepala;
while (NodeTanda.next)
{
NodeTanda = NodeTanda.next;
}
NodeTanda.next = node;
}
this._panjang++;
},
Item : function(index)
{
if (index > -1 && index < this._panjang)
{
var NodeTanda = this._kepala,
i=0;
while (i++ < index)
{
NodeTanda = NodeTanda.next;
}
return NodeTanda.data;
}
else
{
return null;
}
},
Buang : function(index)
{
if( index > -1 && index < this._panjang)
{
var NodeTanda = this._kepala,previous, i=0;
if (index === 0)
{
this._kepala = NodeTanda.next;
}
else
{
while(i++ < index)
{
previous = NodeTanda;
NodeTanda = NodeTanda.next;
}
previous.next = NodeTanda.next;
}
this._panjang--;
return NodeTanda.data;
}
else
{
return null;
}
},

Ukuran : function()
{
return this._panjang;
},

toArray : function()
{
var result = [],
NodeTanda = this._kepala;
while (NodeTanda)
{
result.push(NodeTanda.data);
NodeTanda = NodeTanda.next;
}
return result;
},

toString : function()
{
return this.toArray().toSring();
};
}

var list = new LinkedList();
list.tambah("Teknik Informatika");
list.tambah("Teknik Komputer");
list.tambah("Komputer Akutansi");
list.tambah("Computer Nerworking");

document.write("Isi LinkedList <br>");
document.write("--------------- <br>");
for (i=0;i<4;i++)
{
document.write(list.Item(i) + "<br>");
}
document.write("----------------<br>");

alert("Isi LinkedList awal = " + list.Item(0));
alert("Item 1 pada LinkedList dibuang, yaitu = " + list.Item(1));
list.Buang(1);

document.write("Isi LinkedList Terakhir <br>");
document.write("--------------- <br>");
for (i=0;i<4;i++)
{
document.write(list.Item(i) + "<br>");
}
document.write("----------------<br>");
//-->
</script>
</body>
</html>
Diposting oleh di Tidak ada komentar:

Kamis, 22 April 2010

pengurangan matrix

<HTML>
<HEAD>
<TITLE>parameter array</TITLE>
</HEAD>
<BODY>
<SCRIPT LANGUAGE = "JavaScript">
<!--

var MatrixA = new Array(2);
var MatrixB = new Array(2);
var MatrixHasil = new Array(2);
var i,j;
MatrixHasil [0] = new Array(2);
MatrixHasil [1] = new Array(2);

MatrixA [0] = new Array(2);

MatrixA [0][0] = 2;

MatrixA [0][1] = 3;
MatrixA [1] = new Array(2);

MatrixA [1][0] = 2;

MatrixA [1][1] = 3;

MatrixB [0] = new Array(2);

MatrixB [0][0] = 0;

MatrixB [0][1] = 0;
MatrixB [1] = new Array(2);

MatrixB [1][0] = 0;

MatrixB [1][1] = 0;
for(i=0;i<2;i++)
{
for(j=0;j<2;j++)
{
MatrixHasil [i][j]=MatrixA [i][j]-MatrixB[i][j];
}
}
for(i=0;i<2;i++)
{
for(j=0;j<2;j++)
{
document.write("Hasil Pengurangan Matrix : "+MatrixHasil [i][j]

+"<br>");
}
}
//-->
</SCRIPT>
</BODY>
</HTML>
Diposting oleh di Tidak ada komentar:

Jumat, 22 Januari 2010

TUGAS FISIKA DASAR MEDAN MAGNET

Medan Magnet
Diposting oleh di Tidak ada komentar:

Kamis, 12 November 2009

Apt-cdrom

Binary package hint: apt

While running 'apt-cdrom add' in my notebook its always fails saying:
E: Failed to mount the cdrom.

APT looks into /etc/fstab to get the default cdrom mount point. My fstab looks like:
/dev/cdrom /cdrom udf,iso9660 user,noauto 0 0

APT tries to mount '/cdrom/' instead of just '/cdrom' (withou slash). If I change fstab and remove the slash from the mount point everything works well.

Suggestion:
a) APT needs to use the hal mounting point instead the /etc/fstab, so it would works with no mention in fstab
b) The default fstab mounting point should be '/cdrom/' instead of just '/cdrom'
c) The default mounting point where apt looks into should be '/cdrom'
Diposting oleh di Tidak ada komentar:

Selasa, 10 November 2009

Cleaning Trash pada ubuntu

adakalanya saat kita ingin membersihkan trash dari file-file yang sudah dibuang agar menhemat resource hdd komputer kita, di windows hal ini sangatlah gampang tinggal klik tombol empty recycle bin tapi bagaiman dengan ubuntu?
kadang ada file yang tidak bisa maen buang gitu ja karena terkait dengan hak aksese kepemilikan file so filenya ga mau digubris saat mau dibuang, setelah saya konsultasi ketemen saya ternyata hal ini ga bisa dilakukan dengan command GUI hanya bisa via terminal
caranya seperti ini

sudo rm -fr /home/username/.local/share/Trash/
Diposting oleh di Tidak ada komentar:
Langganan: Postingan (Atom)