ÇAĞ UNIVERSITY
FACULTY OF ARTS AND SCIENCES
Learning Outcomes of the Course
Code
Course Title
Credit
ECTS
MAT 383
Discrete Mathematics
3 (3-0)
5
Prerequisites
None
Language of Instruction
Mode of Delivery
Face to face
English
Type and Level of Course
Elective/3.Year/Fall Semester EQF- Level 6
Lecturers
Name(s)
Contacts
Lecture Hours
Office Hours
Course Coordinator Asist. Prof..Dr. Ayfer Kurt
[email protected]
Others
Course Objective
Students will learn the essential mathematic concepts and ideas in discrete mathematics,
which are required for studies in most areas in computer science.
Relationship
Students who have completed the course successfully should
be able to
Prog. Output
Net Effect
4,5,5
1
Be able to discuss and use set theoretic techniques,
1,2,5
(operations, Venn diagrams, etc.).
4,5,5,4
2
Be able to construct simple mathematical proofs and possess
1,2,3,5
the ability to verify them.
3,4,5
3
Be able to explain logical arguments and logical constructs.
1,2,5
4,5,5
4
Have a better understanding of sets, functions, and relations.
1,3,5
5,5
5
Be able to solve problems in combinatorics (permutations,
2,5
combinations, etc..).
5,5
6
Be able to perform various operations with relations and
2,5
functions (congruence, methods of proof, induction, recursion,
etc..).
4,5
7
Be able to explain and use the concepts of graphs and trees.
3,5
4,5,5
8
Be able to possess the mathematical knowledge and maturity
3,5,7
that are required for upper level computer
science courses.
4,5,5
9
Be able to discuss and use set theoretic techniques,
1,2,5
(operations, Venn diagrams, etc.).
Course Description: Topics in discrete math aimed at applications in Computer Science. Fundamental principles:
set theory, induction, relations, functions, Boolean algebra. Techniques of counting: permutations,
combinations, recurrences, algorithms to generate them. Introduction to graphs and trees.
Course Contents:( Weekly Lecture Plan )
Weeks
Topics
Preparation
Teaching Methods
1
Lectures
The Language Of Mathematics
None
2
Lectures
Logic
Textbook Ch. 2
3
Lectures
Algorithms
Textbook Ch. 3
4
Lectures
Integers
Textbook Ch. 4
5
Lectures
Counting Methods and the Pigeonhole
Textbook Ch. 5
Principle
6
Presentation & Demonstration
Generalized Permutations and Combinations;
Textbook Ch. 6
Binomial Coefficients and Combinatorial
Identities;
7
Exercises
Problem Solutions
8
Lectures
Recurrence Relations
Textbook Ch. 7
9
Lectures
Graph Theory
Textbook Ch. 8
10
Exercises
Problem Solutions
11
Lectures
Terminology and Characterizations of Trees;
Textbook Ch. 9
Spanning Trees; Minimal Spanning Trees;
12
Presentation & Demonstration
BinaryTrees; Tree Traversals; Decision Trees
Textbook Ch. 9
and the Minimum Time for Sorting;
Isomorphisms of Trees; Game Trees
13
Exercises
Problem Solutions
14
Exercises
Problem Solutions
REFERENCES
Textbook
Richard Johnsonbaugh, Discrete Mathematics, 7th edition, Prentice Hall (2009)
ISBN-10: 0131593188
http://www.slideshare.net/genierosecsantos/discrete-mathematics-lecture
Related links
http://aduni.org/courses/discrete/index.php?view=cw
Recommended Reading
Discrete and Combinatorial Mathematics, 5/E ,Ralph P. Grimaldi,
ISBN-10: 020172634
Material Sharing
Activities
Midterm Exam
Quizzes
Homework
Effect of The Activities
Effect of The Final Exam
Contents
Hours in Classroom
Hours out Classroom
Homeworks
Implementation
Quizzes
Midterm Exam
Final Exam
Number
1
4
4
ASSESSMENT METHODS
Effect
30%
5%
5%
40%
60%
ECTS TABLE
Number
14
14
1
4
4
1
1
Notes
Hours
3
3
4
3
1
16
24
Total
Total / 30
ECTS Credit
RECENT PERFORMANCE
N/A
Total
42
42
4
12
4
16
24
144
=144/30=4,80
5