DEPT. OF MATH. & STAT.

COURSE SYLLABUS

A Course Number
& Title
Discrete Mathematics – MTH 213

B Pre/Co-requisite(s) Prerequisite: MTH 102 or MTH 103

C Number of credits 3
D Faculty Name Taher Abualrub
E Term/ Year Spring 2024
F Sections CRN Days Time Location
21037-1 MW 12:30 – 1:45 NAB 007
21414-5 TR 9:30-10:45 Physics 113
G Instructor
Information Office Telephone Email
NAB 261 515-2920 [email protected]
Office Hours:
• MW: 11:00 – 12:30
• Or by appointment

H Course Description (Equivalent to CMP 213). Covers propositional and predicate calculus, sets, major classes of
from Catalog functions and related algorithms, asymptotic analysis of functions, principle of
mathematical induction, proof techniques, recursive definitions, counting, relations, graphs
and trees.

Computer science and computer engineering students who are not yet formally admitted to
the second-year level in the major are not eligible to take this course.
Course Learning Outcomes (CLOs) Assessment Instrument(s)
I Course Learning
Upon completion of this course, students will be able
Outcomes and
to:
Assessment
CLO1: Apply logic and mathematical reasoning. Exam 1 and/or Final
Instruments
CLO2: Perform different methods of proof including induction Exam 1 and/or Exam
and proof by contradiction. 2 and/or Final

CLO3: Identify and apply basic set theory principles. Exam 1 and/or Exam
2 and/or Final
CLO4: Identify and apply relations, and functions including one- Exam 1 and/or Exam
to-one and onto functions. 2 and/or Final

CLO5: Apply basic principles of counting including the addition Exam 2 and/or Final
and multiplication rules, and the pigeonhole principle.

CLO6: Use graph theory concepts, such as minimum spanning Exam 2 and/or Final
tree and traveling salesman problem, to model and solve a
variety of network and real-life problems.

CLO7: Analyze different type of algorithms and their complexity Exam 2 and/or Final
and the order of algorithms.
 DEPT. OF MATH. & STAT.
COURSE SYLLABUS

J Mapping CLO’s to Course Learning Outcomes Program Learning Outcome:

PLO's The BSMTH CLOs are listed at the end of this document
1. CLO1, CLO2 PLO1, PLO2, PLO3, PLO5, PLO8
2. CLO3, CLO5 PLO1, PLO8
3. CLO4 PLO1, PLO6, PLO8
4. CLO6 PLO6, PLO8
5. CLO7 PLO1, PLO6

K Textbook and Susanna S. Epp, Discrete Mathematics with Applications, Metric Edition, 5th Edition,
other Instructional Brooks/Cole, Cengage Learning, 2020.
Material and
• Sponsored students: Contact the Office of Sponsored Students (Ms. Maha:
Resources
[email protected]) for instructions of how to obtain your access code.

• If you are not a sponsored student, you can buy the access code from the
Bookstore (AllPrint) or direct from the publisher (you get 25% discount) using the
link:

https://www.cengage.com/coursepages/American_WebAssign_All_
Courses_Spring24
L Teaching Methods Lectures, oral presentations and group discussion. All lecture notes and videos will be
available on iLearn.
M Grading Scale, Grading Scale (example)
Grading
Distribution, and 93 – 100 4.0 A 73.00 – 77.99 2.3 C+
Due Dates 89.00 – 92.99 3.7 A- 68.00 – 72.99 2.0 C
86.00 – 88.99 3.3 B+ 62.00 – 67.99 1.7 C-
81.00 – 85.99 3.0 B 50.00 – 61.99 1.0 D
78.00 – 80.99 2.7 B- Less Than 50.00 0 F

Grading Distribution

Assessment Weight Due Date (Week #)

Quizzes/Assignments 15% TBA
Exam 1 25% Wednesday, March 6 (MW)
Thursday March 7 (TR), In Class
Exam 2 25% Monday, April 22 (MW)
Tuesday April 23 (TR), In Class
Final Exam 35% TBA
Total 100%

N Explanation of There will be two exams, several quizzes/assignments and a comprehensive final exam.
Assessments
• No make-up quiz will be given. If you miss a quiz for whatever reason, you will get
zero for that quiz. The lowest quiz grade will not count toward your grade,
however.
• Late homework will not be graded. If a homework is not done on time, you will get
zero for that homework. The lowest homework grade will not count toward your
grade, however.
• With a valid written excuse and making immediate arrangements with the
instructor, a missed exam might be replaced with a make-up exam or the grade of
 DEPT. OF MATH. & STAT.
COURSE SYLLABUS

the final exam and/or the average grade of all tests (including final) and/or quizzes
and homework.

O Attendance Students in this course are required to follow the AUS Attendance Policy as outlined in the
AUS Undergraduate Catalog.
P Student Academic Students MUST read the Student Academic Integrity Code outlined in the AUS
Integrity Code Undergraduate Catalog and abide by the standards for academic conduct, students’ rights
Statement and responsibilities and procedures for handling allegations of academic dishonesty.
Q Generative AI It is considered an academic integrity violation to represent output of a generative artificial
Course Policy intelligence tool as your own work.

Schedule*

CHAPTER NOTES
WEEK

1 1: Speaking Mathematically 1.1 Variables

2.1 Logical Forms and Logical Equivalence
2.2 Conditional Statements
2 2: The Logic of Compound Statements
2.3 Valid and Invalid Arguments
3.1 Predicates and Quantified Statements I
3.2 Predicates and Quantified Statements II
3 3: The Logic of Quantified Statements
3.3 Statements with Multiple Quantifiers
3.4 Arguments with Quantified Statements
4: Elementary Number Theory and Methods 4.1 Direct Proof and Counterexample I: Introduction
4 4.2 Direct Proof and Counterexample II: Writing Advice
of Proofs
4.3 Direct Proof and Counterexample III: Rational Numbers
4.4 Direct Proof and Counterexample IV: Divisibility
4.5 Direct Proof and Counterexample V: Division into Cases and the
5 4.7 Indirect Argument: Contradiction and Contraposition
4.8 Indirect Argument: Two Famous Theorems
4.10: Algorithms; The Euclidean Algorithm
5.2 Mathematical Induction I
6 5: Sequences, Induction, and Recursion 5.3 Mathematical Induction II
5.4 Strong Mathematical Induction
Exam 1 (Ch.1 – Ch.4, 5.1-5.4): Wednesday March 6 for MW, Thursday
March 7 for TR, In class
7 5.6 Defining Sequences Recursively
5.7 Solving Recurrence Relations by Iteration
5.8 Second-Order Linear Homogenous Recurrence Relations
1.2 The Language of Sets
6.1 Definitions and the Elements Method of Proof
8 6: Set Theory
6.2 Properties of Sets
6.3 Disproof and Algebraic Proofs
1.3 The language of Relations and Functions
9 7: Functions 7.1 Functions Defined on General Sets
7.2 One-to-One and Onto, Inverse Functions
8.1 Relations on Sets
10 8: Relations
8.2 Reflexivity, Symmetry, and Transitivity
 DEPT. OF MATH. & STAT.
COURSE SYLLABUS

8.3 Equivalence Relations

8.4 Modular Arithmetic with Applications to Cryptography
9.1 Introduction
9.2 Possibility Tree and the Multiplication Rule
11 9: Counting and Probability
9.3 Counting Elements of Disjoint Sets: the Addition Rule
9.4 The Pigeonhole Principle
Exam 2 (Ch.5 – Ch.9): Monday, April 22 for MW, Tuesday April 23 for TR, In
12 class
10.1 Trails, Paths, and Circuits
10.4 Trees
13 10: Graphs and Trees
10.5 Rooted Trees
10.6 Spanning Trees and Shortest Paths
14 10: Graphs and Trees
11.2 O-, Omega-, and Theta-Notations

15 11: Analysis of Algorithm Efficiency 11.3 Application: Analysis of Algorithm Efficiency I

16 Final Exam (Comprehensive): TBA

* The teaching schedule is subject to change at the instructor’s discretion, and students will be informed
accordingly.

BSMTH Program Learning Outcomes

PLO1: Demonstrate knowledge and understanding of diverse areas in mathematics such as analysis, algebra, discrete
mathematics, and applied mathematics.

PLO2: Construct and effectively communicate valid mathematical arguments.

PLO3: Demonstrate a solid grounding in the ideas and techniques of mathematics.

PLO4: Apply mathematical analysis and mathematical skills to problems in other disciplines.

PLO5: Use discrete mathematical concepts in a variety of contexts such as algorithm development, computer
programming and network development and implementation.

PLO6: Demonstrate the ability to identify and carry out thoughtful approaches to problem solving.

PLO7: Define and execute simple research tasks, and assist in more complex research tasks as required for professional
work.

PLO8: Formulate a problem in mathematical terms from descriptions written in language specific to disciplines
associated with engineering, finance and the natural sciences.

PLO9: Obtain the research skills necessary to adapt to change and remain current in the field and continue to learn new
information, skills and concepts.