Discrete Mathematics – MATH 350
CG • Section 8WK • 11/08/2019 to 04/16/2020 • Modified 07/28/2020
Recurrence relations, relations, graph theory, languages, grammars, and finite-state machines.
MATH 200 or MATH 250
Discrete mathematics, the study of finite systems, has become increasingly important in this technological society. The digital computer is essentially a finite system, and many of its properties can be understood and interpreted within the framework of finite mathematical systems. This course provides an exposure to mathematical topics that are essential to the study of computer science. To promote an understanding and appreciation of the discrete mathematical structures which are the foundation of all software engineering.
Measurable Learning Outcomes
Upon successful completion of this course, the student will be able to:
- Perform analysis and design of simple iterative and recursive algorithms.
- Develop proofs using mathematical induction and strong induction.
- Apply number theory to public key cryptography.
- Encrypt and decrypt simple messages using basic secret key and public key methods.
- Identify and use the many terms associated with graphs, directed graphs, and trees.
- Identify whether two given graphs are isomorphic.
- Test a graph for the existence of an Euler path, an Euler circuit, a Hamiltonian path and a Hamiltonian circuit, and find the shortest path between two nodes in a simple weighted connected graph.
- Recognize how formal languages, finite-state machines, and Turing machines are all models of various kinds of computation.
After reading the Course Syllabus and Student Expectations, the student will complete the related checklist found in Module/Week 1.
The student will complete reading assignments within the ConnectMath software associated with the textbook.
The student will complete handwritten homework assignments and submit them in Blackboard each week
Each quiz will cover the Reading & Study material for the assigned modules/weeks. Each quiz will be timed, open-book/open-notes, have a 1-hour time limit, and be completed in ConnectMath software. The student will have 2 attempts at each quiz.
The student will complete exams during Modules/Weeks 2, 4, 6, and 8. Each exam will be open-book/open-notes, have a 2-hour time limit, and will cover 2 modules/weeks of material. All tests are handwritten.