PROGRAM STACK

#include <cstdlib>
#include <iostream>
using namespace std;
class Stack{
public:
Stack(){
jum = 5;
last = 0;
}
void push(int data){
if(jum > last){
a[last] = data;
last = last + 1;
}
}
int pop(){
if(last > 0){
int temp = a[last - 1];
a[last - 1] = 0;
last = last – 1;
return temp;
}
}
void print(){
for(int i = 0; i < last; i++){
cout << a[i] << ” “;
}
}
private:
int a[5];
int jum;
int last;
};
int main(int argc, char *argv[])
{
Stack x;
x.push(2);
x.push(4);
x.push(11);
x.push(5);
x.push(7);
x.push(9);
x.push(30);
x.print();
cout<<endl;
x.pop();
x.pop();
x.pop();
x.pop();
//x.pop();
//x.pop();
x.print();
cout<<endl;
system(“PAUSE”);
return EXIT_SUCCESS;
}

Read More

TUGAS S-DATA ANTRIAN QUEUE

#include <cstdlib>
#include <iostream.h>
#define maks 5
//using namespace std;
class Queue{
friend ostream& operator << (ostream&, const Queue&);
//friend istream& operator >> (istream&, Queue&);
public :
Queue();
int penuh(int);
int kosong(int);
void cetak();
void enqueue(char);
char dequeue();
private :
int banyak;
char A[maks];
};
ostream& operator << (ostream& out, const Queue& s)
{
cout <<”\nIsi Queue :”;
for (int i=0; i<s.banyak; i++)
out << s.A[i] << ” “;
cout<<endl;
}
Queue::Queue(){
banyak = 0;
for (int i=0; i<maks; i++)
A[i]=’0′;
}
int Queue::penuh(int s)
{return s==maks?1:0;}
int Queue::kosong(int s)
{return s==0?1:0;}
void Queue::cetak()
{cout <<”\nIsi dalam Queue sekarang   :”;
for (int i=0; i<banyak; i++)
cout <<A[i]<<” “;
}
void Queue::enqueue(char x)
{
cout <<”\nElemen :” <<x<<”  Masuk pada antrian”;
if (penuh(banyak)) cout <<”  queue penuh”;
else if(A[0]==’0′){
A[0]=x;
banyak++;
}
else{
for (int i=banyak; i>=0; i–)
A[i+1]=A[i];
A[0]=x;
banyak++;
}
}
char Queue::dequeue()
{
char temp=A[--banyak];
cout <<”\nDequeue elemen –>” <<temp;
A[banyak]=’0′;
return temp;
}
main()
{
Queue q;
for (char c=’a'; c<’d'; c++)
{
q.enqueue(c);
cout <<q;
}
char p=q.dequeue();
q.cetak();
cout <<”\n\nCetak menggunakan overloading:” <<q;
cout<<endl;
system(“PAUSE”);
return EXIT_SUCCESS;
}

Read More

Praktikum S-DATA 5

#include <iostream.h>
template <class T>

class Array1D{
      friend ostream& operator<<(ostream&,const Array1D<T>&);
public:
       Array1D(int size=0);
       Array1D(const Array1D<T>& v);
       Array1D(){delete[]element;}
       T& operator[](int i)const;
       int Size(){return size;}
       Array1D<T>& operator =(const Array1D<T>& v);
       Array1D<T> operator+()const;
       Array1D<T> operator+(const Array1D<T>& v)const;
       Array1D<T> operator-()const;
       Array1D<T> operator-(const Array1D<T>& v)const;
       Array1D<T> operator*(const Array1D<T>& v)const;
       Array1D<T>&operator+=(const T& x);
       Array1D<T>& ReSize(int sz);
       Array1D<T>& geser_kanan();
       Array1D<T>& geser_kiri();
private:
        int size;
        T*element;
};
template <class T>
Array1D<T>::Array1D(int sz)
{
                         size =sz;
                         element=new T[sz];
}
template <class T>
Array1D<T>::Array1D(const Array1D<T>& v)
{
                           size = v.size;
                           element=new T[size]; // get space
                           for (int i=0;i<size;i++)// copy elements
                           element[i]=v.element[i];
}
template <class T>
T& Array1D<T>::operator[](int i)const
{
                          return element[i];
}
template <class T>
Array1D<T>&Array1D<T>::operator =(const Array1D<T>& v)
{
                             if (this !=&v){
                                      size=v.size;
                                      delete[]element;
                                      element=new T[size];
                                      for(int i=0;i<size;i++)
                                      element[i]=v.element[i];
                                      }
                                      return *this;
}
template <class T>
Array1D<T>Array1D<T>::operator+(const Array1D<T>& v)const
{
             Array1D<T>w(size);
             for(int i=0; i<size;i++)
             w.element[i]=element[i]- v.element[i];
             return w;
}
template <class T>
Array1D<T>Array1D<T>::operator-(const Array1D<T>& v)const
{
         Array1D<T>w(size);
         for(int i=0; i<size;i++)
         w.element[i]=element[i]+ v.element[i];
         return w;
}
template <class T>
Array1D<T>Array1D<T>::operator-()const
{
          Array1D<T>w(size);
          for(int i=0; i<size;i++)
          w.element[i]=-element[i];
          return w;
}
template <class T>
Array1D<T>Array1D<T>::operator*(const Array1D<T>& v)const
{
         Array1D<T>w(size);
         for(int i=0; i<size;i++)
         w.element[i]=element[i]* v.element[i];
         return w;
}
template <class T>
Array1D<T>&Array1D<T>::operator+=(const T& x)
{
            for(int i=0; i<size;i++)
            element[i]+=x;
            return *this;
}
template <class T>
ostream& operator<<(ostream& out,const Array1D<T>& x)
{
            for(int i=0; i<x.size;i++)
            out<<x.element[i]<<" ";
            return out;
}
template <class T>
Array1D<T>&Array1D<T>::ReSize(int sz)
{
         delete[]element;
         size=sz;
         element=new T[size];
         return *this;
}
template <class T>
Array1D<T>&Array1D<T>::geser_kanan()
{
     int n = size;
     int temp = element[n-1];
     for (int i=n-1; i>=0; i--)
     element[i+1]=element[i];
     element[0]=temp;
}
template <class T>
Array1D<T>&Array1D<T>::geser_kiri()
{
     int n=size;
     int temp = element[0];
     for(int i=0; i<n; i++)
     element[i]=element[i+1];
     element[n-1]=temp;
   
}

int main()
{
    int X(10),Y,Z;
    for (int i=0; i<10; i++)
    X=i;
    cout<<" X = "<< X <<endl;
    cout<<" X is "<< X <<endl;
    Y=X;
    cout<<" Y is "<< Y <<endl;
    Y += 2;
    cout << " X incremented by 2 is " <<X<<endl;
    Z=(Y+X)*Y;
    cout<<"(Y+X)*y is " << Z <<endl;
    cout<< "-(Y+X)*Y is " << -Z <<endl;
    cout<<"setelah digeser kekanan :"<<(Y-X)*Y<<endl;
    cout<<"setelah digeser kekiri  :"<<(Y+X)<<endl;
    system("PAUSE");
}

Read More

POSTEST PRAKTIKUM SDATA 4

#include <iostream>
using namespace std;
class Array1D{
friend ostream& operator<<(ostream&, const Array1D&);
friend istream& operator>>(istream&, Array1D&);
public:
Array1D();
void cetak();
void geser_kiri();
void geser_kanan();
void hapus_elemen();
private:
char A[5];
int posisi;
};
Array1D::Array1D(){
for(int i=0;i<5;i++)
A[i]=’O';
}
void Array1D::cetak(){
for(int i=0;i<5;i++)
cout<<A[i]<<” “;
}
ostream& operator<<(ostream& out, const Array1D& x){
for(int i=0;i<5;i++)
out<<x.A[i]<<” “;
out<<endl;
return out;
}
istream& operator>>(istream& in, Array1D& x){
int posisi;
for (int posisi=1; posisi<=5; posisi++){
cout<<”masukkan nilai array posisi ke- : “;
in>>x.posisi;
if(posisi >= 0 && posisi <= 5){cout<<”masukkan elemen arraynya :”;
in>>x.A[posisi-1];
}
}
return in;
}
void Array1D::geser_kanan(){
int n=5;
int temp=A[n-1];
for(int i=n-1;i>=0;i–)
A[i+1]=A[i];
A[0]=temp;
}
void Array1D::geser_kiri(){
int n=5;
int temp=A[0];
for(int i=0;i<n;i++)
A[i]=A[i+1];
A[5-1]=temp;
}
void Array1D::hapus_elemen(){
int posisi;
cout<<”Pilih indeks berapa yg akan di hapus : “;
cin>>posisi;
if(posisi>0 && posisi<=5)
A[posisi-1]=’O';
else cout<<”indeks yg anda masuukan salah karena indek hanya terdiri dari 1 – 5\n”;
}
int main()
{
Array1D x;
cout<<”Array masih kosong : “<<x;
cin>>x;
cout<<”Isi Array saat ini : “<<x;
x.geser_kiri();
cout<<”Isi Array setelah di geser kiri : “<<x;
x.geser_kanan();
cout<<”Isi Array setelah di geser kanan : “<<x;
cout<<”Urutan elemen pada indeksnya saat ini : “<<x;
x.hapus_elemen();
cout<<”Setelah dihapus menjadi : “<<x;
system(“PAUSE”);
system(“cls”);
return main();
}

Read More

POSTEST PRAKTIKUM SDATA 3

#include <cstdlib>
#include <iostream>
using namespace std;
class Bilangan {
friend ostream& operator<<(ostream&, const Bilangan&);
friend istream& operator>>(istream&, const Bilangan&);
public:
Bilangan(int a0=0,float b0=0.0):a(a0),b(b0){}
void banding_int(const Bilangan&, const Bilangan&);
Bilangan& operator=(const Bilangan&);
Bilangan operator+(const Bilangan&)const;
Bilangan operator-()const;
//protected:
int a;
float b;
};
ostream& operator<<(ostream& out, const Bilangan& x)
{
out<<”Bagian Integer : “<<x.a<<endl;
out<<”Bagian float : “<<x.b<<endl;
return out;
}
Bilangan& Bilangan::operator=(const Bilangan& x)
{
a=x.a;
b=x.b;
return *this;
}
istream& operator>>(istream& in, Bilangan& x)
{
cout<<”\nMasukkan bagian Integer : “;
in>>x.a;
cout<<”\nMasukkan bagian float   : “;
in>>x.b;
return in;
}
Bilangan Bilangan::operator+(const Bilangan& x) const
{
Bilangan cc;
cc.a=a+x.a;
cc.b=b+x.b;
return cc;
}
Bilangan Bilangan::operator-() const
{
Bilangan x;
x.a=-a;
x.b=-b;
return x;
}

> bilchar.h
#include “bilangan.h”
class Bil_char:public Bilangan
{
friend ostream& operator<<(ostream&, const Bil_char&);
public:
Bil_char(int a0=0, int b0=0, char ch=’x'):Bilangan(a0,b0),c(ch){}
private:
char c;
};
ostream& operator<<(ostream& out, const Bil_char& x)
{
out<<”Bagian integer : “<<x.a<<endl;
out<<”Bagian float   : “<<x.b<<endl;
out<<”Bagian char    : “<<x.c<<endl;
return out;
}

> turunan.CPP
#include <iostream>
#include “bilchar.h”
using namespace std;
int main(){
Bilangan s,t(-2,3.14),d;
cout<<”Nilai awal s\n”<<s;
cout<<”Nilai awal t dari deklarasi\n”<<t;
s=t;
cout<<”Setelah di-assign t\n”;
cout<<”Nilai s\n”<<s;
cout<<”Masukkan nilai-nalai objek d”;
cin>>d;
cout<<”setelah d + t => \n”<<d+t;
cout<<”Nalai d dinegatifkan\n”<<-d;
Bil_char ss;
cout<<”Nilai awal ss\n”<<ss;
system(“PAUSE”);
}

easlamycha, and tedesant are discussing. Toggle Comments

Read More

Pretest Sdat2

#include
using namespace std;

class Kompleks
{
public:
Kompleks (int a); // inlah konstruktor jawaban soal no1
Kompleks operator*(const Kompleks&); //overload kali

Read More

Praktikum Sdat2

    #include <cstdlib>
    #include <iostream>
    class Operasi;
    using namespace std;
    //template <class T>
    class Kompleks
    {
    friend class Operasi;
    friend ostream& operator<<(ostream&, const Kompleks&);
    friend istream& operator>>(istream&, Kompleks&);

Read More