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

Additionally, students must always refer to course syllabus for the most up to date information. The course covers fundamental ideas from discrete mathematics, especially for computer science students ...

Examines graph theory, trees, algebraic systems, Boolean algebra, groups, monoids, automata, machines, rings and fields, applications to coding theory, logic design ...

Covers topics in discrete mathematics with applications within computer science. Some of the topics to be covered include graphs and matrices; principles of logic and induction; number theory; ...

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

My research centers on combinatorics, the study of discrete structures with applications in both theory and practice. The primary goal of my research is to identify suitable perspectives and employ ...

We will organize an integrated method of algebraic operations for various types of discrete structures and construct the standard techniques for efficiently processing the large-scale practical ...