To operate the Blended Learning Center(BLC) at optimal level, maintenance will be performed every day at 8:30 AM and at 5:00 PM regularly which can take up to 30 minutes. Please consider scheduling your activity in the BLC platform accordingly.
Topic outline
- Welcome to the world of Artificial Intelligence
![](https://elearn.daffodilvarsity.edu.bd/theme/image.php/remui/core/1716861392/spacer)
Welcome to the world of Artificial Intelligence
Assalamuwalikum Students, welcome to Summer'21. Throughout this semester I will be with you in any problem.
Hope you have a great semester. Best, SSH
Audio welcome letter:
![](https://elearn.daffodilvarsity.edu.bd/pluginfile.php/1125365/course/section/225202/AlarmingGloomyHoneycreeper-max-14mb.gif)
![](https://elearn.daffodilvarsity.edu.bd/pluginfile.php/1125365/course/section/225202/aa.png)
![DIU - Daffodil International University](https://faculty.daffodilvarsity.edu.bd/images/teacher/45e3e651cb2c244dddc0b112f7698604.jpg)
Instructor
Name: Shahana Shultana
Designation: Lecturer
Email: shahana.cse@diu.edu.bd
Office
Address: Room 505, AB-04, Savar, Dhaka
Course Rationale:
Artificial intelligence (AI) is a research field that studies how to realize the intelligent human behaviors on a computer. The ultimate goal of AI is to make a computer that can learn, plan, and solve problems autonomously. Although AI has been studied for more than half a century, we still cannot make a computer that is as intelligent as a human in all aspects. In this course, we will study the most fundamental knowledge for understanding AI. We will introduce some basic search algorithms for problem solving; knowledge representation and reasoning;
game playing theories;
Uncertainty; natural language processing and neural networks.
Course Objectives:
The main objective of this course is to provide an introduction to the
basic principles and applications of artificial intelligence.
After Completing the course students will be able to:
CO1: Understand the concepts of Artificial intelligence, Intelligent Agents And issues in the
design of search programs.
CO 2: Explain the role of agents and how it is related to environment and the way of evaluating it and how agents can act by establishing goals.
CO 3: Analyze and simulate various searching techniques, constraint satisfaction problem and example problems- game playing techniques..
CO 4: Explain the concepts of Logical Agents, Uncertainty,Natural Language processing and Expert Systems.
CO 5: Analyze and design a real world problem for implementation and understand the dynamic
behavior of a system.
Assessment:
Class Attendance
|
07
|
Assignment
|
5
|
Class Test
|
15
|
Presentation
|
8
|
Mid Term Exam
|
25
|
Semester Final Exam
|
40
|
Total:
|
100
|
Grading Policy:
Numerical Grade
|
Letter Grade
|
Grade Point
|
80% and above
|
A+
|
(A Plus)
|
4.0
|
75% to less than 80%
|
A
|
(A regular)
|
3.75
|
70% to less than 75%
|
A-
|
(A minus)
|
3.5
|
65% to less than 70%
|
B+
|
(B Plus)
|
3.25
|
60% to less than 65%
|
B
|
(B regular)
|
3.0
|
55% to less than 60%
|
B-
|
(B minus)
|
2.75
|
50% to less than 55%
|
C+
|
(C Plus)
|
2.5
|
45% to less than 50%
|
C
|
C (regular)
|
2.25
|
40% to less than 45%
|
D
|
|
2.0
|
Less than 40%
|
F
|
|
0.0
|
Artificial Intelligence: A Modern Approach
- Stuart Russel & Peter Norvig
Edition: 3rd
- Week 1
Week 1
![](https://elearn.daffodilvarsity.edu.bd/pluginfile.php/1168121/mod_label/intro/ai.gif)
Lesson 1: Introducing Class
Formal introduction between students and teacher. Outline of the course will be shared and course related topic will be discussed in order to make students familiar about the outcome of the course.
Lesson 2:
Topic Name: Introduction to AI
After completing the lesson students will be able to:
- Understand the fundamental ideas of AI
- Understand the foundational concepts of AI
- Know about the initial experiments and and future scopes of AI
Write down the differences between AI and Cybernetics
Topic-1 (PC-A) URL
Restricted Not available unless: You belong to PC-A
Topic-1 (pc-b) URL
Restricted Not available unless: You belong to PC-B
topic-1 (pc-c) URL
Restricted Not available unless: You belong to PC-C
Lab-1 (PC-C) URL
Restricted Not available unless: You belong to PC-C
- Week 2
![](https://elearn.daffodilvarsity.edu.bd/theme/image.php/remui/core/1716861392/spacer)
Week 2
Lesson 3:
Learning Objectives
After completing the lecture students will be able to:
- Explain about agent and rational agents
- Define PEAS for any given agent
- Explain about different kinds of Agents' Environments
- Differentiate between different kinds of agents
Write down the PEAS description of a Football Player agent
Topic-2 (part-1) (PC-A) URL
Restricted Not available unless: You belong to PC-A
topic-2 (part-1) (pc-b) URL
Restricted Not available unless: You belong to PC-B
topic-2 (part-1) (pc-c) URL
Restricted Not available unless: You belong to PC-C
Lesson 4:
Learning Objectives:
After completeing this lecture students will be able to:
- Describe the properties of Espert Systems
- Explain different aspects of Expert Systems
Topic-7 & Topic-2 (part-2) (PC-A) URL
Restricted Not available unless: You belong to PC-A
Topic-7 & Topic-2 (part-2) (PC-B) URL
Restricted Not available unless: You belong to PC-B
Topic-7 & Topic-2 (part-2) (PC-C) URL
Restricted Not available unless: You belong to PC-C
lab-2 (pc-c) URL
Restricted Not available unless: You belong to PC-C
Lab performance-1 regression Assignment
Restricted Not available unless: You belong to PC-C
- Week 3
Week 3
![Image result for bfs gif](https://upload.wikimedia.org/wikipedia/commons/7/7f/Depth-First-Search.gif)
Lesson 5:
Learning Objectives:
After completing this lecture students will be able to:
- Formulate AI program
- Apply Uninformed search algorithms on given problems
b=9, d=11, m=19, l=13
fina N(IDS), N(BFS), N(DFS), N(DLS)
Topic-3 (part-1) (PC-A) URL
Restricted Not available unless: You belong to PC-A
topic-3 (part-1) (pc-b) URL
Restricted Not available unless: You belong to PC-B
Lab practice-1 visualization Assignment
Restricted Not available unless: You belong to PC-C
Lab-3 URL
Restricted Not available unless: You belong to PC-C
- Week 4
Week 4
![Breadth-first search - Wikipedia](https://upload.wikimedia.org/wikipedia/commons/4/46/Animated_BFS.gif)
Lesson 6:
Learning Objectives:
After completing this lecture students will be able to:
- Formulate AI program
- Apply Uninformed search algorithms on given problems
Topic-3 (part-2) (PC-A) URL
Restricted Not available unless: You belong to PC-A
topic-3 (part-2) (pc-b) URL
Restricted Not available unless: You belong to PC-B
topic-3 part-2 URL
Restricted Not available unless: You belong to PC-C
- Quiz-1
- Week 5
Week 5
Lesson 6:
Continuation of topic 4 (Problem solving by Search).
Learning Objectives:
After completing this lecture students will be able to:
- Explain Heuristic functions for some toy problems
- Simulate Greedy search on a given problem
Prove the optimality of A* search
topic-4 part-1 URL
Restricted Not available unless: You belong to PC-C
classification lab part-1 URL
Restricted Not available unless: You belong to PC-C
lab performance-classification Assignment
Restricted Not available unless: You belong to PC-C
t-4 part-1 URL
Restricted Not available unless: You belong to PC-B
t-4 part-1 URL
Restricted Not available unless: You belong to PC-A
- Week 6
Week 6
Lesson 7:
Learning Objectives:
After completing this lecture students will be able to:
- Explain Heuristic functions for some toy problems
- Simulate and apply A* search on a given problem
Lesson 7:
Review on midterm exam topics
t-4 part-2 URL
Restricted Not available unless: You belong to PC-C
classification lab part-2 URL
Restricted Not available unless: You belong to PC-C
- Week 7
Week 7
Midterm Exam
Date and time will be announced later.
Mid Term Exam Assignment
Restricted Not available unless: You belong to PC-A
Please rename your answer script using your student ID and then submit.
Mid Term Exam Assignment
Restricted Not available unless: You belong to PC-B
Please rename your answer script using your student ID and then submit.
Mid Term Exam Assignment
Restricted Not available unless: You belong to PC-C
Please rename your answer script using your student ID and then submit.
- Week 8
Week 8
Lesson 15:
Learning Obectives:
![Artificial Intelligence | Mini-Max Algorithm - Javatpoint](https://static.javatpoint.com/tutorial/ai/images/mini-max-algorithm-in-ai-step1.png)
After completing this lecture students will be able to:
- Evaluate utility funcs of some basic game playing algorithms
- Simulate greedy and minimax algorithm for some popular turn taking games
- Week 9
Week 9
Lesson 16:
Topic: Logical Agent
Learning Objectives:
After completing this students will be able to:
- Explain about Logical agents
- Apply First Order Propositional Logic to infer new knowledge
Define the following terms:
Knowledgebase
Logic
Fact
Rule
Sentence
- Week 10
Week 10
Lesson 18:
Topic: Uncertainty
Learning Objectives:
After Completing this lecture students will be able to:
- Explain about uncertain features of real world
- Explain Kolmagorov's axioms
- Apply Bayes Theorem to take decision in some uncertainty based problems
Define probability, utility and decision theory.
- Week 14
- Quiz-1
- Quiz-2
- Quiz-3
- Presentation And Assignment
Presentation And Assignment
Presentation Assignment
Restricted Not available unless: You belong to PC-A
Presentation Assignment
Restricted Not available unless: You belong to PC-B
Presentation Assignment
Restricted Not available unless: You belong to PC-C
Assignment
Restricted Not available unless: You belong to PC-A
Assignment
Restricted Not available unless: You belong to PC-B
Assignment
Restricted Not available unless: You belong to PC-C
- Lab Final (PC-C)
Lab Final (PC-C)
Lab final Assignment
Restricted Not available unless: You belong to PC-C
- Project Final
Project Final
Project Final Assignment
Restricted Not available unless: You belong to PC-C
- Final Exam
Final Exam
FINAL EXAM Assignment
Restricted Not available unless: You belong to PC-B
FINAL EXAM Assignment
Restricted Not available unless: You belong to PC-C
FINAL EXAM Assignment
Restricted Not available unless: You belong to PC-A
- Topic 20