Difference between revisions of "CSC231 Exercises with conditional jumps"

From dftwiki3
Jump to: navigation, search
(Long/short jumps)
Line 85: Line 85:
 
<br />
 
<br />
 
<br />
 
<br />
[[Category:CSC231]][[Category:nasm]][[Category:Exercise]]
+
[[Category:CSC231]][[Category:nasm]][[Category:Exercises]]

Revision as of 08:13, 4 November 2014

Exercises on Conditional Jumps





Finding the minimum


Find the minimum of 3 signed int variables a, b, and c


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?