Departmental Outline for MATH 2420
Discrete Mathematics
Description: Introduction to discrete structures which are applicable to computer science. Topics include number bases, logic, sets, Boolean algebra, and elementary concepts of graph theory.
Prerequisite: MATH 1220 Survey of Calculus or Math 1113 Precalculus.
Calculator: Students may have a scientific calculator. It is up to each instructor as to how much the students can use a calculator on tests.
Texts: (Required) Discrete Mathematics, 3 rd Edition by Susanna Epp, ITP, 2004, ISBN 0-534-35945-0.
Syllabus
Chapter 1
Sections 1.1 - 1.5
The Logic of Compound Statements
Chapter 2
Sections 2.1 - 2.4
The Logic of Quantified Statements
Chapter 3
Sections
3.1-3.4, 3.6
Elementary Number Theory and Methods of Proof
Chapter 4
Sections 4.1 - 4.2
Sequences and Mathematical Induction
Chapter 5
Sections 5.1 - 5.3
Set Theory
Chapter 7
Sections 7.1 - 7.4
Functions
Chapter 10
Sections
10.1-10.3, 10.5
Relations
Chapter 11
Sections 11.1, 11.2, 11.5, 11.6
Graphs and trees
If time permits, one could cover Section 10.4 (Cryptography), Chapter 12, or the omitted sections in Chapter 11. This material is optional.