Download O.S Material of Univ. UNIKOM

-
Once again, I have to apologize to universities student of UNIKOM , exactly MI-18, MI-19, and MI-21. Today I couldn't come teach You due to my urgent Task. Please download the material bellow for You to learn, if there is a question you can ask by mail to me.

Popular posts from this blog

Introduction to Use Case Diagram - Case study: Facebook

-
Image
At this session, will be explained about Use case Diagram. as we know, there are so many diagrams in UML for Analyse and design such as Use Case, Class diagram, Interaction, communication diagrams, etc. Use case can be created to explain business process from the system and to know the relationship between Actor and Use case itself. here is the sample of Facebook which is created in Astah community (Free UML tools) : From the pictures, can be explained that :  the User can update status, send message, edit his profile after he/she log on (in this part use "include"). the Extend in this session have a function as conditional, according to text book of AdegBoyage..continue
Read more

Kenapa tidak berkurban?

-
Image
Bismillah, kenapa engkau tidak berkurban? ketika Allah Subhanahu wata'ala menganungrahkan rezeki kepadamu. Qurban adalah suatu ibdah yang mulya dan sebagai bentuk ketaatan kepada Allah dan bentuk syukur.   Kesalahan fatal adalah ketika engkau bisa pergi piknik bersama keluargamu dan memakan makanan enak dari rizki yang Allah karuniakan, mungkin engkau pergi kesana kemari untuk hal-hal yang mubah, semoga Allah subhanahu wata'ala memberikan usia yang panjang lagi berkah dan dapat menjalankan semua perintahnya dan menjauhi semua larangganya, dan beribah secara Ikhlas dan I'tiba dan berpegang teuh pad Qola Allah, Qola Rosull dan Qola Sahabat atau menggegnggam sunah dalam genggamanmu Aamiin
Read more

Sequential Search

-
Salam, berikut ini diberikan contoh program menggunakan Sequential Search menggunakan bahasa pemrograman Pascal. Silhakan saudara coba coding menggunakan tools Free pascal. program pencarian_SequenctialSearch; uses crt; const   Nmaks = 100; type   larikInt = array[1..Nmaks] of integer; var   L : larikint;   i : integer;  {indeks Larik}   n : integer;  {banyaknya elemen Larik used}   x : integer; {nilai dicaari}   idx : integer;   procedure bacaLarik(var L:larikInt; n : integer);   var     i : integer;   begin     for i := 1 to n do     begin       write('Masukan nilai L[',i,']:'); readln(L[i]);     end;   end;   procedure cetakLarik(L:larikInt; n : integer);   var     i : integer;   begin     for i := 1 to n do      begin        writeln(L[i]);      end;   end;   procedure seqSearch2(L : LarikInt; n : integer; x : integer; var idx:integer);   var     i : integer;   begin     i := 1;     while (i < n) and (L[i] <> x) do  
Read more