A data structure problem.

[shailesh]

struct node *nPtr, *sPtr; /* pointers for a linked list. */
for (nPtr=sPtr; nPtr; nPtr=nPtr->next)
{
free(nPtr);
}
The sample code above releases memory from a linked list. Which of the
choices below accurately describes how it will
work?
Choice 1
It will work correctly since the for loop covers the entire list.
Choice 2
It may fail since each node "nPtr" is freed before its next address
can be accessed.
Choice 3
In the for loop, the assignment "nPtr=nPtr->next" should be changed to
"nPtr=nPtr.next".
Choice 4
This is invalid syntax for freeing memory.
Choice 5
The loop will never end.

I have a confusion b/w choice 1 and 2.

[Iyswarya Narayanan]

choice 2 , as the memory is freed, before accessing its successor. 

[NISHANT BULCHANDANI]

yep,...choice 2 :)

On Mon, Mar 8, 2010 at 9:07 AM, Iyswarya Narayanan <iyswa...@gmail.com> wrote:

choice 2 , as the memory is freed, before accessing its successor. 

--
"There is no mistery about success.. Do you know even one successful man who didn't tell you about it!! "
 
To post to this group, send email to gloss-...@googlegroups.com
To unsubscribe from this group, send email to gloss-sastra...@googlegroups.com
For more options, visit this group at http://groups.google.co.in/group/gloss-sastra?hl=en

[ravi babu]

choice 4,,.....
human knowledge belongs to the world..

[Bhargav kanipakam]

the answer may be choice 2 i think....

[kumara vardhan]

Choice is 2