We suggest the following function to perform a circular list traversal, without looping back (no infinite loop) void browseCircList(t_circ_list mylist)
{
t_cell *temp = mylist.head;
while (temp != mylist.tail)
{
// ici une ou des instructions pour le parcours (affichage par exemple)
// pas de piège pour ces instructions
temp = temp-next;
}
return;
} Which of the following statements are correct (multiple answers, wrong answers will be penalised)?

Question

We suggest the following function to perform a circular list traversal, without looping back (no infinite loop) void browseCircList(t_circ_list mylist) 
 { 
     t_cell *temp = mylist.head; 
     while (temp != mylist.tail) 
     { 
        // ici une ou des instructions pour le parcours (affichage par exemple) 
        //  pas de piège pour ces instructions 
        temp = temp->next; 
     } 
    return; 
 }            Which of the following statements are correct (multiple answers, wrong answers will be penalised)?

Answer

If the list is empty, the function causes a seg fault (memory error).

Answer

The function will process all the cells in the list when it runs through them

Answer

The function will not process all the cells in the list

Answer

If the list is empty, the function executes correctly, without a seg fault (memory error).

Crowdly

We suggest the following function to perform a circular list traversal, without ...

Want instant access to all verified answers on moodle.myefrei.fr?