Discrete Structures

  • Information Systems |
  • English

Description

The course provides an introduction to mathematical structures fundamentals of computer science. Topics discussed include logic of compound and quantified statements, number theory and methods of proof, sequences and mathematical induction, set theory, counting methods, s and relations. The course lays down the mathematical formulation necessary for success in the computer science field.

Program

Information Systems (2021 - Old Plan)

Objectives

  • 1. Use logic to determine the validity of an argument.
    2. Construct the proof of a theorem.
    3. Understand the terminology, operations, and symbols of set theory.
    4. Use combinatorial techniques when needed in solving problems.
    5. Identify s specifically, surjective, injective, and bijective s.
    6. Identify relations specifically, a partial order, equivalence, and total order relations.

Textbook

Susanna Epp, Discrete Mathematics with Applications, Thomson Learning.

Course Content