Tweet about this on TwitterPin on PinterestShare on LinkedInShare on Google+Email this to someoneShare on FacebookShare on VkontakteShare on Odnoklassniki

RLA5.CPP

#include <stdio.h> #include <stdlib.h> #include <conio.h> #define MAX 8 int queue_arr[MAX]; int rear = -1; int front = -1; insert() { int added_item; if (rear == MAX - 1) printf("Queue Overflow !! \n"); else { if (front == -1) front = 0; printf("Masukkan Elemen Kedalam Queue : "); scanf("%d", &added_item); rear = rear + 1;...
Tweet about this on TwitterPin on PinterestShare on LinkedInShare on Google+Email this to someoneShare on FacebookShare on VkontakteShare on Odnoklassniki

LA5.CPP

#include <iostream> #include <conio.h> using namespace std; int main() { float luas, phi=3.14; int r; cout<<"Masukan Jari-jari : "; cin>>r; luas=phi*r*r; cout<<"Luas Lingkaran = "<<luas<<endl; getch(); }
Tweet about this on TwitterPin on PinterestShare on LinkedInShare on Google+Email this to someoneShare on FacebookShare on VkontakteShare on Odnoklassniki

ap3cc.cpp

#include <stdio.h> #include <conio.h> int main(){ char name[25], npm[8],kelas[5]; printf("\nMasukan Nama : "); gets (name); printf("\nMasukan NPM : "); scanf ("%s", &npm); printf("\nMasukan Kelas : "); scanf ("%s", &kelas); printf("\n"); getch(); puts("=========Biodata========="); printf("\nNama : %s", name); printf("\nNPM : %s", npm); printf("\nKelas : %s", kelas); return 0; }