OK , so you are all excited about running a 10 minute process and you are happy that
you have set the processing as a background process, while the user can surf along your
website / CMS. If you are are using sessions, not quite smarty !

(more…)

1.download php-mode.el from http://sourceforge.net/projects/php-mode/

2. copy php-mode.el to emacs/lisp/

3.byte compile php-mode.el file to get php-mode.elc file

command:  M-x byte-compile-file

4.add following lines to you .emacs file

(require ‘php-mode)

(add-to-list ‘auto-mode-alist ‘(”\\.module$” . php-mode))

(add-to-list ‘auto-mode-alist ‘(”\\.inc$” . php-mode))

(add-to-list ‘auto-mode-alist ‘(”\\.install$” . php-mode))

(add-to-list ‘auto-mode-alist ‘(”\\.engine$” . php-mode))

done! emacs is ready to support php.

try C-c C-f on built in php function

With PHP’s widespread adoption,it’s almost too easy to find a script or snippet to do exactly what you need. Unfortunately, there’s no filter as to what is a “good practice” and what’s, well… not so good when writing a PHP script. We need trustworthy sources, who have proven they have a solid grasp on the best practices of PHP.

We need PHP masters to show us the best principles to follow for high-grade PHP programming.

(more…)

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 in PHP is not enabled by default. You have to compile the CGI or CLI version of PHP with –enable-pcntl configuration option when compiling PHP to enable Process Control support.
Currently, this module will not function on non-Unix platforms (Windows).

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 )

(more…)

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‘.

(more…)