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

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

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

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

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