Sign-in Links
ELEC 270 Discrete Mathematics with Computer Engineering App Units: 3.50
Introduction to the mathematics of representing and manipulating discrete objects. Topics include numbers, modular arithmetic, counting, relations and graph theory. Methods of proof and reasoning - such as induction and mathematical logic - will also be covered. Some applications to cryptosystems, hashing functions, and job scheduling will be included.
(Lec: 3, Lab: 0, Tut: 0.5)
(Lec: 3, Lab: 0, Tut: 0.5)
Offering Term: W
CEAB Units:
Mathematics 31
Natural Sciences 0
Complementary Studies 0
Engineering Science 11
Engineering Design 0
Offering Faculty: Smith Engineering
Course Learning Outcomes:
- Identify when a mathematical proposition is a tautology, contradiction, or logical equivalence.
- Determine whether a relation is an equivalence relation or whether a relation is a partial order.
- Use mathematical induction as a proof technique to prove a result.
- Apply the Pigeonhole Principle in mathematical proofs.
- Be able to compute an inverse in modular arithmetic and know how to use it to solve linear congruences.
- Apply counting techniques such as inclusion-exclusion, combinations and permutations to count large groups of objects.