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, functions, relations, and graph theory. The course lays down the mathematical formulation necessary for success in the computer science field.

Program

Information Systems (2024)

Objectives

  • • Use logic to determine the validity of an argument.
    • Construct the proof of a theorem.
    • Use combinatorial techniques when needed in solving problems.
    • Identify functions; specifically, surjective, injective, and bijective functions.
    • Identify relations; specifically, a partial order, equivalence, and total order relations.
    • Understand the terminology and concepts of elementary graph theory.

Textbook

Susanna Epp, Discrete Mathematics with Applications, Thomson Learning.

Course Content

content serial Description
1Introduction and Logic form and logical equivalence
2Conditional statements
3Valid and invalid arguments
4Predicates and quantified statements
5Arguments with quantified statements
6Methods of proof: Direct proof and counterexample part 1
7Methods of proof: Direct proof and counterexample part 2
8Methods of proof: Contraposition and contradiction
9Sequences and mathematical induction
10Counting part 1
11Counting part 2
12Functions
13Composite Functions
14Relations and elementary graph theory
15Relations and elementary graph theory

Markets and Career

  • Generation, transmission, distribution and utilization of electrical power for public and private sectors to secure both continuous and emergency demands.
  • Electrical power feeding for civil and military marine and aviation utilities.
  • Electrical works in construction engineering.

Start your application

Start The your journey to your new career.