Skip to main content

How to Install and Run PHP file

To download wampserver and it's installation, and 
To run php script on browser

Step 1: Download php Virtual server like WAMPSERVER or XAMPP

Note: - Download php and VC10 (link is provided in warning section)


Step 2: After that, install php. (Follow the steps and just click next...next...next...).

Step 3: After the complete installation, start wampserver.

Step 4: Now go to System tray and click on wampserver icon.


Step 5: Click on “start all Services” (Now icon turns green)
Note: - If the icon turns green that means all services are started or red then services are stopped or yellow that means temporarily stopped (you need to start all services).

Step 6: Now click on “www directory”

Step 7: Create new folder (in my case, named it as “vik”).



Step 8: Open vik folder and create php file

e.g.: Type the below php script in notepad or any other text editor as you want (It is better to place this script within html tags for the sake of good programmers).
<?php echo "Hello, This is my first php script"?>
Save the file with .php extension

Step 9: Now go to web browser and type in address bar http://localhost/yourfoldername/your_php_filename_with_extension
Note: - In my case http://localhost/vik/bb.php





Comments

Popular posts from this blog

Use Case Diagram for Online Book Store

Online Movie Ticket Booking Sequence Diagram

Linear search & Binary search using Template

Write a program to search an element from a list. Give user the option to perform Linear or Binary search. Use Template functions. #include<iostream> using namespace std; template <class T> void Lsearch(T *a, T item, int n) { int z=0; for(int i=0;i<n;i++) { if(a[i]== item) { z=1; cout<<"\n Item found at position = "<<i+1<<"\n\n"; } else if(z!=1) { z=0; } } if(z==0) cout<<"\n Item not found in the list\n\n"; } template <class T> void Bsearch(T *a, T item, int n) { int beg=0,end=n-1; int mid=beg+end/2; while((a[mid]!=item) && (n>0)) { if(item>a[mid]) beg=mid; else end=mid; mid=(beg+end)/2; n--; } if(a[mid]==item) cout<<"\n Item found at position = "<<mid+1<<"\n\n"; else cout<<"\n Item not found in the list\n\n"; } void main() { int iarr[10] = {2,42,56,86,87,99,323,546,767,886};