Course Syllabus
Course: MATH 3310
Division: Natural Science and Math
Department: Mathematics
Title: Discrete Mathematics
Semester Approved: Summer 2022
Five-Year Review Semester: Spring 2027
End Semester: Spring 2028
Catalog Description: This course in discrete mathematics covers Boolean algebra, logic and proof, sets and relations, functions, induction, recursion, enumerative combinatorics, elements of number theory, and graph theory.
Semesters Offered: Fall
Credit/Time Requirement: Credit: 3; Lecture: 3; Lab: 0
Prerequisites: Math 1210
Justification: Discrete mathematics is a required topic in a variety of major programs. Included are computer science, engineering, and certain emphases in mathematics. In particular, this course is a requirement for the Bachelor's of Science Degree in Software Engineering. It is similar to Math 3310 at USU and Math 2200 at the University of Utah.
Student Learning Outcomes:
Demonstrate their ability to apply discrete mathematical concepts to real-world-type applications.
Topics for these applications may include data networks and their design, data encryption, logic circuits, and algorithmic design and efficiency.
Students will be assessed using homework, quizzes, tests, and/or projects.
Demonstrate that they can use the ideas of logic to write proofs that solve problems in discrete mathematics.
Writing proofs is an important way to logically organize one's thoughts while solving a problem. This logical organization represents an important skill for software engineers and anyone else who will need to both write code and understand complex relationships clearly and precisely.
Students will be assessed using homework, quizzes, tests, and/or projects.
Content:
Through lecture, instruction, and various other methods, this course may include any of the following topics:
• logic and proof
• Boolean algebra
• sets and relations on sets, including cardinalities and partial order
• functions
• induction and recursion
• counting principles, permutations, and combinations
• elements of number theory
• groups
• cryptography
• algorithmic complexity
• graph theory
•trees
This course is designed so that students can consider and even develop unique and original perspectives and/or approaches to solve problems. Instructors are encouraged to foster an environment where each contribution from the students is appreciated.
Instructors are also encouraged to assign at least one project and/or presentation in which the students can explore those topics that interest them and present them in a way that they find most interesting and most relatable.
Key Performance Indicators:
Student learning may be evaluated using:
Midterm Exams 20 to 70%
Quizzes 0 to 20%
Comprehensive Final Exam 15 to 35%
Homework 5 to 25%
Projects 0 to 20%
Representative Text and/or Supplies:
Kolman, Busby, and Ross, Discrete Mathematical Structures, current edition, Prentice Hall.
Kenneth H. Rosen, Discrete Mathematics and its Applications, current edition, McGraw Hill.
Kevin Powell, Discrete Perspectives in Mathematics: Mathematics without Limits, current edition.
Pedagogy Statement:
The AAC&Us high impact practices are proving to be of value to students of all backgrounds; be that learning preferences, ethnicity, gender or socioeconomic levels. Based on that knowledge teachers of this course regularly use many teaching/learning methods such as group work, discussion, lecture, online sources for both learning and homework, group and individual presentations, and traditional paper and pencil homework that allows students to demonstrate their learning.
Instructional Mediums:
Lecture
Maximum Class Size: 36
Optimum Class Size: 20
