IT: 2018

Senin, 02 April 2018

TUGAS STRUKTUR DATA 3

GRAPH WEIGHTED

Nama : Dian Prastiyanto

NIM : 1117101496

Kelas : SP2.2

1. Jalur yang bisa dilalui :
a. Jakarta -> Semarang -> Banyuwangi.
b. Jakarta -> Semarang -> Jogja -> Malang -> Banyuwangi.
c. Jakarta -> Semarang -> Jogja -> Malang -> Blitar -> Banyuwangi.
d. Jakarta -> Jogja -> Malang -> Blitar -> Banyuwangi.
e. Jakarta -> Jogja -> Malang -> Banyuwangi.
f. Jakarta -> Malang -> Blitar -> Banyuwangi.
g. Jakarta -> Malang -> Banyuwangi.

2. Jarak yang harus ditempuh untuk setiap path :
a. 400 Km + 800 Km = 1200 Km.
b. 400 Km + 100 Km + 250 Km + 300 Km = 1050 Km.
c. 400 Km + 100 Km + 250 Km + 120 Km + 450 Km = 1320 Km.
d. 600 Km + 250 Km + 120 Km + 450 Km = 1420 Km.
e. 600 Km + 250 Km + 300 Km = 1150 Km.
f. 800 Km + 120 Km + 450 Km = 1370 Km.
g. 800 Km + 300 Km = 1100 Km.

3. Path terpendek yaitu path e dengan jarak yang harus ditempuh 1050 Km.

4. Path terjauh yaitu path a dengan jarak yang harus ditempuh 1420 Km.

Selasa, 06 Maret 2018

TUGAS UTS STRUKTUR DATA

BINARY TREE

SEKOLAH TINGGI ILMU KOMPUTER

Keterengan :

S : ROOT

E : E < S = KIRI

K : K < S = KIRI

K > E = KANAN

O : O < S = KIRI

O > E = KANAN

O > K = KANAN

L : L < S = KIRI

L > E = KANAN

L > K = KANAN

L < O = KIRI

A : A < S = KIRI

A < E = KIRI

H : H < S = KIRI

H > E = KANAN

H < K = KIRI

T : T > S = KANAN

I : I < S = KIRI

I > E = KANAN

I < K = KIRI

I < H = KIRI

N : N < S = KIRI

N > E = KANAN

N > K = KANAN

N < O = KIRI

N > L = KANAN

G : G < S = KIRI

G > E = KANAN

G < K = KIRI

G < H = KIRI

G < I = KIRI

G : G < S = KIRI

G > E = KANAN

G < K = KIRI

G < H = KIRI

G < I = KIRI

G = G = KANAN

I : I < S = KIRI

I > E = KANAN

I < K = KIRI

I < H = KIRI

I = I = KANAN

I : I < S = KIRI

I > E = KANAN

I < K = KIRI

I < H = KIRI

I = I = KANAN

L : L < S = KIRI

L > E = KANAN

L > K = KANAN

L < O = KIRI

L = L = KANAN

L < N = KIRI

M: M < S = KIRI

M > E = KANAN

M > K = KANAN

M < O = KIRI

M > L = KANAN

M < N = KIRI

M > L = KANAN

U : U > S = KANAN

U > T = KANAN

K : K < S = KIRI

K > E = KANAN

K = K = KANAN

K < O = KIRI

K < L = KIRI

O : O < S = KIRI

O > E = KANAN

O > K = KANAN

O = O = KANAN

M: M < S = KIRI

M > E = KANAN

M > K = KANAN

M < O = KIRI

M > L = KANAN

M < N = KIRI

M > L = KANAN

M = M= KANAN

P : P < S = KIRI

P > E = KANAN

P > K = KANAN

P > O = KANAN

U : U > S = KANAN

U > T = KANAN

U = U = KANAN

T : T > S = KANAN

T = T = KANAN

T < U = KIRI

E : E < S = KIRI

E = E = KANAN

E < K = KIRI

E < H = KIRI

E < I = KIRI

E < G = KIRI

R : R < S = KIRI

R > E = KANAN

R > K = KANAN

R > O = KANAN

R > P = KANAN

Root (T) : S

Leaft (T) : A, E, G, I, K, M, R, T ,U

Parent (K) : E

Child (E) : A, K

Sibling (H) : O

Ancestor (K) : L, O, K, E, S

Descendent (L) : K, N

Path (S, R) : S -> E -> K -> O -> O -.P -> R

Size (T) : 25

Height (T) : 9

Minggu, 04 Maret 2018

Tugas 2 Struktur Data

DIAN PRASTIYANTO

Rabu, 14 Februari 2018

Tugas Struktur Data POP

Script

<html>
<head>
<title>Tugas Javascript Manipulasi Array || Pop</title>
</head>
<body>
<center><h2>Tugas Javascript Manipulasi Array || Metode Pop</h2></center>
<script src="tugas1.js"></script>
</body>
</html>

var nama = new Array;
nama.push("Dendi");
nama.push("Dimas");
nama.push("Arti");
nama.push("Danu");
nama.push("Indra");
nama.push("Rahmat");
nama.push("Dewi");
nama.push("Ayu");

document.write("nama : "+nama.toString() +"<br>");
document.write("<br>");
var AmbilData = nama.pop();
document.write("Data Yang Diambil : "+AmbilData);
document.write("<br>");
document.write("Stack Terakhir : "+nama.toString());
document.write("<br>")

var AmbilData = nama.pop();
document.write("Data Yang Diambil : "+AmbilData);
document.write("<br>");
document.write("Stack Terakhir : "+nama.toString());
document.write("<br>");

var AmbilData = nama.pop();
document.write("Data Yang Diambil : "+AmbilData);
document.write("<br>");
document.write("Stack Terakhir : "+nama.toString());
document.write("<br>");

var AmbilData = nama.pop();
document.write("Data Yang Diambil : "+AmbilData);
document.write("<br>");
document.write("Stack Terakhir : "+nama.toString());
document.write("<br>");

var AmbilData = nama.pop();
document.write("Data Yang Diambil : "+AmbilData);
document.write("<br>");
document.write("Stack Terakhir : "+nama.toString());
document.write("<br>");

var AmbilData = nama.pop();
document.write("Data Yang Diambil : "+AmbilData);
document.write("<br>");
document.write("Stack Terakhir : "+nama.toString());
document.write("<br>");

var AmbilData = nama.pop();
document.write("Data Yang Diambil : "+AmbilData);
document.write("<br>");
document.write("Stack Terakhir : "+nama.toString());
document.write("<br>");

var AmbilData = nama.pop();
document.write("Data Yang Diambil : "+AmbilData);
document.write("<br>");
document.write("Stack Terakhir : "+nama.toString());
document.write("<br>");