Difference between revisions of "CSC231 Exercises with conditional jumps"
(→Finding the Smallest of 3 Ints) |
|||
Line 1: | Line 1: | ||
+ | --[[User:Thiebaut|D. Thiebaut]] ([[User talk:Thiebaut|talk]]) 08:08, 9 November 2015 (EST) | ||
+ | ---- | ||
+ | |||
=Exercises on Conditional Jumps= | =Exercises on Conditional Jumps= | ||
Revision as of 08:08, 9 November 2015
--D. Thiebaut (talk) 08:08, 9 November 2015 (EST)
Exercises on Conditional Jumps
Contents
Finding the Smallest of 3 Ints
- Find the minimum of 3 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?