| |
Dec 22, 2024
|
|
|
|
|
MA 3320 - Discrete Mathematics II3 lecture hours 0 lab hours 3 credits
Course Description
This course continues the introduction of discrete mathematics begun in MA 2310. Emphasis is placed on concepts applied within the field of computer science. Topics include logic and proofs, number theory, counting, computational complexity, computability, and discrete probability. A student cannot receive credit for both MA 3320 and MA 1830. (prereq: MA 2310 )
Course Learning Outcomes
Upon successful completion of this course, the student will be able to:
- Apply conditional probability to identify independent events
- Apply Bayes’ rule and demonstrate an understanding of its implications
- Be familiar with standard complexity classes
- Derive closed-form and asymptotic expressions from series and recurrences for growth rates of processes
- Identify a given set as countable or uncountable
- Calculate the number of possible outcomes of elementary combinatorial processes such as permutations and combinations
- Illustrate by examples the properties of primes
- Apply the Chinese remainder theorem
- Synthesize induction hypotheses and simple induction proofs
- Illustrate by examples proof by contradiction
Prerequisites by Topic
- Predicate logic
- Recurrence relations
- Fundamental structures
Coordinator
Dr. Chunping Xie
Add to Portfolio (opens a new window)
|
|
Skip to Main Content
