Discrete Mathematics: Getting Started

Discrete Mathematics

Course Number:

CSIS 2050

An introduction to the concepts and techniques of discrete mathematical structures that are used in the theory and application of computer science and computer information systems. Topics covered include set theory, relations, functions, proof techniques, predicate logic, combinational and sequential logic and circuitry, recurrence relations, boolean algebra, graph theory, trees, and discrete probability.

Discrete Mathematics

Course Number:

CSIS 2050

Discrete Mathematics Textbook Information:

Discrete Mathematics

Course Number:

CSIS 2050

Discrete Mathematics

• Perform the operations associated with sets, functions, and relations and relate practical examples to the appropriate set, function, or relation model, and interpret the associated
• Model real-life situations with combinational and sequential logic and circuitry including, select the type of proofs and use formal logic proofs to provide rigorous reasoning to real situations, and solve problems including those arising in computing contexts such as program correctness, database queries, and algorithms including recursion
• Model problems in computer science using graphs and trees, demonstrate understanding of traversal, and relate graphs and trees to data structures, algorithms, and counting
• Compute permutations, combinations, and discrete probabilities
• Determine the time and space complexity of algorithms
• Model discrete probability problems, understand events and conditional probability, apply binomial theorem to independent events and solve problems using Bayes theorem