A good answer might be:

No, not easily.

Linked List

A linked list overcomes some of the disadvantages of arrays (and introduces its own disadvantages). In a linked list, each element consists of two items:

  1. The data
  2. The address of the next element

The picture shows the idea:

The arrows represent memory addresses. The diagonal slash in the last element stands for the value null which is how the last element shows that it has no successor. In MIPS assembly (and in most other languages), null is a word full of zero bits.

QUESTION 7:

Here is an element of a linked list: 

          .data
elmnt01:  .word  1
next01:   .word  ________

Here, somewhere else in the program, is the second element: 

elmnt02:  .word  2
next02:   .word  .....

Fill in the blank so that the field next01 contains the address of the second element.