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; ...
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, ...
Discrete mathematics has been rising in prominence in the past fifty years, both as a tool with practical applications and as a source of new and interesting mathematics. The topics in discrete ...
These online resources offer additional content for instructors and/or students that support enhanced teaching and learning outcomes and can be accessed online or downloaded for offline reading.
The Department has a strong faculty working in various topics in discrete mathematics, especially algorithmic aspects. The interface between Theoretical Computer Science and Discrete Mathematics has ...
Students can pursue a Master's Degree in Mathematical Sciences with an emphasis in discrete mathematics, pure mathematics, statistics, or computational and applied mathematics. Applicants are not ...
If you have assigned this textbook in your course, you may gain access to the instructor resources described on this page by clicking the link below. All requests for instructor access are verified by ...
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 ...
Sets, logic, mathematical induction, functions and equivalence relations. Partial orderings, algebraic structures and morphisms. Error correcting codes and public key ...
Examines graph theory, trees, algebraic systems, Boolean algebra, groups, monoids, automata, machines, rings and fields, applications to coding theory, logic design ...