D.2: Relations and Functions
From
m (→Discrete Math Learning modules) |
m (→Discrete Math Learning modules) |
||
| (3 intermediate revisions not shown) | |||
| Line 21: | Line 21: | ||
== Discrete Math Learning modules == | == Discrete Math Learning modules == | ||
| + | [[media:Relations_and_Functions.pptx | Relations/Functions Overview (from Terrel Smith's class, MS-Powerpoint slide set)]]<br/> | ||
| + | [[media:Kirkwood's Hashing Project.doc | Hashing project Java exercises (from Don Kirkwood's class)]]<br/><br/> | ||
| + | == Resources for Relations and Functions == | ||
<br/><br/> | <br/><br/> | ||
| - | |||
| - | |||
---- | ---- | ||
{{HS Discrete Math (CS0)/ChapNav}} | {{HS Discrete Math (CS0)/ChapNav}} | ||
---- | ---- | ||
[[Category:HS Discrete Math (CS0)|{{SUBPAGENAME}}]] | [[Category:HS Discrete Math (CS0)|{{SUBPAGENAME}}]] | ||
Current revision as of 15:49, 1 February 2011
Oregon Department of Education knowledge and skills for Relations and Functions
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.
Discrete Math Learning modules
Relations/Functions Overview (from Terrel Smith's class, MS-Powerpoint slide set)
Hashing project Java exercises (from Don Kirkwood's class)
Resources for Relations and Functions
