Form No. QC001
FACULTY OF ENGINEERING
Department: Computer Engineering and Networks
Course Syllabus
Instructor Name
Course Title:
Dr. Mohamed Anadani
Discrete Mathematics
Course code:
none
none
Prerequisite:
Co-requisite:
1434-1435
Level: Third &Seventh
Academic Year:
Sun.12.00-13.50
Mon.9.00.9.50
Lecture Times:
Wed.12.00-12.50
Office Hours
CS,IT111,
CEN 201
Cr.Hrs:
3
Thu. 8.00-8.50
Tutorial Time:
Semester: Second
Lab Time:
Office number 2533
Course Discription
1
2
3
1
2
3
4
5
6
7
8
9
N
1
2
3
4
5
6
7
8
1)
Elementary logic and Set theory: Simple and compound statements, Logical connectives, Truth tables, Basic logic laws,
Operations on sets, Basic laws of set theory, Cartesian product of sets.
2)
Methods of proof: Proof Strategy, Direct Method, the Contrapositive Method, the Contradiction Method, Mathematical
Induction, and Structural Induction.
3)
Relations: Basic definitions on relations, Binary relations and their types, Equivalence relation and set partition, Partial
Ordering.
4)
Algorithms: Algorithms, Examples of Algorithms, Complexity of Algorithms, Recursive Definitions, Recursive
Algorithms.
5)
Integers and Algorithms: Integers and Division, The Division Algorithm, Congruencies, Representation of Integers,
Integers Algorithms, The Euclidean Algorithm, Applications.
6)
Principles of Counting: The Basics of Counting, The Pigeonhole Principle, Permutations and Combinations, Generalized
Permutations and Combinations, Algorithms for generating Permutations and Combinations, Binomial Coefficients.
7)
Graph theory: Introduction to Graphs, Representation of Graphs, Paths and Cycles, Euler and Hamilton Paths, ShortestPath Algorithms, Planar Graph, Graph Coloring.
Course Goals and Objectives
Basic and fundamentals tools of Discrete Mathematics are explained and applied.
Students will be able to apply differential in various applications in real-time.
This course will help students to improve their thinking to solve problems.
Course Outcomes
Ability to apply knowledge of mathematics, science, and engineering
Ability to design and conduct experiments, as well as to analyze and interpret data
Ability to design a system, component, or process to meet desired needs within realistic constraints such as economic,
environmental, social, political, ethical, health and safety, manufacturability, and sustainability.
Ability to function on multidisciplinary teams.
Understanding of professional and ethical responsibility
Ability to communicate effectively
Broad education necessary to understand the impact of engineering solutions in a global, economic, environmental, and
societal context
Knowledge of contemporary issues
Ability to use the techniques, skills, and modern engineering tools necessary for engineering practice
Course Contents
Short Description
Simple and compound statements.
Logical connectives, Truth tables, Basic logic laws.
Operations on sets, Basic laws of set theory, Cartesian product of sets.
Proof Strategy, Direct Method, the Contrapositive Method, the Contradiction Method, Mathematical Induction,
and Structural Induction.
Algorithms, Examples of Algorithms, Complexity of Algorithms, Recursive Definitions, Recursive Algorithms.
Integers and Division, The Division Algorithm, Congruencies, Representation of Integers, Integers Algorithms,
The Euclidean Algorithm, Applications.
The Basics of Counting, The Pigeonhole Principle, Permutations and Combinations, Generalized
Permutations and Combinations, Algorithms for generating Permutations and Combinations, Binomial
Coefficients.
Introduction to Graphs, Representation of Graphs, Paths and Cycles, Euler and Hamilton Paths, ShortestPath Algorithms, Planar Graph, Graph Coloring.
Week
1
2
2
2
2
2
2
1
Mode of Assessment
1
2
3
4
5
1st midterm exam
2nd midterm exam
Quiz and homework assignments
Activities
Final Exam
Textbook:
References:
20%
20%
10%
10%
40%
Books
- Kenneth H. Rosen, Discrete mathematics and its applications, McGraw- Hill, 5th Ed, ISBN 0-07-119881-4.
- John A. Dossey, Albert D. Otto, Lawrence E. Spence, and Charles Vanden Eynden, "Discrete Mathematics",ISBN
0321305159. Addison, Wesley, 5th Ed.
- Joe L Mott, "Discrete mathematics for Computers", ISBN: 97881203150.