Difference between revisions of "CSC231 Homework 10 2012"
(→Problem #2: Optional and Extra Credits (0.3 points)) |
|||
| (4 intermediate revisions by the same user not shown) | |||
| Line 4: | Line 4: | ||
This assignment is due on 11/28/12 evening, at midnight. | This assignment is due on 11/28/12 evening, at midnight. | ||
</bluebox> | </bluebox> | ||
| − | + | <onlydft> | |
=Problem 1= | =Problem 1= | ||
| + | ( 1 point for documentation, 1 point for efficiency, 2 points for correctness of implementation) | ||
| + | <br /> | ||
| − | + | Your assignment is to implement a recursive version of the Towers of Hanoi in assembly. | |
You can use this Python version for inspiration: | You can use this Python version for inspiration: | ||
| Line 81: | Line 83: | ||
rsubmit hw10 hw10a.asm | rsubmit hw10 hw10a.asm | ||
| − | =Problem #2: Optional and Extra Credits (0. | + | =Problem #2: Optional and Extra Credits (0.6 points)= |
First study the program below, which is purposefully undocumented, and which computes the 46th term of the Fibonacci series using a recursive function. | First study the program below, which is purposefully undocumented, and which computes the 46th term of the Fibonacci series using a recursive function. | ||
| Line 169: | Line 171: | ||
==Your assignment== | ==Your assignment== | ||
| − | * Keep the recursive nature of the fib function but improve it so that the execution of the program becomes less than one second. | + | * Keep the recursive nature of the fib function but improve it so that the execution of the program becomes less than one second when launched on beowulf. |
* How much stack space is used by your program, expressed in dwords or bytes.. Explain how you compute the amount of stack space in the header of your program. | * How much stack space is used by your program, expressed in dwords or bytes.. Explain how you compute the amount of stack space in the header of your program. | ||
| Line 176: | Line 178: | ||
rsubmit hw10 hw10b.asm | rsubmit hw10 hw10b.asm | ||
| + | |||
| + | </onlydft> | ||
Latest revision as of 17:38, 4 December 2017
--D. Thiebaut 20:51, 14 November 2012 (EST)
This assignment is due on 11/28/12 evening, at midnight.
