Introduction to Artificial Intelligence &
Machine Learning
(AI & ML)
Subject Code: CS301, 5th,CSE, Credit: 5
Dr. Shubham Yadav
Assistant Professor , Department of CSE
CV Raman Global University, Bhubaneswar
[Link]@[Link]
Learning Assessments
Bloom’s Level of Cognitive Teacher Assessment / Formative Assessment (40 %) Summative
Task Assessment (60 %)
Quiz Assignment Experiential Attendance Mid Sem End Sem
(10%) (10%) learning * (10%) (20%) (40%)
(10%)
Level-1 Remember 40% 40% 20% 40% 30%
understand
Level-2 Apply 60% 40% 40% 60% 50%
Analyze
Level-3 Evaluate 20% 40% 20%
Create
Total 100% 100% 100% 100% 100%
2
Vision & Mission
Vision of the C. V. Raman Global University: To emerge as a global leader in the area of higher education through the
pursuit of excellence with future of skills and innovation to match the ever changing global scenario.
Vision of the Department of CSE : To become a leader in providing high quality education and research in the area of
Computer Science, Information Technology, and allied areas.
Mission of C.V. Raman Global University :
❖ Providing State-of-the art education both at undergraduate, postgraduate and research.
❖ Working collaboratively with technical Institutes / Universities/ Industries of National and International repute
❖Keeping abreast with latest technological advancements with a view to enhancing future of skills, R&D and start-up activities at large;
❖Realising its’ goals and objectives in a time bound phased manner.
Mission of the Department of CSE:
M1: To develop human resource with sound theoretical and practical knowledge in the discipline of Computer Science & Engineering.
M2: To work in groups for Research, Projects, and Co-Curricular activities involving modern methods, tools and technology.
M3: To collaborate and interact with professionals from industry, academia, professional societies, community groups for
enhancement of quality of education.
Dept. of CSE
3
Program Outcomes
(POs)
Engineering knowledge: Apply the knowledge of mathematics, science, engineering fundamentals, and an engineering specialization for the solution of complex
engineering problems.
Problem analysis: Identify, formulate, research literature, and analyze complex engineering problems reaching substantiated conclusions using first principles of
mathematics, natural sciences, and engineering sciences.
Design/development of solutions: Design solutions for complex engineering problems and design system components or processes that meet the specified needs with
appropriate consideration for public health and safety, and cultural, societal, and environmental considerations.
Conduct investigations of complex problems: Use research-based knowledge and research methods including design of experiments, analysis and interpretation
of data, and synthesis of the information to provide valid conclusions.
Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern engineering and IT tools, including prediction and modeling to
complex engineering activities, with an understanding of the limitations.
The engineer and society: Apply reasoning informed by the contextual knowledge to assess societal, health, safety, legal, and cultural issues and the consequent
responsibilities relevant to the professional engineering practice.
Environment and sustainability: Understand the impact of the professional engineering solutions in societal and environmental contexts, and demonstrate
the knowledge of, and need for sustainable development.
Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of the engineering practice.
Individual and team work: Function effectively as an individual, and as a member or leader in diverse teams, and in multidisciplinary settings.
Communication: Communicate effectively on complex engineering activities with the engineering community and with the society at large, such as, being able to
comprehend and write effective reports and design documentation, make effective presentations, and give and receive clear instructions.
Project management and finance: Demonstrate knowledge and understanding of the engineering and management principles and apply these to one’s own work, as
a member and leader in a team, to manage projects and in multidisciplinary environments.
Life-long learning: Recognize the need for, and have the preparation and ability to engage in independent and life-long learning in the broadest context of
technological change.
4
PROGRAM EDUCATIONAL OBJECTIVE (PEO)
PEO1- To provide the fundamental knowledge in mathematics, science and engineering concepts for the
development of engineering system (Fundamental Knowledge).
PEO2- To apply current industry accepted computing practices and emerging technologies to analyze,
design, implement, test and verify high quality computing systems and computer based solutions to real
world problems (Design and development).
PEO3- To enable the use of appropriate skill sets and its applications towards social impacts of computing
technologies in the career related activities (Skill Set) and to produce Efficient team leaders, effective
communicators and capable of working in multi-disciplinary environment following ethical
values(Communication).
PEO4- To practice professionally and ethically in various positions of industry or government and/or
succeed in graduate (Professionalism) with lifelong learning and to make substantial contributions to the
society (Societal Contribution)
5
PROGRAM SPECIFIC OUTCOMES (PSO)
Graduates have the ability to
PSO1- The ability to understand, analyze and develop computer programs in the
area of computer science and to solve computer software and hardware
related engineering problems
PSO2- The ability to develop software systems to allow convenient use of
computing system and posses professional skills and knowledge of software
design processes.
PSO3-The ability to gain knowledge in diverse area of computer science and apply
for successful career entrepreneurship and higher studies.
PSO4-Ability to use knowledge of ethical and management principles required to
required to work in a team as well as to lead a team.
6
Detailed Syllabus
Introduction: Objective, scope and outcome of the course. AI techniques, Level of the Model, AI problems, foundation of AI and history of AI
intelligent agents: Agents and Environments, the concept of rationality, the nature of environments, structure of agents, problem solving agents,
Unit – I problem formulation, defining the problem as a State Space Search, problem characteristics, Issues in the designing of Search Programs.
Knowledge representation: Knowledge representation and mapping, Knowledge issues, knowledge representation using propositional and
predicate logic, logical consequences, logic programming, semantic nets- frames and inheritance, constraint propagation, representing knowledge
Unit – II using rules, rules-based deduction systems, Conceptual Dependency Scripts, CYC.
Predicate Logic: Predicate Representing Instance and ISA Relationships, Computable Functions and Predicates, Resolution, Natural Deduction,
syntax and semantics of an expression, semantic Tableau. Forward and backward reasoning.
Quantifying Uncertainty: Acting under uncertainty, basic probability notations, inference using full joint distributions, independence,
Bayes’ rule and its use.
Probabilistic Reasoning: Representing knowledge in an uncertain domain, the semantics of Bayesian Networks, Efficient representation of
Unit – III conditional distributions, Exact and approximate inference in Bayesian Networks, Relational and First-Order Probability models.
Making Simple Decisions: Basics of utility theory, utility functions, multi-attribute utility functions, decision networks, the value of information,
decision-theoretic expert systems. Making Complex Decisions: Sequential decision problems, value iteration, policy iteration, Partially
Observable MDPs, Decision with multiple Agents: Game theory.
Introduction to Machine Learning: Definition, History, applications and need, Learning: what is learning, Types of learning, Examples,
Unit – IV Data/Features, Hypothesis space and inductive bias, Bias-variance Trade off, Loss function, Evaluation matrix. Basic statistical concepts: Mean
Median, Mode, Variance, Co-variance, Correlation, dispersion matrix.
Supervised Learning: Supervised learning setup (training, testing). Classification and Regression, Regression: Linear regression. Logistic
regression. Classification: Minimum distance classifier, k-nearest neighbour classifier, Perceptron (single layer/multi-layer). Decision trees,
Unit – V Model selection, Over-fitting, Cross validation.
Unsupervised Learning: Clustering. Similarity measures, Case Study for K-means algorithm, Hierarchical clustering - Divisive algorithm,
Density based clustering (DBSCAN), Inductive and deductive learning.
7
Course Outcomes
Upon successful completion of this course, students will be able to:
CO-1 Demonstrate fundamental understanding of the history of artificial intelligence (AI)
and its foundations to intelligent agents.
CO-2 Apply selected basic AI techniques; judge applicability of more advanced techniques.
Participate in the design of systems that act intelligently and learn from experience.
CO-3 Apply basic probability notations and inference techniques to reason under
uncertainty. Represent uncertain knowledge using Bayesian networks and perform
exact and approximate inference in these networks. Quantify and optimize utility
functions for decision-making tasks.
CO-4 Learn the basics and use mathematical concepts required for machine learning.
CO-5 Identify and differentiate different types of supervised and unsupervised learning
Textbooks
• The course lecture are based on the following books
1. Suryani, A. (2025). ARTIFICIAL INTELLIGENCE FOR BEGINNERS: A QUICK GUIDE TO
UNDERSTANDING AI: Your Essential Guide to AI Fundamentals, Real-World Applications, and
Future Skills. GuinEvel Editions.
2. Dhinakaran, M., Deepthi, P., Mary, S. S. C., & Namdev, M. A. (2023). Machine Learning for
Absolute Beginners. Booksclinic Publishing.
3. Mehrotra, D. (2019). Basics of artificial intelligence & machine learning. Notion Press.
Reference Books
1. S. Russel and P. Norvig, Artificial Intelligence: a Modern Approach, Pearson.
2. D. W. Patterson, Introduction to Artificial Intelligence and Expert Systems, Prentice Hall of India.
3. “Machine Learning”, Tom Mitchell, First Edition, McGraw- Hill, 1997.
4. “Introduction to Machine Learning”, Ethem Alpaydin, Second Edition, 2010.
5. “Machine Learning: An Algorithmic Perspective”, Stephen Marsland, Second Edition, 2014.
Open Sources (Websites References )
1. [Link]
2. [Link]
3. [Link]
10
What is AI?
What is AI?
AI: Artificial Intelligence
Man-made Thinking Power
• Making machines think & act
like humans.
• Uses logic, data & learning
• Examples: Google Maps, Siri,
Self-driving cars
Definition: Artificial intelligence [1] is a domain of computer
science focused on the examination and development of computer
systems that demonstrate some kind of intelligence.
1. Vacuum Cleaner 2. Phone Keyboard
🧾 Traditional: You push and move it 🧾 Traditional: Just type — no help.
manually. 🤖 AI: Predicts your next word,
🤖 AI: Robot vacuum moves on its auto-corrects based on your habits.
own, avoids furniture, learns the room.
3. Camera 4. Video Games
🧾 Traditional: Manual focus and 🧾 Traditional: Enemies behave the
settings. same every time.
🤖 AI: Auto-focuses, detects smiles, and 🤖 AI: Enemies learn your moves and
improves photo quality. become smarter.
Traditional AI
Fixed rules Learns from data
No understanding Understands input
Same every time Adapts and improves
Needs perfect input Works with messy input
Applications of AI:
•Business (financial
strategies)
•Engineering
•Fraud detection
•Education
• Medicine: monitoring,
diagnosing
• Object identification
• Information retrieval
Building AI Systems:
perception reasoning
learning acting
Example: Building a robot that finds the shortest path in a maze.
∙ It needs perception: detect walls.
∙ It needs reasoning: plan a route.
∙ It needs learning: improve over time.
∙ It needs acting: move correctly.
Intelligent Systems:
In order to design intelligent systems, it is important to categorize them into four
categories (Luger and Stubberfield 1993), (Russell and Norvig, 2003)
1. Systems that think like humans
2. Systems that think rationally
3. Systems that behave like humans
4. Systems that behave rationally
1. Systems that think like humans
•These systems try to mimic the way humans think.
•Based on cognitive science: how the brain processes information, solves problems,
learns, etc.
Goal: Understand and simulate human thought processes.
Example:
•A system that uses neural networks to solve a puzzle by learning like a child.
Systems that think rationally
•These systems aim to think logically and correctly, using rules and reasoning.
•They don’t try to copy human thinking exactly, but instead focus on formal logic.
Goal: Follow the laws of rational thought.
Example:
•An expert system that uses logical rules like "IF symptoms = X, THEN diagnosis = Y".
•A robot that makes decisions using mathematical logic.
3. Systems that behave like humans
•These systems try to act like humans, even if they don’t “think” the same way.
•The focus is on making machines that appear intelligent to people.
Goal: Imitate human behavior, especially observable actions.
Example:
•A chatbot that holds a conversation like a human (e.g., Siri, Alexa).
•A humanoid robot that can walk, talk, and respond to questions.
4. Systems that behave rationally
These systems focus on doing the right thing to achieve the best result.
They don’t need to think like humans — they just need to make good decisions.
Goal: Choose actions that lead to the best outcome, based on the current situation.
Example:
A self-driving car that avoids traffic and follows safety rules.
A chess AI (like AlphaZero) that always chooses the best move to win the game.
Intelligent systems
Think Like Humans Think Rationally
(Human-like Thought) (Logical Reasoning)
Cognitive AI Rule-Based AI
Ex: Neural networks modeling brain Ex: Expert systems, logic solvers
Behave Like Humans Behave Rationally
(Mimic Human Actions) (Best Decisions)
Ex: Chatbots, robots Ex: Self-driving cars, Game-playing AIs
Foundations & History
• • Foundations: Math, Logic, Probability
• • History:
• Term “Artificial Intelligence” coined by John McCarthy
• - 1950: Turing Test
• - 1956: Dartmouth Conference
• - 1980s: Expert Systems
• - Modern: Deep Learning, Big Data
History of Artificial Intelligence
Year/Period Milestone/Event Key Points
Alan Turing asks “Can machines
1950 Turing Test
think?”
Term Artificial Intelligence coined
1956 Dartmouth Conference
— birth of AI as a field
Logic Theorist, General Problem
1950s–1960s Early Programs
Solver — first AI programs
Basic games (chess), natural
1960s–1970s Early Developments
language (ELIZA)
Funding cuts due to limited
1970s–1980s AI Winter
progress
Practical industry applications
1980s–1990s Expert Systems
revived interest
IBM’s Deep Blue defeats chess
1997 Deep Blue
champion Garry Kasparov
Modern Era of AI
Year/Period Milestone/Event Key Points
Rise of large datasets and
2000s Big Data & Machine Learning
improved algorithms
AlexNet wins ImageNet — huge
2012 Deep Learning Breakthrough
leap for neural networks
Google DeepMind’s AlphaGo
2016 AlphaGo
defeats Go champion Lee Sedol
AI models like GPT, DALL·E —
2020s Generative AI
language, images, video
Virtual assistants, self-driving
Today Everyday AI
cars, recommendation systems
Agents & Environments
An agent [2] is defined as an entity that perceives its surroundings via sensors and interacts
with that environment through actuators.
senses thinks acts
Environment-Types:
• Accessible vs. inaccessible or Fully observable vs Partially
Observable
• Deterministic vs. Stochastic
• Episodic vs. non-episodic
• Static vs. dynamic
• Discrete vs. continuous
Types of Agents
• Simple Reflex → Thermostat
• Model-Based → Robot vacuum
• Goal-Based → Self-driving car
• Utility-Based → Smart Assistant
1. Simple Reflex
• Simple reflex agents ignore the rest of the percept history and act only on the
basis of the current percept.
• The agent function is based on the condition-action rule.
• If the condition is true, then the action is taken, else not. This agent function
only succeeds when the environment is fully observable.
2. Model-based reflex agents:
• The Model-based agent can work in a partially observable
environment, and track the situation.
• A model-based agent has two important factors:
• Model: It is knowledge about "how things happen in the world," so it
is called a Model-based agent.
• Internal State: It is a representation of the current state based on
percept history.
3. Goal-based agents:
A goal-based agent has an agenda.
It operates based on a goal in front of it and makes decisions based on how best to
reach that goal.
A goal-based agent operates as a search and planning function, meaning it targets
the goal ahead and finds the right action in order to reach it.
Expansion of model-based agent.
4. Utility-based agents:
• A utility-based agent is an agent that acts based not only on what the
goal is, but the best way to reach that goal.
• The Utility-based agent is useful when there are multiple possible
alternatives, and an agent has to choose in order to perform the best
action.
• The term utility can be used to describe how "happy" the agent is.
State Space Search
• The state space representation forms the basis of most of the AI
methods.
• Formulate a problem as a state space search by showing the legal
problem states, the legal operators, and the initial and goal states.
• A state is defined by the specification of the values of all attributes of
interest in the world.
• An operator changes one state into the other; it has a precondition
which is the value of certain attributes prior to the application of the
operator, and a set of effects, which are the attributes altered by the
operator.
• The initial state is where you start.
• The goal state is the partial description of the solution.
Formal Description of the problem:
1. Define a state space that contains all the possible configurations of the relevant
objects.
2. Specify one or more states within that space that describe possible situations
from which the problem solving process may start ( initial state)
3. Specify one or more states that would be acceptable as solutions to the problem.
( goal states)
• Specify a set of rules that describe the actions (operations) available
State-Space Problem Formulation:
• Example: A problem is defined by four items:
• 1. initial state e.g., "at Arad“
• 2. actions or successor function : S(x) = set of action–state
• pairs e.g., S(Arad) = {<Arad →Zerind, Zerind>, … }
• 3. goal test (or set of goal states)
• e.g., x = "at Bucharest”, Checkmate(x)
• 4. path cost (additive)
• e.g., sum of distances, number of actions executed, etc.
• c(x,a,y) is the step cost, assumed to be ≥ 0
• A solution is a sequence of actions leading from the initial state to a goal state
Uninformed search
• Also called blind, exhaustive or brute-force search, uses no
information about the problem to guide the search and therefore
may not be very efficient.
Informed Search
• Also called heuristic or intelligent search, uses information about the
problem to guide the search, usually guesses the distance to a goal
state and therefore efficient, but the search may not be always
possible.
Uninformed Search (Blind searches):
1. Breadth First Search:
• One simple search strategy is a breadth-first search. In this strategy, the root
node is,expanded first, then all the nodes generated by the root node are
expanded next, and then their successors, and so on.
• In general, all the nodes at depth d in the search tree are expanded before the
nodes at depth + 1.
• Applications Of Breadth-First Search Algorithm
• GPS Navigation systems: Breadth-First Search is one of the best
algorithms used to find neighboring locations by using the GPS
system.
• Broadcasting: Networking makes use of what we call as packets for
communication. These packets follow a traversal method to reach
various networking nodes. One of the most commonly used traversal
methods is Breadth-First Search. It is being used as an algorithm that
is used to communicate broadcasted packets across all the nodes in a
network.
2. Depth- First- Search.
• Sometimes searching the goal along the largest depth of the tree,
and move up only when further traversal along the depth is not
possible. We then attempt to find alternative offspring of the parent
of the node (state) last visited. If we visit the nodes of a tree using the
above principles to search the goal, the traversal made is called depth
first traversal and consequently the search strategy is called depth
first search.
References
1. D. W. Patterson, Introduction to Artificial Intelligence and Expert
Systems, Prentice Hall of India.
2. S. Russel and P. Norvig, Artificial Intelligence: a Modern Approach,
Pearson.
Thank You!