D.2: Relations and Functions
From
(Difference between revisions)
m (Created page with '== Discrete Math Learning modules == <br/><br/>') |
Poul.murtha (Talk | contribs) |
||
| Line 2: | Line 2: | ||
<br/><br/> | <br/><br/> | ||
| + | |||
| + | '''D.2 Relations and Functions''': Demonstrate understanding of relations and | ||
| + | functions. | ||
| + | |||
| + | D.2.1 Determine whether simple examples of discrete functions are injective and/or | ||
| + | surjective. | ||
| + | |||
| + | D.2.2 Demonstrate ability to interpret examples of simple discrete functions by | ||
| + | mapping elements from a discrete domain to a discrete range. | ||
| + | |||
| + | D.2.3 Demonstrate ability to produce the subset of the cross product of the domain | ||
| + | and image of a relation corresponding to simple examples of relations. | ||
| + | |||
| + | D.2.4 Use concepts of reflexivity, symmetry, and transitivity to establish that a | ||
| + | relation is an equivalence relation. | ||
| + | |||
| + | D.2.5 Design simple algorithms such as hashing, checksum or error-correction | ||
| + | functions. | ||
Revision as of 23:17, 31 July 2010
Discrete Math Learning modules
D.2 Relations and Functions: Demonstrate understanding of relations and functions.
D.2.1 Determine whether simple examples of discrete functions are injective and/or surjective.
D.2.2 Demonstrate ability to interpret examples of simple discrete functions by mapping elements from a discrete domain to a discrete range.
D.2.3 Demonstrate ability to produce the subset of the cross product of the domain and image of a relation corresponding to simple examples of relations.
D.2.4 Use concepts of reflexivity, symmetry, and transitivity to establish that a relation is an equivalence relation.
D.2.5 Design simple algorithms such as hashing, checksum or error-correction functions.
