Duniaedukasi

What is Quee? for you who study in Informatics Engineering, Computer Sciency must have known about Quee, mustn't you. Ya.., Quee menggunakan konsep antrian FIFO (Fisrt in First Out), contoh real is easy..lihat antrian pembelian tiket kereta api yang manual ya..itu konsep Quee. Berikut diberikan contoh implementasi program Quee di C++ dengan method untuk AddQuee, DeleteQuee, DisplayElement, DisplayHeadTail. Materi lengkapnya sudah ane share buat para mahasiswa karyawan ya..coba di learnt, and discuss dipertemuan berikutnya jika ada yang didiskusikan, Now..here is the code please code manually, don't copy and paste :) to make us more understand about the code. #include <iostream> using namespace std; struct node{   int data;   node *next; }; class Queue{   private:     node *head;     node *tail;   public:     Queue();   void AddQueue(int i);   void DelQueue();   void CetakElement();   void Cetak...

here is the link for "Algorithm and Programming 1" quiz_AlgoritmaPemrograman and, here also the link for "Data Structure quize" quiz_StrukturData

Here is the link... EBusiness_and_eCommerce

write down your answers in your won blog: 1. Analyze what is the difference of E Business and E-Commerce. 2. Analyze some terms bellow : B2B B2C C2C 3. Explain for about 200 words about some famous in E Commerce : eBay Amazon Walmart BukaLapak.com -------------------------------------------------------------------------------------------- write down your answer in your own Blog's posting

Sifat : Open Book --------------------------------------------------------------------------------------------------- 1. Analisis oleh Busine s Intellegence Project Team      a ) .  The Core  team     b ) .  The extended team 2. Analisis IT Staff berdasarkan komponen dalam Business Justification Component berikut : 2. Rancang database OLTP untuk proses bisnis berikut ini :   "PT. Concura IT Solution adalah IT Konsultan yang memberikan jasa pembuatan aplikasi    berbasis web dan mobile, selain itu perusahaan ini pun memberikan jasa pelatihan /training    untuk instansi-intansi pemerintah maupun swasta khususnya dalam bidang teknologi dan informasi. 3. Buat database OLAP dari soal no. 2 diatas 4. Buat salah program transformasi untuk salah satu dimensi yang dibuat. (Buat menggunakan software Pentaho CE, dan DBMS MySql). *

Berikut dilampirkan materi Business Intelligence untuk tugas resume dan presentasi individual. Tugas Individual Resume dan presentasi TextBook “BI Roadmap_” Text Book : “ Business Intelligence Roadmap_The complete Project Lifecycle for DSS Applications” here is the link : https://drive.google.com/open? id= 0B28OU4vdwU43eUppc2U1U1Zlblk Materi diresume dan dipresentasikan mulai Sabtu depan tanggal 18/3/2017.

Buat Project Planning dengan asumsi akan membangun Project Business Intelligence di tempat kerja mahasiswa masing-masing, mengacu pada 8 indikator berikut. The project planning activities do not need to be performed linearly. Figure 3.8 indicates which activities can be performed concurrently. The list below briefly describes the activities associated with Step 3, Project Planning. 1. Determine the project requirements. You may have already prepared the objectives for the project and some highlevel requirements for the proposed scope during Step 1, Business Case Assessment. However, most likely they are not of sufficient detail to start the planning process. As part of the scope definition, review and revise the following requirements: data, functionality (reports and queries), and infrastructure (technical and nontechnical). 2.Determine the condition of the source files and databases. You can neither complete the project schedule nor commit to a delivery date without a good un...

Post-Test..of Business Intelliegence we have post test for about 45 minutes, you can open internet or text book write down your answer in one or two papers included your Name and ID Students ------------------------------------------------------------------------------------------------- 1. What is Business Intelligence (BI). 2. BI Decision-support applicants facilitate many activities, including those listed bellow : Multideimensional analysis, e.g OLAP click-stream analyisis Data Mining Forecasting Mining for text, content, and voice Analysis all those statements above. 3. Explain Development Approach as previous approach before BI Application release oncept built 4. Why traditional approach doesn't mact any more for building BI application release concept? 5. Analysis some steps of Methodology of BI's road map, based on this picture bellow :

Salam... Soal quiz aplro ini dikerjakan di Lab B404 Gedung B UTama, sifat Open Book.waktu : 11 -12.40 Soal. Diketahui Tabel Z berisi angka-angka sebagai berikut : 11 5 6 222 3 5 12 7 10 9 4 Soal 1: a). Uraikan langkah-langkahnya dengan konsep DIvide and Conquer dan urutkan dengan metode Merge-Sort b). Uraikan langkah-langkahnya dengan konsep DIvide and Conquer dan urutkan dengan metode Insertion-Sort c). Uraikan langkah-langkahnya dengan konsep DIvide and Conquer dan urutkan dengan metode Quick-Sort d). Uraikan langkah-langkahnya dengan konsep DIvide and Conquer dan urutkan dengan metode Selection-Sort Soal 2: Buat implementasi programnya dalam bahasa C++ (pilih salah poin [a,b,c atau d]). Semoga sukses...!

Sialhkan download materi Alpro 2 disini disni aja

#include <stdio.h> #include <stdlib.h> /* macro to define limits*/ #define MAX_X 4 #define MAX_Y 9 #define END_X 3 #define END_Y 8 /* define structure for one point    with coordinate x and y */ typedef struct P{int x,y;}; /* functions to present path through matrix,    check if next move is valid    with backtrack technique */ void presentPath(P[],int); int tryC(int m[][MAX_Y],int,int); void checkPaths(int m[][MAX_Y],int,int,P[],int); int main() { /* declare start position and    matrix we are searching paths*/   int sX=0, sY=0,       m[MAX_X][MAX_Y]=      {       {0,0,0,1,1,1,0,0,0},       {1,1,0,0,0,0,0,0,0},       {1,0,1,0,0,1,0,1,0},       {0,0,1,1,0,1,1,1,0}      };     /* array that will serve to memorize the each path */   P Path[MAX_X+MAX_Y+1];     /* let...

#include <iostream> #include <conio.h> using namespace std ; int data[10],data2[10]; int n; void tukar(int a, int b) {  int t;  t = data[b];  data[b] = data[a];  data[a] = t; } void insertion_sort() {  int temp,i,j;  for(i=1;i<=n;i++)  {   temp = data[i];   j = i -1;   while(data[j]>temp && j>=0)   {    data[j+1] = data[j];    j--;   }  data[j+1] = temp;  } } int main() {  cout<<"\t\t\t===PROGRAM INSERTION SORT===\n\n"<<endl;  //Input Data  cout<<"Masukkan Jumlah Data : ";  cin>>n;  cout<<"\n";  for(int i=1;i<=n;i++)  {   cout<<"Masukkan data ke "<<i<<" : ";   cin>>data[i];   data2[i]=data[i];  }  insertion_sort();  cout<<"\n\n";  //tampilkan data  cout<<"Data Setelah di Sort : ";  for(int i=1; i<=n; i++)  {   ...

// include file #include <condefs.h> #include <conio> #include <iostream> #include <fstream> //dibatasi memori 52 #define MAXLIST 52 #define MAXINT (int) (2147483647) using namespace std; //struktur data kita tetap dan fleksible typedef char item_type; typedef struct node_tag; {   Item_type info;   struct node_tag *next; } Node_type; typdedef struct list_ag {   Node_type *head;   Node_type *tail; } List_type; //prototype fungsi operasi pada link list void AddNode(List_type* ,Item_type , const int opt=0); void DeleteNode(List_type , Item_type); void Error (char*); bool ExtractLine(Item_type& , Item_type); void InitList(List_type* ); Node_type *MergeSort(Node_type *p); List_type *InsertionSort (List_type *); bool FindItem(const List_type* ,Item_type); void Transverse(const List_type* ,void (*Visit) (ItemType)); void Visit(Item_type); char Menu(void); void CopyList(const List_type *, List_type *); void BatchSort(List_type *list_ptr); //var gl...

#include <cstdlib> #include <iostream> using namespace std; void minmax2(int A[], int i, int j, int &min, int &max ){      /*      Mencari nilai maksimum dan minimum di dalam tabel A yang      berukuran n elemen secara Divide and Conquer.      Masukan: tabel A yang sudah terdefinisi elemen-elemennya      Keluaran: nilai maksimum dan nilai minimum tabel      */      int min1, min2, max1, max2,k;      if(i==j){               min=A[i];               max=A[i];               }      else if(i==j-1){           if(A[i]<A[j]){      ...

Well, here is example of Linked List for Student record... #include <conio.h> #include <iostream.h> #include <malloc.h> #include <stddef.h> #include <string.h> #include <stdio.h> struct List{     int NIM;     char Nama[20];     float IPK;     List *Next;     }; List *Head, *Baru, *PNow, *PAkhir, *HNow, *HBfr; int Pilih; int main() {  Head = new(List);  Head -> Next = NULL;  do  {   //clrscr();   cout<<"\n*************************\n";   cout<<"*  M E N U   U T A M A           *\n";   cout<<"* 1. Add Data (di akhir)         *\n";   cout<<"* 2. Add Data (di awal)          *\n";         cout<<"* 3. View Data  ...

Well, here is the sample of TicTac game developed in Java, Ok, try to develop in C++. import java.awt.*; import java.awt.event.*; import javax.swing.*; public class TicTac2 implements ActionListener {     private int[][] winCombinations = new int[][] { { 0, 1, 2 }, { 3, 4, 5 },{ 6, 7, 8 },             { 0, 3, 6 },{ 1, 4, 7 }, { 2, 5, 8 },{ 0, 4, 8 }, { 2, 4, 6 }};     private JFrame window = new JFrame("Catur Jawa");     private JButton buttons[] = new JButton[9];     private int count = 0;     private String letter = "";     private boolean win = false;     private static int startCount = 0;     JMenuBar menu = new JMenuBar();     JMenuItem newGame = new JMenuItem("New Game"), instr = new JMenuItem(             "Instructions"), exit = new JMenuItem("Exit"), ...