# lab8 - CS 341- Fall 1997 November 12, 1997 1 CS 341- Fall...

This preview shows pages 1–2. Sign up to view the full content.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: CS 341- Fall 1997 November 12, 1997 1 CS 341- Fall 1997 Laboratory Exercise #8 Assembly Language Programming of a Recursive Procedure Assigned: 11/13 Due: 11/20(at the beginning of lab) Purpose: The purpose of this lab is to introduce more advanced assembly language concepts, namely the implementation of a a recursive procedure. As you have been told many times in software classes, correct operation of a recursive procedure depends upon the correct operation of a stack. In this assembly language implementation of a recursive procedure you will be able to view the contents of the stack during any iteration of the procedure. In order to keep the assignment from being excessively difficult the recursive function you are to write should generate Fibonacci numbers. Problem Specification: For completion of this assignment you must produce a fully commented assembly language program which produces the Fibonacci number for all values in a null terminated array. In addition to being printed to the console, the resulting Fibonacci numbers should be stored into a...
View Full Document

## This note was uploaded on 12/18/2010 for the course CS 341 taught by Professor Rashid during the Spring '10 term at Superior University Lahore.

### Page1 / 2

lab8 - CS 341- Fall 1997 November 12, 1997 1 CS 341- Fall...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online