/*
* Tugas mata kuliah Pengujian Perangkat Lunak
* 1. Konversikan pseudo-code berikut ke Basis Path Testing
* 2. Hitung nilai kompleksitas V (G), dan ada berapa Region R
* 3. Tuliskan jalur Independent Path yang terbentuk
*/
public void infoNilai (double kajian1, double kajian2, double tugas, double quiz, double hadir) { double nilai_total = kajian1 * 0.25 + kajian2 * 0.30 + tugas * 0.20 + quiz * 0.25; if (hadir < 80) { nilai_total = nilai_total - 10; }
char indeks = 'T';
if (nilai_total > 80 && nilai_total <= 100) { indeks = 'A'; }
else if (nilai_total > 70 && nilai_total <= 80) { indeks = 'B'; }
else if (nilai_total > 60 && nilai_total <= 70) { indeks = 'C'; }
else if (nilai_total > 50 && nilai_total <= 60) { indeks = 'D'; }
else if (nilai_total > 0 && nilai_total <= 50) { indeks = 'E'; }
else { indeks = 'F'; }
System.out.println ("Nilai Akhir = " + nilai_total); System.out.println ("Indeks Mutu = " + indeks); if (indeks == 'A' || indeks == 'B' || indeks == 'C') { System.out.println ("Keterangan = LULUS"); } else { System.out.println ("Keterangan = TIDAK LULUS"); } }