Discrete Probabilistic Methods
Download as PDF
Course Description
Modern discrete probabilistic methods suitable for analyzing discrete structures of the type arising in number theory, graph theory, combinatorics, computer science, information theory and molecular sequence analysis. Prerequisite: STATS 116/MATH 151 or equivalent. Typically in alternating years.
Grading Basis
ROP - Letter or Credit/No Credit
Min
4
Max
4
Course Repeatable for Degree Credit?
No
Course Component
Lecture
Enrollment Optional?
No
This course has been approved for the following WAYS
Formal Reasoning (FR)
Programs
MATH159
is a
completion requirement
for:
- (from the following course set: )
- (from the following course set: )