Stack (Push,Pop,Print)

#include<stdio.h>
#include<conio.h>
void Push();
void Pop();
void print();
typedef struct
{
char data[15][15];
int tail;
int head;
}

Queue(POP,PUSH,CETAK)

#include <conio.h>
#include <stdio.h>
#define MAX 5
typedef struct
{
int elm[MAX];
int head;
int tail;
}tElmList;
void Initial(tElmList *isiQueue);
void Insert(tElmList *isiQueue);
void Delete(tElmList *isiQueue);
int isEmpty(tElmList isiQueue);
int isFull(tElmList isiQueue);
void Display(tElmList isiQueue);
int main()

Single linked list

Look at this !

#include <iostream.h>
#include <conio.h>
#include <stdio.h>
#include <alloc.h>

struct simpul
{
int data;
struct simpul*next;
}*baru,*awal=NULL,*akhir=NULL,*hapus,*temp;

Menghitung Nilai (Netbeans)

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package nilai;
import java.util.Scanner;

/**
 *
 * @author ACER
 */
public class Nilai {

Menghitung gaji karyawan (Netbeans)

Look at this !

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package menghitunggajipegawi;
import java.util.Scanner;

/**
 *
 * @author Aspire
 */