Christian Brothers University

Math 141 Departmental Syllabus
Introduction to Discrete Math

Catalog Data The course contains and relates a variety of discrete mathematical themes and topics. These themes include problem solving, abstraction, mathematical reasoning and proof, induction and modeling. Topics include logic, graphs, sets, algorithms and combinatorics.
Prerequisite: Math 106 or Math 117

Textbook Discrete Mathematics, J. Dossey, et al., 4th ed., Addison Wesley, 2002

Calculator Policy You should use a graphing calculator, such as a Texas Instruments Model 89, on assignments and on some tests.

Prerequisites You must have some college level skills in mathematics.

Goals You will learn basic concepts of induction, recursion, algorithms, graphs and combinatorics. You will improve your skills in problem solving and analytical reasoning.


Syllabus
Topic Sections Classes
Introduction to combinatorics and algorithms 1.1-4 4
Sets, functions and induction
Congruence, mathematical induction 		2.1-3,5-7 8
Graphs
Paths, circuits, shortest paths, coloring a graph, directed graphs 		3.1-5 7
Trees
Spanning trees, depth first search, binary trees, traversals 		4.1-6 8
Counting techniques
Permutations, combinations, arrangements, selections with repetitions, probability 		7.1-6 8
Introduction to logic
Statements, connectives, logical equivalence, truth tables 		A.1-2 3
Tests 4
Total 42
Final Exam The final exam is comprehensive.

Resources The Math Center in Science 116 and 151 offers free tutoring.

Attendance You must attend class regularly.