Commercial

Blade3D
Blade3D specializes in producing high-quality game content and reducing the cost of art production for leading game companies such as Electronic Arts, Activision Blizzard, and Eidos

Visual3D.net
Visual3D’s All-in-One Game Development Toolset enables rapid development of 3D interactive simulations, virtual worlds, and next generation games using C#, .NET and XNA

TorqueX
Looking to put your game on a console? Whether your console of choice is the Xbox 360, Nintendo Wii, or even the iPhone, TorquePowered.com has the engine for you.

SunBurn
Combining the latest lighting and rendering technology with a flexible and easy to use framework, SunBurn performs the heavy-lifting, letting you focus on your games.

Free/Open Source

Flat Red Ball
The FlatRedBall name is most commonly associated with the FlatRedBall Engine; however, FlatRedBall does not only create and distribute a game engine, but also a collection of original video games. Although there are two sides to FlatRedBall, each is closely related to the other

Qx
Ox is a mature 3D XNA game engine ready for use in your free or commercial project. It features a 3D scene system with a visual scene editor, a 2D gui system (also with its own editor), JigLibX physics, fully-integrated XNAnimation animation system, and C# game scripting system.

Quickstart 3D Game Engine
The QuickStart Engine is an engine designed to allow a programmer to get a 3D game started in XNA Game Studio as quick as possible. The QuickStart Engine is designed to make it easier to get a 3D XNA project off the ground, by taking care of the framework for you, like physics, animation, rendering, etc. Some of this is still lacking, but the point in having a community project is that anyone can pick it up and add to the engine, or optimize what is already there.

X-Engine
The X-Engine is a game engine built around Microsoft’s XNA project. It is designed to make implementation of many common tasks easy, as well as expand upon this with some more advanced features

BetaCell
BetaCell is a toolkit designed to aid computer graphics programmers to achieve their objectives by embracing DRY (don’t repeat yourself) code and offering an object oriented perspective with design patterns.

Thrust
Thrust is the framework for writing XNA games across the Windows, Xbox 360 and Zune platforms

Particle Engine

Mercury
Mercury Particle Engine is a multi-platform API which allows developers to add rich visual effects to their games. Implemented in C# and targeting the Microsoft XNA Framework, it is fully compatible with Windows and Xbox 360.

Physics Engine

Farseer
The Farseer Physics Engine is an easy to use 2D physics engine designed for Microsoft’s XNA and Silverlight platforms. The Farseer Physics Engine focuses on simplicity, useful features, and enabling the creation of fun, dynamic games.

JigLibX
JigLibX is a specially for XNA designed C# port of the Physic Engine “JigLib”

BulletX
BulletX is the first fully managed 3D physics engine, it supports Windows and XBox360 platforms

kambing.ui.edu (UI, Telkom, Indosat, OpenIXP, INHERENT)

deb http://kambing.ui.edu/ubuntu karmic main restricted universe multiverse
deb http://kambing.ui.edu/ubuntu karmic-updates main restricted universe multiverse
deb http://kambing.ui.edu/ubuntu karmic-security main restricted universe multiverse
deb http://kambing.ui.edu/ubuntu karmic-backports main restricted universe multiverse
deb http://kambing.ui.edu/ubuntu karmic-proposed main restricted universe multiverse

www.foss-id.web.id (Telkom)

deb http://dl2.foss-id.web.id/ubuntu karmic main restricted universe multiverse
deb http://dl2.foss-id.web.id/ubuntu karmic-updates main restricted universe multiverse
deb http://dl2.foss-id.web.id/ubuntu karmic-security main restricted universe multiverse
deb http://dl2.foss-id.web.id/ubuntu karmic-backports main restricted universe multiverse
deb http://dl2.foss-id.web.id/ubuntu karmic-proposed main restricted universe multiverse

ftp.itb.ac.id (ITB, INHERENT)

deb ftp://ftp.itb.ac.id/pub/ubuntu karmic main restricted universe multiverse
deb ftp://ftp.itb.ac.id/pub/ubuntu karmic-updates main restricted universe multiverse
deb ftp://ftp.itb.ac.id/pub/ubuntu karmic-security main restricted universe multiverse
deb ftp://ftp.itb.ac.id/pub/ubuntu karmic-backports main restricted universe multiverse
deb ftp://ftp.itb.ac.id/pub/ubuntu karmic-proposed main restricted universe multiverse

indika.net.id (OpenIXP)

deb http://ubuntu.indika.net.id/ karmic main restricted universe multiverse
deb http://ubuntu.indika.net.id/ karmic-updates main restricted universe multiverse
deb http://ubuntu.indika.net.id/ karmic-security main restricted universe multiverse
deb http://ubuntu.indika.net.id/ karmic-backports main restricted universe multiverse
deb http://ubuntu.indika.net.id/ karmic-proposed main restricted universe multiverse

komo.vlsm.org

deb http://komo.vlsm.org/ubuntu karmic main restricted universe multiverse
deb http://komo.vlsm.org/ubuntu karmic-updates main restricted universe multiverse
deb http://komo.vlsm.org/ubuntu karmic-security main restricted universe multiverse
deb http://komo.vlsm.org/ubuntu karmic-backports main restricted universe multiverse
deb http://komo.vlsm.org/ubuntu karmic-proposed main restricted universe multiverse

mirror.cbn.net.id (OpenIXP)

deb http://ubuntu.cbn.net.id/Ubuntu karmic main restricted universe multiverse
deb http://ubuntu.cbn.net.id/Ubuntu karmic-updates main restricted universe multiverse
deb http://ubuntu.cbn.net.id/Ubuntu karmic-security main restricted universe multiverse
deb http://ubuntu.cbn.net.id/Ubuntu karmic-backports main restricted universe multiverse
deb http://ubuntu.cbn.net.id/Ubuntu karmic-proposed main restricted universe multiverse

launchpad.net

deb http://ppa.launchpad.net/fta/ppa/ubuntu karmic main
deb-src http://ppa.launchpad.net/fta/ppa/ubuntu karmic main
deb http://archive.ubuntu.com/ubuntu/ karmic-security multiverse
deb http://ppa.launchpad.net/tormodvolden/ppa/ubuntu karmic main
deb-src http://ppa.launchpad.net/tormodvolden/ppa/ubuntu karmic main
deb http://ppa.launchpad.net/bogdanb/ppa/ubuntu karmic main
deb-src http://ppa.launchpad.net/bogdanb/ppa/ubuntu karmic main
deb http://ppa.launchpad.net/pythoneers/ppa/ubuntu karmic main
deb-src http://ppa.launchpad.net/pythoneers/ppa/ubuntu karmic main
deb http://ppa.launchpad.net/chromium-daily/ppa/ubuntu karmic main
deb-src http://ppa.launchpad.net/chromium-daily/ppa/ubuntu karmic main

ubuntu.com

deb http://archive.ubuntu.com/ubuntu/ karmic-security main restricted
deb-src http://archive.ubuntu.com/ubuntu/ karmic-security restricted main multiverse universe #Added by software-properties
deb http://archive.ubuntu.com/ubuntu/ karmic-security universe
deb http://archive.ubuntu.com/ubuntu/ karmic-proposed restricted main multiverse universe
deb-src http://archive.ubuntu.com/ubuntu/ karmic-proposed restricted main multiverse universe

How To
terminal –> sudo gedit /etc/apt/sources.list
atau…
System –> Administration –> Synaptic Package Manager
dan jangan lupa :
sudo apt-get update

If all you want to do is a 50% alpha, you can create that via a Vector4 in the color. The alpha float will be between 0 and 1 (0% and 100%) and you’d just use this color in your spritebatch while drawing the particle.

float alpha = .50f;
Color color = new Color(
    255,
    255,
    255,
    255 * (byte)alpha);

To rendering with transparent effect, example,  vertex with transparent alpha value or a .png image with transparent area, just add code below before effect.Begin() called

effect.GraphicsDevice.RenderState.AlphaBlendEnable = true;
effect.GraphicsDevice.RenderState.SourceBlend = Blend.SourceAlpha;
effect.GraphicsDevice.RenderState.DestinationBlend = Blend.InverseSourceAlpha;

In my example code, i will render some line, a transparent line. Befor rendering, i save some properties value of GraphicsDevice object, so i can restore it’s state after rendering

public void Draw(Matrix viewMatrix, Matrix projectionMatrix)
{
    bool alphaBlendEnable = basicEffect.GraphicsDevice.RenderState.AlphaBlendEnable;
    Blend sourceAlpha = basicEffect.GraphicsDevice.RenderState.SourceBlend;
    Blend inverseSourceAlpha = basicEffect.GraphicsDevice.RenderState.DestinationBlend;

    basicEffect.World = Matrix.Identity;
    basicEffect.View = viewMatrix;
    basicEffect.Projection = projectionMatrix;
    basicEffect.VertexColorEnabled = true;

    basicEffect.GraphicsDevice.RenderState.AlphaBlendEnable = true;
    basicEffect.GraphicsDevice.RenderState.SourceBlend = Blend.SourceAlpha;
    basicEffect.GraphicsDevice.RenderState.DestinationBlend = Blend.InverseSourceAlpha;

    basicEffect.Begin();

    foreach (EffectPass pass in basicEffect.CurrentTechnique.Passes)
    {
        pass.Begin();

        device.VertexDeclaration = vertDeclaration;
        device.DrawUserPrimitives<VertexPositionColor>(PrimitiveType.LineList, vertices, 0, vertices.Length / 2);

        pass.End();
    }
    basicEffect.End();

    basicEffect.GraphicsDevice.RenderState.AlphaBlendEnable = alphaBlendEnable;
    basicEffect.GraphicsDevice.RenderState.SourceBlend = sourceAlpha;
    basicEffect.GraphicsDevice.RenderState.DestinationBlend = inverseSourceAlpha;
}

In my campus , i can’t access website like facebook, youtube, or kaskus…it’s frustating, because many websites blocked by proxy. Now i know how to surf that websites…
SSL Proxy offers proxy servers that you can use to unblock websites at school or work.

Just using SSL Proxy Service below :

http://www.hidemyass.com

http://libertybell.biz

http://www.megaproxy.com

http://www.pzeg.com

http://www.sslunblock.com

That’s all, 100% tested and worked

What’s a game or an interactive presentation without a way to move around? So in this tutorial, I’ll show you how to make a rotated camera. This is a simple class to make a camera that can rotating about a fixed point rather than origin point (0, 0, 0)

Keyboard Control :

KEY UP – for rotating up

KEY DOWN – for rotating down

KEY RIGHT – for rotating right

KEY LEFT – for rotating left

Note : for using this code in your application, do not forget to change camera position, camera target and camera up vector (as you needed)

public class RotatedCamera
{

    Matrix viewMatrix;
    Matrix projectionMatrix;

    Vector3 camPosition;
    Vector3 camTarget;
    Vector3 camUpVector;

    float viewAngle;
    float aspectRatio;
    float nearPlane;
    float farPlane;

    private float yAngle = 0f;
    private float xAngle = 0f;

    #region Properties

    public Vector3 CamPosition
    {
        get { return camPosition; }
        set { camPosition = value; }
    }

    public Vector3 CamTarget
    {
        get { return camTarget; }
        set { camTarget = value; }
    }

    public Vector3 CamUpVector
    {
        get { return camUpVector; }
        set { camUpVector = value; }
    }

    public Matrix ViewMatrix
    {
        get { return viewMatrix; }
    }

    public Matrix ProjectionMatrix
    {
        get { return projectionMatrix; }
    }

    #endregion

    public RotatedCamera()
    {
    }

    public void Update(GameTime gameTime, KeyboardState keyboardState)
    {
        bool isChanged = false;

        if (keyboardState.IsKeyDown(Keys.Right))
        {
            yAngle -= 0.010f;
            isChanged = true;
        }
        else if (keyboardState.IsKeyDown(Keys.Left))
        {
            yAngle += 0.010f;
            isChanged = true;
        }

        if (keyboardState.IsKeyDown(Keys.Up))
        {
            xAngle -= 0.010f;
            isChanged = true;
        }
        else if (keyboardState.IsKeyDown(Keys.Down))
        {
            xAngle += 0.010f;
            isChanged = true;
        }

        if (xAngle > 0.2f)
            xAngle = 0.2f;
        else if (xAngle < -0.2f)
            xAngle = -0.2f;

        if (isChanged)
            UpdateViewMatrix();
    }

    private void UpdateViewMatrix()
    {
        Matrix rotationMatrix =
            Matrix.CreateTranslation(new Vector3(-camTarget.X, -camTarget.Y, -camTarget.Z)) *
            Matrix.CreateRotationX(3 * xAngle) *
            Matrix.CreateRotationY(3 * yAngle) *
            Matrix.CreateTranslation(camTarget);
        Vector3 transformedVector = Vector3.Transform(camPosition, rotationMatrix);

        viewMatrix = Matrix.CreateLookAt(transformedVector, camTarget, camUpVector);
    }

    public void SetUpCamera(GraphicsDevice device)
    {
        camPosition = new Vector3(350, -700, -500);  // default
        camTarget = new Vector3(350, 0, 300);        // default
        camUpVector = new Vector3(0, -1, 0);         // default

        viewMatrix = Matrix.CreateLookAt(camPosition, camTarget, camUpVector);

        viewAngle = MathHelper.PiOver4;
        aspectRatio = device.Viewport.AspectRatio;
        nearPlane = 5.0f;
        farPlane = 10000.0f;
        projectionMatrix = Matrix.CreatePerspectiveFieldOfView(viewAngle, aspectRatio, nearPlane, farPlane);
    }

}

Canonical founder Mark Shuttleworth announced that Ubuntu 10.04, the next major version of the popular Linux distribution, will be called Lascivious Liger Lucid Lynx. This version is highly significant because it will be offered with long-term support (LTS).

For the Lucid Lynx, the development team will focus their efforts on quality and stability! The main plans are to make Ubuntu 10.04 a bug-free operating system and bring quality improvements to the user interface, boot and installation experience and  top-notch hardware support. Another essential goal for Ubuntu 10.04 LTS (Lucid Lynx) will be to improve the startup speed to a 10 second boot!

Introduction to Linux Mint 8:

The 8th release of Linux Mint comes with numerous bug fixes and a lot of improvements. In particular Linux Mint 8 comes with support for OEM installs, a brand new Upload Manager, the menu now allows you to configure custom places, the update manager now lets you define packages for which you don’t want to receive updates,the software manager now features multiple installation/removal of software and many of the tools’ graphical interfaces were enhanced.

Highlights of Linux Mint 8:

· Based on Ubuntu 9.10;
· Linux kernel 2.6.31;
· EXT4 filesystem;
· X.Org 7.4;
· GNOME 2.28.1;
· Improvements to the Menu;
· Improvements to the software manager;
· Improvements to the update manager;
· New Upload manager tool;
· Lots of bugs fixed.

System requirements:

A minimum of 512MB of RAM is recommended. Once installed the system works fine with as low as 256MB RAM. The installation process deals with 2.5GB of data compressed on a 700MB CD and it can hang or fail on systems with less than 512MB RAM. If you have between 256MB and 512MB RAM you may have to try to install several times

Download Linux Mint 8:

You can download the Main and Universal editions of Linux Mint 8 via torrent or via HTTP:

Main edition:

• size: 688MB LiveCD
• MD5Sum: 06fc2f27f8352a2bac5516b86c020755
• Torrent download: http://www.linuxmint.com/torrent/LinuxMint-8.iso.torrent
• HTTP download: http://www.linuxmint.com/edition.php?id=44

Universal edition:

• size: 1GB LiveDVD
• MD5Sum: e297a2cdf1b1c6408ac6a6d76833933a
• Torrent download: http://www.linuxmint.com/torrent/LinuxMint-8-Universal.iso.torrent
• HTTP download: http://www.linuxmint.com/edition.php?id=45

Asia:

• http://ftp.jaist.ac.jp/pub/Linux/LinuxMint-ISO/stable/8/ (Japan)
• http://ftp.riken.jp/pub/Linux/linuxmint/stable/8/ (Japan)

Europe:

• http://gd.tuwien.ac.at/linux/mint/isos/stable/8/ (Austria)
• http://mint.nano-box.net/iso/stable/8/ (Bulgaria)
• http://mirrors.cytanet.com.cy/linux/mint/stable/8/ (Cyprus)
• http://ftp.klid.dk/ftp/linuxmint/stable/8/ (Denmark)
• ftp://ftp.linuxmint-fr.org/pub/linuxmint.com/stable/8/ (France)
• http://linuxmint.cybermirror.org/stable/8/ (Germany) *
• http://ftp.cc.uoc.gr/mirrors/linux/linuxmint/stable/8/ (Greece)
• http://ftp.heanet.ie/pub/linuxmint.com/stable/8/ (Ireland)
• ftp://ftp.tpnet.pl/pub/linux/linuxmint/isos/stable/8/ (Poland) *
• http://cesium.di.uminho.pt/pub/linuxmint/stable/8/ (Portugal)
• http://ftp.df.lth.se/pub/linuxmint/stable/8/ (Sweden)
• http://mirror.sov.uk.goscomb.net/linuxmint.com/stable/8/ (UK)

Northern America:

• http://mirror.csclub.uwaterloo.ca/linuxmint/stable/8/ (Canada)
• http://mirror.amarillolinux.com/linuxmint/stable/8/ (USA)
• http://mint.ez.by/linuxmint.com/stable/8/ (USA)
• ftp://linuxfreedom.com/linuxmint/linuxmint.com/stable/8/ (USA)
• http://ftp.cs.rose-hulman.edu/linuxmint/stable/8/ (USA) *
• http://linuxmint.secsup.org/stable/8/ (USA)
• ftp://mirrors.secution.com/linuxmint.com/stable/8/ (USA)
• http://mira.sunsite.utk.edu/linuxmint/stable/8/ (USA) *

Rest of the World:

• http://mirror.aarnet.edu.au/pub/linuxmint/stable/8/ (Australia) *
• ftp://mirror.unej.ac.id/pub/iso/linux-mint/stable/8/ (Indonesia) *

* Mirrors marked with a star weren’t fully synched when this announcement was made.

What is Linux Mint? Linux Mint is an elegant, easy-to-use, up-to-date, 100% free and comfortable Linux desktop distribution based on the very popular Ubuntu operating system. It offers paid commercial support to companies and individuals. Also, free community support is available from the forums and the IRC channel.

Linux Mint is based on Ubuntu and the two distributions have much in common. Both distributions use the same software repositories. For instance, release 6 (“Felicia”) uses the package pools of Ubuntu “Intrepid Ibex” (8.10). Most packages are the same on both distributions, and as of Linux Mint 6 ‘Felicia’, each Linux Mint release is based on Ubuntu, whereas before they were based on the previous Linux Mint release.

Most differences are on the desktop. Linux Mint has a stated focus on elegance, and it includes a number of applications that are not available in Ubuntu

Game Title : INVADERZ

Genre : Shoot ‘em up

Type : Game 3D

Framework : XNA Game Studio 3.1

Tool :

-    Visual Studio 2008 Professional SP 1
-    SpriteFont 1.2

DOWNLOAD HERE

Problem yang pertama adalah mengenai longest common subsequence dengan menggunakan tiga sekuen. Algoritma ini memiliki tujuan untuk mendapatkan subsekuen yang sama secara berurutan dan tentunya yang paling panjang dari ketiga subsekuen.

Contoh :

Sekuen Pertama : SURABAYA
Sekuen Kedua : SURAKARTA
Sekuen Ketiga : PASURUAN
Hasil : SURA

Algoritma

Algoritma solusi menggunakan solusi dynamic programming. Sebenarnya LCS dengan tiga sekuen sama saja dengan LCS menggunakan dua sekuen. Namun bedanya disini, dalam mengelesaikan LCS dengan tiga string, dibutuhkan array tiga dimensi yang volumenya adalah X.Y.Z dimana X, Y, dan Z adalah panjang dari ketiga sekuen.
Solusi optimal yang dihasilkan akan didapatkan di elemen array yang terakhir, yaitu array dengan indeks X-1, Y-1, dan Z-1
Petbedaan lainnya dalam LCS menggunakan tiga sekuen, arah/direction yang perlu di-cek adalah sebanyak tujuh arah. Tujuh arah tersebut yang direpresentasikan dengan angka adalah sebagai berikut :

0 menuju ke c[i - 1, j - 1, k - 1]
1 menuju ke c[i - 1, j - 1, k]
2 menuju ke c[i - 1, j, k - 1]
3 menuju ke c[i, j - 1, k - 1]
4 menuju ke c[i, j, k - 1]
5 menuju ke c[i, j - 1, k]
6 menuju ke c[i - 1, j, k]

Algoritma LCS-Length

LCS-LENGTHX, Y, Z, c then
    // menginisiasi array c
    for i <-- 0 to X.Length-1 do
        for j <-- 0 to Y.Length-1 do
            for k <-- 0 to Z.Length-1 do
                c[i, j, k].Value <-- 0   // tidak memiliki nilai
                c[i, j, k].Direction <-- -1    // tidak memiliki arah

     // looping sebanyak X.Y.Z dimana masing-masing
     // adalah panjang dari subsequence then
     for i <-- 0 to X.Length-1 do
        for j <-- 0 to Y.Length-1 do
            for k <-- 0 to Z.Length-1 do

                max <-- 1 // variabel nilai temporari
                dir <-- -1 // variabel arah temporari

                if Xi = Yj = Zk then
                    // mendapatkan karakter
                    max <-- c[i - 1, j - 1, k - 1].Value + 1
                    // yang cocok
                    dir <-- 0
                else
                    // tidak mendapatkan karakter yang cocok,
                    // maka mencari nilai maksimal

                    if c[i - 1, j - 1, k].Value > max then
                        max <-- c[i - 1, j - 1, k].Value
                        dir <-- 1

                    if c[i - 1, j, k - 1].Value > max then
                        max <-- c[i - 1, j, k - 1].Value
                        dir <-- 2

                    if c[i, j - 1, k - 1].Value > max then
                        max <-- c[i, j - 1, k - 1].Value
                        dir <-- 3

                    if c[i, j, k - 1].Value > max then
                        max <-- c[i, j, k - 1].Value
                        dir <-- 4

                    if c[i, j - 1, k].Value > max then
                        max <-- c[i, j - 1, k].Value
                        dir <-- 5

                    if c[i - 1, j, k].Value > max then
                        max <-- c[i - 1, j, k].Value
                        dir <-- 6

                // inputkan nilai maksimal
                c[i, j, k].Value <-- max
                c[i, j, k].Direction <-- dir

Algoritma Print-LCS

PRINT-LCS(c, X, i, j, k)
    // sudah sampai sisi dari array tiga dimensi
    // maka stop
    if i = 0 or j = 0 or k = 0 then
        return

    // mengecek arah pada tabel c
    if c[i, j, k].Direction = 0 then
        PRINT-LCS(c, X, i - 1, j - 1, k - 1)
        print(Xi)
    else if c[i, j, k].Direction = 1 then
        PRINT-LCS(c, X, i - 1, j - 1, k)
    else if c[i, j, k].Direction = 2 then
        PRINT-LCS(c, X, i - 1, j, k - 1)
    else if c[i, j, k].Direction = 3 then
        PRINT-LCS(c, X, i, j - 1, k - 1)
    else if c[i, j, k].Direction = 4 then
        PRINT-LCS(c, X, i, j, k - 1)
    else if c[i, j, k].Direction = 5 then
        PRINT-LCS(c, X, i, j - 1, k)
    else if c[i, j, k].Direction = 6 then
        PRINT-LCS(c, X, i - 1, j, k)

Implementasi menggunakan C#

Fungsi LCS-Length

        /// Fungsi ini akan mengisi tabel c yang berupa instansiasi dari
        /// Entity yang memiliki dua informasi, yaitu nilai dan arah
        /// Dari tabel c ini, kita akan dapat mengetahui solusi optimal dari lcs
        /// </summary>
        /// <param name="X"></param>
        /// <param name="Y"></param>
        /// <param name="Z"></param>
        /// <param name="c"></param>
        private void LCSLength(string X, string Y, string Z, Data[, , ] c)
        {
            // menginisiasi array c
            for (int i = 0; i < X.Length; i++)
                for (int j = 0; j < Y.Length; j++)
                    for (int k = 0; k < Z.Length; k++)
                    {
                        c[i, j, k].Value = 0;           // tidak memiliki nilai
                        c[i, j, k].Direction = -1;      // tidak memiliki arah
                    }

            // looping sebanyak X.Y.Z (dimana masing-masing adalah panjang
            // dari subsequence)
            for (int i = 1; i < X.Length; i++)
                for (int j = 1; j < Y.Length; j++)
                    for (int k = 1; k < Z.Length; k++)
                    {

                        numOfIteration++;

                        int max = -1; // variabel nilai temporari
                        int dir = -1; // variabel arah temporari

                        if (X[i] == Y[j] && Y[j] == Z[k])
                        {
                            max = c[i - 1, j - 1, k - 1].Value + 1; // mendapatkan
                                                                    // karakter
                            dir = 0;                                // yang cocok
                        }
                        else
                        {   // tidak mendapatkan karakter yang cocok,
                            // maka mencari nilai maksimal

                            if (c[i - 1, j - 1, k].Value > max)
                            {
                                max = c[i - 1, j - 1, k].Value;
                                dir = 1;
                            }

                            if (c[i - 1, j, k - 1].Value > max)
                            {
                                max = c[i - 1, j, k - 1].Value;
                                dir = 2;
                            }

                            if (c[i, j - 1, k - 1].Value > max)
                            {
                                max = c[i, j - 1, k - 1].Value;
                                dir = 3;
                            }

                            if (c[i, j, k - 1].Value > max)
                            {
                                max = c[i, j, k - 1].Value;
                                dir = 4;
                            }

                            if (c[i, j - 1, k].Value > max)
                            {
                                max = c[i, j - 1, k].Value;
                                dir = 5;
                            }

                            if (c[i - 1, j, k].Value > max)
                            {
                                max = c[i - 1, j, k].Value;
                                dir = 6;
                            }
                        }

                        // inputkan nilai maksimal
                        c[i, j, k].Value = max;
                        c[i, j, k].Direction = dir;

                    }

        }

Fungsi Print-LCS

        /// <summary>
        /// Fungsi ini akan mencetak solusi dari lcs dengan
        /// melakukan pembacaan secara rekursif terhadap tabel c
        /// </summary>
        /// <param name="c">tabel c yang berupa array tiga dimensi</param>
        /// <param name="X">Sekuen pertama</param>
        /// <param name="i">indeks array i</param>
        /// <param name="j">indeks array j</param>
        /// <param name="k">indeks array k</param>
        private void PrintLCS(Data[, , ] c, string X, int i, int j, int k)
        {
            // sudah sampai sisi dari array tiga dimensi
            // maka stop
            if (i == 0 || j == 0 || k == 0)
                return;

            // mengecek arah pada tabel c
            switch (c[i, j, k].Direction)
            {
                case 0:
                    PrintLCS(c, X, i - 1, j - 1, k - 1);
                    solution.Add(X[i]); // print solusi optimal
                    break;

                case 1:
                    PrintLCS(c, X, i - 1, j - 1, k);
                    break;

                case 2:
                    PrintLCS(c, X, i - 1, j, k - 1);
                    break;

                case 3:
                    PrintLCS(c, X, i, j - 1, k - 1);
                    break;

                case 4:
                    PrintLCS(c, X, i, j, k - 1);
                    break;

                case 5:
                    PrintLCS(c, X, i, j - 1, k);
                    break;

                case 6:
                    PrintLCS(c, X, i - 1, j, k);
                    break;
            }
        }

Database merupakan tempat penyimpanan data, yang memudahkan pengolahan dan pencarian data. SQL Server 2008 merupakan DBMS (Database Management System) yang powerfull untuk mengolah data. Di samping memiliki user interface yang mudah digunakan,. SQL Server 2008 juga memiliki fitur tambahan yang bisa diimplementasikan untuk meningkatkan performa dan mengurangi tempat penyimpanan

Berikut ini file tutorial instalasi SQL Server 2008 Enterprise yang saya buat dalam bentuk file *.doc :

< DONWLOAD TUTORIAL >