Laporan Praktikum Modul 5 : Array (Kristianus Unang - Sistem Informasi - S1 - 201101018)

MODUL 5 : Array

Disusun Oleh:

Kristianus Unang

201101018

Dosen:

Yosef  Murya Kusuma Ardhana , S.T

Jurusan Sistem Informasi

Sekolah Tinggi Ilmu Komputer (STIKOM)

"Yos Sudarso"

Purwokerto
2012

---------------------------------------------------------------------------------------------------------------------------------------
 PRAKTIKUM ARRAY 2 D

Listing Program :

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

main()
{
      int huruf_a[8][45]={
          {1,1,1,0,0,1,1,1,0, 1,1,1,1,1,1,1,1,0, 0,0,0,1,1,0,0,0,0, 1,1,1,1,1,1,1,1,0, 1,1,1,1,1,1,1,1,0},
          {1,1,1,0,0,1,1,1,0, 1,1,1,1,1,1,1,1,0, 0,0,1,1,1,1,0,0,0, 1,1,1,1,1,1,1,1,0, 1,1,1,1,1,1,1,1,0},
          {1,1,1,0,0,1,1,1,0, 1,1,1,1,1,1,1,1,0, 0,1,1,0,0,1,1,0,0, 1,1,1,1,1,1,1,1,0, 1,1,1,0,0,0,0,0,0},
          {1,1,1,0,0,1,1,1,0, 1,1,1,0,0,1,1,1,0, 1,1,0,0,0,0,1,1,0, 1,1,1,0,0,1,1,1,0, 1,1,1,0,0,1,1,1,0},
          {1,1,1,0,0,1,1,1,0, 1,1,1,0,0,1,1,1,0, 1,1,1,1,1,1,1,1,0, 1,1,1,0,0,1,1,1,0, 1,1,1,0,0,1,1,1,0},
          {1,1,1,1,1,1,1,1,0, 1,1,1,0,0,1,1,1,0, 1,1,1,1,1,1,1,1,0, 1,1,1,0,0,1,1,1,0, 1,1,1,0,0,0,1,1,0},
          {1,1,1,1,1,1,1,1,0, 1,1,1,0,0,1,1,1,0, 1,1,1,0,0,1,1,1,0, 1,1,1,0,0,1,1,1,0, 1,1,1,1,1,1,1,1,0},
          {1,1,1,1,1,1,1,1,0, 1,1,1,0,0,1,1,1,0, 1,1,1,0,0,1,1,1,0, 1,1,1,0,0,1,1,1,0, 1,1,1,1,1,1,1,1,0},
          };
          int i,j;
         
          for(i=0;i<8;i++)
          {
            for(j=0;j<45;j++)
             if(huruf_a[i][j]==1)
             cout<<"*";
             else
             cout<<"\x20";
             cout<<endl;
            }
            getche();
            }

 Screenshot Result Of Program

 ---------------------------------------------------------------------------------------------------------------------------------------

PRAKTIKUM 3 D

Listing Program :

 

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

main()
{
      int huruf_a[5][8][8]={
          {{1,1,1,0,0,1,1,1},
           {1,1,1,0,0,1,1,1},
           {1,1,1,0,0,1,1,1},
           {1,1,1,0,0,1,1,1},
           {1,1,1,1,1,1,1,1},
           {1,1,1,1,1,1,1,1},
           {1,1,1,1,1,1,1,1},
           {1,1,1,1,1,1,1,1}},
          
           {{1,1,1,1,1,1,1,1},
            {1,1,1,1,1,1,1,1},
            {1,1,1,1,1,1,1,1},
            {1,1,1,1,1,1,1,1},
            {1,1,1,0,0,1,1,1},
            {1,1,1,0,0,1,1,1},
            {1,1,1,0,0,1,1,1},
            {1,1,1,0,0,1,1,1}},
           
            {{0,0,0,1,1,0,0,0},
             {0,0,1,1,1,1,0,0},
             {0,1,1,0,0,1,1,0},
             {1,1,0,0,0,0,1,1},
             {1,1,1,1,1,1,1,1},
             {1,1,1,1,1,1,1,1},
             {1,1,1,0,0,1,1,1},
             {1,1,1,0,0,1,1,1}},
            
             {{1,1,1,1,1,1,1,1},
              {1,1,1,1,1,1,1,1},
              {1,1,1,1,1,1,1,1},
              {1,1,1,1,1,1,1,1},
              {1,1,1,0,0,1,1,1},
              {1,1,1,0,0,1,1,1},
              {1,1,1,0,0,1,1,1},
              {1,1,1,0,0,1,1,1}},
           
            {{1,1,1,1,1,1,1,1},
             {1,1,1,1,1,1,1,1},
             {1,1,1,1,0,0,0,0},
             {1,1,1,1,0,1,1,1},
             {1,1,1,1,0,1,1,1},
             {1,1,1,1,0,0,1,1},
             {1,1,1,1,1,1,1,1},
             {1,1,1,1,1,1,1,1}},
            
            };
           
            int i,j,k;
           
            for(i=0;i<5;i++)
            {
              for(j=0;j<8;j++)
              {
                for(k=0;k<8;k++)
                  if(huruf_a[i][j][k]==1)
                     cout<<"*";
                     else
                     cout<<"\x20";
                     cout<<endl;
                     }
                     cout<<endl;
                     }
                     getche();
                     }
     
 Screenshot Result Of Program:

--------------------------------------------------------------------------------------------------------------------------------------- 

---------------------------------------------------------------------------------------------------------------------------------------

---------------------------------------------------------------------------------------------------------------------------------------