Texas A&M University-Corpus Christi / Dept. of Computing and
Mathematical Sciences
MATH 2305 §002 -- Discrete Mathematics I -- Spring
2003
Test 3 Review
| Section | Topic | Examples | Comment |
| 4.1 | Test an ordered pair for membership in a binary relation. | ||
| Test a binary relation for reflexivity, symmetry, antisymmetry, and transitivity. | |||
| Draw the Hasse Diagram for a partially ordered set. | |||
| Find the least, minimal, greatest, and maximal elements in a partially ordered set. | |||
| Find the equiavalence classes associated with an equivalence relation. | |||
| Definitions: binary relation, properties, equivalence relation, equivalence classes, partially ordered set. | |||
| 4.4 | Test whether a relation is a function. | ||
| Test whether a function is 1-1,onto | |||
| Find image of elements under composition. | |||
| Write permutations (1-1, onto functions) in cycles in different forms and find compositions. | |||
| Given finite domain, codomain, find # functions, # 1-1 and #onto | |||
| Find the order of magnitude of a function, compare the order of magnitude of two functions. | |||
| 4.5 | Add subtract, multiply and perform scalar multiplication on matrices | ||
Perform Boolean and, or, and matrix multiplication on Boolean matrices |
|||
| Determine location of an element within a matrix | |||
| 5.1 | Use graph terminology (vertices, edges, adjacent, loop, degree, complete, simple, path, cyclic, acyclic) | ||
| Construct adjacency matrices for graphs and directed graphs. | |||
| Model diverse situations with graphs | |||
| 5.3 | Construct expression trees | and convert amongs expressions (prefix, infix, postfix) | |
| Conduct preorder, inorder, and postorder traversals of a tree | |||
| 5.4 | Draw decision trees for sequential search and binary search on n-element lists. | ||
| Create binary search trees. | |||
Determine minimum amount of work needed to solve problems in worst cases. |
|||
| Minimum times to search lists and sort lists in the worst cases. |