Difference between revisions of "CSC231 Exercises with conditional jumps"
(→Finding the minimum) |
|||
Line 9: | Line 9: | ||
==Finding the minimum== | ==Finding the minimum== | ||
<br /> | <br /> | ||
− | + | ::Find the minimum of 3 signed int variables a, b, and c | |
− | Find the minimum of 3 signed int variables a, b, and c | ||
<br /> | <br /> | ||
Revision as of 08:11, 4 November 2014
Exercises on Conditional Jumps
Contents
Finding the minimum
- Find the minimum of 3 signed int variables a, b, and c
Loop until overflow
Print fibonacci numbers coded as unsigned words until the result overflows. Don't print erroneous numbers!
Scanning an array
Find the largest element of a 1-dimensional array of integers.
Characters and lower/upper case conversion
Write the code necessary to transform a character from lower- to upper-case, if the character is a letter. The character should not be changed if it is not a letter.
Characters and lower/upper case conversion. Version 2
Use a boolean function that returns true or false depending on whether the character it receives is lowercase or not.
Long/short jumps
Conditional jumps can jump only +127 bytes down, -128 bytes up in the code. How can we code something like this:
cmp eax,10 jl there ... ... there: ...
when the instruction at Label there is 1000 bytes away from the jl conditional jump?