Program C++ Antrian KTP

The document contains code for a queue data structure and functions to add elements to the queue (enqueue), remove elements from the queue (dequeue), check if the queue is empty or full, initialize the queue, and display the queue. It implements two queues - one to store passenger numbers and one to store passenger names. The code is part of a larger program for a passenger registration and calling system at an airport migration office.

Uploaded by

saputra ginta

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as DOCX, PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

181 views

Program C++ Antrian KTP

Uploaded by

saputra ginta

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as DOCX, PDF, TXT or read online on Scribd

You are on page 1/ 11

#include "iostream"

#include "conio.h"
#include "windows.h"
using namespace std;
struct daerah {
char kel[50];
char kec[50];
char kota[50];
};
struct data {
int nomor;
char nama[50];
char agama[20];
char status[20];
char pekerjaan[20];
char tempat[20];
char tanggal[20];
char almt[20];
daerah alamat;
};
typedef struct {
int base[100];
char base1[100][20];
int depan;
int belakang;
}queue;
queue antrian;
queue nama;
char base1[20];
int base, i, j;
int isEmpty () {
if (antrian.belakang == -1)
return 1;
else
return 0;
}
int isFull () {
if (antrian.belakang == 100)
return 1;
else
return 0;
}
void enqueu (int base, char base1[20]) { //tambah elemen
if (isEmpty() == 1) {
antrian.depan = antrian.belakang = 0;
nama.depan = nama.belakang = 0;
antrian.base[antrian.belakang] = base;
for (i=0; i<20; i++) {
nama.base1[nama.belakang][i] = base1[i];
}
cout << "\t\t| |"<<endl;
cout << "\t\t| Silahkan menunggu panggilan |" << endl;
}
else if (isFull() == 0) {
antrian.belakang++;
nama.belakang++;
antrian.base[antrian.belakang] = base;
for (i=0; i<20; i++) {
nama.base1[nama.belakang][i] = base1[i];
}
cout << "\t\t| |"<<endl;
cout << "\t\t| Silahkan menunggu panggilan |" << endl;
}
}
int dequeue () { //keluar elemen
if (isEmpty() == 0) {
int i, e;
char a[20];
e = antrian.base[antrian.depan];
for (i=0; i<20; i++) {
a[i] = nama.base1[nama.depan][i];
}
for (i=antrian.depan; i<antrian.belakang; i++) {
antrian.base[i] = antrian.base[i+1];
for (j=0; j<20; j++) {
nama.base1[i][j] = nama.base1[i+1][j];
}
}
antrian.belakang--;
nama.belakang--;
printf ("\t\t|\tAntrian dengan no %i |",e);
printf ("\n\t\t|\tDengan nama %s ",a);

printf ("\n\t\t|\tSilahkan masuk |");

return e;
return a[20];
}
else {
printf ("\t\t|\tAntrian kosong |");
}
}
void buat () {
antrian.depan = antrian.belakang = -1;
nama.depan = nama.belakang = -1;
}
int list(){
int i;
int list_int[20];
for (i=0; i<base; i++){
list_int[i] = i + 1;
cout << "\t\t|\tAntrian dengan NO "<<list_int[i]<<" |"<<endl;
}
return 0;
}

int dequeue1 () { //keluar elemen

if (isEmpty() == 0) {
int i, e;
char a[20];
e = antrian.base[antrian.depan];
for (i=0; i<20; i++) {
a[i] = nama.base1[nama.depan][i];
}
for (i=antrian.depan; i<antrian.belakang; i++) {
antrian.base[i] = antrian.base[i+1];
for (j=0; j<20; j++) {
nama.base1[i][j] = nama.base1[i+1][j];
}
}
antrian.belakang--;
nama.belakang--;
printf ("\t\t|\tSisa antrian %i |\n",e);
return e;
return a[20];
}
else {
printf ("\t\t|\tSisa Antrian kosong |\n");
}
}
void head(){
cout << "\t\t|===============================================|"<<endl;
cout << "\t\t| |"<<endl;

cout << "\t\t| APLIKASI PENDATAAN MIGRASI 2018 |"<<endl;

cout << "\t\t| Kantor kecamatan Mangga - Bandara Soekarno |"<<endl;
cout << "\t\t| |"<<endl;
cout << "\t\t|===============================================|"<<endl;
cout << "\t\t| |"<<endl;
}

int main() {
int menu;
int nik=-1,x,y;
int n;
int prio;
buat();
n=1;
int pilih;
int namedit;
data ktp[20];
char get[1];
bool ketemu;

cout << "\t\t| |"<<endl;

if(menu==1) {
system("cls");
head();
cout << "\t\t| REGISTRASI ANTRIAN |"<<endl;
cout << "\t\t| |"<<endl;

cout << "\t\t|===============================================|"<<endl;

cout << "\t\t| |"<<endl;
cout << "\t\t|\tNomor antrian anda adalah : " << n <<" |"<< endl;
dequeue1 ();
cout << "\t\t| |"<<endl;
base = n;
printf("\t\t|\tMasukkan nama : ");scanf("%s", &base1);
cout << "\t\t| |"<<endl;
cout << "\t\t|===============================================|"<<endl;
enqueu(base, base1);
n++;
cout << "\t\t| |"<<endl;
cout << "\t\t|===============================================|"<<endl;
cout << "\t\t| |"<<endl;
cout << "\t\t|\t[1] Kembali ke Menu Utama |"<<endl;
cout << "\t\t|\t[2] Keluar dari program |"<<endl;
cout << "\t\t| |"<<endl;
cout << "\t\t|===============================================|"<<endl;
cout << "\n\tMasukan Pilihan Anda : "; cin >> pilih;
cout << endl;

if(pilih == 1) {
goto menuutama;
   }
else if(pilih == 2) {
goto keluar;
    }
}

else if(menu == 2) {
system ("cls");
head();
cout << "\t\t| PEMANGGILAN ANTRIAN |"<<endl;
cout << "\t\t| |"<<endl;
cout << "\t\t|===============================================|"<<endl;
cout << "\t\t| |"<<endl;;
dequeue();
cout << "\n\t\t| |"<<endl;
cout << "\t\t|===============================================|"<<endl;
cout << "\t\t| |"<<endl;
cout << "\t\t|\t[1] Kembali ke Menu Utama |"<<endl;
cout << "\t\t|\t[2] Keluar dari program |"<<endl;
cout << "\t\t| |"<<endl;
cout << "\t\t|===============================================|"<<endl;
cout << "\n\tMasukan Pilihan Anda : "; cin >> pilih;

if(pilih == 1) {
goto menuutama;
    }
else if(pilih == 2) {
goto keluar;
    }
}

else if(menu == 3) {
system("cls");
head();
list();
cout << "\t\t| |"<<endl;
cout << "\t\t|===============================================|"<<endl;
cout << "\t\t| |"<<endl;
cout << "\t\t|\t[1] Kembali ke Menu Utama |"<<endl;
cout << "\t\t|\t[2] Keluar dari program |"<<endl;
cout << "\t\t| |"<<endl;
cout << "\t\t|===============================================|"<<endl;
cout << "\n\tMasukan Pilihan Anda : "; cin >> pilih;
cout << endl;

if(pilih == 1) {
goto menuutama;
   }
else if(pilih == 2) {
goto keluar;
    }
}
else if(menu == 4) {
system("cls");
nik++;
head();
cout << "\t\t| NIK (max 5 karakter) : "; cin >> ktp[nik].nomor; cin.getline(get,1);
cout << "\t\t| Nama Lengkap : "; cin.getline(ktp[nik].nama,50);
cout << "\t\t| Agama : "; cin.getline(ktp[nik].agama,20);
cout << "\t\t| Status Perkawinan : "; cin.getline(ktp[nik].status,20);
cout << "\t\t| Pekerjaan : "; cin.getline(ktp[nik].pekerjaan,20);
cout << "\t\t| Tempat Lahir : "; cin.getline(ktp[nik].tempat,20);
cout << "\t\t| Tanggal Lahir (DD MM YYYY) : "; cin.getline(ktp[nik].tanggal,20);
cout << "\t\t| Alamat : "; cin.getline(ktp[nik].almt,20);
cout << "\t\t| Kelurahan : "; cin.getline(ktp[nik].alamat.kel,20);
cout << "\t\t| Kecamatan : "; cin.getline(ktp[nik].alamat.kec,20);
cout << "\t\t| Kota : "; cin.getline(ktp[nik].alamat.kota,20);

cout << "\t\t| |"<<endl;
cout << "\t\t|===============================================|"<<endl;
cout << "\t\t| |"<<endl;
cout << "\t\t|\t[1] Kembali ke Menu Utama |"<<endl;
cout << "\t\t|\t[2] Keluar dari program |"<<endl;
cout << "\t\t| |"<<endl;
cout << "\t\t|===============================================|"<<endl;
cout << "\n\tMasukan Pilihan Anda : "; cin >> pilih;
cout << endl;

if(pilih == 1) {
goto menuutama;
   }
else if(pilih == 2) {
goto keluar;
    }
  }

else if(menu == 5) {
system ("cls");
head();
cout << "\t\t| PENCARIAN DATA PASWORD |"<<endl;
cout << "\t\t| |"<<endl;
cout << "\t\t|===============================================|"<<endl;
cout << "\t\t| |"<<endl;;
cout << "\t\t|\tMasukan NIK : "; cin>>namedit;

for(x=0;x<=nik;x++) {
if(namedit==ktp[x].nomor) {
cout << "\t\t| |"<<endl;
cout << "\t\t|===============================================|"<<endl;
cout << "\t\t| |"<<endl;
cout << "\t\t|\tData di temukan |"<<endl;
cout << "\t\t|\tRegistrasi data penduduk ke-" << x+1 <<" |"<< endl;
cout << "\t\t| |"<<endl;
cout << "\t\t|\tNama Lengkap : " << ktp[x].nama << endl;
cout << "\t\t|\tAgama : " << ktp[x].agama << endl;
cout << "\t\t|\tStatus perkawinan : " << ktp[x].status << endl;
cout << "\t\t|\tPekerjaan : " << ktp[x].pekerjaan << endl;
cout << "\t\t|\tTempat Lahir : " << ktp[x].tempat << endl;
cout << "\t\t|\tTanggal Lahir : "<< ktp[x].tanggal << endl;
cout << "\t\t|\tAlamat : "<< ktp[x].almt << endl;
cout << "\t\t|\tKelurahan : "<< ktp[x].alamat.kel << endl;
cout << "\t\t|\tKecamatan : "<< ktp[x].alamat.kec << endl;
cout << "\t\t|\tKota : "<< ktp[x].alamat.kota << endl;

goto menu0;
     }
   }

cout << "\t\t| |"<<endl;
cout << "\t\t|===============================================|"<<endl;
cout << "\t\t| |"<<endl;
cout << "\t\t| DATA YANG ANDA CARI TIDAK DI TEMUKAN !!! |"<<endl;
menu0:
cout << "\t\t| |"<<endl;
cout << "\t\t|===============================================|"<<endl;
cout << "\t\t| |"<<endl;
cout << "\t\t|\t[1] Kembali ke Menu Utama |"<<endl;
cout << "\t\t|\t[2] Keluar dari program |"<<endl;
cout << "\t\t| |"<<endl;
cout << "\t\t|===============================================|"<<endl;
cout << "\n\tMasukan Pilihan Anda : "; cin >> pilih;
cout << endl;

if(pilih == 1) {
goto menuutama;
    }
else if(pilih == 2) {
goto keluar;
    }
}
else if(menu == 6) {
system ("cls");
head();
cout << "\t\t| PENGHAPUSAN DATA PASWORD PADA DATABASE |"<<endl;
cout << "\t\t| |"<<endl;
cout << "\t\t|===============================================|"<<endl;
cout << "\t\t| |"<<endl;
cout << "\t\t|\tNIK : "; cin >> namedit;

for(x=0;x<=nik;x++) {
if(namedit==ktp[x].nomor) {
ketemu=true;
if(ketemu) {
for(y=x;y<=nik+1;y++) {
ktp[y]=ktp[y+1];
      }
cout << "\t\t| |"<<endl;
cout << "\t\t|===============================================|"<<endl;
cout << "\t\t| |"<<endl;
cout << "\t\t| DATA BERHASIL DI HAPUS |"<<endl;
nik--;
goto menu;
     }
    }
   }
cout << "\t\t| |"<<endl;
cout << "\t\t|===============================================|"<<endl;
cout << "\t\t| |"<<endl;
cout << "\t\t| DATA YANG AKAN DI HAPUS TIDAK DITEMUKAN !!! |"<<endl;

menu:
cout << "\t\t| |"<<endl;
cout << "\t\t|===============================================|"<<endl;
cout << "\t\t| |"<<endl;
cout << "\t\t|\t[1] Kembali ke Menu Utama |"<<endl;
cout << "\t\t|\t[2] Keluar dari program |"<<endl;
cout << "\t\t| |"<<endl;
cout << "\t\t|===============================================|"<<endl;
cout << "\n\tMasukan Pilihan Anda : "; cin >> pilih;
cout << endl;
if(pilih == 1) {
goto menuutama;
   }
else if(pilih == 2) {
goto keluar;
   }
}

else if(menu == 7) {
system ("cls");
head();
cout << "\t\t| MENAMPILKAN DATA PASWORD |"<<endl;
cout << "\t\t| |"<<endl;
cout << "\t\t|===============================================|"<<endl;
cout << "\t\t| |"<<endl;
for(x=0;x<=nik;x++) {
cout << "\t\t|\tDatabase Data Penduduk ke-" << x+1 << endl;
cout << "\t\t| "<<endl;
cout << "\t\t|\tNIK : " << ktp[x].nomor << endl;
cout << "\t\t|\tNama : " << ktp[x].nama << endl;
cout << "\t\t|\tAgama : " << ktp[x].agama << endl;
cout << "\t\t|\tStatus perkawinan : " << ktp[x].status << endl;
cout << "\t\t|\tPekerjaan : " << ktp[x].pekerjaan << endl;
cout << "\t\t|\tTempat Lahir : " << ktp[x].tempat << endl;
cout << "\t\t|\tTanggal Lahir : " << ktp[x].tanggal << endl;
cout << "\t\t|\tAlamat : " << ktp[x].almt << endl;
cout << "\t\t|\tKelurahan : " << ktp[x].alamat.kel << endl;
cout << "\t\t|\tKecamatan : " << ktp[x].alamat.kec << endl;
cout << "\t\t|\tKota : " << ktp[x].alamat.kota << endl;
}

cout << "\t\t| |"<<endl;

cout << "\t\t|===============================================|"<<endl;
cout << "\t\t| |"<<endl;
cout << "\t\t|\t[1] Kembali ke Menu Utama |"<<endl;
cout << "\t\t|\t[2] Keluar dari program |"<<endl;
cout << "\t\t| |"<<endl;
cout << "\t\t|===============================================|"<<endl;
cout << "\n\tMasukan Pilihan Anda : "; cin >> pilih;
cout << endl;
if(pilih == 1) {
goto menuutama;
   }
else if(pilih == 2) {
goto keluar;
}
keluar:
system("cls");
head();
cout << "\t\t| TERIMA KASIH |" << endl;
cout << "\t\t| |"<<endl;
cout << "\t\t|===============================================|"<<endl;
getch();
return 0;
}
else if(menu == 0 ){
system("cls");
int i, e;
char a[20];
e = antrian.base[antrian.depan];
for (i=0; i<20; i++) {
a[i] = nama.base1[nama.depan][i];
}
for (i=antrian.depan; i<antrian.belakang; i++) {
antrian.base[i] = antrian.base[i+1];
for (j=0; j<20; j++) {
nama.base1[i][j] = nama.base1[i+1][j];
   }
}
antrian.belakang--;
nama.belakang--;
printf ("\t\t|\t[1] Priority Dengan no %i |",e);
printf ("\n\t\t|\t Dengan Nama %s ",a);
cout << "\n\t\t|\t[2] Tidak Priority |"<<endl;
cout << "\t\t| |"<<endl;
cout << "\t\t|===============================================|"<<endl;
cout << "\n\tMasukan Pilihan Anda : "; cin >> prio;
if(prio == 1) {
printf ("\t\tNo %i tersebut Priorty\n",e);
system("pause");
goto menuutama;
   }
else if(prio == 2) {
cout << " NIK tersebut Tidak Priorty"<<endl;
system("pause");
goto quit;
}
}
else if(menu == 8) {
system("cls");
head();
quit:
cout << "\t\t| TERIMA KASIH |" << endl;
cout << "\t\t| |"<<endl;
cout << "\t\t|===============================================|"<<endl;
getch();
return 0;
}
}

Object Oriented Analysis and Design Full Notes
100% (5)
Object Oriented Analysis and Design Full Notes
56 pages
#8 - Antrian
No ratings yet
#8 - Antrian
3 pages
Queue - Antrian: Struktur Data
No ratings yet
Queue - Antrian: Struktur Data
11 pages
Queue en Que
No ratings yet
Queue en Que
2 pages
Syntax - Ahmad Khodadan Azizi - 02311940000023
No ratings yet
Syntax - Ahmad Khodadan Azizi - 02311940000023
3 pages
NANDI FAJAR - 211011400873 - 02TPLE009 - UAS ALGOritma
No ratings yet
NANDI FAJAR - 211011400873 - 02TPLE009 - UAS ALGOritma
10 pages
Source Code: #Include #Include #Include
No ratings yet
Source Code: #Include #Include #Include
8 pages
Tugas 1: Script Program
No ratings yet
Tugas 1: Script Program
5 pages
An Trian
No ratings yet
An Trian
3 pages
Program C++ Membuat Game Tic Tac Toe
No ratings yet
Program C++ Membuat Game Tic Tac Toe
10 pages
Bruh Fix
No ratings yet
Bruh Fix
9 pages
Post Test: Nama: Angelita Salshabilla Alindra NIM: 21102223 Kelas: IF09F
No ratings yet
Post Test: Nama: Angelita Salshabilla Alindra NIM: 21102223 Kelas: IF09F
22 pages
Algoritma Struktur Data
No ratings yet
Algoritma Struktur Data
7 pages
Macam - Macam Linked List
No ratings yet
Macam - Macam Linked List
21 pages
Laundry Fix
No ratings yet
Laundry Fix
9 pages
Jawaban Struktur Data
No ratings yet
Jawaban Struktur Data
6 pages
Script
No ratings yet
Script
8 pages
Struktur Data Tuagasssss Uts
No ratings yet
Struktur Data Tuagasssss Uts
4 pages
Drink Price Fefef
No ratings yet
Drink Price Fefef
9 pages
Tugas Struktur Data
No ratings yet
Tugas Struktur Data
3 pages
uas pemrograman dasar (akbar)
No ratings yet
uas pemrograman dasar (akbar)
1 page
StrukturData_Pertemuan20
No ratings yet
StrukturData_Pertemuan20
2 pages
Tugas Akhir Ahul
No ratings yet
Tugas Akhir Ahul
32 pages
Deque
No ratings yet
Deque
5 pages
TakeHome UTS Praktek PseudoCode
No ratings yet
TakeHome UTS Praktek PseudoCode
17 pages
Nama: Tama Putra Wijaya NIM: 18.11.2083 Source Code
No ratings yet
Nama: Tama Putra Wijaya NIM: 18.11.2083 Source Code
2 pages
Ulfani Rohima Zalti Tugas Aray
No ratings yet
Ulfani Rohima Zalti Tugas Aray
7 pages
redone
No ratings yet
redone
6 pages
Tugas Algoritma Program Linked List: Jeri Trio Sentana Ti Pagi
No ratings yet
Tugas Algoritma Program Linked List: Jeri Trio Sentana Ti Pagi
9 pages
Restaurant Management System
No ratings yet
Restaurant Management System
23 pages
3.program Queque: #Include #Include #Include #Include #Define Max 10
No ratings yet
3.program Queque: #Include #Include #Include #Include #Define Max 10
4 pages
M Rangga Yaqub Wijaya Posttest2
No ratings yet
M Rangga Yaqub Wijaya Posttest2
19 pages
Pertemuan 14 - Pengantar Coding-Resi Syahriza - 22180019
No ratings yet
Pertemuan 14 - Pengantar Coding-Resi Syahriza - 22180019
6 pages
Include Using
No ratings yet
Include Using
3 pages
Algoritma Dan Pseudocode
No ratings yet
Algoritma Dan Pseudocode
19 pages
stack (1)
No ratings yet
stack (1)
8 pages
Mochammad Ganjar Nugraha 3411141140 Kelas B
No ratings yet
Mochammad Ganjar Nugraha 3411141140 Kelas B
6 pages
Air Line Reservation
No ratings yet
Air Line Reservation
11 pages
Tugas Algoritma Pertemuan 9
No ratings yet
Tugas Algoritma Pertemuan 9
10 pages
Stuktur Data - Double Ended Queue
No ratings yet
Stuktur Data - Double Ended Queue
12 pages
Visha Goel C Projec
No ratings yet
Visha Goel C Projec
24 pages
Kuis-Praktikum Daskom 2322014
No ratings yet
Kuis-Praktikum Daskom 2322014
3 pages
Cyrcular Single Linked List
No ratings yet
Cyrcular Single Linked List
5 pages
Tugas Struktur Data: Teknik Informatika Teknologi Informasi Institut Tekhnologi Adhi Tama Surabaya 2010
No ratings yet
Tugas Struktur Data: Teknik Informatika Teknologi Informasi Institut Tekhnologi Adhi Tama Surabaya 2010
20 pages
Tugas Struktur Data Imam Syawalulail
No ratings yet
Tugas Struktur Data Imam Syawalulail
13 pages
Tugas Doubly Linked List
No ratings yet
Tugas Doubly Linked List
15 pages
Praktikum Pemograman 11
No ratings yet
Praktikum Pemograman 11
3 pages
Diana Mayangsari Ramadhani: Program Sederhana Insert-Delete-Search Menggunakan Bahasa C
No ratings yet
Diana Mayangsari Ramadhani: Program Sederhana Insert-Delete-Search Menggunakan Bahasa C
4 pages
Project1 Zikra
No ratings yet
Project1 Zikra
14 pages
Coding
No ratings yet
Coding
6 pages
Disusun Oleh: Kelompok 5 Ulaen, Hendra Katiandagho, Dyna Massie, Rendy Marthin, Zarra Hanibe, Rio Hutapea, George
No ratings yet
Disusun Oleh: Kelompok 5 Ulaen, Hendra Katiandagho, Dyna Massie, Rendy Marthin, Zarra Hanibe, Rio Hutapea, George
18 pages
Indrianika Purnama - 18310081 - 6b - Uas Algoritma Pemprograman
No ratings yet
Indrianika Purnama - 18310081 - 6b - Uas Algoritma Pemprograman
5 pages
Studi Kasus Queue - Struktur Data
No ratings yet
Studi Kasus Queue - Struktur Data
13 pages
Prak ASD Sorting
No ratings yet
Prak ASD Sorting
21 pages
Listing Prak. STRUDA Laporan 4
No ratings yet
Listing Prak. STRUDA Laporan 4
3 pages
Tutorial C++
No ratings yet
Tutorial C++
10 pages
100 Program CPP
100% (1)
100 Program CPP
78 pages
Meli Amanda 063001400034: Listing Program
No ratings yet
Meli Amanda 063001400034: Listing Program
9 pages
C++ Contoh Program
No ratings yet
C++ Contoh Program
9 pages
Soal 1, Array Data Mahasiswa: Soal Latihan C++ Buat Program - Program Berikut Dan Perbaiki Sampai Dengan Sukses
No ratings yet
Soal 1, Array Data Mahasiswa: Soal Latihan C++ Buat Program - Program Berikut Dan Perbaiki Sampai Dengan Sukses
8 pages
150+ C Pattern Programs
From Everand
150+ C Pattern Programs
Hernando Abella
No ratings yet
Interview Questions Part 1
100% (1)
Interview Questions Part 1
123 pages
Moore Mealy Machine Lecture-1
No ratings yet
Moore Mealy Machine Lecture-1
15 pages
IQ-Swift PDF PDF
No ratings yet
IQ-Swift PDF PDF
97 pages
Problem
No ratings yet
Problem
4 pages
OOP Features
No ratings yet
OOP Features
32 pages
BCA III Semester QP per Notes
No ratings yet
BCA III Semester QP per Notes
2 pages
2017+KotlinConf+-+Deep+dive+into+Coroutines+on+JVM
No ratings yet
2017+KotlinConf+-+Deep+dive+into+Coroutines+on+JVM
107 pages
Eee 5th V Sem CS 2312 Oop Lab Manual
100% (1)
Eee 5th V Sem CS 2312 Oop Lab Manual
80 pages
Chapter 3 Abstract
No ratings yet
Chapter 3 Abstract
19 pages
Inheritance
No ratings yet
Inheritance
9 pages
Course Title: Credit Units: Course Code: IT201: Java Programming
No ratings yet
Course Title: Credit Units: Course Code: IT201: Java Programming
3 pages
Learn Rust Faster
No ratings yet
Learn Rust Faster
7 pages
Packageof Java
No ratings yet
Packageof Java
11 pages
Java-Question Bank-Mid-1
No ratings yet
Java-Question Bank-Mid-1
2 pages
Assignment 1 Toc
No ratings yet
Assignment 1 Toc
3 pages
Virtual Function
No ratings yet
Virtual Function
3 pages
Assignment 5
No ratings yet
Assignment 5
16 pages
The Expression Trees: Getting Started
No ratings yet
The Expression Trees: Getting Started
5 pages
Class 1
No ratings yet
Class 1
6 pages
CSC-103L Object Oriented Programming Section C
No ratings yet
CSC-103L Object Oriented Programming Section C
3 pages
OOP Mcqs
No ratings yet
OOP Mcqs
13 pages
FALLSEM2019-20 STS4021 SS VL2019201000258 Reference Material I 16-Jul-2019 Ppt-A2 Module 1 PDF
No ratings yet
FALLSEM2019-20 STS4021 SS VL2019201000258 Reference Material I 16-Jul-2019 Ppt-A2 Module 1 PDF
91 pages
Design Pattern
No ratings yet
Design Pattern
67 pages
Java QA
No ratings yet
Java QA
22 pages
Inheritance and Polymorphism
No ratings yet
Inheritance and Polymorphism
2 pages
TOC Intro To Syllabus
No ratings yet
TOC Intro To Syllabus
47 pages
Introduction To Java Programming
No ratings yet
Introduction To Java Programming
14 pages
What Is The Difference Between Procedural and Object Oriented Programming ?
No ratings yet
What Is The Difference Between Procedural and Object Oriented Programming ?
7 pages
Apex Notes-Day 1 & 2
No ratings yet
Apex Notes-Day 1 & 2
4 pages

Program C++ Antrian KTP

Uploaded by

Program C++ Antrian KTP

Uploaded by

#include "iostream"

printf ("\n\t\t|\tSilahkan masuk |");

int dequeue1 () { //keluar elemen

cout << "\t\t| APLIKASI PENDATAAN MIGRASI 2018 |"<<endl;

cout << "\t\t| |"<<endl;

cout << "\t\t|===============================================|"<<endl;

cout << "\t\t| |"<<endl;

You might also like