akwdakwudawkudhakwdddddddddddddddddddddddddddddddddddddddddddddhwudhakuwdhakuwddwda...
Jumat, 11 Maret 2016
Kamis, 10 Oktober 2013
Delphi 7 ( Perhitungan Nilai, Input Biodata dan Perhitungan Casir dengan Pindah form )
UNIT 1
implementation
uses
unit2,unit3,unit4;
{$R *.dfm}
procedure TForm1.Button1Click(Sender: TObject);
begin
Form2.Show;
end;
procedure TForm1.Button2Click(Sender: TObject);
begin
Form3.Show;
end;
procedure TForm1.Button3Click(Sender: TObject);
begin
Form4.Show;
end;
end.
UNIT 2
implementation
uses
unit1;
{$R *.dfm}
procedure TForm2.Button1Click(Sender: TObject);
var nilai_tugas,nilai_uts,nilai_uas,tugas,uts,uas,total:real;
var...
Minggu, 09 Juni 2013
FUNGSI, CLASS, REKURSIF, FAKTORIAL, QUEUE, DAN STACK
#include
#include
#define nil NULL
#define max 5
#define stack_max 5
#include
using namespace std;
//FAKTORIAL===================================================================//
int faktorial(int f){
int rumus;
if(f==0)
return 1;
else
rumus = f*faktorial(f-1);
cout<<" "<rumus; return="" rumus;="" }="" faktorial="==================================================================//" rekursif="===================================================================//"...
FUNGSI, CLASS, REKURSIF, FAKTORIAL, QUEUE, DAN STACK
#include
#include
#define nil NULL
#define max 5
#define stack_max 5
#include
using namespace std;
//FAKTORIAL===================================================================//
int faktorial(int f){
int rumus;
if(f==0)
return 1;
else
rumus = f*faktorial(f-1);
cout<<" "<rumus; return="" rumus;="" }="" faktorial="==================================================================//" rekursif="===================================================================//"...
Senin, 20 Mei 2013
QUEUE LINKED LIST
#include
#include
#include
#include
#include
struct node{
int data;
struct node *link;
};
struct node *cur,*first,*last;
int create();
int insert();
int delte();
int display();
int create()
{
printf("\nENTER THE FIRST ELEMENT: ");
cur=(struct node *)malloc(sizeof(struct node));
scanf("%d",&cur->data);
cur->link=NULL;
first=cur;
last=cur;
}
int insert()
{
printf("\nENTER THE NEXT ELEMENT: ");
cur=(struct node *)malloc(sizeof(struct...
Rabu, 20 Maret 2013
Menghitung Volum Bangun Ruang
sedot lagi gan materi ini
#include
#include
float v_balok(float a, float b, float c){
return (a*b*c);
}
float v_kubus(float d){
return (d*d*d);
}
float v_kerucut(float e, float f){
float pi = 3.14;
return (pi*e*e*f)/3;
}
float v_bola(float g){
float pi = 3.14;
return (4*pi*g*g*g)/3;
}
int main(){
char pil;
float pi = 3.14;
float p, l, t, s, r;
int kode;
for(char ulang = 'y'; ulang == 'y' || ulang =='Y' ; ){
cout<<" PROGRAM MENGHITUNG...
sedot sedot ilmunya
#include
using namespace std;
class mahasiswa{
public:
int algoritma() {return krs_algoritma;}
int organisasi() {return krs_organisasi;}
int ski() {return krs_ski;}
int diskrit(){return krs_diskrit;}
int arab(){return krs_arab;}
int islam(){return krs_islam;}
int so(){return krs_so;}
int ppk(){return krs_ppk;}
int sks_algoritma(int);
void sks_organisasi(int);
void sks_ski(int);
void sks_diskrit(int);
void...
Langganan:
Postingan (Atom)