Organisasi Berkas Direct

TUGAS 01

SISTEM BERKAS

ORGANISASI BERKAS DIRECT

Disusun oleh:

Nama              : Ajeng Dian A

Nim                  : 121051091

JURUSAN TEKNIK INFORMATIKA

FAKULTAS TEKNOLOGI INDUSTRI

INSTITUT SAINS & TEKNOLOGI AKPRIND

YOGYAKARTA

2015

1.      SOAL

Membuat sebuah aplikasi yang dapat menghitung panjang pita, lama akses dan transfer rate pada magnetic tape. Perhitungan dilakukan dengan metode blocking atau tanpa blocking. Jika yang diketahui adalah jumlah record, panjang setiap record, IRG, IBG, blocking factor, data dencity, dan laju pita. Bahasa pemrograman yang saya pakai untuk membuat aplikasi ini adalah Turbo C++

2.     Algoritma Program

·         Program Mulai dan muncul.

·         Terdapat 2 Pilihan Menggunakan Metode (1) Blocking atau (2) Tanpa Blocking.

·         Menginputkan Jumlah Record, Panjang Record, IRG, IBG, Blocking Factor, Data Dencity, dan Laju Pita.

·         Rumus pada Metoda Blocking:

pitablok = (jrec / blocfak) * ((blocfak * prec / dden) + ibg), aksesblok = pitablok / lpita, rateblok = jrec*prec / aksesblok.

·         Dan rumus pada metoda Tanpa Blocking:

pitatblok = jrec * ((prec / dden) + irg), aksestblok = pitatblok / lpita, ratetblok = jrec*prec/ aksestblok.

·         Kemudian kita enter untuk Menampilkan Hasil Panjang Pita, Lama Akses dan Transfer Rate.

3.       Source Code

#include<iostream.h>

#include<math.h>

void main()

{

            float jumlah_rec,panjang_rec,ibg,irg,bf,dd,laju_pita;

            float panjang_pita,lama_akses,tr;

            int pil;

            char jawab;

cout<<"+++++++++++++++++++++++++++++++++++++++++++++++++"<<endl;endl;

            cout<<"||                        MAGNETIC TAPE                         ||"<<endl;endl;

cout<<"+++++++++++++++++++++++++++++++++++++++++++++++++"<<endl;endl;

            cout<<"||                                                                      ||"<<endl;endl;

            cout<<"||                      1.Metode Tanpa Blocking                  ||"<<endl;endl;

            cout<<"||                      2.Metode Blocking                 ||"<<endl;endl;

cout<<"+++++++++++++++++++++++++++++++++++++++++++++++++"<<endl;endl;

            cout<<"||                      Ajeng Dian A                          ||"<<endl;endl;

            cout<<"||                      121051091                              ||"<<endl;endl;

            cout<<"||                      TURBO C++                          ||"<<endl;endl;

cout<<"+++++++++++++++++++++++++++++++++++++++++++++++++"<<endl;endl;

            cout<<" Metode Yang Digunakan<1/2>?";

            cin>>pil;

            if(pil==1)

            {          cout<<"+++++++++++++++++++++++++++++++++++++++++++++++"<<endl;endl;

                        cout<<"||                      Metode Tanpa Blocking                     ||"<<endl;endl;

            cout<<"+++++++++++++++++++++++++++++++++++++++++++++++"<<endl;endl;

                        cout<<"||                      Jumlah record = ";

                        cin>>jumlah_rec;endl;

                        cout<<"||                      Panjang record = ";

                        cin>>panjang_rec;endl;

                        cout<<"||                      IRG = ";

                        cin>>irg;

                        cout<<"||                      Data dencity = ";

                        cin>>dd;

                        cout<<"||                      Laju Pita = ";

                        cin>>laju_pita;                        cout<<"+++++++++++++++++++++++++++++++++++++++++++++++"<<endl;endl;

                        panjang_pita=((panjang_rec/dd)+irg)*jumlah_rec;

                        lama_akses=panjang_pita/laju_pita;

                        tr=(panjang_pita*jumlah_rec)/lama_akses;

                        cout<<"+++++++++++++++++++++++++++++++++"<<endl;

                        cout<<"||                      HASIL PERHITUNGAN                  ||"<<endl;

                        cout<<"||+++++++++++++++++++++++++++++++"<<endl;

                        cout<<"||          Panjang pita    ="<<panjang_pita<<"inchi"<<endl;

                        cout<<"||          lama akses         ="<<lama_akses<<"detik"<<endl;

                        cout<<"||          Transfer Rate  ="<<tr<<"byte/detik"<<endl;

                        cout<<"+++++++++++++++++++++++++++++++++"<<endl;

                        }

                        else

                        if(pil==2)

                        {

                        cout<<"+++++++++++++++++++++++++++++++++++++++"<<endl;

                        cout<<"||                      Metode Blocking                    ||"<<endl;

                        cout<<"+++++++++++++++++++++++++++++++++++++++"<<endl;

                        cout<<"||          Jumlah record = ";cin>>jumlah_rec;

                        cout<<"||          Panjang record            = ";cin>>panjang_rec;

                        cout<<"||          IBG                                         = ";cin>>ibg;

                        cout<<"||          Data Dencity   = ";cin>>dd;

                        cout<<"||          Laju pita                      = ";cin>>laju_pita;

                        cout<<"||          Blocking Factor          = ";cin>>bf;

                        cout<<"+++++++++++++++++++++++++++++++++++++++"<<endl;

                        panjang_pita=(jumlah_rec/bf)*((bf*panjang_rec/dd)+ibg);

                        lama_akses=panjang_pita/laju_pita;

                        tr=(panjang_rec*jumlah_rec)/lama_akses;

                        cout<<"+++++++++++++++++++++++++++++++++++++++"<<endl;

                        cout<<"||                      HASIL PERHITUNGAN                  ||"<<endl;

                        cout<<"||+++++++++++++++++++++++++++++++++++++"<<endl;

                        cout<<"||          Panjang pita    ="<<panjang_pita<<"inchi"<<endl;

                        cout<<"||          lama akses         ="<<lama_akses<<"detik"<<endl;

                        cout<<"||          Transfer Rate  ="<<tr<<"byte/detik"<<endl;

                        cout<<"+++++++++++++++++++++++++++++++++++++++"<<endl;

                        }

                        else

                        if ( pil != 3){

                        cout<<"Maaf pilihan tidak tersedia"<<endl;

                                                                                    }

                        }

4.      Contoh Tampilan Input Dan Output

Perhitungan Dengan Blocking

 Perhitungan Tanpa Blocking