Answer
\begin{array}{l}{\text { The address values that you come up with will depend entirely on your }} \\ {\text { solution. The symbol table for the program in Practice Problem } 1 \text { would }} \\ {\text { look like the following example. (Note: The solution assumes that each }} \\ {\text { instruction occupies one memory location.) }}\end{array}
\begin{array}{ll}
{\textbf {Symbol }} & {\textbf { Address }} \\
{\text {LOOP }} & {\text { 3 }} \\
{\text {SKIP }} & {\text { 11 }} \\
{\text {ENDLOOP }} & {\text { 13 }} \\
{\text {NEGCOUNT }} & {15}\\
{\mathrm{I}} & {16} \\
{\mathrm{N}} & {17} \\
{\mathrm{ONE}} & {18} \\
{\mathrm{FIFTY}} & {19} \\
{\mathrm{ZERO}} & {20}
\end{array}
Work Step by Step
\begin{array}{l}{\text { The address values that you come up with will depend entirely on your }} \\ {\text { solution. The symbol table for the program in Practice Problem } 1 \text { would }} \\ {\text { look like the following example. (Note: The solution assumes that each }} \\ {\text { instruction occupies one memory location.) }}\end{array}
\begin{array}{ll}
{\textbf {Symbol }} & {\textbf { Address }} \\
{\text {LOOP }} & {\text { 3 }} \\
{\text {SKIP }} & {\text { 11 }} \\
{\text {ENDLOOP }} & {\text { 13 }} \\
{\text {NEGCOUNT }} & {15}\\
{\mathrm{I}} & {16} \\
{\mathrm{N}} & {17} \\
{\mathrm{ONE}} & {18} \\
{\mathrm{FIFTY}} & {19} \\
{\mathrm{ZERO}} & {20}
\end{array}
