C code 32 bit vs 64 bit

Source: http://www.gowrikumar.com

Problem:
The following C program segfaults of IA-64, but works fine on IA-32.

  int main()
  {
      int* p;
      p = (int*)malloc(sizeof(int));
      *p = 10;
      return 0;
  }
 
Update (Oct 30, 2011):
Wrong problem. Sorry for the trouble.

Comments

  1. Ravi1:34 PM, September 11, 2011

    int* is 64 bits on a 64 bit machine, but 32 bits on a 32 bit machine. int, on the other hand, is 32 bits on both. On a 32 bit machine, this would work fine, but on a 64 bit machine it segfaults, since you are allocating 32 bits of memory, but accessing 64.
    Cheers...

    ReplyDelete
  2. Tiger7:41 PM, September 13, 2011

    @ravi :- doesn't matter. p is pointing to a 32 bit value... shouldn't segfault.
    the above code segfaulting makes no sense whatsoever.
    doesn't segfault for me at least (as in fact it shouldn't. ) i'm guessing someone used a crappy compiler that got confused as ravi points out.
    pratik, can you post the original link?

    ReplyDelete
  3. Pratik Poddar12:20 AM, September 14, 2011

    I too think that Ravi's solution is wrong. It should not segfault.

    You have this problem somewhere in the middle of the page http://www.gowrikumar.com/c/index.html

    ReplyDelete

Post a Comment

Popular posts from this blog

Fraction Brainteaser

Source: Sent to me by Gaurav Sinha Problem: Siddhant writes a Maths test and correctly answers 5 out of 6 Arithmetic questions and 20 out of 28 Geometry questions.  In total, Siddhant scores 25 out of 34.  Vaibhav writes another Maths test and correctly answers 20 out of 25 Arithmetic questions and 6 out of 9 Geometry questions. in total, Vaibhav scores 26 out of 34. Note that a) Vaibhav scores more than Siddhant b) Siddhant score better than Vaibhav in both individual topics -  5/6 > 20/25 and 20/28 > 6/9 How is it possible? 
Read more

Buying Dimsums

Source: Alok Goyal (Stellaris VP, Ex-Helion VC) puzzle blog Problem: A fast food restaurant sells dimsums in boxes of 7 and 3. What’s the greatest number of dimsums a person cannot buy. Generalize it for p and q where p and q are relatively prime. I loved the puzzle. Hope you enjoy it too.
Read more

Consecutive Heads

Let's say A keep tossing a fair coin, until he get 2 consecutive heads, define X to be the number of tosses for this process; B keep tossing another fair coin, until he get 3 consecutive heads, define Y to be the number of the tosses for this process. 1) Calculate P{X>Y} 2) What's the expected value of X 3) What's the expected value of Y This is probably the hardest puzzle I have ever put on my blog. Hence, I will post its solution in the post directly rather than on comment. Solution: 1) (Solved by me finally after 13 months :)) Make a state diagram. Let the state be (a,b) where a is the number of consecutive heads streak "A" is on currently and b is the number of consecutive heads streak "B" is on currently. So, (0,3) (1,3) are final accepted states and (2,0) (2,1) (2,2) (2,3) are failure states. If you get tails, your contribution to the state reaches to "0" f(State) = P(X>Y | "State" configuration initially)
Read more