Course Information
SemesterCourse Unit CodeCourse Unit TitleT+P+LCreditNumber of ECTS Credits
4BİL216Discrete Mathematics3+0+035

Course Details
Language of Instruction Turkish
Level of Course Unit Bachelor's Degree
Department / Program Computer Engineering
Mode of Delivery Face to Face
Type of Course Unit Compulsory
Objectives of the Course The mathematical foundations of computer applications to teach the principles of graph theory and to provide information to modeling.
Course Content Logic, proof methods, set theory, relations, functions, number theory, cryptoraphy, counting, permutation, combination, graph theory, trees, Boolean algebra, modeling, finite state machines, Turing machine
Course Methods and Techniques
Prerequisites and co-requisities None
Course Coordinator None
Name of Lecturers Asist Prof. Refia Aksoy
Assistants None
Work Placement(s) No

Recommended or Required Reading
Resources KennethRosen, DiscreteMathematicsandIts Applications, McGraw-HillEducation; 7th edition 2011.
Lectures, Question-Answer.
Vize ve Final Sınavları

Course Category
Mathematics and Basic Sciences %20
Engineering %10
Engineering Design %0
Social Sciences %0
Education %0
Science %0
Health %0
Field %70

Planned Learning Activities and Teaching Methods
Activities are given in detail in the section of "Assessment Methods and Criteria" and "Workload Calculation"

Assessment Methods and Criteria
In-Term Studies Quantity Percentage
Mid-terms 1 % 40
Final examination 1 % 60
Total
2
% 100

 
ECTS Allocated Based on Student Workload
Activities Quantity Duration Total Work Load
Course Duration 14 3 42
Hours for off-the-c.r.stud 14 4 56
Mid-terms 1 15 15
Final examination 1 15 15
Total Work Load   Number of ECTS Credits 5 128

Course Learning Outcomes: Upon the successful completion of this course, students will be able to:
NoLearning Outcomes
1 Defines the basic mathematical concepts.
2 Understands the relationship between computers and mathematics.
3 Taking advantage of the different varieties of modeling creates models of real-world problems.
4 Improves the ability of abstract thinking.
5 Demonstrates the ability to prove that a given theorem. Problems analytical, numerical methods, and be statistically dissolves.


Weekly Detailed Course Contents
WeekTopicsStudy MaterialsMaterials
1 Basic concepts, logic.
2 Propositions, proof methods.
3 Sets, Venn diagrams, power sets, Cartesian product.
4 Relations, the properties of relations, representation of relations.
5 Functions, the composition of functions.
6 Number theory, division algorithm, integer representations, solving congruences.
7 Fermat's little theorem, Wilson's theorem, check bit.
8 Midterm exam.
9 Caesar cipher, cryptanalysis.
10 Block cipher, public key cryptography, RSA cryptosystem, digital signatures.
11 Counting, permutation, combination.
12 Graph theory, the general concepts of graph, isomorphism, Euler and Hamilton paths.
13 Trees, Boolean algebra.
14 Modeling, finite state machines, Turing machine.


Contribution of Learning Outcomes to Programme Outcomes
P1 P2 P3 P4 P5 P6 P7 P8 P9 P10 P11
All 5 1 1 1 1 1 1 1 1 1
C1 5 1 1 1 1 1 1 1 1 1
C2 5 1 1 1 1 1 1 1 1 1
C3 5 1 1 1 1 1 1 1 1 1
C4 5 1 1 1 1 1 1 1 1 1
C5 5 1 1 1 1 1 1 1 1 1

bbb


https://obs.gedik.edu.tr/oibs/bologna/progCourseDetails.aspx?curCourse=205984&curProgID=5607&lang=en