A linked list consists of nodes, where each node is a record with

a value field (containing an integer) and a next field (containing

a pointer to the next node in the list). Suppose R3 contains a pointer

to the list.

Why should the program compare R3 with nil before it performs R3 := (*R3).next?

Question

A linked list consists of nodes, where each node is a record with 
 
a value field (containing an integer) and a next field (containing 
 
a pointer to the next node in the list).  Suppose R3 contains a pointer 
 
to the list. 
 
Why should the program compare R3 with nil before it performs R3 := (*R3).next?

Answer

The program will be more efficient if R3 is nil

Answer

If the list is empty, then R3 := (*R3).next would load a garbage pointer 
 
into R3, and the program would likely malfunction later on

Answer

After executing R3 := (*R3).next, there is no longer a register that 
 
contains nil

Crowdly

A linked list consists of nodes, where each node is a record with a value fie...

Want instant access to all verified answers on moodle.gla.ac.uk?