1 / 4

Algoritma

Algoritma. SELEKSI TUNGGAL Pertemuan 2 28 Febuari 2011. Mulai. 1. cin>>Nama; cin>>NPM; cin>>Lulus; 2. If (Lulus==‘Y’) { 3. cout<<“LULUS” }. Nama , NPM, Lulus. 1. Lulus=‘Y’. 2. 3. Y. “LULUS”. T. Selesai. Void main () { String Nama,NPM;

paley
Télécharger la présentation

Algoritma

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Algoritma SELEKSI TUNGGAL Pertemuan 2 28 Febuari 2011

  2. Mulai 1. cin>>Nama; cin>>NPM; cin>>Lulus; 2. If (Lulus==‘Y’) { 3. cout<<“LULUS” } Nama, NPM, Lulus 1 Lulus=‘Y’ 2 3 Y “LULUS” T Selesai

  3. Void main () { String Nama,NPM; Char Lulus; 1.cout<<“Masukkan Nama :”; cin>>Nama; cout<<“Masukkan NPM :”; cin>>NPM; cout<<“Apakah Lulus (Y/T)? :”; cin>>Lulus; 2. If (Lulus==‘Y’) { 3. cout<<“SELAMAT ANDA LULUS….!”; } System (“pause”); }

  4. Mulai 1. cin>>Nama; cin>>NPM; cin>>Lulus; 2. If (Lulus==‘Y’) { 3. cout<<“LULUS”; } Else 5. Cout<<“Tidak Lulus”; Nama, NPM, Lulus 1 Lulus=‘Y’ 2 3 Y “LULUS” 4 T “Tidak Lulus” 5 Selesai

More Related