Difference between revisions of "CSC231 Final Exam 2010"
| Line 10: | Line 10: | ||
<onlydft> | <onlydft> | ||
| − | =Problem #1: Recursive GCD= | + | =Problem #1: Recursive GCD (1 point)= |
The following algorithm can be used to find the greatest common denominator of two integers, or ''GCD''. The GCD of two integers ''m'' and ''n'' is the largest integer that divides both of them with a remainder of 0. The GCD of 5 and 6 is 1. The GCD of 10 and 12 is 2. The GCD of 12 and 20 is 4. | The following algorithm can be used to find the greatest common denominator of two integers, or ''GCD''. The GCD of two integers ''m'' and ''n'' is the largest integer that divides both of them with a remainder of 0. The GCD of 5 and 6 is 1. The GCD of 10 and 12 is 2. The GCD of 12 and 20 is 4. | ||
| Line 32: | Line 32: | ||
=Problem #2: Debugging Utility Functions= | =Problem #2: Debugging Utility Functions= | ||
| − | ==Part 1== | + | ==Part 1 (2 points)== |
Write an assembly language program that does '''not''' use the driver.c or asm_io.asm files and that displays a 32-bit integer in binary, hexadecimal, and in decimal. When the number is displayed in decimal it is displayed as an ''unsigned'' '''int'''. For example, 0x80000000 should display as 2147483648. | Write an assembly language program that does '''not''' use the driver.c or asm_io.asm files and that displays a 32-bit integer in binary, hexadecimal, and in decimal. When the number is displayed in decimal it is displayed as an ''unsigned'' '''int'''. For example, 0x80000000 should display as 2147483648. | ||
| Line 83: | Line 83: | ||
:where nextLine is a function that brings the cursor to the next line. | :where nextLine is a function that brings the cursor to the next line. | ||
| − | ==Part 2== | + | ==Part 2 (1/2 point)== |
Add a fourth function called '''printRegs''' to your program that will display all the registers in hex, in unsigned decimal, and in signed decimal formats. | Add a fourth function called '''printRegs''' to your program that will display all the registers in hex, in unsigned decimal, and in signed decimal formats. | ||
| Line 101: | Line 101: | ||
Your function should display the value the registers hold before the call is made to printRegs. Your function should return to the calling program without having changed the value of any of the registers. | Your function should display the value the registers hold before the call is made to printRegs. Your function should return to the calling program without having changed the value of any of the registers. | ||
| − | ==Part 3== | + | ==Part 3 (1/2 point)== |
Add a new feature to the '''printRegs''' function so that it displays the flag bits. | Add a new feature to the '''printRegs''' function so that it displays the flag bits. | ||
Revision as of 09:59, 13 December 2010
This final exam is take-home. It is open-books, open-notes, and open-Web. It is due a week after it is made available, at 12:00 p.m. on Monday December 20, 2010.
You cannot discuss the details of this exam with anyone except your instructor. The TAs are not allowed to help you out in any way. No question will be answered in person after 12:00 a.m. on 12/13/10. Instead, if you have questions regarding the exam, send them via email to thiebaut@cs.smith.edu, and the question and its answer will be broadcast back to the hole class via email. The exam is given under the rules of the Smith College Honor Code.
Make sure you reference all work/resources you use in your documentation.
