### A good answer might be:

In MIPS, 32 zero bits.

# Traversing a Linked List

Let us write a program that visits every element of a linked list and prints out its data. A visit to every element of a data structure is called a traversal. Here is a start on the program:

    ## linked.asm --- hard-coded linked list
    ##
              .text
              .globl main

    main:
              ____   $s0,elmnt01    # get the address of
                                    # the first element

    loop:     beqz   $s0,done       # while not null

              . . .
    done:

              . . .

              .data

    elmnt01:  .word  1
              .word  elmnt02

    elmnt02:  .word  2
              .word elmnt03

              . . .

The first statement loads register `$s0` with the address of the first element.

### QUESTION 11:

Which instruction should fill the blank in the first statement:

- lw --- load a register with the data stored at a symbolic address
- la --- load a register with the address corresponding to a symbolic address