MATH 350 Discrete Mathematics
Course Description
Recurrence relations, relations, graph theory, languages, grammars, and finite-state machines.
For information regarding prerequisites for this course, please refer to the Academic Course Catalog.
Course Guide
View this course’s outcomes, policies, schedule, and more.*
Rationale
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.
Course Assignment
No details available.
After reading the Course Syllabus and Student Expectations, the student will complete the related checklist found in the Course Overview.
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 Canvas each week.
Each quiz will cover the Learn material for the assigned Modules. 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 quizzes: written exams during Modules 2, 4, 6, and 8. Each written exam will be open-book/open-notes, cover 2 modules of material, and have a 2 hour time limit. All written exams will be handwritten and submitted in Canvas.
Have questions about this course or a program?
Speak to one of our admissions specialists.
Inner Navigation
Have questions?