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

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

the study of structures and relations in sets; and abstract algebra and design theory, the study of symmetries. It is a good field for someone who sees the beauty in mathematics. Degree requirements ...

Dr. Burlick previously served as assistant professor in the Computer Science Department at Stevens Institute of Technology in Hoboken, NJ, where he instructed in undergraduate courses in areas such as ...