Php is installed and apache too ... but how to get a plugin of php ...so tht i cn use php via apache server ...

hi ...
i want to use php 4 and apache 2 on fedora core 4 ... butr not been able to use ... so can anyone tell me how to plugin php non apache on linux platform ....

Ashish

hi ...
can anyone please tell what are Lvalue and Rvalue errors in c and c++ ???

hi ..
can anyone help me to understand what are the uses of different OOPS concepts of c++ and how thse features helps in programming in c++ ...
specailly features like data abstraction etc ...

int i=0,j=1;
cout<<(j++)&&(i++); //output=1;

i=0,j=1;
printf("%d",(j++)&&(i++)); //output=0

can anyone please tell why this difference in output ???

what are the features of c which are not available in c++ ???

thanks for the nice explaination !!!!!!!

char s[]="the cocaine man";

int i=0;
char ch;

ch=s[++i];
printf("%c ",ch);

ch=s[i++];
printf("%c ",ch);

hey thanks ..this really nice tutorial ....

if i implement same algorithm iteratively and also with recusrion ...than which of the above methods is better in implementing .....

and what are the advantages of recursion over iterative...

thanks for that ..defianately i will learn from that ..ya its much easier to read ...but can u still me a better algorithm than this

thanks for that ..i am just a starter ..so there could be some mistakes there !!!

given a positive integer n ,we have to find the number of possible combination of integers (i,j) where i+j=k ... given 0<=i,j,k<=n
i code this problem as below ...



#include<iostream.h>...

its good that forum is abide by some rules and regulations to maintain legacy ..but i have seen in many others threads people have asked to write codes even some people have asked to write there code...

whos so ever you are ..i have asked a qusetion ..its upto others whether they want to write code or not ...who are you to decide this ??

u can write in anyone c or c++ ..whichever is comfortable to you ..

can anyone tell me the code for inorder traversal of binary tree non recursively and using a constant memory ...??

i have work with the same code after initializing it ..but there is no change in output ...

i got your answer to how swap pointers ...
But can u tell me what's happening in the code i have written ???
is the address which is passed by i & j is copied in pointers a & b and only adress...

can anyone explain me why the values are not swapped in the below code ??

main()
{
int *i,*j;
*i=4000;
*j=9000;
f(i,j);
printf(" %d %d",*i,*j); //output =4000 9000
}

i completely agree with salem ...i have checked at many other sites too ...it always depend on compiler ....

hey thanks ..this is really gud link u have provided ...

i guess i havnet understand the concept ..so can u please make me understand ...and tell me why the code is undefined ...

hi salem ...
thanks for such a gud site ..
so according to you it depends on compiler ...
but this question appears in IBM interview ..so what to answer there ???

thts what i thought but compiler is giving different outputs ...
i guess if u think outputs are incorrect ..u can check on compiler and please let me know about the outputs ...

can anyone tell me what are pointers to function ??? and how are they implemented ??

can anyone please tell me why following output is generated ...

int i=10;
printf(" %d ",i++/i); // output=0
i=10;
printf("%d",i/++i); //output=1
i=10;
printf("%d ",i++/++i); //output...

i guess u can try some recursive algorithm for this .but with that 0(n) is still tough .. with recursive u can try maximum combinations while keeping efficiency ..

i guess i have to repeat my question for clarification ... can u tell me how the following output is generated ...


int i=10;
printf(" %d ",i++/i); //output=0
i=10;
printf("%d",i/++i); ...

hey ..d ans is very simple d array shld be declare as array[4] nt as array[3] ..dis is solve it

hi ..
if anyone cn plz tell me wht will be the output of following code n how dis output is generated ...

float i=10;
printf("i++/i %f\n",i++/i);
printf("%f \n",i);
i=10;
printf("i/++i %f...