- Recognise and use the terminology: binary operation, infix notation, quotient and remainder (associated with integer division).
- Use the notation for various binary operations introduced in the text, in particular DIV and MOD on integers; and ∧ (and) and ∨ (or) on Boolean values.
- Suggest appropriate signatures and preconditions for functions corresponding to binary operations, including comparisons that return Boolean values.
- Evaluate expressions involving functions and binary operations introduced in the text. Take note of where brackets appear in an expression.
- Recognise an expression that is invalid because it uses a process in a way inconsistent with its signature or precondition.
20.8.11
Objectives for Section 5
After studying this section you should be able to do the following.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment