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 ...

If you are interested in the real-world applications of numbers, discrete mathematics may be the concentration for you. Because discrete mathematics is the language of computing, it complements the ...

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; ...

The mathematics behind artificial intelligence (AI) and machine learning (ML) rely on linear algebra, calculus, probability, ...

This is a course covering a number of concepts and techniques of discrete mathematics. Topics covered: Counting: selections; inclusion-exclusion; generating functions; recurrence relations. Graph ...

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, ...

Introduces students to ideas and techniques from discrete mathematics that are widely used in science and engineering. Mathematical definitions and proofs are emphasized. Topics include formal logic ...

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 ...