Saindra Santyadiputra

Kue Tape Keju Coklat

2011-01-25T18:28:00.001+07:00

[V] Telor
[V] Terigu
[V] Baking soda
[V] Gula pasir
[V] Tape
[V] Maezena
[V] Keju
[V] Minyak klp
[V] Coklat btang

posted from Bloggeroid

[TESTING] BLOGGEROID FOR ANDROID ON SAMSUNG GALAXY S

2010-12-28T14:34:00.001+07:00

Iseng2 cr aplikasi posting ke blog dr mobile phone.. Ketemu Blogger-droid.. Search aj d market dengan keyword blog.. Psti ktemu..

Menjelang 2011.. Mudah2an content blog ini bs terus terupdate.. Hehe.. Myb akan ada map dota baru n tutorial2.. Blkngan ne lumayan dpt pengetahuan baru.. Jd hrus bnyk di share..

Ok cukup utk hari ini.. sekian dan terimakasih..

Latest DotA Map: v6.66b and v6.66b AI Map

2010-02-03T08:02:00.000+07:00

* Fixed a major exploit recently discovered

* Recoded Bounty Hunter's wind walk damage bonus as to not require two separate attacks to trigger his new passive

* Some Doombringer nerfs:

* Readjusted the Divine Rapier pickup rules to prevent some abuses.

* -unlock now requires a majority vote before the gold and items of a leaver will be released. As a reminder, once a hero is unlocked, it cannot be switched.

* Added a 15 second wait period before the drafting begins in -CD to give both teams a chance to look at the heroes.

* Renamed the controlon/off commands to be clearer which is which. They are now -disableselection (-ds) and -enableselection (-es)

* Various map optimizations
* Fixed an old recipe fusing exploit with leaver items that could result in crashes
* Fixed Essence Shift on units that change form
* Fixed a couple of bugs with Dark Pact debuff
* Added replay data for creep kills/denies (at time intervals,
format: "CSK"+I2S(PlayerID),value and "CSD"+I2S(PlayerID),value)
* Fixed various tooltips
* Fixed gold not being split after using -unlock when someone leaves via -kickafk
* Fixed being able to -unlock while a switch vote is ongoing
* Fixed some spells incorrectly triggering Magic Stick/Essence Aura (Devoured Neutral Troll Priests Heal, Radiance Swap, etc)
* Fixed some -CD language text issues as well as some missing parser information
* Fixed Arcane Ring recipe purchase hotkey
* Fixed some potential Basher bugs on some levels of Spirit Bear
* Fixed an abuse possible with one hero carrying multiple Urn of Shadows
* Fixed the second Forged Spirit from being added to your control despite having control helper turned off
* Fixed a bug with -switch when you have Rapier (that you don't own) on you
* Fixed a few other misc minor bugs

DOWNLOAD DotA Map v6.66b HERE

DOWNLOAD DotA Map v6.66b AI HERE

Enable Hide Inactive Icons Tray Using Registry in Windows

2010-01-26T20:51:00.001+07:00

Many of the Windows XP, Windows Vista or Windows 7 users usually find that the Auto Hide Inactive Icons tray from the taskbar has stopped working or it is missing inspite of enabling it from the control panel or the taskbar properties. This problem is very common. May be after reboot it may work again, but for some systems the tray may never come up. This tray will hide the inactive and unnecessary icons from the taskbar. So many people like this feature. Making it work again is what we are talking about here. See the images below where one is not having hide inactive Icon tray and another one is having it:

Enabling the Inactive icon tray consists of changing only a single registry. Its an easy process. There are two methods given below. Both the methods needs registry editing to be enabled. If your Registry editing has been disabled by the administrator then visit: How to enable Registry Editor (REGEDIT) to enable it.

Method 1: Using Elevated Command Prompt

Step1: Copy the whole command from the table below:

REG ADD HKCUSoftwareMicrosoftWindowsCurrentVersionExplorer /t REG_DWORD /v EnableAutoTray /d 1 /f

Step 2: Open a Command Prompt (Press Start + R, type cmd and Enter). Paste the command you had copied into the Command Prompt. In order to paste in Command Prompt right click and select paste.

Step 3: Press Enter to execute the command. It should execute successfully.
Step 4: Log Off your computer and Log On again. Now your Hidden Icon tray will be working.

Method 2: Using Registry Editor

Step 1: Open a Registry Editor(Press Start + R, type regedit and Enter)
Step 2: Go to the registry key path given below:

HKEY_CURRENT_USERSoftwareMicrosoftWindowsCurrentVersionExplorer

Step 3: In the Right Side of the registry editor see for the value EnableAutoTray. [If you are not able to find it, create a new value with the same name. To create a, value right click anywhere on the right pane and select New DWORD. Change the Name to EnableAutoTray(Press F2 for name change)]. Double click on EnableAutoTray and change the value to 1.

Step 4: Now close the editor and log off your computer. Log On and you will find your tray is working.
Congratulations you have enabled your Auto Hide Inactive Icons.
Note:
1. Log Off means complete logging off the computer not Locking the computer like pressing Start+L.
2. Restarting the computer will also work after the performing the procedure.
3. If you change the Value as 0 the it will disable the Tray.
4. This method works for windows XP, Vista and 7.

Download Registry Script Here

DotA Map v6.66 Released!

2010-01-16T16:04:00.001+07:00

Batrider
- Flaming Lasso cooldown decreased from 130/90/50 to 90/70/50

Beastmaster
- Wild Axes now properly hits invisible units

Bounty Hunter
- Jinada cooldown improved from 22/17/12/7 to 21/16/11/6

Clockwerk
- Rocket Flare cooldown decreased from 30/25/20/15 to 20/18/16/14

Dirge
- Added Aghanim's Scepter for Undying.

Doom Bringer
- Reworked and rebalanced most of his abilities

Earthshaker
- Echo Slam no longer counts corpses for damage Echo damage (They used to count them for partial damage)
- Aftershock AoE from 280 to 300
- Enchant Totem damage increased from 50/100/150/200 to 75/150/225/300
- Added Aghanim's Scepter to Earthshaker's Echo Slam (echo bounces twice for each hero it hits)
- Echo Slam's Echo damage increased from 35/45/65 to 40/55/70
- Echo Slam's unit search aoe increased by 75 (this is not the damage aoe, just the initial unit search aoe)
- Note: The main idea with most of these changes is to emphasis the timing aspect of the echo slam more. Some other buffs are done to compensate for the reduced power from the corpse count loss.

Enchantress
- Movement speed increased from 295 to 305
- Enchant's slow effect increased from 10/20/30/40% to 20/30/40/50%
- Enchant's slow effect duration decreased from 7 to 5.5 seconds

Faceless Void
- Timewalk slow increased from 10/20/30/40% to 25/30/35/40%
- Timewalk cooldown rebalanced from 13 to 19/17/15/13

Invoker
- Invoke cd from 30/25/12/5 cd to 22/17/12/5
- Invoke manacost from 20/50/80/110 to 20/40/60/80
- Alacrity bonus damage increased from 20-80 to 30-90
- Alacrity duration increased from 8 to 9
- Chaos Meteor damage improved:
Main damage from 40-130 to 55-145 every 0.5 seconds
Burn damage from 8-26 to 11-29 per second
- Cold Snap now applies an initial ministun on cast
- Forged Spirits Armor is now based on Exort and Range is now based on Quas
- Ghost Walk manacost reduced from 300 to 200
- Ghost Walk slow rescaled from 10-40% to 20-40%
- Ice Wall manacost increased from 125 to 175
- Ice Wall cooldown increased from 20 to 25
- Sun Strike damage rescaled from 75-450 to 100-475
- Tornado range increased from 700-3100 -> 800-3200
- Tornado duration increased from 0.6-2.2 -> 0.8-2.5
- Tornado damage increased from max of 375 to 400
- Quas per instance regen from 0.75 to 1

Juggernat
- Blade Fury cooldown reduced from 30 to 30/28/26/24

Kaldr
- Cold Feet manacost increased from 90 to 90/100/110/120
- Ice Blast impact delay is a little slower now
- Ice Blast no longer pierces Shallow Grave
- Ice Blast debuff is now purgable

Ogre Magi
- Fireblast Multicast upgraded cooldown improved from 15/12/9/6 to 12/10/8/6

Obsidian Destroyer
- Essence Aura no longer has a lower chance to trigger when autocasting Arcane Orb

Priestess of the Moon
- Moonlight Shadow manacost from 200/250/300 to a constant 175

Pugna
- Decrepify cast range increased from 550 to 550/600/650/700

Queen of Pain
- Scream of Pain now affects Decrepified units

Spirit Breaker
- Nether Strike now makes Spirit Breaker magic immune for the second that he is fading out during its cast
- Charge of Darkness decreased manacost from 120 to 75
- Charge of Darkness cast mechanic reworked

Slark
- Pounce Leash now gets removed if the target blinks or teleports away
- Shadow Dance passive no longer works if Slark is Doomed

Ursa Warrior
- Undid previous cast animation change on Overpower
- Fixed a bug in the recent Overpower rewrite that prevented it from being removed by purge/euls

Visage
- Soul Assumption damage per charge decreased from 130 to 110
- Soul Assumption manacost from 100/120/140/160 to 100
- Soul Assumption cooldown from 7/6/5/4 to 4
- Familiars Bounty reduced from 150 to 100
- Familiars now magic reduction from 70/95/95% to 95% at all levels
- Familiars bonus damage attack bonus attack damage from 72/90/100 to 84/105/126
- Familiars now have a small (160) ranged attack instead of melee
- Gravekeeper's Cloak recharge time improved from 14/12/10/8 to 10/9/8/7

Warlock
- Fatal Bonds damage increased from 3.75/7.5/11.25/15% to 15%
- Fatal Bonds link count reduced from 5 to 2/3/4/5

Aghanim's Scepter
- Added Undying and Earthshaker

Divine Rapier
- Can no longer be destroyed by attacking the item
- If a player other than the original owner of the Rapier picks it up, they cannot drop it

Force Staff
- Double clicking force staff now acts as if you clicked on yourself

Maelstrom & Mjollnir
- Increased max bounces from 3 to 4

Phase Boots
- Cooldown from 12 seconds to 10 seconds
- Duration from 6 seconds to 5 seconds
- Movement bonus from 10% to 12%

Scroll of Town Portal
- Double clicking on scrolls now automatically targets your fountain

* Switch now only works as long as the items of the leaver remain intact. Once someone leaves, the inventory of that hero becomes locked. Players can use an -unlock command, but once that is done switch cannot be used on that hero anymore. Once this feature is used enough to be considered stable, switch will be usable by default (-so mode won't be required) with the restrictions described above. The gold that the leaver is carrying is also frozen until the hero is either unlocked or swapped.

* Added a new command, "-controloff"/"-controlon", to disable control help in the game (to prevent stuff like adding summoned units to your current selection: Invoker, Techies, Lanaya, etc)
* Added a new test command to toggle creeps spawn off and on -spawnoff/-spawnon
* Restored -mc, but with more detailed statistics to match up with the recently changed Multicast chance system
* To prevent some abuses with -unstuck, it no longer works if your taking damage during the first few seconds after you enter the command

* Doubled Satyr Trickster manapool and purge manacost (primarily affects just stolen ability via Devour)
* Fixed the teleport effects sometimes being visually on an angle
* Fixed Nightcrawler status buff text format
* Fixed Tango visual buff being slightly inaccurate (this is just a cosmetic improvement/fix)

* Added a visual effect for allied players to indicate which creep you infesting
* Added a new sound set for Furion (91160)
* Added a new sound set for Clockwerk
* Added a new visual effect for Spirit Lance
* Added new charge icon for Soul Assumption (137459)
* Disabled visual charge indication if the cooldown for Soul Assumption is not ready
* Added a new overhead indictor for Soul Assumption (137459)
* Added an visaul effect when Eclipse misses to help players keep track (109017)
* Phantom Assassin images now have the proper fade visual effect (114120)
* Improved Eyes In The Forest cast animation (95740)
* Added new visual effect for Flesh Golem (51874)

* Game mode status, rune messages and a few other misc strings are now externalized properly to allow for more flexible translation choices
* Added replay parsing data for assists (Format: "Assist"+I2S(KillerId),DyingId)

* Fixed a few areas where you could get stuck in using TP scrolls
* Fixed Malefice not reliably working if the enemy is fogged
* Fixed Last Word from firing off on the precast for Ice Blast and Unstable Concoction
* Fixed Ice Blast indicator staying at edge of map until you release it
* Fixed Ice Blast debuff from overriding Time Lapse
* Fixed some Dark Pact bugs
* Fixed Essence Shift from piercing Shallow Grave
* Fixed Essence Shift sometimes not registering properly at high attack speeds
* Fixed Murloc sometimes not attacking the pounced target
* Fixed dispersion damage on creeps
* Fixed bugs with Charge of Darkness interaction with euls and ghost scepter
* Fixed some mac specific bugs

DOWNLOAD DotA MAP v 6.66 HERE!

Avenged Sevenfold’s Drummer "The Rev" is DEAD

2009-12-30T10:26:00.000+07:00

Avenge Sevenfold’s ‘The Rev’ reportedly died of natural causes today. According to Fox News, James (Jimmy) Owen Sullivan aka “The Rev” was found dead at his home in Southern California. He was a backup vocalist and drummer for the Southern California band, “Avenged Sevenfold.”

They say James Owen Sullivan who went by the stage name, “The Rev” appears to have died of natural causes today in Huntington Beach,California. He was only 28 years old. The Orange County coroner’s office is reportedly investigating the death.

The Avenged Sevenfold band was formed in Huntington Beach,California back in 1999 and won “Best New Artist” at the 2006 MTV Video Music Awards. Also they were working on their fifth album,according to their Myspace page.

The band released a statement earlier to today,stating :

It is with great sadness and heavy hearts that we tell you of the passing today of Jimmy “The Rev” Sullivan. Jimmy was not only one of the world's best drummers, but more importantly he was our best friend and brother. Our thoughts and prayers go out to Jimmy's family and we hope that you will respect their privacy during this difficult time.

Jimmy you are forever in our hearts.
We love you.

M Shadows, Synyster Gates, Zacky Vengeance and Johnny Christ

Sullivan was found dead at his home in Huntington Beach on Monday, December 28, 2009, at 11:00 a.m. The Orange County Police Department is investigating his death; they said that it appeared to be due to natural causes.

DotA Map v6.65 Released!

2009-12-25T22:31:00.001+07:00

- New agility hero (Murloc Nightcrawler)

- New intelligence hero (Ancient Apparition)

Alchemist
- Reworked Unstable Concoction

Anti-Mage
- Mana Void cooldown reduced from 120/100/80 to 70
- Mana Break scaling increased from 16/32/48/64 to 28/40/52/64

Bone Fletcher
- Searing Arrows cooldown from 2/2/0/0 to 2/0/0/0

Bounty Hunter
- Reworked Jinada

Blood Seeker
- Bloodrage Rebalanced from 6/9/12/15 duration and 10 cd to 6/7/8/9 duration and 12/10/8/6 cd. HP loss at a constant 20 hp per sec.

Broodmother
- Spiderlings gold bounty increased from 6-8 to 11-13 and XP bounty increased from 12 to 20

Chaos Knight
- Cast Point Improved
- Reworked his Blink Strike (7225)

Dark Seer
- Vacuum cast range decreased from 800 to 550
- Vacuum damage decreased from 60/120/180/240 to 40/80/120/160

Death Prophet
- Witchcraft's movement bonus has been restored (3/6/9/12%)

Furion
- Force of Nature's Treants now have 33% spell resistance

Lina
- Fiery Soul buff duration increased from 5 to 7 seconds

Leshrac
- Movement speed increased from 300 to 310

Medusa
- Stone Gaze cooldown increased to 100

N'aix
- Movement speed increased from 300 to 315

Night Stalker
- Void manacost decreased from 90/112/130/145 to 80/90/100/110

Panda
- Lowered Fire Panda armor by 2 points, hp from 900/1350/1800/2200 to 1200 and reworked damage from 52/105/214/234 to 70/112/140/180
- Primal Split cooldown from 180/150/120/90 to 180/160/140/120

Priestess of the Moon
- Starfall AoE increased by 50 to fix issues with it not hitting units on the edge of your attack

Pudge
- Meat Hook scaling rebalanced. Cast range from 400/600/800/1000 to 550/700/850/1000, cd from 14 to 14/13/12/11 and manacost from 140 to 110/120/130/140

Pugna
- Cast Point improved
- Decrepify can now be cast on Nether Ward

Queen of Pain
- Base Intelligence increased by 5

Razor
- Agi growth decreased from 2.5 to 2.0
- Strength grown decreased from 1.9 to 1.7
- Eye of the Storm mana cost increased from 100 to 100/150/200

Shadow Priest
- Shallow Grave cooldown increased from 54/40/26/12 to 60/45/30/15

Silencer
- Base damage modified a little from 39-61 to 43-57

Sniper
- Shrapnel duration decreased from 10 to 8 seconds
- Shrapnel AoE decreased from 450 to 325

Spectre
- Dispersion now spreads the reflected damage over the number of nearby heroes. So it is the same in a 1v1 case, but greatly reduced in team fights.

Twin Head Dragon
- Ice Path stun rescaled from 0.8/1.2/1.6/2.0 to 1.00/1.33/1.66/2.0
- Ice Path cooldown scales from 16 to 16/15/14/13
- Macropyre spawn speed improved

Ursa
- Overpower is no longer removed when BKB is activated
- Overpower will not interrupt your movement when cast

Warlock
- Upheaval cooldown increased from 20 to 65 seconds

Visage
- Reworked hero (124153)

Windrunner
- Windrunner cooldown improved from 30/25/20/15 to 15

Witch Doctor
- Paralyzing Casks now do 50 damage to heroes on each bounce

- Added a new recipe item (Urn of Shadows)

Scroll of Town Portal
- Reworked mechanics

Aghanim's Scepter
- Added support for Axe. Cooldown decreased from 75/65/55 to 20

Boots of Speed
- Now available in the side shops

Blademail
- Duration reduced from 5 to 3.5 seconds
- Cooldown increased from 15 to 25
- Blademail can no longer reflect blademail sourced damage

Force Staff
- Push distance increased from 500 to 600

Linken's Sphere
- Properly blocks Unstable Concoction and Death Coil

Maelstrom
- Maelstrom attack speed bonus increased from 15 to 25

Planeswalker's Cloak
- Price increased by 100

: Radiance
- AoE damage effect can now be toggled on and off

Vanguard
- Damage block reduced from 40 to 20 when equipped on ranged heroes (50% less block like stout and Poor Man's Shield)

* Readjusted the -bonus gold/xp system that is given in an aoe around dying heroes from being static unsplit to a dynamic split variation (numbers adjusted as well)

* Rebalanced the creep stats for your creeps when you kill an enemy rax

* Added a new small neutral camp (102473)
* Increase the buffer time in -CM from 45 to 60 seconds (This means 15 seconds total for each player, not 15 seconds for each turn)
* Added the new hero death timers to observer scoreboard title
* Reworked Recipe tooltips (128284)
* A text message and minimap indictator is now displayed when an ally purchases a Courier
* Observer board now shows ultimate cooldowns (120509)
* Added a new physical model for Gem of Truesight (124547)
* New and reworked heroes are temporarily unavailable in -CM

* Added a new visual effect when you have the Haste powerup (83240)
* A special death animation is now played when Pudge suicides (17542)
* Improved spawning location code for couriers, to help against minimap icon overlap
* Decreased cooldown on Courier Morph and added a mini techies courier (123947)
* Fixed Inner Beast buff icon
* Removed extra spikes that appear on some (except Leshrac) characters with Aghanims Scepter (11289)
* Added new sound effect for Scream of Pain
* Improved quality of Panda's Thunderclap icon
* Removed the gorge in the terrain near the bottom sentinel lane
* Added visual effect for Huskar's Scepter (20814)
* Some Nighstalker visual improvements (5227)
* Rotated the direction the Frozen Throne is facing (82193)
* Changed Scourge consumable shop model from Graveyard to Tomb of Relics (114591)
* Added hero pick/ban data to replays for -CD mode (same data format as -CM)
* Added hero pool information to replays for -CD mode (Format: Pool+index,id)
* Fixed hero death timer overwriting player name color for leavers

* Added a camera control command (-center) that locks the camera to your hero. -centeroff disables it (Not recommend for regular games)
* Clarified Ward tooltips
* Fixed lots of typos
* Replay Data: host playerid is 0 if the game was created using HCL automode
* Adjusted where the kill timer shows on the open scoreboard. Names are always visible now.
* Some minor code optimizations when heroes are picked
* Invoker: Forged Spirit units are now added to your control group when created
* Invoker: Added an Ally/Observer only visual effect that plays before sun strike lands

* New icon for Essence Aura
* New icon for Darkness
* New icon for Desolate
* New icon for Void (126145)
* New icon for Enchant (126145)
* New icon for Impetus (126145)
* New icon for Nature's Attendants (126145)
* New icon for Backtrack (126145)
* New icon for SA's Blink Strike (126145)
* New icon for Crystal Nova (118362)
* New icon for Death Ward (126145)
* New icon for Divided We Stand (126145)
* New icon for Dual Breath (126145)
* New icon for EMP (126145)
* New icon for Exorcism (126145)
* New icon for Geostrike (126145)
* New icon for Impale NA (126145)
* New icon for Juxtapose (108662)
* New icon for Phantom Edge (108662)
* New icon for Malefice (126145)
* New icon for Reaper's Scythe (126145)
* New icon for Timelock (126145)
* New icon for Timewalk (126145)
* New icon for Invoke Tornado (126145)
* New icon for Last Word (126145)
* New icon for Amplify Damage (126145)
* New icon for Jinada (105435)
* New icon for Track (105435)

* Fixed bug with swapping with Kunkka and getting Quelling Blade
* Fixed Kraken Shell not getting disabled when Doomed
* Fixed an area where you could TP and become stuck
* Fixed a bug with Forged Spirits dying when getting an allied War Cry buff
* Fixed a recent issue with Frost Arrows cast range
* Fixed Eul's movement speed bonus not functioning correctly sometimes (if your hero has a unit morphing ability)
* Fixed a minor bug with Ursa's Enrage + Fury Swipes combo against Vanguard
* Fixed some Ion Shell stacking bugs

CLICK HERE FOR DOWNLOAD DOTA MAP v6.65

SQL VIEW: Create View, Update View, and Drop View

2009-12-03T11:44:00.000+07:00

A view is a virtual table. This chapter shows how to create, update, and delete a view.

CREATE VIEW

In SQL, a view is a virtual table based on the result-set of an SQL statement. A view contains rows and columns, just like a real table. The fields in a view are fields from one or more real tables in the database. You can add SQL functions, WHERE, and JOIN statements to a view and present the data as if the data were coming from one single table.


CREATE VIEW view_name AS
SELECT column_name(s)
FROM table_name
WHERE condition

Note: A view always shows up-to-date data! The database engine recreates the data, using the view's SQL statement, every time a user queries a view.

UPDATE VIEW

You can update a view by using the following syntax:


CREATE OR REPLACE VIEW view_name AS
SELECT column_name(s)
FROM table_name
WHERE condition

Now we want to add the "Category" column to the "Current Product List" view. We will update the view with the following SQL:


CREATE VIEW [Current Product List] AS
SELECT ProductID,ProductName,Category
FROM Products
WHERE Discontinued=No

DELETE VIEW

You can delete a view with the DROP VIEW command:


DROP VIEW view_name

MY EXERCISE

Create Table BARANG:


mysql> CREATE table barang (
-> kd_brg varchar(3) not null primary key,
-> nama_barang varchar(50),
-> harga_barang int)
-> engine=INNODB;
Query OK, 0 rows affected (0.09 sec)

Create Table JUAL:


mysql> create table jual (
-> tgl date,
-> kode varchar(3),
-> jml_jual int)
-> engine=INNODB;
Query OK, 0 rows affected (0.02 sec)

Insert Value Into BARANG:


mysql> insert into barang values
-> ('b01','Sepatu','50000'),
-> ('b02','Sandal','10000'),
-> ('b03','Handuk','25000'),
-> ('b04','Ember','5000'),
-> ('b05','Celana','20000');
Query OK, 5 rows affected (0.05 sec)
Records: 5  Duplicates: 0  Warnings: 0

Insert Value Into JUAL:


mysql> insert into jual values
-> ('09-08-23','b01','5'),
-> ('09-10-21','b02','10'),
-> ('09-11-14','b03','3'),
-> ('09-12-01','b04','7'),
-> ('09-12-01','b05','20');
Query OK, 5 rows affected (0.03 sec)
Records: 5  Duplicates: 0  Warnings: 0

Create Table View VIEW_JUAL:


mysql> CREATE VIEW VIEW_JUALAN as 
->     SELECT 
->     DATE_FORMAT(b.tgl,'%d %M %Y') as tgl,
->     b.kode, 
->     a.nama_barang,
->     a.harga_barang, 
->     b.jml_jual, 
->     (a.harga_barang*b.jml_jual) as total 
->   FROM jual b, barang a 
->   WHERE b.kode=a.kd_brg;
Query OK, 0 rows affected (0.05 sec)

Select It :)


mysql> SELECT * FROM VIEW_JUALAN;
+------------------+------+-------------+--------------+----------+--------+
| tgl              | kode | nama_barang | harga_barang | jml_jual | total  |
+------------------+------+-------------+--------------+----------+--------+
| 23 August 2009   | b01  | Sepatu      |        50000 |        5 | 250000 |
| 21 October 2009  | b02  | Sandal      |        10000 |       10 | 100000 |
| 14 November 2009 | b03  | Handuk      |        25000 |        3 |  75000 |
| 01 December 2009 | b04  | Ember       |         5000 |        7 |  35000 |
| 01 December 2009 | b05  | Celana      |        20000 |       20 | 400000 |
+------------------+------+-------------+--------------+----------+--------+
5 rows in set (0.00 sec)

[PASCAL PROGRAMMING] Binary Tree

2009-11-26T14:04:00.003+07:00

In computer science, a binary tree is a tree data structure in which each node has at most two children. Typically the first node is known as the parent and the child nodes are called left and right. In type theory, a binary tree with nodes of type A is defined inductively as TA = μα. 1 + A × α × α. Binary trees are commonly used to implement binary search trees and binary heaps.

Graph theorists use the following definition: A binary tree is a connected acyclic graph such that the degree of each vertex is no more than 3. It can be shown that in any binary tree, there are exactly two more nodes of degree one than there are of degree three, but there can be any number of nodes of degree two. A rooted binary tree is such a graph that has one of its vertices of degree no more than 2 singled out as the root.

With the root thus chosen, each vertex will have a uniquely defined parent, and up to two children; however, so far there is insufficient information to distinguish a left or right child. If we drop the connectedness requirement, allowing multiple connected components in the graph, we call such a structure a forest.

Another way of defining binary trees is a recursive definition on directed graphs. A binary tree is either:

A single vertex.
A graph formed by taking two binary trees, adding a vertex, and adding an edge directed from the new vertex to the root of each binary tree.

This also does not establish the order of children, but does fix a specific root node.

The groupings of pairs of nodes in a tree can be represented as pairs of letters, surrounded by parenthesis. Thus, (a b) denotes the binary tree whose left subtree is a and whose right subtree is b. Strings of balanced pairs of parenthesis may therefore be used to denote binary trees in general. The set of all possible strings consisting entirely of balanced parentheses is known as the Dyck language.

Given n nodes, the total number of ways in which these nodes can be arranged into a binary tree is given by the Catalan number Cn. For example, C2 = 2 declares that (a 0) and (0 a) are the only binary trees possible that have two nodes, and C3 = 5 declares that ((a 0) 0), (0 a) 0), (0 (a 0)), (0 (0 a)), and (a b) are the only five binary trees possible that have 3 nodes. Here 0 represents a subtree that is not present.

The ability to represent binary trees as strings of symbols and parentheses implies that binary trees can represent the elements of a magma. Conversely, the set of all possible binary trees, together with the natural operation of attaching trees to one-another, forms a magma, the free magma.

Given a string representing a binary tree, the operators to obtain the left and right subtrees are sometimes referred to as car and cdr.

SOURCE:


http://docs.google.com/Doc?docid=0AR5w-4kQFP95ZGZtN2hkbTlfMWdoMnRud2N0&hl=en

OUTPUT:


Inorder
1   2   4   8   9  10  12  13  15
preorder
8   4   1   2  12   9  10  15  13
postorder
2   1   4  10   9  13  15  12   8

9   4   1   2  12  10  15  13

Show an Animation about Binary Tree by clicking link below

http://www.cs.jhu.edu/~goodrich/dsa/trees/btree.html

And here is a COOL APPLET AVL TREE's, check this out..

http://webpages.ull.es/users/jriera/Docencia/AVL/AVL%20tree%20applet.htm

Normalization Exercise (1)

2009-11-26T13:39:00.000+07:00

Case:
Click here to see a NORMALIZATION CASE

Completion:

Create table SUPPLY


mysql> create table supply (
-> kode_supply varchar(3) not null primary key,
-> nama_supply varchar(50));
Query OK, 0 rows affected (0.03 sec)

Create table BARANG


mysql> create table barang (
-> kode_brg varchar(3) not null primary key,
-> nama_brg varchar(100));
Query OK, 0 rows affected (0.03 sec)

Create table PRIMARY FAKTUR


mysql> create table primary_faktur
-> (no_fak int(3) not null primary key,
-> tanggal date,
-> jatuh_tempo date,
-> kode_supply varchar(3),
-> foreign key (kode_supply) references 
-> supply(kode_supply) on update cascade);
Query OK, 0 rows affected (0.03 sec)

Create table DETIL FAKTUR


mysql> create table detil_faktur (
-> no_fak int(3),
-> kode_brg varchar(3),
-> kuantitas int(3),
-> foreign key (no_fak) references primary_faktur(no_fak) on update cascade,
-> foreign key (kode_brg) references barang(kode_brg) on update cascade);
Query OK, 0 rows affected (0.05 sec)

TO BE CONTINUED..

[Pascal Programming] Quick Sort

2009-11-25T12:36:00.002+07:00

SOURCE:


program QuickSort;
uses WinCrt;
type Array100 = array [1..100] of integer;
var
  Data: Array100;
  DataCount: Integer;

procedure InputData(var d: Array100; var c: Integer);
var
  Code, k: Integer;
  i: String;
begin
  k := 1;

  Writeln('Quick Sort');
  Writeln('-----------');
  Writeln;

  repeat     
    Write('Masukkan angka ke-',k,' : ');readln(i);
    if(i <> '') then
    begin
      Val(i,d[k],Code);
      if(Code <> 0) then
        d[k] := 0;
    end;
    Inc(k);
  until (k > 100) or (i = '');
  c := k - 2;
end;

procedure Swap(var a,b: Integer);
var
  t: Integer;
begin
  t := a;
  a := b;
  b := t;  
end;

procedure Tampil(d: Array100; c: Integer);
var
  i: Integer;
begin
  for i:=1 to c do
    Write(d[i]:5);
    Writeln;
end; 

procedure Sorting(var d: Array100; a,b: Integer);
var
  a1, b1, pivot: Integer;
begin
  a1:=a;
  b1:=b;
  pivot:= d[(a+b) div 2];

  repeat
    while(d[a1] < pivot) do      Inc(a1);    while(d[b1] > pivot) do
      Dec(b1);
    if (a1<=b1) then    begin      Swap(d[a1], d[b1]);      Inc(a1);      Dec(b1);    end;  until (a1 > b1);

  Tampil(d,b);

  if (a < b1) then    Sorting(d,a,b1);  if (a1 < b) then    Sorting(d,a1,b);end; begin  InputData(Data, DataCount);  Writeln;  Writeln('Sebelum diurutkan');  Tampil(Data,DataCount);  Sorting(Data,1,DataCount);  {data, index terkecil, index terbesar/banyak data}  Writeln;  Writeln('Sesudah diurutkan');  Tampil(Data,DataCount);end.

OUTPUT:


Quick Sort
-----------

Masukkan angka ke-1 : 9
Masukkan angka ke-2 : 8
Masukkan angka ke-3 : 7
Masukkan angka ke-4 : 6
Masukkan angka ke-5 : 5
Masukkan angka ke-6 : 4
Masukkan angka ke-7 : 3
Masukkan angka ke-8 : 2
Masukkan angka ke-9 : 1
Masukkan angka ke-10 :

Sebelum diurutkan
    9    8    7    6    5    4    3    2    1
    1    2    3    4    5    6    7    8    9
    1    2    3    4
    1    2    3    4
    1    2    3    4    5    6    7    8    9
    1    2    3    4    5    6    7    8    9

Sesudah diurutkan
    1    2    3    4    5    6    7    8    9

[Pascal Programming] Selection Sort

2009-11-25T12:34:00.000+07:00

SOURCE:


program SelectionSort;
uses WinCrt;
type Array100 = array [1..100] of integer;
var
  Data: Array100;
  DataCount: Integer;

procedure InputData(var d: Array100; var c: Integer);
var
  Code, k: Integer;
  i: String;
begin
  k := 1;

  Writeln('Selection Sort');
  Writeln('--------------');
  Writeln;

  repeat     
    Write('Masukkan angka ke-',k,' : ');readln(i);
    if(i <> '') then
    begin
      Val(i,d[k],Code);
      if(Code <> 0) then
        d[k] := 0;
    end;
    Inc(k);
  until (k > 100) or (i = '');
  c := k - 2;
end;

procedure Swap(var a,b: Integer);
var
  t: Integer;
begin
  t := a;
  a := b;
  b := t;  
end;

procedure Sorting(var d: Array100; c: Integer);
var
  lok, i, j: Integer;
begin
  for i:= 1 to c-1 do
  begin
    lok := i;  
      for j:=i+1 to c do
        if(d[j] < d[lok]) then          lok := j;          Swap(d[i],d[lok]);  end;end;procedure Tampil(d: Array100; c: Integer);var  i: Integer;begin  for i:=1 to c do    Write(d[i]:5);    Writeln;end;begin  InputData(Data, DataCount);  Writeln;  Writeln('Sebelum diurutkan');  Tampil(Data,DataCount);  Sorting(Data,DataCount);  Writeln;  Writeln('Sesudah diurutkan');  Tampil(Data,DataCount);end.

OUTPUT:


Selection Sort
--------------

Masukkan angka ke-1 : 9
Masukkan angka ke-2 : 8
Masukkan angka ke-3 : 7
Masukkan angka ke-4 : 6
Masukkan angka ke-5 : 5
Masukkan angka ke-6 : 4
Masukkan angka ke-7 : 3
Masukkan angka ke-8 : 2
Masukkan angka ke-9 : 1
Masukkan angka ke-10 :

Sebelum diurutkan
    9    8    7    6    5    4    3    2    1

Sesudah diurutkan
    1    2    3    4    5    6    7    8    9

[Pascal Programming] Insertion Sort

2009-11-25T12:32:00.000+07:00

SOURCE:


program SelectionSort;
uses WinCrt;
type Array100 = array [1..100] of integer;
var
  Data: Array100;
  DataCount: Integer;

procedure InputData(var d: Array100; var c: Integer);
var
  Code, k: Integer;
  i: String;
begin
  k := 1;

  Writeln('Selection Sort');
  Writeln('--------------');
  Writeln;

  repeat     
    Write('Masukkan angka ke-',k,' : ');readln(i);
    if(i <> '') then
    begin
      Val(i,d[k],Code);
      if(Code <> 0) then
        d[k] := 0;
    end;
    Inc(k);
  until (k > 100) or (i = '');
  c := k - 2;
end;

procedure Swap(var a,b: Integer);
var
  t: Integer;
begin
  t := a;
  a := b;
  b := t;  
end;

procedure Sorting(var d: Array100; c: Integer);
var
  lok, i, j: Integer;
begin
  for i:= 1 to c-1 do
  begin
    lok := i;  
      for j:=i+1 to c do
        if(d[j] < d[lok]) then          lok := j;          Swap(d[i],d[lok]);  end;end;procedure Tampil(d: Array100; c: Integer);var  i: Integer;begin  for i:=1 to c do    Write(d[i]:5);    Writeln;end;begin  InputData(Data, DataCount);  Writeln;  Writeln('Sebelum diurutkan');  Tampil(Data,DataCount);  Sorting(Data,DataCount);  Writeln;  Writeln('Sesudah diurutkan');  Tampil(Data,DataCount);end.

OUTPUT:


Insertion Sort
--------------

Masukkan angka ke-1 : 9
Masukkan angka ke-2 : 8
Masukkan angka ke-3 : 7
Masukkan angka ke-4 : 6
Masukkan angka ke-5 : 5
Masukkan angka ke-6 : 4
Masukkan angka ke-7 : 3
Masukkan angka ke-8 : 2
Masukkan angka ke-9 : 1
Masukkan angka ke-10 :

Sebelum diurutkan
    9    8    7    6    5    4    3    2    1

Sesudah diurutkan
    1    2    3    4    5    6    7    8    9

[Pascal Programming] Bubble Sort

2009-11-25T12:29:00.000+07:00

SOURCE:


program BubbleSort;
uses WinCrt;
type Array100 = array [1..100] of integer;
var
  Data: Array100;
  DataCount: Integer;

procedure InputData(var d: Array100; var c: Integer);
var
  Code, k: Integer;
  i: String;
begin
  k := 1;

  Writeln('Bubble Sort');
  Writeln('-----------');
  Writeln;

  repeat     
    Write('Masukkan angka ke-',k,' : ');readln(i);
    if(i <> '') then
    begin
      Val(i,d[k],Code);
      if(Code <> 0) then
        d[k] := 0;
    end;
    Inc(k);
  until (k > 100) or (i = '');
  c := k - 2;
end;

procedure Swap(var a,b: Integer);
var
  t: Integer;
begin
  t := a;
  a := b;
  b := t;  
end;

procedure Sorting(var d: Array100; c: Integer);
var
  i,j: Integer;
begin
  for i:=1 to c-1 do
    for j:=c downto i+1 do
      if(d[j] < d[j-1]) then        Swap(d[j],d[j-1]);end;procedure Tampil(d: Array100; c: Integer);var  i: Integer;begin  for i:=1 to c do    Write(d[i]:5);    Writeln;end;begin  InputData(Data, DataCount);  Writeln;  Writeln('Sebelum diurutkan');  Tampil(Data,DataCount);  Sorting(Data,DataCount);  Writeln;  Writeln('Sesudah diurutkan');  Tampil(Data,DataCount);end.

OUTPUT:


Bubble Sort
-----------

Masukkan angka ke-1 : 9
Masukkan angka ke-2 : 8
Masukkan angka ke-3 : 7
Masukkan angka ke-4 : 6
Masukkan angka ke-5 : 5
Masukkan angka ke-6 : 4
Masukkan angka ke-7 : 3
Masukkan angka ke-8 : 2
Masukkan angka ke-9 : 1
Masukkan angka ke-10 :

Sebelum diurutkan
    9    8    7    6    5    4    3    2    1

Sesudah diurutkan
    1    2    3    4    5    6    7    8    9

JAVA APPLET SORTING ALGORITHMS

2009-11-25T11:52:00.000+07:00

In computer science and mathematics, a sorting algorithm is an algorithm that puts elements of a list in a certain order. The most-used orders are numerical order and lexicographical order. Efficient sorting is important to optimizing the use of other algorithms (such as search and merge algorithms) that require sorted lists to work correctly; it is also often useful for canonicalizing data and for producing human-readable output. More formally, the output must satisfy two conditions:

The output is in nondecreasing order (each element is no smaller than the previous element according to the desired total order);
The output is a permutation, or reordering, of the input.

Since the dawn of computing, the sorting problem has attracted a great deal of research, perhaps due to the complexity of solving it efficiently despite its simple, familiar statement. For example, bubble sort was analyzed as early as 1956.[1] Although many consider it a solved problem, useful new sorting algorithms are still being invented (for example, library sort was first published in 2004). Sorting algorithms are prevalent in introductory computer science classes, where the abundance of algorithms for the problem provides a gentle introduction to a variety of core algorithm concepts, such as big O notation, divide and conquer algorithms, data structures, randomized algorithms, best, worst and average case analysis, time-space tradeoffs, and lower bounds.

Classification

Sorting algorithms used in computer science are often classified by:

Computational complexity (worst, average and best behaviour) of element comparisons in terms of the size of the list . For typical sorting algorithms good behavior is and bad behavior is . (See Big O notation) Ideal behavior for a sort is . Comparison sorts, sort algorithms which only access the list via an abstract key comparison operation, need at least comparisons for most inputs.
Computational complexity of swaps (for "in place" algorithms).
Memory usage (and use of other computer resources). In particular, some sorting algorithms are "in place". This means that they need only or memory beyond the items being sorted and they don't need to create auxiliary locations for data to be temporarily stored, as in other sorting algorithms.
Recursion. Some algorithms are either recursive or non-recursive, while others may be both (e.g., merge sort).
Stability: stable sorting algorithms maintain the relative order of records with equal keys (i.e., values).
Whether or not they are a comparison sort. A comparison sort examines the data only by comparing two elements with a comparison operator.
General method: insertion, exchange, selection, merging, etc. Exchange sorts include bubble sort and quicksort. Selection sorts include shaker sort and heapsort.
Adaptability: Whether or not the presortedness of the input affects the running time. Algorithms that take this into account are known to be adaptive.

FOR EXAMPLE,
SEE THE JAVA APPLET FOR THE SORTING ALGORITHMS IN LINK BELOW:



http://maven.smith.edu/~thiebaut/java/sort/

JAVA MATRIX CALCULATOR

2009-11-19T13:04:00.004+07:00

No special classes or libraries are used with this application. The complete source resides in the one file above. After downloading, the following should work in any JDK 1.2 compatible compiler:

javac MatrixCalculator.java
java MatrixCalculator

Matrix Calculator Tips/Help

All Matrices must be symmetric (n x n)

Enter Matrix Elements Row by Row seperated by spaces.
Ex. (3x3)


1 2 3
4 5 6
7 8 9

Results will be placed in the C matrix.

The calculation of the determinant, by definition, is based upon a factorial number of calculations with respect to the size of the matrix. ie. a 3x3 matrix would have 6 calculations (3!) to make, whereas a 20x20 matrix would have 2.43 x 10^18 calculations (20!). So instead of brute forcing the calculations, I first do some operations on the matrix, which converts it to a upper triangular matrix, and then calculate the determinant by multipling down the diagonal, since everything below is 0, this will give the determinant.

Floating Points and Accuracies

For some reason computers aren't as accurate as I think they are, probably my calculation techniques. The accuracy of the numbers are probably only to 3 maybe 2 decimal places. If you keep applying operations to matrices and then use the resultant matrix a couple of times, the decimals get out of whack. Calculating an inverse and then multplying the matrix by it, is a good example of this.

Test Some Mathematical Theories
The determinant of A-inverse equals 1 over the determinant of A.
If two rows of matrix A are equal, the determinant of A equals 0.
det(A*B)=det(A)det(B)
A*B does not necessarily equal B*A
The determinant of A-transpose equals the determinant of A.
If the matrix B is constructed by interchanging two rows (columns) in matrix A, then the determinant of B equals the negative determinant of A
You can test, adj(A) = det(A) * inv(A), but this is the theorem I use to calculate the inverse, so it better work.

Mathematics and Linear Algebra Calculating the Determinant

So instead of brute forcing the calculations, I first do some operations on the matrix, which converts it to a upper triangular matrix, and then calculate the determinant by multipling down the diagonal, since everything below is 0, this will give the determinant.

See The Mathematics Behind Them for more information and mathematical explanations on the definitions and calculation techniques.

Click the spoiler below for displaying source-code

SOURCE CODE


import java.awt.BorderLayout;
import java.awt.Component;
import java.awt.Dimension;
import java.awt.GridLayout;
import java.awt.event.ActionEvent;
import java.awt.event.ActionListener;
import java.awt.event.WindowAdapter;
import java.awt.event.WindowEvent;
import java.text.NumberFormat;
import java.util.ArrayList;
import java.util.StringTokenizer;

import javax.swing.BorderFactory;
import javax.swing.Box;
import javax.swing.BoxLayout;
import javax.swing.JButton;
import javax.swing.JFrame;
import javax.swing.JLabel;
import javax.swing.JPanel;
import javax.swing.JScrollPane;
import javax.swing.JTextArea;

public class MatrixCalculator {

private boolean DEBUG = true;

private boolean INFO = true;

private static int max = 100;

private static int decimals = 3;

private JLabel statusBar;

private JTextArea taA, taB, taC;

private int iDF = 0;

private int n = 4;

private static NumberFormat nf;

public Component createComponents() {

/* == MATRIKS == */
taA = new JTextArea();
taB = new JTextArea();
taC = new JTextArea();

JPanel paneMs = new JPanel();
paneMs.setLayout(new BoxLayout(paneMs, BoxLayout.X_AXIS));
paneMs.setBorder(BorderFactory.createEmptyBorder(10, 10, 10, 10));
paneMs.add(MatrixPane("Matrix A", taA));
paneMs.add(Box.createRigidArea(new Dimension(10, 0)));
paneMs.add(MatrixPane("Matrix B", taB));
paneMs.add(Box.createRigidArea(new Dimension(10, 0)));
paneMs.add(MatrixPane("Matrix C", taC));

/* == OPERATION BUTTONS == */
JPanel paneBtn = new JPanel();
paneBtn.setBorder(BorderFactory.createEmptyBorder(5, 5, 5, 5));
paneBtn.setLayout(new GridLayout(3, 3));
JButton btnApB = new JButton("A + B = C");
JButton btnAmB = new JButton("A * B = C");
JButton btnBmA = new JButton("B * A = C");
JButton btnAdjA = new JButton("adjoint(A) = C");
JButton btnInvA = new JButton("inverse(A) = C");
JButton btnInvB = new JButton("inverse(B) = C");
JButton btnTrnsA = new JButton("transpose(A) = C");
JButton btnDetA = new JButton("determ(A) = C");
JButton btnDetB = new JButton("determ(B) = C");
paneBtn.add(btnApB);
paneBtn.add(btnAmB);
paneBtn.add(btnBmA);
paneBtn.add(btnAdjA);
paneBtn.add(btnInvA);
paneBtn.add(btnInvB);
paneBtn.add(btnTrnsA);
paneBtn.add(btnDetA);
paneBtn.add(btnDetB);

/* == ADD BUTTON Listeners == */
btnApB.addActionListener(new ActionListener() {
public void actionPerformed(ActionEvent evt) {
try {
DisplayMatrix(AddMatrix(ReadInMatrix(taA),
ReadInMatrix(taB)), taC);
} catch (Exception e) {
System.err.println("Error: " + e);
}
}
});

btnAmB.addActionListener(new ActionListener() {
public void actionPerformed(ActionEvent evt) {
try {
DisplayMatrix(MultiplyMatrix(
ReadInMatrixNotSquare(taA),
ReadInMatrixNotSquare(taB)), taC);
} catch (Exception e) {
System.err.println("Error: " + e);
}
}
});

btnBmA.addActionListener(new ActionListener() {
public void actionPerformed(ActionEvent evt) {
try {
DisplayMatrix(MultiplyMatrix(ReadInMatrixNotSquare(taB),
ReadInMatrixNotSquare(taA)), taC);
} catch (Exception e) {
System.err.println("Error: " + e);
}
}
});

btnInvA.addActionListener(new ActionListener() {
public void actionPerformed(ActionEvent evt) {
try {
DisplayMatrix(Inverse(ReadInMatrix(taA)), taC);
} catch (Exception e) {
System.err.println("Error: " + e);
}
}
});

btnInvB.addActionListener(new ActionListener() {
public void actionPerformed(ActionEvent evt) {
try {
DisplayMatrix(Inverse(ReadInMatrix(taB)), taC);
} catch (Exception e) {
System.err.println("Error: " + e);
}
}
});

btnAdjA.addActionListener(new ActionListener() {
public void actionPerformed(ActionEvent evt) {
try {
DisplayMatrix(Adjoint(ReadInMatrix(taA)), taC);
} catch (Exception e) {
System.err.println("Error: " + e);
}
}
});

btnTrnsA.addActionListener(new ActionListener() {
public void actionPerformed(ActionEvent evt) {
try {
DisplayMatrix(Transpose(ReadInMatrixNotSquare(taA)), taC);
} catch (Exception e) {
System.err.println("Error: " + e);
}
}
});

btnDetA.addActionListener(new ActionListener() {
public void actionPerformed(ActionEvent evt) {
try {
taC.setText("Determinant A: "
+ nf.format(Determinant(ReadInMatrix(taA))));
} catch (Exception e) {
System.err.println("Error: " + e);
}
}
});

btnDetB.addActionListener(new ActionListener() {
public void actionPerformed(ActionEvent evt) {
try {
taC.setText("Determinant B: "
+ nf.format(Determinant(ReadInMatrix(taB))));
} catch (Exception e) {
System.err.println("Error: " + e);
}
}
});

/* == MAIN PANEL == */
JPanel pane = new JPanel();
pane.setBorder(BorderFactory.createEmptyBorder(5, 5, 5, 5));
pane.setLayout(new BoxLayout(pane, BoxLayout.Y_AXIS));
pane.add(paneMs);
pane.add(paneBtn);

JPanel fpane = new JPanel();
fpane.setLayout(new BorderLayout());
fpane.setBorder(BorderFactory.createEmptyBorder(5, 5, 5, 5));
fpane.add("Center", pane);
statusBar = new JLabel("Ready");
fpane.add("South", statusBar);

return fpane;
}

/* == Setup Invidual Matrix Panes == */
private JPanel MatrixPane(String str, JTextArea ta) {
JScrollPane scrollPane = new JScrollPane(ta);
int size = 200;

scrollPane.setPreferredSize(new Dimension(size, size));
JLabel label = new JLabel(str);
label.setLabelFor(scrollPane);

JPanel pane = new JPanel();
pane.setBorder(BorderFactory.createEmptyBorder(5, 5, 5, 5));
pane.setLayout(new BoxLayout(pane, BoxLayout.Y_AXIS));
pane.add(label);
pane.add(scrollPane);

return pane;
}

public static void main(String[] args) {
JFrame frame = new JFrame("Matrix Calculator");
frame.setSize(new Dimension(725, 200));
MatrixCalculator app = new MatrixCalculator();

Component contents = app.createComponents();
frame.getContentPane().add(contents, BorderLayout.CENTER);
frame.addWindowListener(new WindowAdapter() {
public void windowClosing(WindowEvent e) {
System.exit(0);
}
});
frame.pack();
frame.setVisible(true);

nf = NumberFormat.getInstance();
nf.setMinimumFractionDigits(1);
nf.setMaximumFractionDigits(decimals);

}

// ------------------------------------------------------------------------------
// ------------------------------------------------------------------------------



public float[][] ReadInMatrix(JTextArea ta) throws Exception {
if (DEBUG) {
System.out.println("Reading In Matrix");
}

/* == Parse Text Area == */
String rawtext = ta.getText();
String val = "";
int i = 0;
int j = 0;
int[] rsize = new int[max];

/* == Determine Matrix Size/Valid == */
StringTokenizer ts = new StringTokenizer(rawtext, "\n");
while (ts.hasMoreTokens()) {
StringTokenizer ts2 = new StringTokenizer(ts.nextToken());
while (ts2.hasMoreTokens()) {
ts2.nextToken();
j++;
}
rsize[i] = j;
i++;
j = 0;
}
statusBar.setText("Ukuran Matriks: " + i);
if ((DEBUG) || (INFO)) {
System.out.println("Ukuran Matriks: " + i);
}

for (int c = 0; c < i; c++) {   if (DEBUG) {    System.out.println("i=" + i + "  j=" + rsize[c] + "   Kolom: "      + c);   }   if (rsize[c] != i) {    statusBar.setText("Invalid Matrix. Size Mismatch.");    throw new Exception("Invalid Matrix. Size Mismatch.");   }  }  /* == set ukuran matriks == */  n = i;  float matrix[][] = new float[n][n];  i = j = 0;  val = "";  /* == Actual Parsing == */  StringTokenizer st = new StringTokenizer(rawtext, "\n");  while (st.hasMoreTokens()) {   StringTokenizer st2 = new StringTokenizer(st.nextToken());   while (st2.hasMoreTokens()) {    val = st2.nextToken();    try {     matrix[i][j] = Float.valueOf(val).floatValue();    } catch (Exception exception) {     statusBar.setText("Invalid Number Format");    }    j++;   }   i++;   j = 0;  }  if (DEBUG) {   System.out.println("Baca Matriks::");   for (i = 0; i < n; i++) {    for (j = 0; j < n; j++) {     System.out.print("m[" + i + "][" + j + "] = "       + matrix[i][j] + "   ");    }    System.out.println();   }  }  return matrix; } public float[][] ReadInMatrixNotSquare(JTextArea ta)   throws Exception {  if (DEBUG) {   System.out.println("Membaca Matriks");  }  /* == Parse Text Area == */  String rawtext = ta.getText();  /* == Determine Matrix Size/Valid == */  StringTokenizer ts = new StringTokenizer(rawtext, "\n");  if (DEBUG)   System.out.println("Baris: " + ts.countTokens());  float matrix[][] = new float[ts.countTokens()][];  StringTokenizer st2;  int row = 0;  int col = 0;  //making sure rows are same length  int last = -5;  int curr = -5;  while (ts.hasMoreTokens()) {   st2 = new StringTokenizer(ts.nextToken(), " ");   last = curr;   curr = st2.countTokens();   if(last != -5 && curr!= last)    throw new Exception("Baris != length");   if (DEBUG)    System.out.println("Kolom: " + st2.countTokens());   matrix[row] = new float[st2.countTokens()];   while (st2.hasMoreElements()) {    matrix[row][col++] = Float.parseFloat(st2.nextToken());   }   row++;   col = 0;  }  System.out.println();  return matrix; } // -------------------------------------------------------------- // Display Matrix in TextArea // -------------------------------------------------------------- public void DisplayMatrix(float[][] matrix, JTextArea ta) {    if (DEBUG) {   System.out.println("Displaying Matrix");  }    String rstr = "";  String dv = "";  for (int i = 0; i < matrix.length; i++) {   for (int j = 0; j < matrix[i].length; j++) {    dv = nf.format(matrix[i][j]);    rstr = rstr.concat(dv + "  ");   }   rstr = rstr.concat("\n");  }  ta.setText(rstr); } public float[][] AddMatrix(float[][] a, float[][] b) throws Exception {  int tms = a.length;  int tmsB = b.length;  if (tms != tmsB) {   statusBar.setText("Matrix Size Mismatch");  }  float matrix[][] = new float[tms][tms];  for (int i = 0; i < tms; i++)   for (int j = 0; j < tms; j++) {    matrix[i][j] = a[i][j] + b[i][j];   }  return matrix; } // -------------------------------------------------------------- public float[][] MultiplyMatrix(float[][] a, float[][] b) throws Exception {    if(a[0].length != b.length)   throw new Exception("Matrices incompatible for multiplication");  float matrix[][] = new float[a.length][b[0].length];  for (int i = 0; i < a.length; i++)   for (int j = 0; j < b[i].length; j++)    matrix[i][j] = 0;  //cycle through answer matrix  for(int i = 0; i < matrix.length; i++){   for(int j = 0; j < matrix[i].length; j++){    matrix[i][j] = calculateRowColumnProduct(a,i,b,j);   }  }  return matrix; } public float calculateRowColumnProduct(float[][] A, int row, float[][] B, int col){  float product = 0;  for(int i = 0; i < A[row].length; i++)   product +=A[row][i]*B[i][col];  return product; } // --------------------------------------------------------------  public float[][] Transpose(float[][] a) {  if (INFO) {   System.out.println("Performing Transpose...");  }    float m[][] = new float[a[0].length][a.length];  for (int i = 0; i < a.length; i++)   for (int j = 0; j < a[i].length; j++)    m[j][i] = a[i][j];  return m; } // -------------------------------------------------------------- public float[][] Inverse(float[][] a) throws Exception {  // Formula used to Calculate Inverse:  // inv(A) = 1/det(A) * adj(A)  if (INFO) {   System.out.println("Performing Inverse...");  }  int tms = a.length;  float m[][] = new float[tms][tms];  float mm[][] = Adjoint(a);  float det = Determinant(a);  float dd = 0;  if (det == 0) {   statusBar.setText("Determinant = 0, Not Invertible.");   if (INFO) {    System.out.println("Determinant = 0, Not Invertible.");   }  } else {   dd = 1 / det;  }  for (int i = 0; i < tms; i++)   for (int j = 0; j < tms; j++) {    m[i][j] = dd * mm[i][j];   }  return m; } // -------------------------------------------------------------- public float[][] Adjoint(float[][] a) throws Exception {  if (INFO) {   System.out.println("Performing Adjoint...");  }  int tms = a.length;  float m[][] = new float[tms][tms];  int ii, jj, ia, ja;  float det;  for (int i = 0; i < tms; i++)   for (int j = 0; j < tms; j++) {    ia = ja = 0;    float ap[][] = new float[tms - 1][tms - 1];    for (ii = 0; ii < tms; ii++) {     for (jj = 0; jj < tms; jj++) {      if ((ii != i) && (jj != j)) {       ap[ia][ja] = a[ii][jj];       ja++;      }     }     if ((ii != i) && (jj != j)) {      ia++;     }     ja = 0;    }    det = Determinant(ap);    m[i][j] = (float) Math.pow(-1, i + j) * det;   }  m = Transpose(m);  return m; } // -------------------------------------------------------------- public float[][] UpperTriangle(float[][] m) {  if (INFO) {   System.out.println("Converting to Upper Triangle...");  }  float f1 = 0;  float temp = 0;  int tms = m.length; // get This Matrix Size (could be smaller than       // global)  int v = 1;  iDF = 1;  for (int col = 0; col < tms - 1; col++) {   for (int row = col + 1; row < tms; row++) {    v = 1;    outahere: while (m[col][col] == 0) // check if 0 in diagonal    { // if so switch until not     if (col + v >= tms) // check if switched all rows
{
iDF = 0;
break outahere;
} else {
for (int c = 0; c < tms; c++) {       temp = m[col][c];       m[col][c] = m[col + v][c]; // switch rows       m[col + v][c] = temp;      }      v++; // count row switchs      iDF = iDF * -1; // each switch changes determinant          // factor     }    }    if (m[col][col] != 0) {     if (DEBUG) {      System.out.println("tms = " + tms + "   col = " + col        + "   row = " + row);     }     try {      f1 = (-1) * m[row][col] / m[col][col];      for (int i = col; i < tms; i++) {       m[row][i] = f1 * m[col][i] + m[row][i];      }     } catch (Exception e) {      System.out.println("Still Here!!!");     }    }   }  }  return m; } // -------------------------------------------------------------- public float Determinant(float[][] matrix) {  if (INFO) {   System.out.println("Getting Determinant...");  }  int tms = matrix.length;  float det = 1;  matrix = UpperTriangle(matrix);  for (int i = 0; i < tms; i++) {   det = det * matrix[i][i];  } // multiply down diagonal  det = det * iDF; // adjust w/ determinant factor  if (INFO) {   System.out.println("Determinant: " + det);  }  return det; }}

FOR DOWNLOAD: CLICK HERE

Warcraft Patch 1.24b Guide

2009-11-18T10:38:00.000+07:00

Things you should already have:

Original Warcraft and The Frozen Throne
One Dota map: 6.62b or higher for testing

Official 1.24b patch download section

Download here: Official 1.24b

Others 1.24b section:

When you enter blizzard FTP, scroll all the way down, and chose your patch.
Other Languages
Machintosh

WARNING FOR MAC USERS: Any Mac user wishing to patch should get the 1.24a patch and then connect to battle.net for the final upgrade.

How to Install the patch:

If everything is fine, then just press BattleNet button, it will be automatic
If you downloaded it, just double click it.

How to check what version you have:

Just check the number under your Quit button. It should be 1.24.1.6374

Solving problems:

The most common problems of all is "Missing install path" problem. This problem is (99%) caused because game wasn't Installed, because it was only copied from another computer. The game is missing registry entries, thus, patch can't update. Example of "Missing path error"

First you need to download War3 Registry fix program. Click to Download. Unpack it, and just double click it. You should get this screen. Now click the Fix Reign of Chaos.

Find your Warcraft 3 folder. Its ussually at C:\Program Files\Warcraft III. At my example, its at C:\Warcraft III. When you find it, mark it untill that + becomes -. Now at that bar above, path should be correct, but program generates DIABLO2 folder. DELETE IT! That Diablo folder is program mistake. Delete it with Backspace or Delete button untill its gone like this:

1.

2.

Click the OK button and then click Yes like this:

Now, go to first page of program again and do everything again for Frozen Throne!

When you finaly finished this fixing, go to Warcraft 3 The Frozen Throne game. Just enter it, it doesn't matter what patch you have. When you enter the game, just Quit the game. You need this part to check if you did everything correct. Do this part no matter what!

If everything worked well, now you can upgrade to 1.24b without any errors! Use 6.62b map for testing.

Other problems

If you can't download the patch, try again, blizzard servers can be full!
If the 1.24b patch is less than 56.05MB, then download it again, maybe it was broke during download.
If you have specific problem which isn't in this guide, post it in this topic!

Disclaimer!

No talking about cracks, keygens or pirated software!
No Version Switcher discussion, check Dota Tools if you need it.
Only 6.62b and above are allowed. No discussion about 6.61c and below.
No Garena problems, please. I can't help you there, check Garena Support

If you have any ideas how to make this guide better, post them here. Remember, this isn't the only way, but it looks its the most newbie friendly. There are other ways with Regedit, but I don't find it easy for people which need small and helpfull programs, not registry files, and editing path at their own risk.

Attached Files

W3Fixer.rar (482.1 KB, 23232 views)

Warcraft Patch Version Switcher

2009-11-17T13:19:00.001+07:00

All in One Warcraft Version Switcher. Yeah, it's available now. Currently, there are 7 Warcraft 3 TFT versions file are available, Warcraft Patch 1.20e, 1.21, 1.21b, 1.22, 1.23, 1.24a & 1.24b. You can download any Warcraft 3 Patch version Switcher file you want to use. Check the download links & guide.

Steps:

1. Download standalone Warcraft Version Switcher from the link below and extract it.

Download Warcraft-Version-Switcher.rar (617KB)

2. Download the Warcraft 3 version switcher file(s) you want to use with Version Switcher.

Warcraft 1.20 Patch File:
TFT Version 1.20

Warcraft 1.21 Patch File:
TFT Version 1.21

Warcraft 1.21b Patch File:
TFT Version 1.21b

Warcraft 1.22 Patch File:
TFT Version 1.22

Warcraft 1.23 Patch File:
TFT Version 1.23

Warcraft 1.24 Patch File:
TFT Version 1.24

Warcraft 1.24b Patch File:
TFT Version 1.24b

3. After Downloading the patch version file(s), DO NOT EXTRACT THEM. Just copy the files and paste in your "wvs" folder of Warcraft Version Switcher.

4. Now run wvs.exe & you're done.

[NIGHTCRAWLER] New Hero On New Map DOtA 6.65

2009-11-17T12:11:00.000+07:00

INTRODUCTION

Summon Nightcrawler

Disfar is came from the tribe of the Murlocs from the lands of Felwood. The Undead Legions conquered their habitats and turned them into bases. The nightcrawler is the only one who have escaped in the terror of the lich king's army. He joined the Sentinel for him to have revenge on the death of his tribe and family. The nightcrawler can turn invisible when night, allowing him to spy his enemies. He can throw flashbangs in a certain range to blind his enemies and prevent them from attacking. The Scourge shall know the true anger of the Nightcrawler.

Strength - 17 +2.00
Agility - 24 +2.80(Main Attribute)
Intelligence - 18 +1.55

Learns Nightclawler's Flashbang, Corrosive Scales, Night Crawl and Death Stab

Attack range of 100
Movement speed of 300

_____________________________________________________________________________
HERO INFORMATION

Alliance: Sentinel
Theme: Nightcrawlers
Role: Killer

Disfal, the Nightcrawler

Starting Hitpoints:= 150 + (Strength * 19); 150 + (17 * 19) = 473
Starting Mana:= Intelligence * 13; 18 * 13 = 234
Starting Damage: 39-50
Starting Armor:=Agility/7; 24/7 = 3.4

_____________________________________________________________________________
HERO ABILITIES

Nightcrawler's Flashbang

The night crawler will throws a flashbang in an area to damage, slow enemy units by 35% and to prevent them from attacking. The flashbang last for 2.5 seconds.

Level 1 - Deals 120 damage and has a 200 AOE.
Level 2 - Deals 200 damage and has a 240 AOE.
Level 3 - Deals 280 damage and has a 270 AOE.
Level 4 - Deals 330 damage and has a 300 AOE.

Cooldown: 30 seconds
Mana cost: 100/110/120/130

The casting time is 1 second.
The casting range is 400

Corrosive Scales

Allows the Nightcrawler to be scaly. Gives a chance to reflect the percentage of the received damage of the nightcrawler in an area near him.

Level 1 - 10% chance to reflect the 120% of the nightcrawler's received damage.
Level 2 - 10% chance to reflect the 150% of the nightcrawler's received damage.
Level 3 - 10% chance to reflect the 180% of the nightcrawler's received damage.
Level 4 - 10% chance to reflect the 200% of the nightcrawler's received damage.

Passive

Night Crawl

The nightcrawler will become permanently invisible when night. The invisible will removed when the nightcrawler attacks, use a skill or when day comes.

Level 1 - The nightcrawler becomes invisible when night. Has 8 seconds fade time.
Level 2 - The nightcrawler becomes invisible when night. Has 7 seconds fade time.
Level 3 - The nightcrawler becomes invisible when night. Has 6 seconds fade time.
Level 4 - The nightcrawler becomes invisible when night. Has 5 seconds fade time.

Passive

Death Stab

When the nightcrawler attacks in front it will deal a bonus damage but when it attacks from the rear, the attacked one will be slowed by 30%.

Level 1 - adds a bonus 25% of damage.
Level 2 - adds a bonus 50% of damage.
Level 3 - adds a bonus 75% of damage.

Orb Effects do not stack

Hero Combo
_____________________________________________________________________________

+
When you are invisible can easily use the skill, Nightcrawler's Flasbang to your enemies.
+
Flashbang can slow and prevent the attack of enemies. In this state, you can deal a bonus damage when you attack in front.

Hardisk Partition for XP/VISTA/7

2009-11-15T20:20:00.000+07:00

Partition Wizard Home Edition (PWHE) is a free partition manager designed by MT Solution Ltd. It supports 32/64 bit Windows Operating System including Windows XP, Windows Vista , Windows 2000 Professional and Windows 7.

Home users can perform complicated partition operations by using this powerful but free partition manager to manage their hard disk partition such as Resizing partitions, Copying partitions, Create partition, Delete partition, Format partition, Convert partition, Explore partition, Hide partition, Change drive letter, Set active partition and Partition Recovery.


Size         : 5.54 MB
Platform : Windows
License   : Freeware
Updated  : 20 Jul, 2009

Click here for download pwhe-setup.exe free (5.54 MB)

Request Software/Game/App Keygen Here..!!

2009-11-13T18:10:00.000+07:00

A keygen (an abbreviated form of "key generator") is a small program that will generate valid CD keys or serial/registration numbers for a piece of software. These are made available by software cracking groups for free download on various websites dedicated to software piracy. In some countries, the use of keygens to activate software without purchasing a genuine code is unlawful.

How registration key generators work

The author of a keygen typically uses a disassembler to look at the raw assembly code of the targeted program, checking either the software itself or the installer. Once access has been obtained to the program's code, the location of the subroutine(s) responsible for verifying that the key entered is valid are found. Using this knowledge, the algorithm may be reverse engineered to generate valid keys, which is then incorporated into the keygen.

With weaker serial protection schemes a complex reverse is not required as the key-checking code itself in the original application can be effectively copied and incorporated into a keygen. Weaker schemes sometimes internally generate a correct key inside the original application for comparison purposes (to determine whether the entered key is correct).

Some keygens use a brute force approach or brute force hybrid approach to creating valid keys. In these instances, rather than produce an exact reverse of the key check algorithm, the attacker uses a search technique, testing many possible combinations per second against the key validation check until a given combination produces a valid key.

Sometimes, keygens have code incorporated into the keygen to change the written code of a program in order for the code that is given via the keygen to work, but this is not typically done for a keygen, as it is considered 'impure' when a crack must be used in conjunction with a keygen; true keygens are considered as such when they generate valid keys and do not require an additional 'crack' i.e. modification to the original application code for generated keys to be accepted.

For request a keygen please email me use this format:
Subject: ReqKeygen
Message Body: Name of app/game/warez what you need the keygen

Indonesian and International Free SMS

2009-11-13T08:58:00.001+07:00

Short Message Service (SMS) is a communication service standardized in the GSM mobile communication system, using standardized communications protocols allowing the interchange of short text messages between mobile telephone devices. SMS text messaging is the most widely used data application on the planet, with 2.4 billion active users, or 74% of all mobile phone subscribers sending and receiving text messages on their phones.[citation needed] The SMS technology has facilitated the development and growth of text messaging. The connection between the phenomenon of text messaging and the underlying technology is so great that in parts of the world the term "SMS" is used as a synonym for a text message or the act of sending a text message, even when a different protocol is being used.

FOR FREE SMS, CLICK THIS LINK for 10 sms per DAY

OR THIS LINK for 20 sms per DAY

DeepFreeze 6 Password Remover

2009-11-13T08:22:00.000+07:00

Download Here :
http://www.4shared.com/file/141981063/81333a4d/UDF.html

Or using this:
http://d60pc.com/redirectdownload/Anti-DeepFreeze.html

Or This

Download Here :
4SHARED
http://www.4shared.com/file/144249041/65b02369/undeep.html
RAPIDSHARE
http://rapidshare.com/files/298875286/undeep.zip
MIRROR
http://downloads.alsyundawy.org/?dir=appz/UnDeepFreeZeR

Password Hacking via USB

2009-11-12T14:13:00.000+07:00

Have you ever thought that a Simple USB Drive can be used as a Destructive Tool for Hacking Passwords? Today I will give you the right tools.

As we all know, Windows stores most of the passwords which are used on a daily basis, including instant messenger passwords such as MSN, Yahoo, AOL, Windows messenger etc. Along with these, Windows also stores passwords of Outlook Express, SMTP, POP, FTP accounts and auto-complete passwords of many browsers like IE and Firefox. There exists many tools for recovering these passswords from their stored places.

Using these tools and an USB pendrive hack your friends passwords. Luckily for you i put every thing together for n00bs.

VIDEO:

http://www.youtube.com/watch?v=DRpkNjsR4Aw

DOWNLOAD:

http://hotfile.com/dl/15570241/4d7a997/USB_Password_Hack.rar.html

NB: Files are available in RAR format with passwords. If you want to know the password, please comment on this blog and leave your email address. I will send your password to your email address.

Free Download Journal

2009-11-12T13:33:00.000+07:00

SCIENCEDIRECT
target :
http://science.servepics.com
proxy :
128.42.142.43:3124

Sceinecdirect, Springerlink, Wileyinterscience
target:
http://www.sciencedirectatpassfans.cjb.net
proxy :
ns1.kmu.edu.tw:3128
username/pass :
960499/960499

Other
Ingenta
anand.mooo.com
netlibrary
http://www.netlibraryatpassfans.cjb.net
thieme publishing
http://www.thiemec.cjb.net/ejournals/home.html
Emerald Group Publishing Limited
http://emerald2010.cjb.net

Click the spoiler below for displaying proxy

Jurnal Perpusnas RI
1. Database Proquest
proquest berisi artikel tentang pertanian, kesehatan, psikologi, ekonomi, sosial dll.
Alamat URL : http://proquest. pnri.go.id
User id: anggota
Password: anggota
2. Database Gale
berisi Teksbook
Alamat URL: http://infotrac.galegroup.com/itweb/idpnri
Password: research
3. Database Westlaw
Berisi masalah Hukum
Alamat URL: http://web2. westlaw.com
Password: 6823415SPDH
Client id: 3 USER

CASCADE INNODB

2009-11-12T13:08:00.000+07:00

CREATE TABLE TBLPM


mysql> create table tblpm
-> (idtblpm int not null primary key,
-> data char(10))
-> engine=innodb;
Query OK, 0 rows affected (0.08 sec)

CREATE TABLE TBLCASCADE


mysql> create table tblcascade
-> (idtblpm int not null,
-> idtblcascade int not null primary key,
-> data char(10),
-> foreign key (idtblpm) references tblpm(idtblpm) ON UPDATE CASCADE
-> )ENGINE=INNODB;
Query OK, 0 rows affected (0.08 sec)

INSERT VALUE TO TBLPM


mysql> insert into tblpm values
-> ('1','A'),
-> ('2','B'),
-> ('3','C'),
-> ('4','D'),
-> ('5','E');
Query OK, 5 rows affected (0.03 sec)
Records: 5  Duplicates: 0  Warnings: 0

INSERT VALUE TO TBLCASCADE


mysql> insert into tblcascade values
-> ('1','1','A'),
-> ('2','2','B'),
-> ('3','3','C'),
-> ('4','4','D'),
-> ('5','5','E');
Query OK, 5 rows affected (0.06 sec)
Records: 5  Duplicates: 0  Warnings: 0

CHANGING VALUE IN TBPM


mysql> update tblpm set idtblpm='9' where idtblpm='1';
Query OK, 1 row affected (0.03 sec)
Rows matched: 1  Changed: 1  Warnings: 0

SHOW VALUE TBLPM


mysql> select * from tblpm order by data asc;
+---------+------+
| idtblpm | data |
+---------+------+
|       9 | A    |
|       2 | B    |
|       3 | C    |
|       4 | D    |
|       5 | E    |
+---------+------+
5 rows in set (0.00 sec)

VALUE ON TBLCASCADE HAS BEEN CHANGED TOO


mysql> select * from tblcascade order by data asc;
+---------+--------------+------+
| idtblpm | idtblcascade | data |
+---------+--------------+------+
|       9 |            1 | A    |
|       2 |            2 | B    |
|       3 |            3 | C    |
|       4 |            4 | D    |
|       5 |            5 | E    |
+---------+--------------+------+
5 rows in set (0.00 sec)
5 rows in set (0.00 sec)

SQL Query Example: Update, SET, Combination

2009-11-05T13:13:00.001+07:00

*) Update table add foreign key / change table structure


mysql> alter table NamaTabel
       add constraint
       foreign key (FOREIGNKEYFIELD) references TABLENAME(PRIMARYKEYFIELD);

*) Change value table


mysql> update NamaTabel
       set FieldName='NewValue'
       where FieldName='OldValue';

1)Tampilkan pegawai dan jabatan


mysql> select p.nama, j.jabatan
    -> from pegawai p, jabatan j
    -> where p.kj=j.kj;
+------------+------------------+
| nama       | jabatan          |
+------------+------------------+
| Amir Yahya | System Analyst   |
| Bayu       | Marketing Leader |
| Dahlan     | Programmer       |
| Rizal      | Programmer       |
| Iwan       | Network Engineer |
| Dewi       | Sekretaris       |
| Hakim      | Programmer       |
+------------+------------------+

7 rows in set (0.00 sec)

2)Tampilkan pegawai dan anaknya


mysql> select p.nama, a.nama_anak
    -> from pegawai p, anak a
    -> where p.nip=a.nip;
+------+-----------+
| nama | nama_anak |
+------+-----------+
| Bayu | Haris     |
| Bayu | Hany      |
| Iwan | Sitti     |
| Iwan | Sultan    |
+------+-----------+

4 rows in set (0.00 sec)

3)Tampilkan pegawai dan gajinya


mysql> select p.nama, j.gaji
    -> from pegawai p, jabatan j
    -> where p.kj=j.kj;
+------------+---------+
| nama       | gaji    |
+------------+---------+
| Amir Yahya | 6000000 |
| Bayu       | 7000000 |
| Dahlan     | 3000000 |
| Rizal      | 3000000 |
| Iwan       | 4500000 |
| Dewi       | 3000000 |
| Hakim      | 3000000 |
+------------+---------+

7 rows in set (0.00 sec)

4) Tampilkan pegawai dg gaji tertinggi


mysql> select p.nama, j.gaji
    -> from pegawai p, jabatan j
    -> where j.kj=p.kj order by j.gaji desc
    -> limit 0,1;
+------+---------+
| nama | gaji    |
+------+---------+
| Bayu | 7000000 |
+------+---------+

1 row in set (0.00 sec)

5)Tampilkan pegawai dg gaji > 5000000


mysql> select p.nama, j.gaji
    -> from pegawai p, jabatan j
    -> where p.kj=j.kj and j.gaji<5000000;
+--------+---------+
| nama   | gaji    |
+--------+---------+
| Dahlan | 3000000 |
| Rizal  | 3000000 |
| Iwan   | 4500000 |
| Dewi   | 3000000 |
| Hakim  | 3000000 |
+--------+---------+

5 rows in set (0.00 sec)

6)Tampilkan pegawai dan gaji >=1500000 dan <=4000000


mysql> select p.nama, j.gaji
    -> from pegawai p, jabatan j
    -> where p.kj=j.kj and j.gaji>=1500000 and j.gaji<=4000000;
+--------+---------+
| nama   | gaji    |
+--------+---------+
| Dahlan | 3000000 |
| Rizal  | 3000000 |
| Dewi   | 3000000 |
| Hakim  | 3000000 |
+--------+---------+

4 rows in set (0.05 sec)

7)Tampilkan pegawai dan anaknya yg berumur < 5


mysql> select p.nama, a.nama_anak, a.umur
    -> from pegawai p, anak a
    -> where p.nip=a.nip and a.umur<5;
+------+-----------+------+
| nama | nama_anak | umur |
+------+-----------+------+
| Iwan | Sultan    |    1 |
+------+-----------+------+

1 row in set (0.00 sec)

8)Tampilkan View dari 3 Tabel


mysql> select p.nama, a.nama_anak, j.jabatan
    -> from pegawai p, anak a, jabatan j
    -> where p.nip=a.nip and p.kj=j.kj;
+------+-----------+------------------+
| nama | nama_anak | jabatan          |
+------+-----------+------------------+
| Bayu | Haris     | Marketing Leader |
| Bayu | Hany      | Marketing Leader |
| Iwan | Sitti     | Network Engineer |
| Iwan | Sultan    | Network Engineer |
+------+-----------+------------------+

4 rows in set (0.00 sec)

VLSM (Variable Length Subnet Masking)

2009-10-30T07:38:00.000+07:00

Seperti yang telah kita ketahui, konsep subnetting adalah meminjam bit host untuk dikorbankan menjadi alamat network. Metode subnetting terdiri dari 2 macam:
- Melihat berdasarkan kebutuhan jumlah network
- Melihat berdasarkan kebutuhan jumlah IP Address

Pada VLSM menggunakan metode kedua, yakni melihat berdasarkan kebutuhan jumlah IP Address terbanyak dalam suatu network.

Contoh kasus yang digunakan adalah sebagai berikut:

Apabila diurutkan berdasarkan kebutuhan jumlah IP Address, dapat diurutkan menjadi:

1. LAN Branch-1 = 120 IP Address
2. LAN Branch-2 = 60 IP Address
3. LAN Branch-3 = 14 IP Address
4. LAN Branch-4 = 14 IP Address
5. WAN 1 = 2 IP Address
6. WAN 2 = 2 IP Address
7. WAN 3 = 2 IP Address

*Ket: 2^n = 2 pangkat n

I. Menentukan alamat subnetwork LAN Branch-1
2^n-2 >= 120, n=7 (7= jumlah bit 0 yang tetap)

IP Asal: 192.168.3.0
SM Asal : 255.255.255.00000000 (/24)
SM Baru : 255.255.255.10000000 (/25)

Terbentuk dua network:
- 192.168.3.0 /25 <== Digunakan untuk network LAN Branch-1
- 192.168.3.128 /25 <== di-subnet lagi untuk mendapatkan subnetwork baru

LAN Branch-1
- Alamat subnetwork : 192.168.3.0 /25
- Range IP Address : 192.168.3.1 – 192.168.3.126
- Alamat broadcast : 192.168.3.127

II. Menentukan alamat subnetwork LAN Branch-2
2^n-2 >= 60, n=6 (6= jumlah bit 0 yang tetap)

IP Asal : 192.168.3.128
SM Asal : 255.255.255.10000000 (/25)
SM Baru : 255.255.255.11000000 (/26)

Terbentuk dua network:
- 192.168.3.128 /26 <== Digunakan untuk network LAN Branch-2
- 192.168.3.192 /26 <== di-subnet lagi untuk mendapatkan subnetwork baru

LAN Branch-2
- Alamat subnetwork : 192.168.3.128 /26
- Range IP Address : 192.168.3.129 – 192.168.3.190
- Alamat broadcast : 192.168.3.191

III. Menentukan alamat subnetwork LAN Branch-3
2^n-2 >= 14, n=4 (4= jumlah bit 0 yang tetap)

IP Asal : 192.168.3.192
SM Asal : 255.255.255.11000000 (/26 )
SM Baru : 255.255.255.11110000 (/28 )

Terbentuk empat network:
- 192.168.3.192 /28 <== Digunakan untuk network LAN Branch-3
- 192.168.3.208 /28 <== Digunakan untuk network LAN Head Office
- 192.168.3.224 /28 <== di-subnet lagi untuk mendapatkan subnetwork baru
- 192.168.3.240 /28

Dari subnetting di atas didapatkan 4 buah network baru karena perubahan bit biner dari /26 ke /28 ada 2 bit, sehingga terbentuk 2(2) = 4 network.
LAN Branch-3
- Alamat subnetwork : 192.168.3.192 /28
- Range IP Address : 192.168.3.193 – 192.168.3.206
- Alamat broadcast : 192.168.3.207

LAN Head Office
- Alamat subnetwork : 192.168.3.208 /28
- Range IP Address : 192.168.3.209 – 192.168.3.222
- Alamat broadcast : 192.168.3.223

IV. Menentukan alamat WAN (Wide Area Network).

Subnetwork address untuk koneksi WAN sebaiknya menggunakan subnet mask /30 (255.255.255.252) karena hanya dibutuhkan 2 ip address sehingga lebih menghemat IP Address dan menambah keamanan pada koneksi WAN.

Untuk mendapatkan subnetwork address koneksi WAN, dapat memecah subnetwork 192.168.3.224 /28.

Berikut ini pemecahannya
2^n-2 >= 2, n=2 (2= jumlah bit 0 yang tetap)
IP Asal : 192.168.3.224
SM Asal : 255.255.255.11110000 (/28 )
SM Baru : 255.255.255.11111100 (/30 )

Terbentuk 4 network:
- 192.168.3.224 /30 <== Digunakan untuk network WAN 1
- 192.168.3.228 /30 <== Digunakan untuk network WAN 2
- 192.168.3.232 /30 <== Digunakan untuk network WAN 3
- 192.168.3.236 /30 <== dapat digunakan apabila ada pengembangan jaringan.

Proses subnetting di atas dapat disingkat menjadi:
- 192.168.3.0 /24
- 192.168.3.0 /25 <== Dialokasikan untuk LAN Branch-1
- 192.168.3.128 /25
- 192.168.3.128 /26 <== Dialokasikan untuk LAN Branch-2
- 192.168.3.192 /26
- 192.168.3.192 /28 <== Dialokasikan untuk LAN Branch-3
- 192.168.3.208 /28 <== Dialokasikan untuk LAN Head Office
- 192.168.3.224 /28 <== untuk keperluan masa datang
- 192.168.3.224 /30 <== Dialokasikan untuk WAN 1
- 192.168.3.228 /30 <== Dialokasikan untuk WAN 2
- 192.168.3.232 /30 <== Dialokasikan untuk WAN 3
- 192.168.3.236 /30 <== untuk keperluan masa datang
- 192.168.3.240 /28 <== untuk keperluan masa datang

Subnetting

2009-10-30T07:29:00.000+07:00

Subnetting digunakan untuk membuat segmentasi pada sebuah alamat network. Selain meningkatkan performansi jaringan, subnetting juga dapat menghemat IP Address. Peningkatan performansi terjadi pada router karena tabel router tidak terlalu banyak menyimpan catatan IP Address.

Konsep subnetting sendiri adalah meminjam bit porsi host menjadi bit porsi network. Metode subnetting ada dua:

1. Melihat berdasarkan kebutuhan jumlah subnet address

2. Melihat berdasarkan kebutuhan jumlah host (terbanyak)

Studi kasus:

Ket: 2^n = 2 pangkat n

I. Melihat berdasarkan kebutuhan jumlah subnet address
Rumus: 2^n-2 >=subnet address yang dibutuhkan
2^n-2 >=5, n=3 (n menunjukkan jumlah bit 0 yang berubah menjadi bit 1

Hasil:
Subnet Mask default : 255.255.255.00000000 (255.255.255.240) atau /24
Subnet Mask baru : 255.255.255.11100000 (255.255.255.224) atau /27
Subnet Address yang terbentuk : 2^n=2^3=8
Block size (jumlah IP per subnetwork) : 2^(jml bit 0 yang tetap)=2^5=32

Berdasarkan hasil perhitungan, maka subnetwork-subnetwork yang terbentuk:
1. 192.168.3.0 /27 <== Untuk CCNA I tidak boleh dialokasikan
2. 192.168.3.32 /27 <== dialokasikan untuk Head Office

- Network Address : 192.168.3.32 /27
- Range IP yg dapat dipakai : 192.168.3.33 /27 sampai 192.168.3.62 /27
- Broadcast Address : 192.168.3.63 /27

3. 192.168.3.64 /27 <== dialokasikan untuk Branch-1
- Network Address : 192.168.3.64 /27
- Range IP yg dapat dipakai : 192.168.3.65 /27 sampai 192.168.3.94 /27
- Broadcast Address : 192.168.3.95 /27
4. 192.168.3.96 /27 <== dialokasikan untuk Branch-2
- Network Address : 192.168.3.96 /27
- Range IP yg dapat dipakai : 192.168.3.97 /27 sampai 192.168.3.126 /27
- Broadcast Address : 192.168.3.127 /27

5. 192.168.3.128 /27 <== dialokasikan untuk WAN 1
- Network Address : 192.168.3.128 /27
- Range IP yg dapat dipakai : 192.168.3.129 /27 sampai 192.168.3.158 /27
- Broadcast Address : 192.168.3.159 /27

6. 192.168.3.160 /27 <== dialokasikan untuk WAN 2
- Network Address : 192.168.3.160 /27
- Range IP yg dapat dipakai : 192.168.3.161 /27 sampai 192.168.3.190 /27
- Broadcast Address : 192.168.3.191 /27

7. 192.168.3.192 /27 <==dapat dialokasikan untuk kebutuhan masa datang
- Network Address : 192.168.3.192 /27
- Range IP yg dapat dipakai : 192.168.3.193 /27 sampai 192.168.3.222 /27
- Broadcast Address : 192.168.3.223 /27

8. 192.168.3.224 /27 <== Untuk CCNA I tidak boleh dialokasikan

II. Melihat berdasarkan kebutuhan jumlah host
Rumus: 2^n-2 >= jumlah host(terbanyak) yang dibutuhkan
2^n-2 = 30, n=5 (n=menunjukkan jml bit 0 yang tetap)

Hasil:
Subnet Mask default : 255.255.255.00000000 (255.255.255.240) atau /24
Subnet Mask baru : 255.255.255.11100000 (255.255.255.224) atau /27
Subnet Address yang terbentuk : 2^n=2^3=8 (n=jml bit 0 yang berubah jadi 1)
Block size (jumlah IP per subnetwork) : 2^(jml bit 0 yang tetap)=2^5=32

Subnetwork-subnetwork yang dihasilkan sama seperti perhitungan menggunakan metode perhitungan berdasarkan jumlah network.

Download Map DotA Allstars v6.64 AI 0.213

2009-10-29T19:28:00.000+07:00

Changelog:

6.64 (v0.213)
=============
-First update to 6.64
-Changed the default AI behaviour of creeps and towers to be the same as in the official map
-Fixed the fade on Circles of Protection belonging to other players
-Fixed some numerical errors on Bristleback's abilities
-Added some additional AI ability functionality (Black Hole, Fissure, Epicenter)

[Mirrors]
MediaFire
Megaupload
RapidShare

First release, updated to 6.62 and 1.24b compliant. Note that this is v0.21, and there will be bugs.

Some abilities are not working for bots yet (they learn them but don't use them), and this is expected and will be addressed in future versions.

The following game modes have been disabled for now:
-vr, -rv, -rd, -cd, -cm, -lm, -xl

The following game commands have been disabled for now:
-afk, -kickafk, -ah, -switch, -fun

Please report bugs to me.

Things that are bugs:
-Crashes with reproducible reasons
-Abilities/items not working as expected (for players or bots)

Things that are not bugs:
-Bots not using certain abilities
-Bots being too strong/weak/cheating. They do that.

Show the map DotA 6.64 non AI here

DOWNLOAD HERE

Saying a Value Application In Pascal

2009-10-29T14:50:00.001+07:00

SOURCE CODE:


program terbilang_rekursi;

uses
wincrt;

function Terbilang(x:LongInt):String;
function Bilang(x:LongInt):String;
begin
case x of
0: Bilang := '';
1: Bilang := 'satu';
2: Bilang := 'dua';
3: Bilang := 'tiga';
4: Bilang := 'empat';
5: Bilang := 'lima';
6: Bilang := 'enam';
7: Bilang := 'tujuh';
8: Bilang := 'delapan';
9: Bilang := 'sembilan';
10: Bilang := 'sepuluh';
11: Bilang := 'sebelas';
end;
end;

begin
if x<12 then Terbilang:=' '+Bilang(x) else if x<20 then Terbilang:=Terbilang(x-10)+'belas' else if x<100 then Terbilang:=Terbilang(x div 10)+'puluh'+Terbilang(x mod 10) else if x<200 then Terbilang:='seratus'+Terbilang(x-100) else if x<1000 then Terbilang:=Terbilang(x div 100)+'ratus'+Terbilang(x mod 100) else if x<2000 then Terbilang:='seribu'+Terbilang(x-1000) else if x<1000000 then Terbilang:=Terbilang(x div 1000)+'ribu'+Terbilang(x mod 1000) else if x<1000000000 then Terbilang:=Terbilang(x div 1000000)+'juta'+Terbilang(x mod 1000000) else Terbilang:=Terbilang(x div 1000000000)+'milyar'+Terbilang(x mod 1000000000) end; var i:LongInt; lanjut:Char; begin repeat write('Masukkan data: ');readln(i); Writeln('Terbilang: ',Terbilang(i)); write('Lagi?');readln(lanjut); until(lanjut = 't') or (lanjut = 'T'); end.

OUTPUT:

Count Faktorial in Pascal

2009-10-29T14:47:00.000+07:00

Source Code:


program faktorial;
uses
wincrt;
var
i,fak:longint;


function faktorialiterasi(n:longint):longint;
var
f,k:longint;
begin
f:=1;
for k:=1 to n do
f:=f*k;
faktorialiterasi:=f;
end;
procedure faktorialproc(n:longint;var hasil:longint);
var
f,k:longint;
begin
f:=1;
for k:=1 to n do
f:=f*k;
hasil:=f;
end;
function faktorialrekursif(n:longint):longint;
begin
if n=0 then
faktorialrekursif:=1
else
faktorialrekursif:=n*faktorialrekursif(n-1);
end;
procedure faktorialprocrek(n:longint;var hasil:longint);
var
h:longint;
begin
if n=0 then
hasil:=1
else
begin
faktorialprocrek(n-1,h);
hasil:=n*h;
end;
end; 

begin
write('masukkan nilai faktorial yang dicari :');readln(i);
writeln;
writeln('nilai faktorial dengan fungsi iterasi', i, '! adalah ',faktorialiterasi(i));
writeln('nilai faktorial dengan fungsi rekursif', i, '! adalah ',faktorialrekursif(i));
faktorialproc(i,fak);
writeln('nilai faktorial dengan prosedur iterasi', i, '! adalah ',fak);
faktorialprocrek(i,fak);
writeln('nilai faktorial dengan prosedur rekursif', i, '! adalah ',fak);
end.

Output:

Database : Foreign Key and JOIN Function

2009-10-22T12:13:00.000+07:00


/* Membuat tabel karyawan dengan NIP sebagai PK */
mysql> create table karyawan
-> (NIP int(10) not null Primary Key,
-> Nama varchar(30),
-> JK varchar (2),
-> Kota varchar(30));


/* Membuat tabel anak dengan NIP sebagai FK bernama NIP juga */
mysql> create table anak
-> (NIP int(10) not null,
-> Nama_anak varchar(30),
-> JK_anak varchar(2),
-> umur int(4),
-> foreign key (NIP) references karyawan (NIP));


/* Menampilkan hubungan antara tabel karyawan dg tabel anak : nama dg nama_anak */
/* Cara I */
mysql> select karyawan.nama, anak.nama_anak
-> from karyawan, anak
-> where karyawan.nip = anak.nip;


/* Cara II */
mysql> select k.nama, a.nama_anak
-> from karyawan k, anak a
-> where  k.nip=a.nip;


/* Cara III */
mysql> select k.nama, a.nama_anak
-> from karyawan k left join anak a
-> on k.nip=a.nip;

C Programming : Input, Output, If..Else @SUSE

2009-10-21T15:39:00.000+07:00

C SOURCE


//by:saindra

#include "stdio.h"

int main() {

int a,b,c,umur,umur_teman;

/*
PENdeklarasian Variabel
*/

a = 5;
b = 10;  
c = 15;

/* 
HELLO WORLD output
*/

printf("\n");
printf("Hello World\n");
printf("nama saya Saindra\n");
fprintf(stdout,"Halo dunia lagi\n\n");

/*
Input Output  
*/

printf("Masukkan umur anda: ");scanf("%d", &umur);
printf("Umur anda: %d tahun\n\n", umur);

fprintf(stdout,"Masukkan umur teman anda: ");fscanf(stdin,"%d", &umur_teman);
fprintf(stdout,"Umur anda: %d tahun\n\n", umur_teman);

/*
fprintf(stdout) dan fscanf(stdin) digunakan pada output 
dan input FILE dan merupakan standar baku
dalam penulisan program di C
*/

if(umur>0 && umur<=20){     
printf("Anda masih muda\n\n");   
} else {     
if (umur>=20 && umur<=100) {       
printf("Anda sudah dewasa\n\n");     } 
else {       
printf("ERROR!\n\n");     
}   
}      

if(umur_teman>0 && umur_teman<=20){
printf("Teman anda masih muda\n\n");
} else {
if (umur_teman>=20 && umur_teman<=100){
printf("Teman anda sudah dewasa\n\n");
} else {
printf("ERROR!\n\n");
}
}
}

Compiling : gcc FileName.c -o EXEFIleName

adminmahasiswa@linux-73u9:~/Desktop/Saindra> gcc HelloWorld.c -o HelloWorldEXE

Output: ./EXEFileName

adminmahasiswa@linux-73u9:~/Desktop/Saindra> ./HelloWorldEXE


Hello World
nama saya Saindra
Halo dunia lagi

Masukkan umur anda: 17
Umur anda: 17 tahun

Masukkan umur teman anda: 34
Umur anda: 34 tahun

Anda masih muda

Teman anda sudah dewasa

DOTA Latest Map: 6.64

2009-10-20T12:22:00.000+07:00

Language:	English
Date:	2009-10-13
MD5:	0cd942347ba11b73cc36ce87662e0844
Changelog:	View Details

Click the spoiler below for displaying Map 6.64 ChangeLog

SQL Query: INDEXES

2009-10-15T13:16:00.001+07:00

Indexes in databases are very similar to indexes in libraries. Indexes allow locating information within a database fast, much like they do in libraries. If all books in a library are indexed alphabetically then you don’t need to browse the whole library to find particular book. Instead you’ll simply get the first letter from the book title and you’ll find this letter’s section in the library starting your search from there, which will narrow down your search significantly.

An Index can be created on a single column or a combination of columns in a database table. A table index is a database structure that arranges the values of one or more columns in a database table in specific order. The table index has pointers to the values stored in specified column or combination of columns of the table. These pointers are ordered depending on the sort order specified in the index.

Here is how to use CREATE INDEX SQL statement to create an index on column Model in the Product table, called idxModel:


CREATE INDEX idxModel
ON Product (Model)

The syntax for creating indexes varies greatly amongst different RDBMS, that’s why we will not discuss this matter further.

There are some general rules which describe when to use indexes. When dealing with relatively small tables, indexes do not improve performance. In general indexes improve performance when they are created on fields used in table joins. Use indexes when most of your database queries retrieve relatively small datasets, because if your queries retrieve most of the data most of the time, the indexes will actually slow the data retrieval. Use indexes for columns that have many different values (there are not many repeated values within the column). Although indexes improve search performance, they slow the updates, and this might be something worth considering.

SQL Query: VIEWS

2009-10-15T13:15:00.002+07:00

A SQL View is a virtual table, which is based on SQL SELECT query. Essentially a view is very close to a real database table (it has columns and rows just like a regular table), except for the fact that the real tables store data, while the views don’t. The view’s data is generated dynamically when the view is referenced. A view references one or more existing database tables or other views. In effect every view is a filter of the table data referenced in it and this filter can restrict both the columns and the rows of the referenced tables.

Here is an example of how to create a SQL view using already familiar Product and Manufacturer SQL tables:

CREATE VIEW vwAveragePrice AS
SELECT Manufacturer, ManufacturerWebsite, ManufacturerEmail, AVG(Price) AS AvgPrice
FROM Manufacturer JOIN Product
ON Manufacturer.ManufacturerID = Product.ManufacturerID
GROUP BY Manufacturer, ManufacturerWebsite, ManufacturerEmail

A view can be referenced and used from another view, from a SQL query, and from stored procedure. You reference a view as you would reference any real SQL database table:

SELECT * FROM vwAveragePrice

SQL Query: CREATE DATABASE, CREATE TABLE, and ALTER TABLE

2009-10-15T13:15:00.000+07:00

The CREATE DATABASE statement is used to create a new SQL database and has the following syntax:

CREATE DATABASE DatabaseName

The CREATE DATABASE implementation and syntax varies substantially between different RDBMS implementations.

The CREATE TABLE statement is used to create a new database table. Here is how a simple CREATE TABLE statement looks like:

CREATE TABLE TableName
(
Column1 DataType,
Column2 DataType,
Column3 DataType,
….

)

The DataType specified after each column name is a placeholder fro the real data type of the column.

The following CREATE TABLE statement creates the Users table we used in one of the first chapters:

CREATE TABLE Users
(
FirstName CHAR(100),
LastName CHAR(100),
DateOfBirth DATE
)

The CREATE TABLE statement above creates a table with 3 columns – FirstName of type CHAR with length of 100 characters, LastName of type CHAR with length of 100 characters and DateOfBirth of type DATE.

The ALTER TABLE statement is used to change a table definition by adding, modifying or dropping columns. Below you can see the syntax of an ALTER TABLE statement, which adds a new column to the table:

ALTER TABLE TableName
ADD ColumnName DataType

If we want to delete the newly added ColumnName column we can do it with the following ALTER TABLE statement:

ALTER TABLE TableName
DROP ColumnName

SQL Query: Nested Queries

2009-10-15T13:14:00.000+07:00

A SQL nested query is a SELECT query that is nested inside a SELECT, UPDATE, INSERT, or DELETE SQL query. Here is a simple example of SQL nested query:

SELECT Model FROM Product
WHERE ManufacturerID IN (SELECT ManufacturerID FROM Manufacturer
WHERE Manufacturer = 'Dell')

The nested query above will select all models from the Product table manufactured by Dell:

Model

Inspiron B120

Inspiron B130

Inspiron E1705

You can have more than one level of nesting in one single query.

SQL Query: UNION

2009-10-15T13:13:00.000+07:00

The SQL UNION is used to combine the results of two or more SELECT SQL statements into a single result. All the statements concatenated with UNION must have the same structure. This means that they need to have the same number of columns, and corresponding columns must have the same or compatible data types (implicitly convertible to the same type or explicitly converted to the same type). The columns in each SELECT statement must be in exactly the same order too.

This is how a simple UNION statement looks like:

SELECT Column1, Column2 FROM Table1
UNION
SELECT Column1, Column2 FROM Table2

The column names in the result of a UNION are always the same as the column names in the first SELECT statement in the UNION.

The UNION operator removes by default duplicate rows from the result set. You have the option to use the ALL keyword after the UNION keyword, which will force all rows including duplicates to be returned in your result set.

SQL Query: JOIN

2009-10-15T13:12:00.001+07:00

In all SQL examples so far we’ve selected data from a single table. In the previous chapter we learned how the concepts of Primary Key and Foreign Key, and how database table relate to one another. Using that knowledge we can move forward and learn how to select data from more than one table in one SQL statement.

The SQL JOIN clause is used to retrieve data from 2 or more tables joined by common fields. The most common scenario is a primary key from one of the tables matches a foreign key in second table. We will use the 2 related tables Product and Manufacturer from the previous chapter, to illustrate how to use JOIN. Consider the SQL JOIN statement below:

SELECT Manufacturer, ManufacturerWebsite, ManufacturerEmail, AVG(Price) AS AvgPrice
FROM Manufacturer JOIN Product
ON Manufacturer.ManufacturerID = Product.ManufacturerID
GROUP BY Manufacturer, ManufacturerWebsite, ManufacturerEmail

The first obvious thing about this SQL statement is that it contains columns from 2 different tables in the SELECT column list. Then the FROM clause is followed by a JOIN clause. The JOIN clause has 2 parts, the first one stating the tables we are joining:

Manufacturer JOIN Product

And the second part, which specifies which columns we are joining on:

ON Manufacturer.ManufacturerID = Product.ManufacturerID

Because the Price column is a parameter for the AVG function in our SQL statement, we need to use GROUP BY clause for the rest of the columns in the SELECT list.
As you might already have guessed our SQL statement selects a list of all manufacturers and the average price of their product. The result will look like this:

Manufacturer	ManufacturerWebsite	ManufacturerEmail	AvgPrice
Dell	http://www.dell.com	support@dell.com	$682.33
Toshiba	http://www.toshiba.com	support@toshiba.com	$741.50

You can specify the JOIN condition in the WHERE clause instead of the FROM clause, without using the JOIN keyword like this:

SELECT Manufacturer, ManufacturerWebsite, ManufacturerEmail, AVG(Price) AS AvgPrice
FROM Manufacturer, Product
WHERE Manufacturer.ManufacturerID = Product.ManufacturerID
GROUP BY Manufacturer, ManufacturerWebsite, ManufacturerEmail

It’s a better programming practice to specify your JOIN conditions in the FROM clause.
When joining tables you’ll have to make sure that there is no ambiguity in the column names. In our example both Manufacturer and Product tables have a column named ManufacturerID, that’s why we prefixed this columns name with the respective table name concatenated with dot. Another thing worth mentioning in our example is the following part of the SQL statement:

AVG(Price) AS AvgPrice

Because the column produced by the AVG function doesn’t have its own name we made up a name for it – AvgPrice. If we put this in SQL terms – we created an alias for the new column.

There are 2 main types of SQL JOINS – INNER JOINS and OUTER JOINS. In our example we didn’t specify what type was the JOIN, and by doing that we used INNER JOIN by default. The INNER JOIN and JOIN clauses are interchangeable in general (Keep in mind that different RDBMS have different syntax for their JOIN clause).

The INNER JOIN clause will retrieve all rows from both tables as long as there is a match between the columns we are joining on. If we add a new manufacturer to our Manufacturer table, but we don’t add any products for it in the Product table, and we run our JOIN statement from above, the result will be the same as it was before adding the new manufacturer. This simply happens because we don’t have a match for this new manufacturer in the Product table, and because we are using INNER JOIN, which returns only the matching rows. The final result is that this manufacturer with products doesn’t appear in the retrieved data.

Wait you say, what if I want to get the list of all manufacturers no matter if they have any products listed in the Product table? How can I do that? The answer is – use OUTER JOIN.

OUTER JOIN clause returns all rows from at least one of the joined tables, granted that these rows meet the search conditions specified in the WHERE and HAVING clause (if any).

In order to get all manufacturers and their average product price, without worrying that some of the manufacturers do not have any products listed yet, we will use the following OUTER JOIN SQL statement:

SELECT Manufacturer, ManufacturerWebsite, ManufacturerEmail, AVG(Price) AS AvgPrice
FROM Manufacturer LEFT OUTER JOIN Product
ON Manufacturer.ManufacturerID = Product.ManufacturerID
GROUP BY Manufacturer, ManufacturerWebsite, ManufacturerEmail

The only difference in our new statement is that we added the keywords LEFT OUTER in front of the JOIN keyword. The SQL OUTER JOIN has 2 sub-types called LEFT OUTER JOIN (or simply LEFT JOIN) and RIGHT OUTER JOIN (or simply RIGHT JOIN). When we use LEFT OUTER JOIN clause we indicate that we want to get all rows from the left table listed in our FROM clause (we will also called it the first table), even if they don’t have a match in the right (second) table.

What values will be returned for the columns selected from the second table, which do not have a match, you may ask? If we relate this question to our example it will sound like this: What average product price will our SQL query return for all manufacturers, which don’t have any products in the Product table? The answer is simple – NULL.

The result of our LEFT OUTER JOIN query will be the following if we added Sony to the Manufacturer table, but we didn’t add any Sony products to the Product table:

Manufacturer	ManufacturerWebsite	ManufacturerEmail	AvgPrice
Dell	http://www.dell.com	support@dell.com	$682.33
Toshiba	http://www.toshiba.com	support@toshiba.com	$741.50
Sony	http://www.sony.com	support@sony.com	NULL

The RIGHT OUTER JOIN or simply RIGHT JOIN does exactly the opposite the LEFT JOIN does. The RIGHT OUTER JOIN gets all rows from the right (second) table listed in our FROM clause, even if they don’t have a match in the left (first) table and returns NULL values for the columns from the left table we don’t have match for.

Finally a table can be joined to itself, and to accomplish that you need to give the table 2 different aliases in the FROM clause.

SQL Query: Table Relations, Primary and Foreign Keys, and Normalization

2009-10-15T13:11:00.001+07:00

So far in all SQL examples we had we were dealing with a single table. The truth is that in real life when dealing with databases you’ll have to work with many tables, which are interrelated. The true power of the Relational Database Management Systems is the fact that they are Relational.

The relationships in a RDBMS ensure that there is no redundant data. What is redundant data, you might ask? I’ll answer you with example. An online store, offers computers for sale and the easiest way to track the sales will be to keep them in a database. You can have a table called Product, which will hold information about each computer - model name, price and the manufacturer. You also need to keep some details about the manufacturer like their website and their support email. If you store the manufacturer details in the Product table, you will have the manufacturer contact info repeated for each computer model the manufacturer produces:

model	Price	Manufacturer	ManufacturerWebsite	ManufacturerEmail
Inspiron B120	$499	Dell	http://www.dell.com	support@dell.com
Inspiron B130	$599	Dell	http://www.dell.com	support@dell.com
Inspiron E1705	$949	Dell	http://www.dell.com	support@dell.com
Satellite A100	$549	Toshiba	http://www.toshiba.com	support@toshiba.com
Satellite P100	$934	Toshiba	http://www.toshiba.com	support@toshiba.com

To get rid of the redundant manufacturer data in the Product table, we can create a new table called Manufacturer, which will have only one entry (row) for each manufacturer and we can link (relate) this table to the Product table. To create this relation we need to add additional column in the Product table that references the entries in the Manufacturer table.

A relationship between 2 tables is established when the data in one of the columns in the first table matches the data in a column in the second table. To explain this further we have to understand SQL relational concepts – Primary Key and Foreign Key. Primary Key is a column or a combination of columns that uniquely identifies each row in a table.
Foreign Key is a column or a combination of columns whose values match a Primary Key in a different table. In the most common scenario the relationship between 2 tables matches the Primary Key in one of the tables with a Foreign Key in the second table. Consider the new Product and Manufacturer tables below:

Manufacturer

ManufacturerID	Manufacturer	ManufacturerWebsite	ManufacturerEmail
1	Dell	http://www.dell.com	support@dell.com
2	Toshiba	http://www.toshiba.com	support@toshiba.com

Product

model	Price	ManufacturerID
Inspiron B120	$499	1
Inspiron B130	$599	1
Inspiron E1705	$949	1
Satellite A100	$549	2
Satellite P100	$934	2

The first table is Manufacturer which has 2 entries for Dell and Toshiba respectively. Each of these entries has a ManufacturerID value, which is unique integer number. Because the ManufacturerID column is unique for the Manufacturer table we can use it as a Primary Key in this table. The Product table retains the Model and the Price columns, but has a new column called ManufacturerID, which matches the values of the ManufacturerID column in the Manufacturer table. All values in the ManufacturerID column in the Product table have to match one of the values in the Manufacturer table Primary Key (for example you can’t have ManufacturerID with value of 3 in the Product table, simply because there is no manufacturer with this ManufacturerID defined in the Manufacturer table).

I’m sure you’ve noticed that we used the same name for the Primary Key in the first table as for the Foreign Key in the second. This was done on purpose to show the relationship between the 2 tables based on these columns. Of course you can call the 2 columns with different names, but if somebody sees your database for a first time it won’t be immediately clear that these 2 tables are related.

But how do we ensure that the Product table doesn’t have invalid entries like the last entry below:

model	Price	ManufacturerID
Inspiron B120	$499	1
Inspiron B130	$599	1
Inspiron E1705	$949	1
Satellite A100	$549	2
Satellite P100	$934	2
ThinkPad Z60t	$849	3

We do not have a manufacturer with ManufacturerID of 3 in our Manufacturer table, hence this entry in the Product table is invalid. The answer is that you have to enforce referential integrity between the 2 tables. Different RDBMS have different ways to enforce referential integrity, and I will not go into more details as this is not important to understand the concept of relationship between tables.

There are 3 types of relations between tables – One-To-Many, Many-To-Many and One-To-One. The relation we created above is One-To-Many and is the most common of the 3 types. In One-To-Many relation a row in one of the tables can have many matching rows in the second table, but a row the second table can match only one row in the first table.

In our example, each manufacturer (a row in the Manufacturer table) produces several different computer models (several rows in the Product table), but each particular product (a row in the Product table) has only one manufacturer (a row in the Manufacturer table).

The second type is the Many-To-Many relation. In this relation many rows from the first table can match many rows in the second and the other way around. To define this type of relation you need a third table whose primary key is composed of the 2 foreign keys from the other 2 table. To clarify this relation lets review the following example. We have a Article table (ArticleID is primary key) and Category (CategoryID is primary key) table.
Every article published in the Article table can belong to multiple categories. To accommodate that, we create a new table called ArticleCategory, which has only 2 columns – ArticleID and CategoryID (these 2 columns form the primary key for this table). This new table called sometimes junction table defines the Many-To-Many relationship between the 2 main tables. One article can belong to multiple categories, and every category may contain more than one article.

In the One-To-One relation each row in the first table may match only one row in the second and the other way around. This relationship is very uncommon simply because if you have this type of relation you may as well keep all the info in one single table.

By dividing the data into 2 tables we successfully removed the redundant manufacturer details from the initial Product table adding an integer column referencing the new Manufacturer table instead.

The process of removing redundant data by creating relations between tables is known as Normalization. Normalization process uses formal methods to design the database in interrelated tables.

SQL Query: HAVING

2009-10-15T13:10:00.000+07:00

The SQL HAVING clause is used in conjunction with the SELECT clause to specify a search condition for a group or aggregate. The HAVING clause behaves like the WHERE clause, but is applicable to groups - the rows in the result set representing groups. In contrast the WHERE clause is applied to individual rows, not to groups.

To clarify how exactly HAVING works, we’ll use the Sales table:

OrderID	OrderDate	OrderPrice	OrderQuantity	CustomerName
1	12/22/2005	160	2	Smith
2	08/10/2005	190	2	Johnson
3	07/13/2005	500	5	Baldwin
4	07/15/2005	420	2	Smith
5	12/22/2005	1000	4	Wood
6	10/2/2005	820	4	Smith
7	11/03/2005	2000	2	Baldwin

In the previous chapter we retrieved a list with all customers along with the total amount each customer has spent respectively and we use the following statement:

SELECT CustomerName, SUM(OrderPrice) FROM Sales
GROUP BY CustomerName

This time we want to select all unique customers, who have spent more than 1200 in our store. To accomplish that we’ll modify the SQL statement above adding the HAVING clause at the end of it:

SELECT CustomerName, SUM(OrderPrice) FROM Sales
GROUP BY CustomerName
HAVING SUM(OrderPrice) > 1200

The result of the SELECT query after we added the HAVING search condition is below:

CustomerName OrderPrice
Baldwin 2500
Smith 1400

CustomerName	OrderPrice
Baldwin	2500
Smith	1400

Another useful example of the HAVING clause, will be if we want to select all customers that have ordered more than 5 items in total from all their orders. OUR HAVING statement will look like this:

SELECT CustomerName, SUM(OrderQuantity) FROM Sales
GROUP BY CustomerName
HAVING SUM(OrderQuantity) > 5

You can have both WHERE and HAVING in one SELECT statement. For example you want to select all customers who have spent more than 1000, after 10/01/2005. The SQL statement including both HAVING and WHERE clauses will look like this:

SELECT CustomerName, SUM(OrderPrice) FROM Sales
WHERE OrderDate > ‘10/01/2005’
GROUP BY CustomerName
HAVING SUM(OrderPrice) > 1000

Here is something very important to keep in mind. The WHERE clause search condition is applied to each individual row in the Sales table. After that the HAVING clause is applied on the rows in the final result, which are a product of the grouping. The important thing to remember is that the grouping is done only on the rows that satisfied the WHERE clause condition.

SQL Query: GROUP BY

2009-10-15T13:05:00.000+07:00

The SQL GROUP BY statement is used together with the SQL aggregate functions to group the retrieved data by one or more columns. The GROUP BY concept is one of the most complicated concepts for people new to the SQL language and the easiest way to understand it, is by example.

We want to retrieve a list with unique customers from our Sales table, and at the same time to get the total amount each customer has spent in our store.

OrderID	OrderDate	OrderPrice	OrderQuantity	CustomerName
1	12/22/2005	160	2	Smith
2	08/10/2005	190	2	Johnson
3	07/13/2005	500	5	Baldwin
4	07/15/2005	420	2	Smith
5	12/22/2005	1000	4	Wood
6	10/2/2005	820	4	Smith
7	11/03/2005	2000	2	Baldwin

You already know how to retrieve a list with unique customer using the DISTINCT keyword:

SELECT DISTINCT CustomerName FROM Sales

The SQL statement above works just fine, but it doesn’t return the total amount of money spent for each of the customers. In order to accomplish that we will use both SUM SQL function and the GROUP BY clause:

SELECT CustomerName, SUM(OrderPrice) FROM Sales
GROUP BY CustomerName

We have 2 columns specified in our SELECT list – CustomerName and SUM(OrderPrice). The problem is that SUM(OrderPrice), returns a single value, while we have many customers in our Sales table. The GROUP BY clause comes to the rescue, specifying that the SUM function has to be executed for each unique CustomerName value. In this case the GROUP BY clause acts similar to DISTINCT statement, but for the purpose of using it along with SQL aggregate functions. The result set retrieved from the statement above will look like this

CustomerName	OrderPrice
Baldwin	2500
Johnson	190
Smith	1400
Wood	1000

You do grouping using GROUP BY by more than one column, for example:

SELECT CustomerName, OrderDate, SUM(OrderPrice) FROM Sales
GROUP BY CustomerName, OrderDate

When grouping, keep in mind that all columns that appear in your SELECT column list, that are not aggregated (used along with one of the SQL aggregate functions), have to appear in the GROUP BY clause too.

SQL Query: AGGREGATE FUNCTION

2009-10-15T13:01:00.001+07:00

SQL Aggregate functions return a single value, using values in a table column. In this chapter we are going to introduce a new table called Sales, which will have the following columns and data:

OrderID	OrderDate	OrderPrice	OrderQuantity	CustomerName
1	12/22/2005	160	2	Smith
2	08/10/2005	190	2	Johnson
3	07/13/2005	500	5	Baldwin
4	07/15/2005	420	2	Smith
5	12/22/2005	1000	4	Wood
6	10/2/2005	820	4	Smith
7	11/03/2005	2000	2	Baldwin

The SQL COUNT function returns the number of rows in a table satisfying the criteria specified in the WHERE clause. If we want to count how many orders has made a customer with CustomerName of Smith, we will use the following SQL COUNT expression:

SELECT COUNT (*) FROM Sales
WHERE CustomerName = 'Smith'

Let’s examine the SQL statement above. The COUNT keyword is followed by brackets surrounding the * character. You can replace the * with any of the table’s columns, and your statement will return the same result as long as the WHERE condition is the same.

The result of the above SQL statement will be the number 3, because the customer Smith has made 3 orders in total.

If you don’t specify a WHERE clause when using COUNT, your statement will simply return the total number of rows in the table, which in our case is 7:

SELECT COUNT(*) FROM Sales

How can we get the number of unique customers that have ordered from our store? We need to use the DISTINCT keyword along with the COUNT function to accomplish that:

SELECT COUNT (DISTINCT CustomerName) FROM Sales

The SQL SUM function is used to select the sum of values from numeric column. Using the Sales table, we can get the sum of all orders with the following SQL SUM statement:

SELECT SUM(OrderPrice) FROM Sales

As with the COUNT function we put the table column that we want to sum, within brackets after the SUM keyword. The result of the above SQL statement is the number 4990.

If we want to know how many items have we sold in total (the sum of OrderQuantity), we need to use this SQL statement:

SELECT SUM(OrderQuantity) FROM Sales

The SQL AVG function retrieves the average value for a numeric column. If we need the average number of items per order, we can retrieve it like this:

SELECT AVG(OrderQuantity) FROM Sales

Of course you can use AVG function with the WHERE clause, thus restricting the data you operate on:

SELECT AVG(OrderQuantity) FROM Sales
WHERE OrderPrice > 200

The above SQL expression will return the average OrderQuantity for all orders with OrderPrice greater than 200, which is 17/5.

The SQL MIN function selects the smallest number from a numeric column. In order to find out what was the minimum price paid for any of the orders in the Sales table, we use the following SQL expression:

SELECT MIN(OrderPrice) FROM Sales

The SQL MAX function retrieves the maximum numeric value from a numeric column. The MAX SQL statement below returns the highest OrderPrice from the Sales table:

SELECT MAX(OrderPrice) FROM Sales

SQL Query: ORDER BY

2009-10-15T12:54:00.001+07:00

SQL ORDER BY clause is used to order the data sets retrieved from a SQL database. The ordering of the selected data can be done by one or more columns in a table. If we want to sort our Users table by the FirstName column, we’ll have to use the following ORDER BY SQL statement:

SELECT * FROM Users
ORDER BY FirstName

The result of the ORDER BY statement above will be the following:

FirstName	LastName	DateOfBirth	Email	City
David	Stonewall	01/03/1954	david@sql-tutorial.com	San Francisco
John	Smith	12/12/1969	john.smith@john-here.com	New York
Paul	O'Neil	09/17/1982	paul.oneil@pauls-email.com	New York
Stephen	Grant	03/03/1974	sgrant@sgrantemail.com	Los Angeles
Susan	Grant	03/03/1970	susan.grant@sql-tutorial.com	Los Angeles

As you can see the rows are ordered alphabetically by the FirstName column.

You can use ORDER BY to order the retrieved data by more than one column. For example, if you want to order by both LastName and City columns, you would do it with the following ORDER BY statement:

SELECT * FROM Users
ORDER BY LastName, DateOfBirth

Here is the result of this ORDER BY statement:

FirstName	LastName	DateOfBirth	Email	City
Susan	Grant	03/03/1970	susan.grant@sql-tutorial.com	Los Angeles
Stephen	Grant	03/03/1974	sgrant@sgrantemail.com	Los Angeles
Paul	O'Neil	09/17/1982	paul.oneil@pauls-email.com	New York
John	Smith	12/12/1969	john.smith@john-here.com	New York
David	Stonewall	01/03/1954	david@sql-tutorial.com	San Francisco

When using ORDER BY with more than one column, you need to separate the list of columns following ORDER BY with commas.

What will happen if we reverse the order of the columns specified after the ORDER BY statement like in the statement below?

SELECT * FROM Users
ORDER BY DateOfBirth, LastName

This ORDER BY statement will return the same results as the one with the reversed columns order, but they will be ordered differently. Here is the result:

FirstName	LastName	DateOfBirth	Email	City
David	Stonewall	01/03/1954	david@sql-tutorial.com	San Francisco
John	Smith	12/12/1969	john.smith@john-here.com	New York
Susan	Grant	03/03/1970	susan.grant@sql-tutorial.com	Los Angeles
Stephen	Grant	03/03/1974	sgrant@sgrantemail.com	Los Angeles
Paul	O'Neil	09/17/1982	paul.oneil@pauls-email.com	New York

The ORDER BY clause first sorts the retrieved data by the first column, then the next one, and so forth.

In all the ORDER BY examples so far, we were sorting alphabetically for character columns (FirstName, LastName) and from earlier to later date for the DateOfBirth column. What do we do if we want to order our data alphabetically but this time backwards? In order to accomplish that we need to use the DESC SQL keyword:

SELECT * FROM Users
ORDER BY FirstName DESC

Here is the result:

FirstName	LastName	DateOfBirth	Email	City
Susan	Grant	03/03/1970	susan.grant@sql-tutorial.com	Los Angeles
Stephen	Grant	03/03/1974	sgrant@sgrantemail.com	Los Angeles
Paul	O'Neil	09/17/1982	paul.oneil@pauls-email.com	New York
John	Smith	12/12/1969	john.smith@john-here.com	New York
David	Stonewall	01/03/1954	david@sql-tutorial.com	San Francisco

When you add the keyword DESC after a column name in the ORDER BY clause, you are still ordering by this column but the result is retrieved backwards. The opposite of the DESC keyword is the ASC keyword which orders by the specified columns alphabetically. But how did our previous statements know to order the data alphabetically, when we didn’t specify the ASC keyword? The answer is simple, when you don’t specify ASC or DESC after a column in the ORDER BY column list, then the ordering is done ASC (alphabetically, from low to high) by default.

It’s important to remember that whenever you are ordering by more than one column, you need to specify ASC and/or DESC after each column, if you need specific ordering. For example the statement below will order by both LastName and DateOfBirth but only LastName will be in descending order:

SELECT * FROM Users
ORDER BY DateOfBirth, LastName DESC

If you want to order descending by both columns you need to change the ORDER BY statement to this:

SELECT * FROM Users
ORDER BY DateOfBirth DESC, LastName DESC.

SQL Query: DELETE

2009-10-15T12:51:00.001+07:00

You already know how to retrieve, insert and update data in SQL database table. In this chapter we’ll learn how to delete data from a table using the SQL DELETE command.

Using our Users table we will illustrate the SQL DELETE usage. One of the users in the Users table (Stephen Grant) has just left the company, and your boss has asked you to delete his record. How do you do that? Consider the SQL statement below:

DELETE FROM Users
WHERE LastName = 'Grant'

The first line in the SQL DELETE statement above specifies the table that we are deleting the record(s) from. The second line (the WHERE clause) specifies which rows exactly do we delete (in our case all rows which has LastName of ‘Grant’). As you can see the DELETE SQL queries have very simple syntax and in fact are very close to the natural language. But wait, there is something wrong with the statement above! The problem is that we have more than one user having last name of ‘Grant’, and all users with this last name will be deleted. Because we don’t want to do that, we need to find a table field or combination of fields that uniquely identifies the user Stephen Grant. Looking at the Users table an obvious candidate for such a unique field is the Email column (it’s not likely that different users use one and the same email). Our improved SQL query which deletes only the record of Stephen Grant’s record will look like this:

DELETE FROM Users
WHERE Email = 'sgrant@sgrantemail.com'

What happens if you don’t specify a WHERE clause in your DELETE query?

DELETE FROM Users

The answer is that all records in the Users table will be deleted. The SQL TRUNCATE statement below will have the exact same effect as the last DELETE statement:

TRUNCATE TABLE Users

The TRUNCATE statement will delete all rows in the Users table, without deleting the table itself.

Be very careful when using DELETE and TRUNCATE, because you cannot undo these statements, and once row(s) are deleted fro your table they are gone forever if you don’t have a backup.

SQL Query: UPDATE

2009-10-15T12:49:00.000+07:00

So far we only looked at retrieving data from SQL database, but we never talked about modifying/updating data. The SQL UPDATE command is used to modify data stored in database tables.

If you want to update the email of one of the users in our Users table, you’ll use a SQL statement like the one below:

UPDATE Users
SET Email = 'new_email_goes_here@yahoo.com'
WHERE Email = 'sgrant@sgrantemail.com'

Let’s examine the statement above. The first row has the keyword UPDATE followed by the name of the table we are updating. The second row is the row that defines the changes made to the database fields using the keyword SET followed by the column name, equal sign and the new value for this column. You can have more than one assignment of new value after the SET keyword, for example if you want to update both the email and the city you will use the SQL statement below:

UPDATE Users
SET Email = 'new_email_goes_here@yahoo.com', City = 'San Francisco'
WHERE Email = 'sgrant@sgrantemail.com'

The third line is our WHERE clause, which specifies which record(s) to update. In our case it says to update the Email filed of the row having email sgrant@sgrantemail.com.

What happens if you remove the WHERE clause and your SQL query looks like this:

UPDATE Users
SET Email = 'new_email_goes_here@yahoo.com'

The answer is that all Email entries in the Users table will be changed to new_email_goes_here@yahoo.com. Most likely you will not want to do something like this, but you might have a case when you need to update several table rows at once. For example if one of the company’s offices has been moved from San Francisco to Los Angeles you might want to update all users with City San Francisco to Los Angeles (we assume that the employees have moved too). To do that, use the following SQL statement:

UPDATE Users
SET City = 'Los Angeles'
WHERE City = 'San Francisco'

In both UPDATE example having WHERE clause above, I’ve changed a table field to new value, using the same field in the WHERE clause criteria. This was purely coincidental and you can update different field(s) than the one used in your WHERE criteria, for example:

UPDATE Users
SET Email = 'new_email_goes_here@yahoo.com'
WHERE FirstName = 'Stephen' AND LastName = 'Grant'

When updating make sure that the WHERE clause criteria you have specified updates only the rows you want. Using the example above if you didn’t have FirstName = ‘Stephen’ in your WHERE criteria, you would have updated 2 records (Susan Grant and Stephen Grant), because both these users have one and the same last name.

SQL Query: DISTINCT

2009-10-15T12:43:00.000+07:00

The SQL DISTINCT command used along with the SELECT keyword retrieves only unique data entries depending on the column list you have specified after it. To illustrate the usage of the DISTINCT keyword, we’ll use our Users table introduced in the previous chapters.

FirstName	LastName	DateOfBirth	Email	City
John	Smith	12/12/1969	john.smith@john-here.com	New York
David	Stonewall	01/03/1954	david@sql-tutorial.com	San Francisco
Susan	Grant	03/03/1970	susan.grant@sql-tutorial.com	Los Angeles
Paul	O'Neil	09/17/1982	paul.oneil@pauls-email.com	New York
Stephen	Grant	03/03/1974	sgrant@sgrantemail.com	Los Angeles

Our Users table has several users in it, and it would be interesting to retrieve a list with all cities where our users live. If we use the statement below, we will get our city list, but there will be repetitions in it, because some in some cases more than one user lives in certain city:

SELECT City
FROM Users

So how do we do get a list with all cities without repeating them? As you have guessed we’ll use the DISTINCT keyword:

SELECT DISTINCT City
FROM Users

The result of the SQL DISTINCT expression above will look like this:

City

New York

San Francisco

Los Angeles

Essentially what the DISTINCT keyword does is removing the duplicates from the result set returned by your SELECT SQL statement.

You can use the DISTINCT keyword with more than one column. Please consider the example below:

SELECT DISTINCT LastName, City
FROM Users

What the above statement will do is to return all unique combinations between LastName and City columns. Here is what the result of this statement will be:

LastName	City
Smith	New York
Stonewall	San Francisco
Grant	Los Angeles
O'Neil	New York

If you have a look at the original table above, you’ll notice that there are two users with identical names (Grant), who happen to live in the same city (Los Angeles). Because the combination of LastName and City values for both this users is not unique, we got only one row with it, when we used the DISTINCT keyword. On the other hand if we add one more column (Email) after the DISTINCT keyword:

SELECT DISTINCT LastName, Email, City
FROM Users

We’ll retrieve both users with last name Grant, simply because they have different emails and thus their entries are unique as far as our SQL statement is concerned:

LastName	Email	City
Smith	john.smith@john-here.com	New York
Stonewall	david@sql-tutorial.com	San Francisco
Grant	susan.grant@sql-tutorial.com	Los Angeles
O'Neil	paul.oneil@pauls-email.com	New York
Grant	sgrant@sgrantemail.com	Los Angeles

SQL Query: INSERT

2009-10-15T12:27:00.001+07:00

The SQL INSERT INTO clause is used to insert data into a SQL table. The SQL INSERT INTO is frequently used and has the following generic syntax:

INSERT INTO Table1 (Column1, Column2, Column3…)
VALUES (ColumnValue1, ColumnValue2, ColumnValue3 …)

The SQL INSERT INTO clause has actually two parts – the first specifying the table we are inserting into and giving the list of columns we are inserting values for, and the second specifying the values inserted in the column list from the first part.

Consider the Users table from the previous chapter:

FirstName	LastName	DateOfBirth	Email	City
John	Smith	12/12/1969	john.smith@john-here.com	New York
David	Stonewall	01/03/1954	david@sql-tutorial.com	San Francisco
Susan	Grant	03/03/1970	susan.grant@sql-tutorial.com	Los Angeles
Paul	O'Neil	09/17/1982	paul.oneil@pauls-email.com	New York
Stephen	Grant	03/03/1974	sgrant@sgrantemail.com	Los Angeles

If we want to enter a new data row into the Users table, we can do it with the following SQL INSERT INTO statement:

INSERT INTO Users (FirstName, LastName, DateOfBirth, Email, City)
VALUES ('Frank', 'Drummer', '10/08/1955', 'frank.drummer@frankdrummermail.com', 'Seattle')

If we select all the data from the Users table after we have executed the SQL INSERT INTO above, we'll get the following result:

FirstName	LastName	DateOfBirth	Email	City
John	Smith	12/12/1969	john.smith@john-here.com	New York
David	Stonewall	01/03/1954	david@sql-tutorial.com	San Francisco
Susan	Grant	03/03/1970	susan.grant@sql-tutorial.com	Los Angeles
Paul	O'Neil	09/17/1982	paul.oneil@pauls-email.com	New York
Stephen	Grant	03/03/1974	sgrant@sgrantemail.com	Los Angeles
Frank	Drummer	10/08/1955	frank.drummer@frankdrummermail.com	Seattle

One interesting question about SQL INSERT INTO is, would it be possible to insert values for only part of the columns, instead for all of them? The answer is yes, as long as the columns that we are skipping can have NULL value or have default value specified.
Here is an example of using SQL INSERT INTO to insert a new row and supply values for only the first 4 columns of the Users table:

INSERT INTO Users (FirstName, LastName, DateOfBirth, Email)
VALUES ('Frank', 'Drummer', '10/08/1955', 'frank.drummer@frankdrummermail.com')

In the above example we assumed that the values in the last column Email can be NULL values. The result of the SQL INSERT above will be:

FirstName	LastName	DateOfBirth	Email	City
John	Smith	12/12/1969	john.smith@john-here.com	New York
David	Stonewall	01/03/1954	david@sql-tutorial.com	San Francisco
Susan	Grant	03/03/1970	susan.grant@sql-tutorial.com	Los Angeles
Paul	O'Neil	09/17/1982	paul.oneil@pauls-email.com	New York
Stephen	Grant	03/03/1974	sgrant@sgrantemail.com	Los Angeles
Frank	Drummer	10/08/1955	frank.drummer@frankdrummermail.com	NULL

If you are inserting a new row and you are supplying values for all columns, then you can skip the entire column list in your statement. For example the following two SQL INSERT statements are equivalent:

INSERT INTO Users
VALUES ('Frank', 'Drummer', '10/08/1955', 'frank.drummer@frankdrummermail.com', 'Seattle')

INSERT INTO Users (FirstName, LastName, DateOfBirth, Email, City)
VALUES ('Frank', 'Drummer', '10/08/1955', 'frank.drummer@frankdrummermail.com', 'Seattle')

However if you skip the column list and do not supply value for all columns at the same time, then you'll get an error as a result of your SQL INSERT INTO execution:

INSERT INTO Users
VALUES ('Frank', 'Drummer', '10/08/1955', 'frank.drummer@frankdrummermail.com')

The above SQL INSERT will produce error, because we haven't specified value for the City column.

SQL Query: WHERE

2009-10-15T12:26:00.000+07:00

The SQL WHERE keyword is used to select data conditionally, by adding it to already existing SQL SELECT query. The WHERE keyword can be used to insert, update and delete data from table(s), but for now we’ll stick with conditionally retrieving data, as we already know how to use the SELECT keyword.

In order to illustrate better the WHERE keyword applications, we are going to add 2 columns to the Users table we used in the previous chapters and we’ll also add a few more rows with actual data entries:

FirstName	LastName	DateOfBirth	Email	City
John	Smith	12/12/1969	john.smith@john-here.com	New York
David	Stonewall	01/03/1954	david@sql-tutorial.com	San Francisco
Susan	Grant	03/03/1970	susan.grant@sql-tutorial.com	Los Angeles
Paul	O'Neil	09/17/1982	paul.oneil@pauls-email.com	New York
Stephen	Grant	03/03/1974	sgrant@sgrantemail.com	Los Angeles

Consider the following SQL query:

SELECT FirstName, LastName, City
FROM Users
WHERE City = 'Los Angeles'

The result of the SQL expression above will be the following:

FirstName	LastName	City
Susan	Grant	Los Angeles
Stephen	Grant	Los Angeles

Our SQL query used the "=" (Equal) operator in our WHERE criteria:

City = 'Los Angeles'

As you can see we have selected only the users which entries have the value ‘Los Angeles’ in the City column. You may also have noticed that we put the Los Angeles string value into single quotes. Whenever you use string (character) values in your SQL queries, you have to put them between single quotes. For example the SQL query below will fail because it uses double quotes instead of single quotes for the string value:

SELECT FirstName, LastName
FROM Users
WHERE City = ”Los Angeles”

But what to do if we want to retrieve all users having LastName O’Neil? The SQL statement below will fail:

SELECT FirstName, LastName
FROM Users
WHERE LastName = ‘O’Neil’

The reason for the failure is the single quote which is part of the string we used in our WHERE criteria. The SQL engine will try to interpret our SQL statement and will consider the single quote inside the string as the end of that string. The remaining part of the SQL statement will be Neil’, which cannot be interpreted correctly, thus we’ll get an error. So how do we deal with strings having single quotes then?
The answer is simple – by replacing all single quotes in our string with two single quotes. When we have two single quotes together, they are interpreted by SQL as one single quote. Here is our improved SQL statement which will work correctly:

SELECT FirstName, LastName
FROM Users
WHERE LastName = 'O''Neil'

We used the = (Equal) operator in the examples above, but you can use any of the following comparison operators in conjunction with the SQL WHERE keyword:

<> (Not Equal)

SELECT FirstName, LastName
FROM Users
WHERE FirstName <> 'Jon'

> (Greater than)

SELECT FirstName, LastName
FROM Users
WHERE DateOfBirth > '02/03/1970'

>= (Greater or Equal)

SELECT FirstName, LastName
FROM Users
WHERE DateOfBirth >= '02/03/1970'

< (Less than)

SELECT FirstName, LastName
FROM Users
WHERE DateOfBirth < '02/03/1970'

<= (Less or Equal)

SELECT FirstName, LastName
FROM Users
WHERE DateOfBirth <= '02/03/1970'

In addition to the comparison operators you can use WHERE along with logical operators. SQL logical operators are used to combine two or more criterions in the WHERE clause of an SQL statement.

If we want to select all users from our Users table, which live in New York and are born after 10/10/1975 we will use the following SQL query:

SELECT FirstName, LastName, DateOfBirth, Email, City
FROM Users
WHERE City = 'New York' AND DateOfBirth > '10/10/1975'

Here is the result of the above SELECT:

FirstName	LastName	DateOfBirth	Email	City
Paul	O'Neil	09/17/1982	paul.oneil@pauls-email.com	New York

As you can see we now have to criteria concatenated with the AND logical operator, which means that both conditions have to be true.

If we want to select all users from our Users table, which live in New York or are born after 10/10/1975 we will use the following SQL query:

SELECT FirstName, LastName, DateOfBirth, Email, City
FROM Users
WHERE City = 'New York' OR DateOfBirth > '10/10/1975'

The result is:

FirstName	LastName	DateOfBirth	Email	City
John	Smith	12/12/1969	john.smith@john-here.com	New York
Paul	O'Neil	09/17/1982	paul.oneil@pauls-email.com	New York
Stephen	Grant	03/03/1974	sgrant@sgrantemail.com	Los Angeles

This time the two criteria are joined with OR, which means that all rows satisfying at least one of them will be returned.

You can use the NOT logical operator in your SQL statements too. Consider the following example:

SELECT FirstName, LastName, DateOfBirth, Email, City
FROM Users
WHERE City NOT LIKE '%York%'

This statement will select all users whose city name doesn’t contain the string York. (I’ve explained the LIKE statement below).

LIKE (similar to)

SELECT FirstName, LastName
FROM Users
WHERE FirstName LIKE 'S%'

We'll talk about the LIKE keyword later, but for now it’s enough to know that the SQL statement above returns all users with first name starting with the letter S. When you use the % character inside a LIKE expression, the % is considered to be a wildcard (note that the syntax I’ve used is for SQL Server, and different SQL implementations may have different syntax for wildcard character %).

You can use the WHERE keyword along with the BETWEEN keyword which defines a range:

SELECT FirstName, LastName
FROM Users
WHERE DateOfBirth BETWEEN '02/03/1970' AND '10/10/1972'

You can use the WHERE keyword along with the IN keyword which defines a criteria list:

SELECT FirstName, LastName
FROM Users
WHERE City IN (‘Los Angeles’, ‘New York’)

The SQL statement above will return all users from Los Angeles and New York.

SQL Query: SELECT

2009-10-15T12:23:00.000+07:00

SQL SELECT is without a doubt the most frequently used SQL command that’s why we are starting our tutorial with it. The SQL SELECT command is used to retrieve data from one or more database tables.

To illustrate the usage of the SELECT command we are going to use the Users table defined in the previous chapter:

FirstName	LastName	DateOfBirth
John	Smith	12/12/1969
David	Stonewall	01/03/1954
Susan	Grant	03/03/1970

The SQL statement below shows a simple usage of the SQL SELECT command:

SELECT FirstName, LastName, DateOfBirth
FROM Users

Let’s examine this SQL statement. The statement starts with the SELECT keyword followed by a list of table columns. This list of columns specifies which columns you want to retrieve from your table. The list of columns is followed by the SQL keyword FROM and the table name (the table we are selecting data from).

There is a special syntax that can be used with the SELECT command, if you want to retrieve all columns from a table. To do that replace the list of columns with the * symbol and voila, you’ve selected all columns from the table:

SELECT *
FROM Users

It’s a prudent programming practice to explicitly specify the list of columns after the SELECT command, as this will improve your query performance significantly.

The SELECT INTO statement retrieves data from a database table and inserts it to another table.

Consider the SELECT INTO example below:

SELECT FirstName, LastName, DateOfBirth
INTO UsersBackup
FROM Users

The first part of the statement looks familiar and is just selecting several columns. The second part of this SQL statement is the important part, which specifies to insert the rows into the UsersBackup table. The last part specifies which table to get the rows from. This example assumes that both Users and UsersBackup tables have identical structure.

You can use the following SQL query to make an exact copy of the data in the Users table:

SELECT *
INTO UsersBackup
FROM Users

So far you learnt how to specify which columns to select and from which table, but you might be wondering how many rows of data will actually be returned from these SQL statements? The answer is simple – all of them. But what if you have a table with 5 million rows, and you only need to select a few rows satisfying certain criteria? Fortunately there is a way to conditionally select data from a table or several tables. Enter the SQL WHERE command.

SQL Introduction

2009-10-15T12:22:00.000+07:00

Our SQL Tutorial starts with introduction to SQL language and Relational Database Management Systems, and then moves on to simple and frequently used SQL clauses like SELECT, WHERE, UPDATE, and DELETE. After you have familiarized yourself with these basic SQL concepts and SQL clauses, the tutorial explains more complicated SQL concepts including table relationships, primary and foreign keys and database normalization, joining tables, views, and indexes.

Although there are existing SQL standards, most popular relational database management systems like MS SQL Server, Oracle, and DB2 use their own SQL dialect (also know as SQL extension or SQL implementation) of one of the SQL standards (ISO or ANSI). We have strived to remain dialect independent and most of the examples in this tutorial can be applied to most major SQL implementations.

Computer Organization and Architecture, Sixth Edition, William Stallings

2009-10-13T17:13:00.000+07:00

In computer engineering, computer architecture is the conceptual design and fundamental operational structure of a computer system. It is a blueprint and functional description of requirements and design implementations for the various parts of a computer, focusing largely on the way by which the central processing unit (CPU) performs internally and accesses addresses in memory.

Once both ISA and microarchitecture have been specified, the actual device needs to be designed into hardware. This design process is called implementation. Implementation is usually not considered architectural definition, but rather hardware design engineering.

The term “architecture” in computer literature can be traced to the work of Lyle R. Johnson and Frederick P. Brooks, Jr., members in 1959 of the Machine Organization department in IBM’s main research center. Johnson had the opportunity to write a proprietary research communication about Stretch, an IBM-developed supercomputer for Los Alamos Scientific Laboratory. In attempting to characterize his chosen level of detail for discussing the luxuriously embellished computer, he noted that his description of formats, instruction types, hardware parameters, and speed enhancements was at the level of “system architecture” – a term that seemed more useful than “machine organization.” Subsequently, Brooks, one of the Stretch designers, started Chapter 2 of a book (Planning a Computer System: Project Stretch, ed. W. Buchholz, 1962) by writing, “Computer architecture, like other architecture, is the art of determining the needs of the user of a structure and then designing to meet those needs as effectively as possible within economic and technological constraints.” Brooks went on to play a major role in the development of the IBM System/360 line of computers, where “architecture” gained currency as a noun with the definition “what the user needs to know.” Later the computer world would employ the term in many less-explicit ways.

DOWNLOAD PPT

DOWNLOAD PDF

Looking The Sequence of Prime Numbers With Pascal

2009-10-13T16:37:00.000+07:00

SOURCE


program deret_bilangan_prima;
uses wincrt;
var i,temp:longint;
s, x, a, n : longint;
jml:integer;
function fakt (t : longint) : longint;
{funtion fakt untuk mengecek banyaknya faktorial dari suatu bilangan}
begin
temp := 0;
for i := 1 to t do if t mod i = 0 then inc (temp);
fakt:= temp;
end;

begin
clrscr;
writeln ('Deret Bilangan Prima');
writeln ('--------------------------------------------');
write ('Jumlah Bilangan Yang Ditampilkan Sebanyak : ');
repeat
readln(x);{meminta uses memasukkan jumlah deret bilangan}
until (x>=2);{input harus >=2}
writeln; writeln; writeln ('Deret Bilangan Prima : '); writeln ('');
a := 1; s := 0;
repeat
if fakt (a) = 2 then{jika banyk faktoriaal dari suatu bilangan adl 2 maka}
begin
write (a,', '); {cetak bilangan yg memp 2 faktorial}
jml:=jml+a; inc (s);{hitung jumlah dari deret bilangan}
end;

inc (a); until (s = x);
writeln; writeln('');
write('Jika dijumlahkan, hasilnya : ',jml);{cetak jumlah}
end.

OUTPUT

Checking Prime Numbers With Pascal

2009-10-13T16:29:00.000+07:00

SOURCE


Program mengecek_suatu_bilangan_adalah_bilangan_prima;
uses wincrt;
var bil,i,x : integer;
prima : boolean;
batas : integer;
ulang : char;

begin
repeat
clrscr;
write('Masukkan bilangan : ');{input bilangan yg akan dicek}
read(bil);
{inisialisasi awal}
batas := round(sqrt(bil))+1;
prima := true;
if (bil=2) or (bil=3) then {jika bilangan 2 dan 3 maka prima}
prima := true
else{jika bukan 2 dan 3 maka}
for i:=2 to batas do{dari i:=2 to batas}
if bil mod i = 0 then{jika bilangan dibagi i = 0 maka bukan prima}
prima := false;
if prima = true then
writeln(bil,' Adalah prima')
else
writeln(bil,' Bukan prima');
writeln;
write('Ulang lagi [Y/T] : ');ulang:=upcase(readkey);
writeln(ulang);
until ulang <> 'Y';{akan terus mengulang jika di inputkan [y,Y]}
end.

Output

Database System Concepts, Silberschatz, Korth, Sudarshan

2009-10-13T16:23:00.000+07:00

Database management has evolved from a specialized computer application to a central component of a modern computing environment, and, as a result, knowledge about database systems has become an essential part of an education in computer science. In this text, we present the fundamental concepts of database management. These concepts include aspects of database design, database languages, and database-system implementation.

This text is intended for a first course in databases at the junior or senior undergraduate, or first-year graduate, level. In addition to basic material for a first course, the text contains advanced material that can be used for course supplements, or as introductory material for an advanced course.

We assume only a familiarity with basic data structures, computer organization, and a high-level programming language such as Java, C, or Pascal. We present concepts as intuitive descriptions, many of which are based on our running example of a bank enterprise. Important theoretical results are covered, but formal proofs are
omitted. In place of proofs, figures and examples are used to suggest why a result is true. Formal descriptions and proofs of theoretical results may be found in research papers and advanced texts that are referenced in the bibliographical notes.

Link For Downloading

Free Download PHP Event Calendar V1.5

2009-10-11T18:48:00.000+07:00

PHP Event Calendar is an easy to use event calendar script which can be used on all your websites and web pages. There are unlimited amount of style combinations - you can change everything - size, colors, fonts, borders, date and time formats, week starting days. Once installed on your website with a single copy and paste you can put it on any of your website pages. You can have a calendar on your website within minutes!

This is my first post sharing some of my files - so take it easy

I personally ripped this script, all of the files are encoded, but it works 100% (I have it installed on a number of sites that I run)

WATCH DEMO HERE

DOWNLOAD FILE HERE

NB: Files are available in RAR format with passwords. If you want to know the password, please comment on this blog and leave your email address. I will send your password to your email address. For using this file please read the Readme.txt file.

Aplikasi Menentukan FPB Menggunakan Bahasa C

2009-10-09T11:20:00.000+07:00

SOURCE :


#include "stdio.h"
#include "conio.h"
#define MYICON 1

void main() {

int x,y,m,n,r;

printf("PROGRAM MENENTUKAN FPB(x,y)\n");
printf("---------------------------\n");
printf("by:saindra\n\n\n\n");

printf("Masukkan nilai x: ");scanf("%d",&x);
printf("Masukkan nilai y: ");scanf("%d",&y);

if(x>=y){
m=x;
n=y;
}else{
n=x;
m=y;
}//end of else

while(n!=0){
r=m%n;    //m modulo n, r= sisa dari pembagian m dg n
m=n;
n=r;
}

printf("\n\nFPB(%d,%d) = %d",x,y,m);

getche();
}

OUTPUT :


PROGRAM MENENTUKAN FPB(x,y)
---------------------------
by:saindra



Masukkan nilai x: 30
Masukkan nilai y: 25


FPB(30,25) = 5

NetCut 2.0.8 & Anti Netcut 2 Free Download

2009-10-09T11:06:00.000+07:00

Product Description:

* Cut down any computer's network connection to the gateway.
* Get all IP addresses of the computers in your LAN(Local Area Network)
* Work in office's LAN,school LAN,or even ISP LAN
* Have Fun with play the online computer make them online or off line remotely
* TRACE Free, No one will TRACE out what happen
* More Stable,swich-hub or hub or cable lan any Lan use Ethernet

NetCut is a Software that helps you admin your network by purely on ARP protocol . List IP-MAC Table in secs, turn off & On network on any computer on your LAN including any device like router , switcher. Also, netcut can protected user from ARP SPOOF attack

High intimate :Pure ARP protocol kernel.enhenced cut off funcation, that no one can escape from your cut off unless he have netcut installed and with protected funcation enabled.

Easy to use: One click to Protect user Computer Function!!! No one in the network can cut you off with ARP spoof technology anymore .

Effective: one Click to Cut down any computer s network connection to the gateway. IYFT:Get all IP addresses of the computers in your LAN(Local Area Network) in Secs High applicability:Work in office LAN,school LAN,or even ISP LAN Have Fun with play the online computer make them online or off line remotely Safe: TRACE Free, No one will TRACE out what happen and last More Stable,swich-hub or hub or cable lan any Lan use Ethernet

This product is designed to run on the following operating systems:

* Windows XP
* Windows 2000
* Windows NT
* Windows 98

Additional Requirements:

* Windows 98/2000/NT/XP

Screenshots Netcut 2.0.8

Screenshots Anti NetCut 2

NB: File tersedia dalam bentuk RAR with password. Jika anda ingin mengetahui passwordnya, silahkan comment di blog ini dan meninggalkan alamat email anda. Password akan saya kirimkan ke alamat email anda tersebut.

Download Netcut 2.01and Anti Netcut 2 Here

Array 3: Dengan Pendeklarasian Variabel Sendiri

2009-10-08T15:19:00.000+07:00

PASCAL SOURCE :


program array3;

uses wincrt;

type
RecordMahasiswa = record
nim: string[10];
nama: string[25];
nilai: real;
umur: byte;
end;

var
DataMahasiswa: array [1..20] of RecordMahasiswa;
banyak, i: integer;

begin

write('Jumlah data yang akan dimasukkan: ');readln(banyak);
writeln('');
for i:=1 to banyak do
begin
write('NIM: ');readln(dataMahasiswa[i].nim);
write('Nama: ');readln(dataMahasiswa[i].nama);
write('Nilai: ');readln(dataMahasiswa[i].nilai);
write('Umur: ');readln(dataMahasiswa[i].umur);
writeln('');
end;

writeln('NIM NAMA NILAI HURUF');
for i:=1 to banyak do
writeln(DataMahasiswa[i].nim:1, DataMahasiswa[i].nama:8, DataMahasiswa[i].nilai:7:2, DataMahasiswa[i].umur:4);

end.

OUTPUT :