This course provides an introduction to discrete mathematics, particularly graph theory. Emphasis will be placed on the algorithmic aspects of the area. Topics to be covered include: Brief ...

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

This course will discuss fundamental concepts and tools in discrete mathematics with emphasis on their applications to computer science. Example topics include logic ... trees and more general graphs.

Graph theory. The fourth number of the course code shows the level of the course. For example, in course 219206, the fourth number is a 2, so it is a 200-level course (usually studied in the second ...

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

See all Abstractions blog For example, imagine you’ve got six vertices ... They worked on a range of topics within discrete mathematics like graph theory, probability and the properties of random ...

Introduces students to ideas and techniques from discrete mathematics ... recurrences and elementary graph theory. Other selected topics may also be covered. Requisites: Requires a prerequisite of ...