Search Results

the output is actually difference between the address locations and in this case the it happens to be 10.
p => address of start of array
q => address of 9th element.

((q-p) + 1) ==> (9 - 0) + 1...

I think there will be n process at the end. If u skip break statement then u will get 2^n process ( 2 to the power of n).

Regards,

May be defining a macro will solve the problem...

Check out https://www.unix.com/showthread.php?t=21543

Regards,

Depends on your application.
If the client and server talk to each other then u need to have read, write on both sides.

thanks for that ..

What I was thinking was how well can a programmer organize himself for making optimal use of stack and memory.
For example declaring unused variables, passing huge arguments to...

Hi,

Sorry for that..

I have removed my email-id.

But it shows up on your post.

kindly edit it...

Regards,

hi,

I am looking for some info on how can we implement state machines.

Conceptually it appears to be good but while implementing it causes lot of confusion..

I have some doubts regarding...

I have copied it as it is, complied as described, but still the same.

What is the output on your side ?

Program prints hello. What were u expecting ?

Hi ching,

I am also very much interested in knowing how is the memory layout for C.

Check this one out. It may be useful ..

https://www.unix.com/showthread.php?t=22238

Regards,
Parasa...

Hi,

Does any one know what tool to use to visualize how is memory layed out for C on linux systems. I mean how much stack portion is used in functional call.
Where exactly does the argument to...

Hi,

I am not a C guru but what I feel in the code portion of yours is that the newline ('\n') is also getting accepted as typed character. So if you see the output each digit is one below the...