octo siswardhono

JARINGAN KOMPUTER LANJUT

noreply@blogger.com (Octo Siswardhono) — Tue, 14 Dec 2010 07:14:27 PST

Teknik Informatika Lokal C 2008

Selamat ! kata pertama yang harus diucapkan untuk kalian (termasuk saya) yang sekarang akan di uji kemampuan untuk membuat server berbasis linux di mata kuliah jaringan komputer lanjut. Mohon di ingat server dan poin yang akan dikerjakan dari hasil undian yang sudah ditetapkan berdasarkan kelompok masing-masing yaa..

Info dosen :

Fedora 13

Setting Up An NFS Server and Client on Fedora 13 http://www.howtoforge.com/setting-up-an-nfs-server-and-client-on-fedora-13
Installing Lighttpd with PHP5 and MySQL Support on Fedora 13 http://www.howtoforge.com/installing-lighttpd-with-php5-and-mysql-support-on-fedora-13
Installing Nginx with PHP5 and MySQL Support on Fedora 13 http://www.howtoforge.com/installing-nginx-with-php5-and-mysql-support-on-fedora-13
Virtual Users and Domains with Postfix, Courier, MySQL and SquirrelMail (Fedora 13 x86_64) http://www.howtoforge.com/virtual-users-domains-postfix-courier-mysql-squirrelmail-fedora-13-x86_64
DNS server on Fedora 13

CentOS 5.5

Installing Nginx with PHP5 and MySQL Support on CentOS 5.5 http://www.howtoforge.com/installing-nginx-with-php5-and-mysql-support-on-centos-5.5
Setting Up an NFS Server and Client on CentOS 5.5 http://www.howtoforge.com/setting-up-an-nfs-server-and-client-on-centos-5.5
BIND Installation on CentOS http://www.howtoforge.com/bind-installation-on-centos
Installing Lighttpd with PHP5 and MySQL Support on CentOS 5.4 http://www.howtoforge.com/installing-lighttpd-with-php5-and-mysql-support-on-centos-5.4
iRedOS-0.6.0: Open Source Mail Server with Postfix, Dovecot, Amavisd, ClamAV, SpamAssassin, RoundCube http://www.howtoforge.com/iredos-0.6.0-open-source-mail-server-with-postfix-dovecot-amavisd-clamav-spamassassin-roundcube

Opensuse 11.3

Setting Up an NFS server and Client on Opensuse 11.3 http://www.howtoforge.com/setting-up-an-nfs-server-and-client-on-opensuse-11.3
Installing Lighttpd with PHP5 and MySQL Support on Opensuse 11.3 http://www.howtoforge.com/installing-lighttpd-with-php5-and-mysql-support-on-opensuse-11.3
Installing Nginx with PHP5 and MySQL Support on Opensuse 11.3 http://www.howtoforge.com/installing-nginx-with-php5-and-mysql-support-on-opensuse-11.3
iRedMail 0.7.0: Open Source Mail Server With Postfix, Dovecot, Amavisd, ClamAV, SpamAssassin, RoundCube, iRedAdmin on Opensuse 11.3
http://www.howtoforge.com/iredmail-0.7.0-open-source-mail-server-with-postfix-dovecot-amavisd-clamav-spamassassin-roundcube-opensuse-11.3

IMPLEMENTASI ERD PFIZER

noreply@blogger.com (Octo Siswardhono) — Thu, 10 Jun 2010 08:05:02 PDT

Pada kesempatan kali ini , Saya bersama teman-teman kuliah akan menjelaskan sedikit banyak mengenai ERD(Entity Relationship Diagram) dan bagaimana implementasinya didalam kehidupan nyata (Real Case).
Silahkan untuk mengunduh file berikut,
Source : ERD PFIZER

SUBQUERIES (NESTED SELECT STATEMENT)

noreply@blogger.com (Octo Siswardhono) — Sun, 30 May 2010 03:29:40 PDT

Kali ini saya akan mencoba menjelaskan mengenai subqueires. Apa itu subqueries ? subqueries di dalam ilmu database merupakan query yang mengandung query yang lain atau jikalau kita menggunakan sebuah select statement, subqueries dapat diartikan select dalam select statement. Subqueries biasa diletakkan setelah kata 'where' dan subqueries bisa mengembalikan nilai dari banyak baris atau bisa juga mengembalikan nilai lebih dari satu kolom. Kegunaan subqueries agar memudahkan apabila terjadinya self join atau saat membuat view

Untuk lebih memperdalam subqueries, saya akan membuat sebuah database yang didalamnya ada beberapa tabel yang nantinya akan dijelaskan lebih lanjut bagaimana contoh penulisan atau aturan dalam subqueries melalui soal-soal sederhana tapi mudah-mudahan dapat dipahami dengan baik oleh teman-teman sekalian.

Tabel:

tmanggota

2. tmbuku

3. ttpeminjaman

NB: Jika di lihat dari ketiga tabel diatas, tabel ttpeminjaman merupakan tabel transaksi yang terdapat dua buah foreign key dari tabel tmanggota(kode) dan tmbuku(kode)

sekarang, saya akan membuat beberapa contoh subqueries dari ketiga tabel tersebut

contoh 1 :

Tampilkan banyaknya penerbit yang menampung buku yang di buat oleh 'Andy Setiawan'

query :

output :

contoh 2 :

Tampilkan jumlah buku yang diterbitkan oleh penerbit Gramedia

query :

output :

contoh 3 :

Tampilkan nama pengarang yang bukunya diterbitkan oleh penerbit yang sama dengan Andy Setiawan

query :

output :

contoh 4 :

Tampilkan jumlah terbanyak buku-buku yang didistibusikan oleh penerbit 'Pustaka Media'

query :

output :

contoh 5 :

Tampilkan data-data peminjaman buku dari anggota yang bernama 'Bimantoko'

query :

output :

contoh 6 :

Tampilkan nama anggota yang memiliki denda terbesar dalam transaksi peminjaman

query :

output :

contoh 7 :

Tampilkan jumlah keseluruhan denda yang diberlakukan untuk anggota yang bernama 'Octo Siswardhono'

query :

output :

contoh 8 :

Tampilkan data-data peminjaman dari anggota bersemester delapan yang meminjam buku di antara tanggal 1 Januari 2009 s/d 1 Januari 2010

query :

output :

contoh 9 :

Tampilkan judul buku serta data-data peminjaman lain yang dipinjam dari anggota bersemester empat dan anggota tersebut hanya meminjam sebuah buku

query :

output :

contoh 10 :

Tampilkan judul dan penerbit yang paling banyak dipinjam oleh anggota bersemester delapan

query :

output :

OOP

noreply@blogger.com (Octo Siswardhono) — Thu, 29 Apr 2010 01:12:03 PDT

this time , I'll explain Object Oriented Programming Concept(OOP Concept), structure class, package, access control, inheritance, polymorphism, and little example of array and how to manipulate it.

OOP

The Object Oriented paradigms suggest we should model instructions in a computer program with the data they manipulate and store these as components together. One advantage of doing this is we get reusable software components. OOP paradigm aims to help overcome these problems by helping with the analysis and design tasks during the initial software development phase and by ensuring software is robust and maintanable.

Abstraction and encapsulation are fundamental principles of Object Oriented approach to software development. Abstraction allow us to consider complex ideas while ignoring irrelevant detail that would confuse us. Encapsulation allow us to focus on what something does without considering the complexities of how it works. Others fundamental principles of Object Orientation are Generalization/specialization ( which allow us to make use of inherintace ) and Polymorphism.
Generalisation allow us to consider general categories of objects which have common properties and then define specialised sub classes that inherit properties of the general categories. Polymorphism which is the ability to interact with a object as it's generalized category regardless of it's more specialised category.

Class
Class are the basic components of any object oriented software system. A class should typically be recognizable by a non-programmer domain even if associated with exixting problems and code contained in a class should be relatively independent

Package
A package is not just a visual representation of a group of classes instead a 'package' is a directory containing a group of related classes(and interfaces). Package allow us to provide a level of organisation and encapsulation above that of individual classes.

Access Control
OOP provides several types of access rights to the variable (attributes), the method and even class. Type of access rights, which are Public, Private, or Protected. This is one of the most important part of OOP, so that programmers who want to learn OOP required to understand the concept of accessing this data in OOP.

Inheritance
Giving the properties of a major class(super-class) to the other classes(sub-class) that have similiar properties. The main class is usually a genereal/global, while the sub-classes are specific/special

Polymorphism
The ablity of variables to be used as reference or a reference object of different type, and automatically can call the method specific to each type

Array
Substansial program would require a lot of variables. We can only declare variables one by one. Suppose that we need five variables with integer types, we can declared with int x,y,z.
This is still very small, what if we need 500 variables?
This would be inefficient. Thus we need or used arrays.
But before we decide to used array, we must also examine whether the data will be accessed sequentially? if yes then we can use arrays, but the data will not be accessed sequentially, should declare itself .
int [] arr = new int[100];

Source : OOP

UML Tutorial - Class Diagrams

noreply@blogger.com (Octo Siswardhono) — Wed, 28 Apr 2010 02:20:53 PDT

Hey Fella, one week ago I learned about UML on OOP-II Class..now I try to share my knowledge about how to make class diagrams with Java also used NetBeans Apps for support this tutorial. Previously I given example that you can see here about class diagram. After you see my previous post, is it diffuclt or easy to realize that ? well, I'll lead you how accurate steps to make class diagram and if you don't mind, please follow these instructions :

First of all, installed NetBeans on your computer/PC whatever the series but I used NetBeans 6.7 for this time

After the main page of NetBeans appears, create new project: File > New Project

Choose project, categories: Java , projects: Java Application and click Next

Fill Project Name:( DependOnYou ) ; Project Location: ( where the project will be saved actually on NetBeans Projects Folder ) ; click Finish

This is the result after create JavaUML Project:

Then, create UML project (File > New Project); Choose Project Categories: UML; Projects: Java-Platform Model; click Next

Fill Project Name: ( DependOnYou ); Project Location: ( where the preiviously main project JavaUML folder have been stored ); click Finish

Choose Class Diagram and Fill Diagram Name as you want, click Finish

Now lets make your own Class Diagram as you want. You can use all of pallete to helping you to do on the right side

Start from package, why package ? we need package diagrams to show the general architecture of a large system. Even modest systems can be broken down into a few basic components i.e packages. You can double click to give the name of package or fill Name section on Properties

Now, you can create class and choose how the relationship between the package. After that, you can create an attributes with right-click on class and you can decide where's field will be the primary key in every class (on properties)

This is the result if you combine class and the relationship like my previous post

The last steps, to see whether the class diagrams that we make is correct then, you can do Run Main Project (F6)

just share to all my friends, downloaded in here :

Class Diagrams

class diagram

noreply@blogger.com (Octo Siswardhono) — Tue, 27 Apr 2010 09:13:03 PDT

this is one of simple implementation from Unified Model Language (UML) which is had four of the most common diagrams (class diagrams, object diagrams, sequence diagrams and package diagrams) but now, focus with simple example of class diagram !

e.g :

relational database

noreply@blogger.com (Octo Siswardhono) — Sat, 17 Apr 2010 08:40:02 PDT

A relational database usually described by using two-dimensional tables consisting of rows and columns which data can be accessed or reassembled in many different ways without having to reorganize the database tables. Hence, a relational database matches data by using common characteristics found within the data set. The resulting groups of data are organized and are much easier for many people to understand. After the original database creation, a new data category can be added without requiring that all existing applications be modified.
Several terms in the relational database include the following:

Relation   : A table consisting of several columns and several rows.
Attribute : Column names in a relation
Tuple    : Rows in a relation ,represents an object and information
                   about that object. Object are typically physical objects or
                   concepts

Domain : A valid set of value for one or more attributes

Degree : The number of attributes in a relation

Cardinality: The number of tuples in a relation

Now, wanna show you one of example which is how's the term and describing a relational database

Candidate Key and Alternate Key

noreply@blogger.com (Octo Siswardhono) — Sat, 10 Apr 2010 10:08:20 PDT

Konsep dasar sistem basis data mengenal adanya Atribut/field, Record, File, Basis Data dan Key. Key merupakan Elemen Record yang digunakan untuk menemukan Record tersebut pada waktu akses.
Macam-macam key :

Primary Key
Secondary Key
Candidate Key
Alternate Key
Composite Key
Foreign Key

Namun pada kesempatan kali ini akan dibahas mengenai Candidate dan Alternate key berikut dengan contohnya

Candidate Key :
sebuah atau sekumpulan atribut minimum yang secara unik mengidentifikasi sebuah tuple dalam sebuah relasi
contoh
No. KTP dan No. Sim untuk mengidentifikasi entitas orang

Alternate Key :
kunci calon yang tidak dipilih sebagai kunci primer.

Setiap atribut dari candidate key yang tidak terpilih sebagai primary key akan dinamakan alternate key. Pada contoh sebelumnya bila untuk primary key dipilih No. KTP maka alternate key nya adalah No. Sim

source : Candidate & Alternate Key

Data Modification Language (DML)

noreply@blogger.com (Octo Siswardhono) — Sat, 10 Apr 2010 09:08:37 PDT

Statement DML adalah perintah-perintah yang digunakan untuk
mengoperasikan atau memanipulasi isi database.
SQL menyediakan 4 perintah DML yaitu Select, insert, update, dan
delete.
INSERT
Syntax : INSERT INTO nama_table [(nama_kolom,..)] VALUES
(data1,...);
Contoh : INSERT INTO MKUL VALUES (”KK222”,”BERKAS
Akses”,2);
Atau
INSERT INTO MKUL (KDMK,MTKUL,SKS) VALUES
(”KK222”,”BERKAS Akses”,2);
UPDATE
Syntax : UPDATE nama_tabel SET nama_kolom=ekspresi
WHERE kondisi;

Contoh :
1. Ubah alamat menjadi depok untuk mahasiswa yang memiliki
NPM ”12100748”
UPDATE MHS SET Alamat=”Depok” WHERE
NPM=”12100748”;
2. Ubah nilai mid dengan menambahkan nilai 10 untuk kode
mata kuliah ”KK021”
UPDATE NILAI SET MID+10 WHERE KDMK=”KK021”;

DELETE
Syntax : DELETE FROM nama_table [WHERE kondisi];
Contoh : DELETE FROM NILAI WHERE NPM=”12100748” AND
KDMK=”KK021’;

SELECT
Syntax : SELECT [(DISTINCT)] nama_kolom
FROM nama_table
[WHERE kondisi]
[GROUP BY nama_kolom]
[HAVING kondisi]
[ORDER BY nama_kolom [ASC/DESC]];
Contoh:
Satu table (simple query)

Tampilkan semua data mahasiswa

SELECT NPM,Nama,Alamat,Kota FROM MHS;
atau SELECT * FROM MHS;Tampilkan mata kuliah yang SKSnya 2
SELECT MTKUL FROM MKUL WHERE SKS=2;

Tampilkan semua data nilai untuk yang memperoleh nilai mid

sekurang-kurangnya 60 atau nilai final diatas 75
SELECT * FROM NILAI WHERE MID>=60 OR FINAL>75;

Tampilkan npm, kode mata kuliah dan nilai mid untuk nilai mid

antara 70 sampai dengan 100
SELECT NPM,KDMK,MID FROM NILAI WHERE BETWEEN 70 AND
100;

Tampilkan nama mahasiswa yang diawali denga huruf ”P”

SELECT Nama FROM MHS WHERE Nama LIKE ”P%”;

Tampilkan nama mahasiswa untuk nama mahasiswa yang tidak mengandung unsur huruf ”a”

SELECT Nama FROM MHS WHERE Nama NOT LIKE ”%a%”;

Tampilkan nama mahasiswa untuk nama mahasiswa yang karakter keduanya huruf ”u”SELECT Nama FROM MHS WHERE Nama LIKE ”_U%”;

Tampilkan alamat mahasiswa, dimana alamat yang sama hanyaditampilkan satu kali saja

SELECT DISTINCT Alamat FROM MHS;

Tampilkan semua data mahasiswa dengan nama terurut dari ”z”ke ”a”

SELECT * FROM MHS ORDER BY Nama DESC;

Tampilkan alamat dan jumlah mahasiswa yang bertempat tinggaldialamat tersebut

SELECT Alamat, COUNT(*) FROM MHS GROUP BY Alamat;

Tampilkan alamat dan jumlah mahasiswa yang bertempat tinggalpada alamat yang jumlahnya lebih dari 1

SELECT Alamat, COUNT (*) FROM MHS GROUP BY ALAMAT
HAVING COUNT (*) > 1;

Tampilkan nilai mid tertinggi dan terendah untuk mata kuliah”KD132”

SELECT MAX(MID), MIN(MID) FROM NILAI WHERE KDMK=”KD
132”;

Tampilkan rata-rata dan jumlah nilai final mata kuliah ”KD132”

SELECT AVG(FINAL), SUM(FINAL) FROM NILAI WHERE
KDMK=”KD132”;
Contoh lebih dari 1 tabel
1. Tampilkan nama mahasiswa yang mempunyai nilai mid < 60
SELECT NAMA FROM MHS WHERE NPM IN
(SELECT NPM FROM NILAI WHERE MID < 60);
JOIN : penggabungan kolom
SELECT NAMA FROM MHS, NILAI
WHERE MHS.NPM = NILAI.NPM AND NILAI.MID < 60;

2. Tampilkan nama mahasiswa yang mengambil mata kuliah SIM
SELECT NAMA FROM MHS WHERE NPM IN
(SELECT NPM FROM NILAI WHERE KDMK IN
(SELECT KDMK FROM MKUL WHERE MTKUL = ”SIM”));
JOIN : penggabungan kolom
SELECT NAMA FROM MHS, NILAI, MKUL
WHERE MKUL.MTKUL = ”SIM” AND
NILAI.KDMK = MKUL.KDMK AND MHS.NPM = NILAI.NPM;

3. Tampilkan nama mahsiswa yang tidak mengambil mata kuliah
”KK021”
SELECT NAMA FROM MHS WHERE NOT EXISTS
(SELECT * FROM NILAI WHERE NILAI.NPM = MHS.NPM AND
KDMK = ”KK021”);

4. Tampilkan npm mahasiswa yang bernama Budi atau yang
memiliki nilai final > 75
SELECT NPM FROM MHS WHERE NAMA = ”BUDI”
UNION SELECT NPM FROM NILAI WHER FINAL > 75;

source : DML

Data Definition Language

noreply@blogger.com (Octo Siswardhono) — Sat, 10 Apr 2010 06:27:45 PDT

Data Definition Language (DDL) is the language of the DBMS (Database Management System) which is used to create or define the objects in the database. In other words, the DDL is used to define the framework of the database.
Statement which is often used from DDL include the following :

Create database, drop database

Create table, drop table, alter table

Create view, drop view

Implementation:

Create database :
Syntax : CREATE DATABASE db_name;
e.g : CREATE DATABASE sentra;

Create table :
Syntax : CREATE TABLE table_name
(column1_name, column1_type,
column2_name, column2_type,…);
e.g : CREATE TABLE MHS
(NRM char(8) not null,
Name char(25) not null,
Address char(30) not null);
Note : Not null are optional.

Create view :
Syntax : CREATE VIEW view_name [(column1, column2,… )]
AS SELECT statement FROM table_name [WITH CHECK OPTION];
e.g : CREATE VIEW MHSv AS SELECT * FROM MHS;
Note : View_name: a view which will be made.
Column: name attribute for the view.
Statement: attributes that will be selected from a database table.
Table_name: database table name.

Drop database :
Syntax : Drop database db_name;
e.g : Drop database sentra;

Drop table :
Syntax : Drop table table_name;
e.g : Drop table MHS;

Drop view : Syntax : Drop view view_name;
e.g : Drop view MHSv;

Alter table : to change the table
Syntax : ALTER TABLE table_name
ADD (column_name_new type_column
[BEFORE column_name])
MODIFY (column_name _ previous type_column)
DROP (nama_kolom_lama type_kolom);
e.g : ALTER TABLE MHS ADD (PHONE number(15));

source : DDL

palindrome algorithm

noreply@blogger.com (Octo Siswardhono) — Sat, 20 Mar 2010 10:24:54 PDT

Now I tried to explain about palindromes, what is palindrome? palindrome meaning that if the words read from left to right or right to left the same. 'RADAR', is one example of the word palindrome because in reading from left to right or right to left the same result 'RADAR'. When viewed it looks easy for us who have long involved with the world of information technology. But I will explain how the algorithm and implementation using C programming language of this palindrome with the steps as follows:

First declare a variable containing an array A 'RADAR' and the array B to serve as a comparison when the array A has been moved to an array B with transfers made from A [n-1] and will use a variable bolean 'x' for the outcome of whether ' RADAR 'said palindrome or not

Then after that, first print array containing a 'RADAR' to check whether the declaration is correct that you have previously made

Furthermore, the logic of the palindrome is actually just move the array A into array B with the launch of A [n-1] like this

Hint: J is the variable which is declaration at the beginning with the value 0(see point 1)

To prove whether the process points 3 that true, then please print first array B

Now it is time to checking that array B has the same contents with array A and if equal then the 'x' will is true and if one letter is not the same 'x' become false value then the process is stopped

This is the last step to the process of palindromes. Check if all the contents of an array of B matches the array A if match so that's palindrome if not that's not palindrome

This is the code i've made before : palindrome

DECRYPT

noreply@blogger.com (Octo Siswardhono) — Sat, 13 Mar 2010 07:59:00 PST

In my previous post explaining what it was encrypt. Now I will explain how the process of returning the result code which was encrypted password back to the initial passcode. This process is known as decrypt process.
The algorithm is similar to decrypt the encryption process:

Prepare two arrays one for the alphabet and one for the code

Then input the code that's encrypted password stored in the variable 'pasw'

Then do the process of checking back for instance encrypted code that is '%##^@!' With code array already defined in the array A

After that do the returns from the pattern that we have made in the previous encryption process in accordance with my posting of the encryption

Y = Y +26 intended to result from the reduction if J

(is to return a value that does not produce a negative number)

Code: decrypt

ENCRYPT

noreply@blogger.com (Octo Siswardhono) — Fri, 19 Mar 2010 23:28:56 PDT

At this opportunity I will explain further what encryption is and how to process. Encryption I have learned during the algorithm classes this semester and I will try to explain to you as well as the encryption algorithm using programming language C.
Encryption is a very popular technology in the world of information technology where the technology is devoted to providing security to the user for a passcode protection from hacker attacks very dangerous and worrying. How it works is by way of encryption scrambles the password code to a particular pattern that sometimes need to work extra hard to break that pattern as this (pattern) is the wealth of each individual who could not possibly be the same between one person with another person . Really amazing !

How the encryption algorithm from the very simple? let's see together

Provide two arrays that contain arrays of the alphabet and the other array codes that will be used for encryption

Enter the password that long will you feedback to learn and to process checks at the next process.

Suppose your passcode 'Ober' is stored in variable pasw,

Next do check on your passcode that has been stored in the variable as follows pasw

After all have been in check, then this is where we can play the pattern used for encryption. One example I can give her like this with the idea of using any odd array with different array pattern even with the addition or subtraction or multiplication or division is up to you.

There if (j> = 26)

This password is used when the code consists of the letter 'y' or 'z'. This is used so that the results

of encrypted code that is still in the code B linkup defined as an array code.

After that the code stored in the variable temp at the end.

This is a simple process of encryption. Having done the encryption then the next step is we have to make his code-breaking or decryption program. What is the process? Will be further explained in the next posting.

Code : encrypt

SELECTION SORT

noreply@blogger.com (Octo Siswardhono) — Sat, 13 Mar 2010 06:26:45 PST

I will try to explain a little about the Selection Sort algorithm that I have learned and understood. Before you go any further I tried to interpret the meaning of the first syllable. When viewed Selection Sort can be interpreted as sorting is done using a selection process. What was selected? Of course the data to be sorted. Selection of this sort, including sorting categories that are still using comparative data or known by the Comparison Sort example like Bubble Sort Sort, Selection Sort, Insertion Sort, Merge sort.

The algorithm in this sorting process (Comparison Sort) is to do a comparison between the data which was followed by the exchange of data if not in accordance with certain requirements.

To more clearly now I'll try to explain how the algorithm and the process of selection sort.

Example:

there is a group of arrays which have the following sequences,

33, 41, 4, 16, 21, 9, 13 33, 41, 4, 16, 21, 9, 13

Then the algorithm as follows;

Determine the minimum index of the data array. Let's just say that the minimum index of the number of visits to the bil-i [i] untill bil [length-1] and store in variable min.

Then compare with the data bil [j] is larger than the data bil [min]. If true then min = j

Once all data have been compared, then exchange bil[i] with bil[min] if min condition was not equal to i

for the detail you can see Illustration process below this

Blue: Index Minimum Red: Data are already sorted

I've made a Selection Sort program using C language

Code : Selection Sort

I hope what I have to say can be useful to you guys

:cheers

Assessment Radix Sort Algorithm to the processing of the LSD (Least Significant Digit)

noreply@blogger.com (Octo Siswardhono) — Tue, 16 Feb 2010 20:11:07 PST

Dear fellas , now i want to share my knowledge about Radix Sort Algortihm to processing of the LSD ( Least Significant Digit ) . I made it also with my team in Algorithm Class .

Sequencing is very important in the Information Technology and couldn't be separated from the processing of data. Solving problems of data processing can be more effective and efficient if the data is in a state sequence. As in the search process data (searching), advanced search algorithms are more effective than conventional means.

Radix Sort is a magical method of sorting which set the sort order value without doing some comparison on the data entered. The word literally means radix position in number. Where simple, in decimal representation, radix it is a digit.

The basic idea of Radix sort method is Categorize the data into subsets of data in accordance with its radix value, combining them and then categorizes the next value by any other radix and so on.

Keywords : RADIX, SORT, LSD, ALGORITHM

Download: Radix Sort Journal

ADT and Struct

noreply@blogger.com (Octo Siswardhono) — Sat, 13 Mar 2010 07:12:27 PST

#include
#include
typedef int angka;
typedef float pecah;
typedef char huruf;
void hitung_total(pecah x, pecah y){
pecah htotal=x*y;
printf("Total Pembayaran :\t%f\n",htotal);
}
void hitung_kembalian(pecah A, pecah B){
pecah hkembali = B-A;
printf("Total Pembayaran :\t%f\n",hkembali);
}

main(){

angka i;
struct barang{
    huruf kode[10];
    huruf nama[20];
    angka jumlah;
    angka harga;
    } brng;
struct transaksi{
    huruf waktu;
    huruf kode[10];
    pecah total;
    pecah pembayaran;
    pecah kembalian;
    brng;
    }trans[3];
    clrscr();
printf("===================================\n");
printf("\"FORM ISIAN TRANSAKSI WARUNG TIC\"\n");
printf("===================================\n");
for(i=0;i<3;i++){
printf("Kode Traksakti\t:\t");
scanf("%s",&trans[i].kode);
printf("\n");
printf("Kode Barang     :\t");
scanf("%s",&trans[i].kode);
printf("\n");
printf("Nama Barang     :\t");
scanf("%s",&trans[i].nama);
printf("\n");
printf("Jumlah Barang   :\t");
scanf("%s",&trans[i].jumlah);
printf("\n");
printf("Harga barang    :\t");
scanf("%s",&trans[i].harga);
printf("\n");
printf("Uang pembayaran :\t");
scanf("%s",&trans[i].pembayaran);
printf("\n");
printf("Waktu Transaksi :\t");
scanf("%s",&trans[i].waktu);
printf("\n");

}
printf("\n=====================================\n");
printf("\t\t\tLaporan Transaksi\n");
printf("=======================================\n");
for(i=0;i<3;i++){
printf("Waktu Transaksi :\t%s\n",trans[i].waktu);
printf("Kode Traksakti :\t%s\n",trans[i].kode);
printf("Nama Barang     :\t%s\n",trans[i].nama);
printf("Jumlah Barang   :\t%d\n",trans[i].jumlah);
printf("Harga barang    :\t%d\n",trans[i].harga);
printf("Uang pembayaran :\t%f\n",trans[i].pembayaran);
printf("Total Bayar     :\t%f\n",trans[i].total);
printf("Kembalian       :\t%f\n",trans[i].kembalian);
hitung_total(trans[i].jumlah,trans[i].harga);

hitung_kembalian(trans[i].total,trans[i].pembayaran);

}
getch();
}

Matrix Multiplication

noreply@blogger.com (Octo Siswardhono) — Sat, 13 Mar 2010 07:59:47 PST

In completing the matrix multiplication algorithm is used as follows:

a. initialize the matrix ~ A [] [], matrix _b [] [], matrix _c [] [], i = 0, j = 0, k = 0, row ~ A, ~ A column,

_b column
b. input line ~ A, ~ A column, the column _b
c. Looping process to enter a value in the matrix ~ A:

1. for i = 0 to the many lines _ a-1, i = i +1

a) for j = 0 to the number of columns ~ A-1, j = j +1
b) the input matrix _b [i +1] [j +1]
c) Is j if not, return to the process c.1.a

2. Did i if not, return to the process of c 1.

d.Proses loop to enter a value in the matrix _b:

1. for j = 0 to the many columns ~ A-1, j = j +1

a) for k = 0 to the number of columns ~ A-1, k = k +1
b) the input matrix _b [j +1] [k +1]
c) Is k <_b column? if not, return to the process d.1.a

2. Is j if not, return to the d 1.

e. The process loops to multiply the matrix:

1. for i = 0 to ~ A lot of line-1, i = i +1

a) for k = 0 to the number of columns _b-1, k = k +1

i) for j = 0 to ~ A column -1, j = j +1
ii) the matrix _c [i] [k] + = matrix ~ A [i] [j] * matrix _b [j] [k]
iii) Is j if not, return to the process i)

b) Is k2.Apakah i if not, return to the process of e 1.

f. The process loops to display the matrix _c:

1. for i = 0 to ~ A lot of line-1, i = i +1

a) for k = 0 to the number of columns _b -1, k = k +1
b) Print the matrix _c [i] [k]
c) Is k <_b column? if not, return to the process f.1.a

2. Did i if not, return to the process f 1.

g.Program finished.

SOURCE

various problems using IF statement

noreply@blogger.com (Octo Siswardhono) — Wed, 17 Mar 2010 21:41:44 PDT

PROBLEMS:

Stacking algorithm to input 3 pieces of numbers denote the length of the side of a triangle. If the 3 sides of the triangle is equal in length will be printed the words "equilateral". If only two sides of the same will be printed "isosceles" and when the 3 side triangle is not the same as it will be printed "not both".

        Hint: a) Using the operator AND (& &) / OR (| |)

        Hint: b) Not allowed to use your logical AND and OR

        ANSWERS here yaa!!

    2. Stacking flowchart to enter 4 integers, then from

        4 numbers is printed is the number of the largest.

        ANSWERS here yaa!!

     3. Stacking flowchart for input integers 3 pieces and then print

         The 3rd value is the order from small to large.

         ANSWERS here yaa!!

answer problems 3

noreply@blogger.com (Octo Siswardhono) — Wed, 17 Mar 2010 21:43:13 PDT

Stacking flowchart for input integers 3 pieces and then printing the 3rd value in the order from small to large.

answer problems 2

noreply@blogger.com (Octo Siswardhono) — Wed, 17 Mar 2010 21:30:00 PDT

Stacking flowchart to enter 4 integers, then from 4 numbers is printed is the number of the largest.

answer problems 1

noreply@blogger.com (Octo Siswardhono) — Wed, 17 Mar 2010 21:38:50 PDT

Stacking algorithm to input 3 pieces of numbers denote the length of the side of a triangle. If the 3 sides of the triangle is equal in length will be printed the words "equilateral". If only two sides of the same will be printed "isosceles" and when the 3 side triangle is not the same as it will be printed "not both".

        Hint: a) Using the operator AND (& &) / OR (| |)

        Hint: b) Not allowed to use your logical AND and OR



a)

Octal %o and Hexadecimal %x

noreply@blogger.com (Octo Siswardhono) — Wed, 17 Mar 2010 22:21:01 PDT

On my previous posts have discussed several determinants formats are briefly described here and here
Further discussion will be explained in my post this time,
the example simple program that displays % o (octal displays an integer value) and % x (hexadecimal value displays integer).

    * Displays Octal Value (% o)
# include
play ()(
    int o;

    printf ( "input decimal values?");

   scanf ( "% d", & O);

   printf ( "octal value =% o \ n", O))

results that look like the following:

input decimal value? 4567
octal value = 10,727

    * Displays the hexadecimal value (% x)

      # include
      main ()
      (
          int A;
          printf ( "input values?");
         scanf ( "% d", & A)
         printf ( "hexadeciaml value = % x \ n", A)
      )

      results:

      input decimal value? 4567
      hexadecimal value = 11d7

differences %d and %i

noreply@blogger.com (Octo Siswardhono) — Wed, 17 Mar 2010 22:13:31 PDT

In the C programming language, we know there is a general library function is used to display the results of his prototype in stdio.h title file (the default input output header) as putchar (), puts () and printf ().
putchar and puts are the two function libraries that can be used to display the results did not preformatted. The point is the width and shape of the display can not be regulated. While printf () can be used to format the form of appearance. Then printf () can be used to display the result set format, because it can use the format code. Will discuss more about the code format (the format specifier), especially% d and% i.
%d and %i both have utility for displaying a decimal integer value. What distinguishes only coverage (range) decimal numbers only.

differences %e, %f and %g

noreply@blogger.com (Octo Siswardhono) — Wed, 17 Mar 2010 22:19:43 PDT

At this opportunity I will explain about defining formats and different from the% e,% f,% g.
% e function to display the real number in exponential notation, such as the following example;

# include
main ()
(

    float A = 0.007654321



    printf ( "% e \ n", A);
)

if the program is executed, the results:
7.654321e-003

% f function untukmenampilkan real numbers in the notation aaaa.aaaaaa, if you use a program like this:

# include
main ()(
    float A = 0.007654321;

    printf ( "% f \ n", A);)

then the output produced:

0.007654

% g function as substitutes% f or% e depends on the shortest.

example program:

# include
main ()(
    float X1 = 345.6789;
    float x2 = 98765432.1;
    printf ( "% g% g \ n", X1, X2);)

the output after the program above was executed:

345,679 9.87654e +007

PARADIGM PROGRAMMING

noreply@blogger.com (Octo Siswardhono) — Wed, 17 Mar 2010 23:46:18 PDT

PARADIGM PROGRAMMING

Programming paradigm is a way of solving our view programming problems. There are many ways to solve a problem, so there are many existing paradigms.
Some examples of programming paradigm :

Procedural

Functional

Structured

Modular

Oriented object

Oriented function

Declarative