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

IS -144 CRs

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

content serial Description
1The logic of compound statements
2The logic of compound statements
3The logic of compound statements
4Quantified statements
5Elementary number theory and methods of proof
6Elementary number theory and methods of proof
77th Week Exam
8Counting
9Counting
10Functions
11Functions
1212th Week Exam
13Relations
14Mathematical induction
15Revision
16Final Exam

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.