The document outlines the task to create an assembly program that calculates Fibonacci numbers and stores them in a quad-word array. It presents the Fibonacci definition and asks for the largest index 'i' for which Fibonacci(i) can be computed. The focus is on efficient computation and memory management for the Fibonacci sequence.

1. 1. Write an assembly program to compute Fibonacci numbers storing all the computed Fibonacc
numbers in a quad-word array in memory. Fibonacci numbers are defined by: f ( n ) = n = 0 n = 1
n > 1 0 1 f ( n 1 ) + f ( n 2 ) - What is the largest i for you which you can compute fib(i)?