Information Package
baskent.edu.tr

Program of Artificial Intelligence Engineering (English)

AI224

DISCRETE MATHEMATICS

Course Code
AI224
Semester
Fourth Term (Spring)
Theory+Practice
3 + 1
ECTS
6
Course TypeCompulsory Course
Course LevelBachelor's Degree
Year of Study2
SemesterFourth Term (Spring)
ECTS6
Name of Lecturer(s) -
Learning Outcomes

At the end of this course, the students;

  1. Represent the propositions using logical connectives and interpret symbolic expressions.
  2. Determine is a mathematical argument correct or not.
  3. Develop the knowledge on recursively-defined structures
  4. Gain the ability to think algorithmically.
  5. Have theoretical knowledge on Equivalence relations and Partial orders; solve related application problems.
  6. Learn the basic principles of counting and advanced counting techniques.
  7. Obtain information about basic concepts, methods and applications of graph theory.
  8. Apply discrete structures and related methods to solve problems in Computer Engineering.
Mode of DeliveryFace to face
PrerequisitesNo
Recommended Optional Programme Components
Course DescriptionPropositional and predicate logic (truth tables, logical inference, quantifiers), Sets, relations, and functions, Recursive definitions and mathematical induction, Counting principles and combinatorics, Graphs and trees, Boolean algebra and its applications, Bitwise operations and basics of coding theory, Discrete probability and its relation to algorithm analysis.
Course Contents
WEEK TOPICS
1st Week Logic
2nd Week Logical operations and laws of logic, quantifiers and proofs of theorems
3rd Week Sets
4th Week Subsets and operations on sets
5th Week Principles of counting
6th Week pigeon-hole principles
7th Week Integers, mathematical induction
8th Week Mid-term
9th Week Relations and functions
10th Week Partially ordered sets and Lattices
11th Week Boolean algebras
12th Week Graphs
13th Week Euler and Hamiltonian paths and circuits
14th Week Trees, Binary trees, spanning trees, Tree searching, Elements of coding theory
Recommended or Required Reading* Discrete Mathematics and Its Applications - Kenneth H. Rosen
* Discrete Mathematics with Applications - Susanna S. Epp
* Discrete Mathematics - Richard Johnsonbaugh
* Discrete Mathematics for Computer Science - Gary Haggard, John Schlipf, Sue Whitesides
Planned Learning Activities and Teaching Methods
  • Lecture
  • Questions/Answers
  • Presentation
  • Report Preparation
  • Project
  • Experiment
  • Practice
Assessment Methods and Criteria
Quantity Percentage (%)
Mid-term 1 30
Assignment 8 15
Quiz 4 15
Total(%) 60
Contribution of In-term Studies to Overall Grade(%) 60
Contribution of Final Examination to Overall Grade(%) 40
Total(%) 100
Language of InstructionEnglish
Work Placement(s)No

Programme Qualifications / Learning Outcomes

LO1 LO2 LO3 LO4 LO5 LO6 LO7 LO8
K1
K2
K3
K4
K5
K6
K7
K8
K9
K10
K11
K12