MATH2000 — Discrete Mathematics
Academic Division: Liberal Arts Academic Discipline: Mathematics Assistant Dean: Steve Haynes PhD 3 Credit(s) This course presents topics in sets, logic, proofs, functions/sequences/relations, algorithms, counting methods, recurrence relations, graph theory, and trees. Emphasis is placed on proper notation and terminology as well as problem solving and proofs. 3 Lecture Hour(s); Required Find sets/subsets based upon given criteria HW:Wk#1 Test:Wk#4 F.Ex.:Wk#16 2. Perform unary and binary set operations both symbolically and visually HW:Wk#1 Test:Wk#4 F.Ex.:Wk#16 3. Use quantifiers when describing set relationships HW:Wk#2 Test:Wk#4 F.Ex.:Wk#16 4. Analyze simple or compound propositions by using truth tables and/or Venn diagrams HW:Wk#1 Test:Wk#4 F.Ex.:Wk#16 5. Analyze arguments using rules of inference. HW:Wk#2 Test:Wk#4 F.Ex.:Wk#16 6. Describe and use methods of proof including direct proofs, indirect proofs, resolution proofs, and mathematical induction HW:Wk#3,4 Test:Wk#4 F.Ex.:Wk#16 7. Provide examples of and/or identify functions that are injections, surjections, bijections, and composite functions HW:Wk#1 Test:Wk#8 F.Ex.:Wk#16 8. Find terms of a sequence, both specific terms and the general term HW:Wk#5 Test:Wk#8 F.Ex.:Wk#16 9. Define sequences and answer questions about them HW:Wk#5 Test:Wk#8 F.Ex.:Wk#16 10. Define strings and answer questions about them HW:Wk#5 Test:Wk#8 F.Ex.:Wk#16 11. Compute the resulting string from string operations HW:Wk#5 Test:Wk#8 F.Ex.:Wk#16