This course will discuss fundamental concepts and tools in discrete mathematics with emphasis on their applications to computer science. Example topics include logic and Boolean circuits; sets, ...

Discrete mathematics is the study of finite or countable discrete structures; it spans such topics as graph theory, coding theory, design theory, and enumeration. The faculty at Michigan Tech ...

This course is available with permission to General Course students. This is a course covering a number of concepts and techniques of discrete mathematics. Topics covered: Counting: selections; ...

This course is available with permission to General Course students. This is a course covering a number of concepts and techniques of discrete mathematics. Topics covered: Counting: selections; ...

Sets, logic, mathematical induction, functions and equivalence relations. Partial orderings, algebraic structures and morphisms. Error correcting codes and public key ...

Discrete Mathematics plays an important role in explaining key concepts in Information Technology and Computer Science, This course explores topics in logic, relationships between data, number theory ...

Presents propositional logic, combinatorics, methods of proof, mathematical systems, algebra of sets, matrix algebra, relations and functions, recursion and generating functions, applications to ...

This is a graduate-level course focused on techniques and models in modern discrete probability. Topics include: the first and second moment methods, Chernoff bounds and large deviations, martingales, ...

Exact & Approximate Methods for Understanding DEs One aim of this course is to provide an Math 708 (Discrete Optimization) will be offered in the Fall 2024 ... situations where small changes to DE ...

The course covers fundamental ideas from discrete mathematics, especially for computer science students. It focuses on topics that will be foundational for future courses including algorithms, ...