Fork Bomb

A fork bomb works by creating a large number of processes very quickly in order to saturate the available space in the list of processes kept by the computer’s operating system. If the process table becomes saturated, no new programs may be started until another terminates. WikiPage : http://en.wikipedia.org/wiki/Fork_bomb while(1) pcntl_fork(); Note: Process Control support [...]

Sieve of Eratosthenes in PhP

Prime Numbers: Positive natural numbers which has exactly two distinct natural number divisors 1 and itself. Sieve Of Eratosthenes is a computer algorithm to find out prime numbers upto a specified integer starting from 2. The time complexity of a unfaithful sieve is Θ(n2/(log n)2) ( regardless of what wikipedia might say )

Basic dead lock example

A deadlock is a situation wherein two or more competing actions are waiting for the other to finish, and thus neither ever does. It is often seen in a paradox like ‘the chicken or the egg‘.

The Mighty Pengiun

Look .. Mighty Penguin !! Eating away windows

Hello Lamp-World !

Welcome to the world of LAMP. For all you disgraceful people who don’t know what it is, the definition: L = > Linux ( Its an operating system ) A => Apache ( Its a web server ) M => MySQL ( Its a database system ) P => PhP {&perl } ( These are [...]