EASTERN MEDITERRANEAN UNIVERSITY
COURSE OUTLINE
COURSE CODE MATH163 COURSE LEVEL Undergraduate Fall 2021-2022
COURSE TITLE Discrete Mathematics
Core for the Computer Engineering, Mechanical Engineering, Industrial Engineering
COURSE TYPE
and Mathematics departments
Gr.1 Dr. Hasan Temizkan
Gr.2 Dr. Neşet Deniz Turgay
[email protected] phone 2412 office AS325
Gr.3 Prof. Dr. Rza Bashirov
[email protected] phone 1005 office AS141
LECTURER(S)
Gr.4 Dr. Mustafa Erbilen
Gr.5 Dr. Neşet Deniz Turgay
[email protected] phone 2412 office AS325
Gr.6 Dr. Mustafa Erbilen
Gr.1 Mohammed Reza Saadet
[email protected] phone 2194 office AS149
Gr.2 Mohammed Reza Saadet
[email protected] phone 2194 office AS149
Gr.3
ASSISTANT(S)
Gr.4 Mohammed Reza Saadet
[email protected] phone 2194 office AS149
Gr.5
Gr.6 Mohammed Reza Saadet
[email protected] phone 2194 office AS149
CREDIT VALUE (3,1) 3 ECTS VALUE 5
PREREQUISITES None
COREQUISITES None
DURATION OF
One semester
COURSE
WEB LINK http://lms.emu.edu.tr
CATALOGUE DESCRIPTION
Sets: subsets, the power set, set operations, proof by Venn diagram, Cartesian product of sets. Relations:
binary relations and their properties, equivalence relations and equivalence classes, partition of a set,
partial order, poset, Hasse diagram. Functions: domain, codomain (target) and range, one-to-one, onto,
one-to-one correspondence and inverse functions, composition of functions. Propositional logic: well-
formed propositions, theorem and contradiction, proof by truth table. Boolean algebra: basic Boolean
functions, digital logic gates, minterm and maxterm expansions, simplifying Boolean functions with
Karnaugh maps. Induction: the principle of mathematical induction. Recursion: some special sequences,
recurrence relations, solving recurrence relations, the characteristic polynomial. Principles of counting:
the principle of inclusion-exclusion, the addition and multiplication rules, the pigeonhole principle.
Permutations and combinations: r-permutations, r-combinations, binomial coefficients, repetitions,
derangements, the binomial theorem, Pascal's triangle. Graphs: terminology, subgraphs, pseudographs,
bipartite graphs, complete and complete bipartite graphs, isomorphism, Eulerian pseudographs, the
theorems on Eulerian circuits and Eulerian trails, Hamiltonian cycles, adjacency matrix. Trees: spanning
trees, minimum spanning trees, Kruskal's algorithm, Prim's algorithm.
AIMS & OBJECTIVES
Discrete mathematics is the first non-calculus course for mathematics, computer science and engineering
majors. This course introduces mathematical tools and techniques used to study discrete processes as
opposed to continuous processes. Topics covered include discrete concepts such as basic set theory,
functions, relations, recurrences, counting principles, fundamentals of propositional logic and Boolean
algebra, graphs and trees. The course also introduces proof techniques of mathematics including proof
by induction, proof by truth table, proof by Venn diagram, etc. This course is indeed prerequisite of logic
design, operational research, combinatorics, abstract algebra, mathematical modeling, geometry and
topology courses.
GENERAL LEARNING OUTCOMES (COMPETENCES)
On completion of this module, student should be able to:
- Define sets and perform operations on sets
- Recognize binary relations and types of functions
- Describe Boolean algebra and its relation to logical circuits
- Use mathematical induction and the pigeon-hole principle to prove various statements
involving natural numbers
- Use basic counting techniques such as permutations, combinations, the principle of inclusion
and exclusion to enumerate elements of finite sets
- Recall basic definitions for graphs
- Identify basic properties of graphs
- Recall the definitions of some famous problems formulated on graphs such as the existence of
Eulerian circuit and Hamiltonian circuit
- Identify trees and recall basic properties of trees; find a minimal spanning tree of a graph
On successful completion of this course, all students will have developed their skills in:
- analytical and critical thinking
- problem identification, formulation and solution
- application of methods and models of discrete mathematics to practical problems
On successful completion of this course, all students will have developed their appreciation of and respect
for values and attitudes regarding the issues of:
- The awareness on how to create different engineering models and use them for problem solving
exploring techniques and mechanisms provided by discrete mathematics
GRADING CRITERIA
Passing grade as well as grade ranges will be determined at the end of semester based on the course
averages.
RELATIONSHIP WITH OTHER COURSES
This course is indeed prerequisite of logic design, operational research, combinatorics, abstract algebra,
mathematical modeling, geometry and topology courses.
LEARNING / TEACHING METHOD
The teaching method adopted for Discrete Mathematics consists of a combination of three lecture hours
and one tutorial hour.
METHOD OF ASSESSMENT
Midterm I - 30%
Midterm II - 30%
Final - 40%
Grade (100%) = Midterm I (30%) + Midterm II (30%) + Final (40%)
All examinations (midterm, final, makeup and resit) will be scheduled by University Exam Committee.
IMPORTANT NOTICES
1. As is known, a hybrid teaching approach is being use for teaching in 2021-22 Fall Semester. In-class
lectures and tutorials are synchronously translated to online students. Video records of the classes
will be soon available on the web page. We are using Moodle LMS platform with MS Teams to
conduct the classes.
2. Attendance is effective predictor of academic achievement. It should be know that neither extra point
will be given for good attendance not a point will be cut for insufficient attendance. Attendance limit
is set to 50%, meaning that to pass the course a student needs to attend 50% of the classes as
minimum.
TEXTBOOKS
1. Goodaire E. G., Parmenter M. M., Discrete Mathematics with Graph Theory, Prentice Hall, 2006.
2. McEliece, R. J., Ash, R. B., Ash, C. Introduction to Discrete Mathematics, McGraw-Hill, 1989.
TIME-TABLE
08:30-09:20
MATH163(04)/CLA11 MATH163(03)/ASG15
<1>
09:30-10:20
MATH163(04)/CLA11 MATH163(03)/ASG15
<2>
10:30-11:20 MATH163(02)/CL218
<3> MATH163(06)/CL301
11:30-12:20 MATH163(02)/CL218
<4> MATH163(06)/CL301
MATH163(01)/ASG13
12:30-13:20 MATH163(03)/ASG15
MATH163(02)/CLA24
<5> MATH163(04)/CLA22
MATH163(05)/CLA22
MATH163(01)/ASG13
13:30-14:20 MATH163(03)/ASG15
MATH163(02)/CLA24
<6> MATH163(04)/CLA22
MATH163(05)/CLA22
14:30-15:20 MATH163(01)/CLA24
MATH163(06)/CL105
<7> MATH163(05)/ASG15
15:30-16:20 MATH163(01)/CLA24
MATH163(06)/CL105
<8> MATH163(05)/ASG15
CONTENT & SCHEDULE
Week Date Topics
1 4 –8 Oct Sets, operations on sets. Binary relations, equivalence relations.
Partial orders, Hasse diagram, Functions, domain, target and range of the
2 11 – 15 Oct
function.
Injective, surjective, bijective and inverse functions, composition of the
3 18 – 22 Oct
functions.
4 25 – 29 Oct The cardinality of a set. Propositions and well-formed propositions.
Basic Boolean functions. Truth tables. Digital logic gates, minterm and
5 1 – 5 Nov
maxterm expansions.
The basic theorems of Boolean algebra. Simplifying Boolean functions
6 8 – 12 Nov
with Karnaugh maps.
7 15 – 19 Nov Mathematical induction. Recursively defined sequences.
8 22 Nov – 4 Dec Midterm Examinations
Solving second-degree homogenous recurrence relations. The principle of
9 6 – 10 Dec
Inclusion-Exclusion.
10 13 – 17 Dec The Addition and Multiplication rules. The Pigeon-Hole Principle.
11 20 – 24 Dec Permutations, combinations. Repetitions, derangements.
12 27 – 31 Dec The Binomial Theorem. Graphs and trees. Definitions and basic properties.
13 3 – 7 Jan Graph isomorphism. Eulerian circuits, Eulerian trails. Hamiltonian circuits.
Adjacency matrix. Properties of trees, spanning trees. Minimal spanning
14 10 – 13 Jan
trees. Kruskal’s and Prim’s algorithms.
17 – 29 Jan Final examinations
Special days:
18 October is Religious Day (Mawlid Oct.17 night)
29 October is TR Republic Day (National Holiday), a non-working day in TRNC
10 November is Commemoration of Atatürk
15 November is TRNC Republic Day (National Holiday), a non-working day in TRNC
25 December is Noel; Attendance will not be taken in classes and no quizzes or any other exams will
be administered
1 January is New Year’s Day, a non-working day in TRNC
CHEATING AND PLAGIARISM
1. In accordance with Article 6 – c – vii of the Regulations for Student Disciplinary Code, a short term
suspension is imposed for attempting to cheat or to help others cheat in any examination.
2. In accordance with Article 6 – e – i of the Regulations for Student Disciplinary Code, a long term
suspension is imposed for cheating or helping others cheat in any examination or project.
3. In accordance with Article 6 – e – xi of the Regulations for Student Disciplinary Code, a long term
suspension is imposed for having someone else sit for the exam for oneself or sitting for an exam
for the place of someone else.
