An introductory course in discrete mathematics. The course covers logic and elements of logic, quantifiers, proofs, mathematical induction, functions and relations. Graph theory, theory of trees, Boolean algebras and combinational circuits, finite-state machines.
İlk dosyayı sen ekleyebilirsin — notlar, geçmiş finaller, çözümler, cheat-sheet, ne varsa. Drive linki / PDF / ZIP / fotoğraf, hepsi olur.
Şu an: mail at, ben düzenleyip yayına alayım. Form/upload UX yakında geliyor (Kimya tasarlıyor).
| Dönem | Course CPA | |
|---|---|---|
| 2025-2026 Fall | 2.88 | 3 sec · 71 öğr |
| 2024-2025 Fall | 2.68 | 4 sec · 116 öğr |
| 2024-2025 Spring | 3.14 | 2 sec · 44 öğr |
| 2023-2024 Fall | 2.45 | 2 sec · 32 öğr |
| 2023-2024 Spring | 2.65 | 3 sec · 98 öğr |
| 2022-2023 Fall | 2.28 | 2 sec · 41 öğr |
| 2022-2023 Spring | 2.34 | 4 sec · 88 öğr |
| 2021-2022 Fall | 2.14 | 1 sec · 22 öğr |
| 2021-2022 Spring | 2.68 | 3 sec · 79 öğr |
| 2020-2021 Fall | 2.26 | 3 sec · 59 öğr |
Aggregate course GPA — Bilkent STARS'tan public data. Hoca-bazlı per-section detayı için STARS evaluation report →. Öğrenci anket cevapları KVKK kapsamında defter'de tutulmaz.
Collect at least 20 points out of 65 points by the Final Exam and don’t miss more than 15 hours of lecture.
Students are advised to consult their instructors regarding the use of Generative AI tools and their appropriateness in each course. Responsible use of GenAI is encouraged in accordance with Bilkent University's GenAI Guidelines. Link: https://w3.bilkent.edu.tr/bilkent/generative-artificial-intelligence-genai-guideline/
Information about the course Objective, Textbook, Grading Chapter 1: Sets and Logic 1.2 Propositions 1.3 Conditional Propositions and Logical Equivalence Chapter 1: Sets and Logic (Continue) Laws of Algebra of Propositions 1.5 Quantifiers 1.6 Nested Quantifiers Chapter 2: Proofs 2.1 Mathematical Systems, Direct Proofs and Counterexamples Chapter 2: Proofs (Continue) 2.4 Mathematical Induction Chapter 3: Functions and Relations 3.1 Functions - Graphs of Functions Chapter 3: Functions and Relations (Continue) 3.3 Relations 3.5 Matrices of Relations Chapter 8: Graph Theory 8.1 Introduction 8.2 Paths and Cycles Chapter 8: Graph Theory (Continue) 8.3 Hamiltonian Cycles and the TSP 8.4 A Shortest-path Algorithm Chapter 8: Graph Theory (Continue) 8.5 Representations of Graphs Chapter 9: Trees 9.1 Introduction Chapter 9: Trees (Continue) 9.2 Terminology and Characterizations of Trees 9.3 Spanning Trees Chapter 9: Trees (Continue) 9.4 Minimal Spanning Trees 9.6 Tree Traversals Chapter 11: Boolean Algebras and Combinatorial Circuits 11.1 Combinatorial Circuits 11.3 Boolean Algebras Chapter 11: Boolean Algebras and Combinatorial Circuits (Continue) 11.4 Boolean Functions and Synthesis of Circuits Chapter 12: Automata, Grammars, and Languages 12.1 Sequential Circuits and Finite-State Machines ECTS - Workload Table: Activities Number Hours Workload Final exam 1 2 2 Midterm exam 3 2 6 Course hours 14 3 42 Preparation for Midterm exam 3 12 36 Individual or group work 14 3 42 Preperation for Final exam 1 24 24 Total Workload: 152 Total Workload / 30: 152 / 30 5.07 ECTS Credits of the Course: 5 Type of Course: Lecture - Exercise Course Course Material: PP - Written - Multimedia - PC Teaching Methods: Lecture - Exercises - Independent study