Skip to main content

Course Detail

Course Description

CourseCodeSemesterT+P (Hour)CreditECTS
DISCRETE MATHEMATICS-Spring Semester3+035
Course Program
Prerequisites Courses
Recommended Elective Courses
Language of CourseEnglish
Course LevelFirst Cycle (Bachelor's Degree)
Course TypeElective
Course CoordinatorAssist.Prof. Cihan Bilge KAYASANDIK
Name of Lecturer(s)Assist.Prof. Cihan Bilge KAYASANDIK
Assistant(s)Slides, Lecture Notes and Textbook
AimThe course is aimed at equipping students with logical and mathematical thinking. The course is designed to accomplish five major themes: (i) Mathematical reasoning, (ii) combinatorial analysis, (iii) discrete structures, (iv) algorithmic thinking, (v) applications and modeling.
Course ContentThis course contains; Fundamentals,Fundamentals of Logic ,Logic, Conditional Statements,Logic of Quantified Statements,Introduction to Number Theory, Direct Proof and Counterexample,Sequences, Mathematical Induction,Strong Induction, Recursion and Structural Induction,Introduction to Set theory,Functions,Cardinality applications to computability,Relation,Equivalence Relation and Modular Arithmetic,Basic Cryptography ,Basic Problems on Graphs and Tree representation,Applications of Graph theory.
Dersin Öğrenme KazanımlarıTeaching MethodsAssessment Methods
Determine an argument using logical notation and whether the argument is or not valid10, 12, 16, 9A, E
Execute proof writing and evaluation.10, 12, 16, 9A, E
Comprehend set fundamentals, operations, and validation of elementary set equalities.10, 12, 16, 9A, E
Comprehend the properties of functions, relationships between them, and introductory knowledge of graph theory and cryptology.10, 12, 16, 9A, E
Teaching Methods:10: Discussion Method, 12: Problem Solving Method, 16: Question - Answer Technique, 9: Lecture Method
Assessment Methods:A: Traditional Written Exam, E: Homework

Course Outline

OrderSubjectsPreliminary Work
1FundamentalsChapter
2Fundamentals of Logic Chapter 2.1
3Logic, Conditional StatementsChapter 2.2, 2.3
4Logic of Quantified StatementsChapter 3
5Introduction to Number Theory, Direct Proof and CounterexampleChapter 4
6Sequences, Mathematical InductionChapter 5.1, 5.2
7Strong Induction, Recursion and Structural InductionChapter 5
8Introduction to Set theoryChapter 6.1
8FunctionsChapter 7.1-7.3
9Cardinality applications to computabilityChapter 7.4
10RelationChapter 8.1, 8.2
11Equivalence Relation and Modular ArithmeticChapter 8.3, 8.4
12Basic Cryptography Chapter 8.4
13Basic Problems on Graphs and Tree representationChapter 10.1-10.5
14Applications of Graph theoryChapter 10.5, 10.7
Resources
Discrete Mathematics and Its Applications, Kenneth H. Rosen, 7th edition, McGraw-Hill, 2012

Course Contribution to Program Qualifications

Course Contribution to Program Qualifications
NoProgram QualificationContribution Level
12345
1
An ability to apply knowledge of mathematics, science, and engineering
X
2
An ability to identify, formulate, and solve engineering problems
X
3
An 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
4
An ability to use the techniques, skills, and modern engineering tools necessary for engineering practice
X
5
An ability to design and conduct experiments, as well as to analyze and interpret data
6
An ability to function on multidisciplinary teams
7
An ability to communicate effectively
8
A recognition of the need for, and an ability to engage in life-long learning
X
9
An understanding of professional and ethical responsibility
10
A knowledge of contemporary issues
11
The broad education necessary to understand the impact of engineering solutions in a global, economic, environmental, and societal context
X

Assessment Methods

Contribution LevelAbsolute Evaluation
Rate of Midterm Exam to Success 30
Rate of Final Exam to Success 70
Total 100
ECTS / Workload Table
ActivitiesNumber ofDuration(Hour)Total Workload(Hour)
Course Hours14342
Guided Problem Solving000
Resolution of Homework Problems and Submission as a Report000
Term Project14342
Presentation of Project / Seminar000
Quiz3515
Midterm Exam12020
General Exam13030
Performance Task, Maintenance Plan000
Total Workload(Hour)149
Dersin AKTS Kredisi = Toplam İş Yükü (Saat)/30*=(149/30)5
ECTS of the course: 30 hours of work is counted as 1 ECTS credit.

Detail Informations of the Course

Course Description

CourseCodeSemesterT+P (Hour)CreditECTS
DISCRETE MATHEMATICS-Spring Semester3+035
Course Program
Prerequisites Courses
Recommended Elective Courses
Language of CourseEnglish
Course LevelFirst Cycle (Bachelor's Degree)
Course TypeElective
Course CoordinatorAssist.Prof. Cihan Bilge KAYASANDIK
Name of Lecturer(s)Assist.Prof. Cihan Bilge KAYASANDIK
Assistant(s)Slides, Lecture Notes and Textbook
AimThe course is aimed at equipping students with logical and mathematical thinking. The course is designed to accomplish five major themes: (i) Mathematical reasoning, (ii) combinatorial analysis, (iii) discrete structures, (iv) algorithmic thinking, (v) applications and modeling.
Course ContentThis course contains; Fundamentals,Fundamentals of Logic ,Logic, Conditional Statements,Logic of Quantified Statements,Introduction to Number Theory, Direct Proof and Counterexample,Sequences, Mathematical Induction,Strong Induction, Recursion and Structural Induction,Introduction to Set theory,Functions,Cardinality applications to computability,Relation,Equivalence Relation and Modular Arithmetic,Basic Cryptography ,Basic Problems on Graphs and Tree representation,Applications of Graph theory.
Dersin Öğrenme KazanımlarıTeaching MethodsAssessment Methods
Determine an argument using logical notation and whether the argument is or not valid10, 12, 16, 9A, E
Execute proof writing and evaluation.10, 12, 16, 9A, E
Comprehend set fundamentals, operations, and validation of elementary set equalities.10, 12, 16, 9A, E
Comprehend the properties of functions, relationships between them, and introductory knowledge of graph theory and cryptology.10, 12, 16, 9A, E
Teaching Methods:10: Discussion Method, 12: Problem Solving Method, 16: Question - Answer Technique, 9: Lecture Method
Assessment Methods:A: Traditional Written Exam, E: Homework

Course Outline

OrderSubjectsPreliminary Work
1FundamentalsChapter
2Fundamentals of Logic Chapter 2.1
3Logic, Conditional StatementsChapter 2.2, 2.3
4Logic of Quantified StatementsChapter 3
5Introduction to Number Theory, Direct Proof and CounterexampleChapter 4
6Sequences, Mathematical InductionChapter 5.1, 5.2
7Strong Induction, Recursion and Structural InductionChapter 5
8Introduction to Set theoryChapter 6.1
8FunctionsChapter 7.1-7.3
9Cardinality applications to computabilityChapter 7.4
10RelationChapter 8.1, 8.2
11Equivalence Relation and Modular ArithmeticChapter 8.3, 8.4
12Basic Cryptography Chapter 8.4
13Basic Problems on Graphs and Tree representationChapter 10.1-10.5
14Applications of Graph theoryChapter 10.5, 10.7
Resources
Discrete Mathematics and Its Applications, Kenneth H. Rosen, 7th edition, McGraw-Hill, 2012

Course Contribution to Program Qualifications

Course Contribution to Program Qualifications
NoProgram QualificationContribution Level
12345
1
An ability to apply knowledge of mathematics, science, and engineering
X
2
An ability to identify, formulate, and solve engineering problems
X
3
An 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
4
An ability to use the techniques, skills, and modern engineering tools necessary for engineering practice
X
5
An ability to design and conduct experiments, as well as to analyze and interpret data
6
An ability to function on multidisciplinary teams
7
An ability to communicate effectively
8
A recognition of the need for, and an ability to engage in life-long learning
X
9
An understanding of professional and ethical responsibility
10
A knowledge of contemporary issues
11
The broad education necessary to understand the impact of engineering solutions in a global, economic, environmental, and societal context
X

Assessment Methods

Contribution LevelAbsolute Evaluation
Rate of Midterm Exam to Success 30
Rate of Final Exam to Success 70
Total 100

Numerical Data

Student Success

Ekleme Tarihi: 09/10/2023 - 10:37Son Güncelleme Tarihi: 09/10/2023 - 10:37