Multiple Choice
The following function cycles through a linked list and displays its contents. Line 3 can be replaced with ____.
1 void display(struct myStruct *contents)
2 {
3 while (contents != NULL)
4 {
5 printf("%-30s\n",contents->name, contents->phoneNum) ;
6 contents = contents->nextaddr;
7 }
8 }
A) while (isValid(contents) )
B) while (contents != EOF)
C) while (!contents)
D) while (contents != NIL)
Correct Answer:

Verified
Correct Answer:
Verified
Q13: A linked list provides a convenient method
Q14: Dynamic memory allocation is also known as
Q15: The structure pointer operator is evaluated from
Q16: Structures that are "linked" together by including
Q17: Each structure in a linked list has
Q19: The following is an example of the
Q20: A stack requires a separate stack pointer
Q21: C provides the four functions, malloc(), calloc(),
Q22: In making requests for dynamic memory allocation,
Q23: Items are removed from a queue in