go to previous page   go to home page   go to next page hear noise


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 node consists of two items:

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

The picture shows the idea. Each rectangle represents a block of memory. Part of the block holds the data, and the other part holds the address of the next block of data.

Linked List

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


Here is a node of a linked list:

elmnt01:  .word  1
next01:   .word  

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

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

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