D.2: Relations and Functions
From
(Difference between revisions)
Poul.murtha (Talk | contribs) |
m (→Discrete Math Learning modules) |
||
| Line 20: | Line 20: | ||
D.2.5 Design simple algorithms such as hashing, checksum or error-correction | D.2.5 Design simple algorithms such as hashing, checksum or error-correction | ||
functions. | functions. | ||
| + | |||
| + | <br/><br/> | ||
| + | ---- | ||
| + | {{HS Discrete Math (CS0)/ChapNav}} | ||
| + | ---- | ||
| + | [[Category:HS Discrete Math (CS0)|{{SUBPAGENAME}}]] | ||
Revision as of 07:39, 2 August 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.
