ANTALYA BİLİM UNIVERSITY
Course Information Package

CS 3006 - Introduction to Artificial Intelligence

Basic Information

Course Code:
CS 3006
Course Name:
Introduction to Artificial Intelligence
Language of Instruction:
English
Course Type:
Class
Course Level:
Bachelor
ECTS:
5.00
Instructor:
Dr. Öğr. Üyesi Zahra GOLRIZKHATAMI

Course Objectives

The main objective of this course is to introduce the foundational principles of artificial intelligence such as search, knowledge-representation and reasoning, planning, probability, utility theories and learning.

Course Content

The meaning of Artificial Intelligence, Intelligent Agents Search Techniques (Breadth-First, Depth-First) Search Techniques (Depth-Limited, Iterative Deepening, Uniform-Cost etc.) Search Techniques (Greedy-Best-First, A* search, heuristics) Constraint Satisfaction Problems Adversarial Search Propositional Logic, First-Order Logic Uncertainty and Utilities Markov Decision Processes (Value Iteration, Policy Iteration) Reinforcement Learning, Q-learning, Policy Search Probability Theory, Naïve Bayes

Prerequisites / Corequisites

CS 1002 and MATH 1004

Course Books / Materials / Recommended Resources

Artificial Intelligence: A Modern Approach, by Stuart Russell and Peter Norvig., 3rd edition, Pearson.

Learning Outcomes

Code Description
LO1 Describe how artificial intelligence (AI) is defined within the context of computer science
LO2 Describe AI techniques including search techniques and heuristics, knowledge representation, automated planning, reinforcement learning and statistical learning.
LO3 Formalize a given problem in the language of different AI methods such as a search problem, a constraint satisfaction problem, a planning problem or a learning problem.
LO4 Design and implement artificial intelligence solution techniques to a wide range of problems that range from policy search to classification.
LO5 Perform an empirical evaluation of different algorithms on AI problems

Weekly Course Content

Week Content
1 The meaning of Artificial Intelligence, Intelligent Agents
2 Search Techniques (Breadth-First, Depth-First)
3 Search Techniques (Depth-Limited, Iterative Deepening, Uniform-Cost etc.)
4 Search Techniques (Greedy-Best-First, A* search, heuristics)
5 Constraint Satisfaction Problems
6 Constraint Satisfaction Problems
7 Adversarial Search
8 Propositional Logic, First-Order Logic
9 Uncertainty and Utilities
10 Markov Decision Processes (Value Iteration, Policy Iteration)
11 Markov Decision Processes (Value Iteration, Policy Iteration)
12 Reinforcement Learning, Q-learning, Policy Search
13 Reinforcement Learning, Q-learning, Policy Search
14 Probability Theory, Naïve Bayes

Workload Calculation

Activity Count Duration (Hours) Total
Attendance 15 3.00 45.00
Practice 10 3.00 30.00
Post-Prectice Individual Study 15 2.00 30.00
Midterm Exam/Preparation 1 15.00 15.00
Final Exam/Preparation 1 20.00 20.00
Research Presentation 1 10.00 10.00
Total Workload (Hours) 150
ECTS Credit (Workload / 25) 5

Assessment

# Assessment Type Contribution (%)
1 Final Exam %100

PO - LO Matrix

PO \ LO
LO1
LO2
LO3
LO4
LO5
PO-1
PO-2
PO-3
PO-4
PO-5
PO-6
PO-7
PO-8
PO-9
PO-10
PO-11
1
Low Contribution
2
Medium Contribution
3
High Contribution

Teaching and Learning Methods

# Method Name Description Tools
1 Lecture (expository teaching), interactive discussion Listening and taking notes. Standard classroom technologies, multimedia tools (projector, computer, digital presentations)
2 Controversial Course Listening and comprehension, critical thinking Standard classroom technologies, multimedia tools, projector, computer, overhead projector
3 Problem Solving * Analyzing physical and physiological problems using problem-solving techniques and developing appropriate solutions.
4 Simulation Exploring the operation of physical circuit designs through the use of simulation software. Simulation tools

Academic Integrity and Artificial Intelligence

Academic integrity is mandatory in this course. Students must submit their own work and properly cite all sources. AI tools may be used only if permitted and must be clearly disclosed. Unauthorized use or plagiarism will result in disciplinary action.