0% found this document useful (0 votes)
75 views

AI Handout

The document outlines a course on artificial intelligence. It includes 4 course outcomes: 1) demonstrate understanding of AI terminology and foundations, 2) apply search algorithms and heuristics, 3) solve puzzles and games using local search and constraints, and 4) represent knowledge and perform logical reasoning. It also lists 5 course objectives, the evaluation metrics for each outcome, textbook and reference information, and a rationale for the course.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
75 views

AI Handout

The document outlines a course on artificial intelligence. It includes 4 course outcomes: 1) demonstrate understanding of AI terminology and foundations, 2) apply search algorithms and heuristics, 3) solve puzzles and games using local search and constraints, and 4) represent knowledge and perform logical reasoning. It also lists 5 course objectives, the evaluation metrics for each outcome, textbook and reference information, and a rationale for the course.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 26

7/8/22, 2:12 PM about:blank

K L Deemed to be University
Department of Artificial Intelligence and Data Science -- KLVZA
Course Handout
2022-2023, Odd Sem
Course Title :Artificial Intelligence
Course Code :21AD2101
L-T-P-S Structure : 2-0-2-0
Pre-requisite :
Credits :3
Course Coordinator :PRAVEENA MANDAPATI
Team of Instructors :
Teaching Associates :
Syllabus :Syllabus: CO1: Introduction to AI: Impact, Terminologies, and related concepts (Machine Learning,
Neural Networks, Deep Learning, Fuzzy Systems, Robotics, Natural Language Processing). Issues and Concerns
around AI, AI Ethical Concerns, AI and Bias, Trust, Jobs and AI, Employment and AI, The evolution and future of
AI. Stages of Artificial Intelligence: Artificial Narrow Intelligence (ANI), Artificial General Intelligence (AGI),
Artificial Super Intelligence (ASI).
CO2: Uniformed Search & Heuristic search: Search fundamentals, the intuition
of planning and searching, Intelligent search, Uninformed search strategies-BFS, DFS, Iterative deepening,
bidirectional search. Heuristic Search Techniques: Greedy BFS, A*, AO*, Memory bounded heuristic functions.
CO3: Local & Adversarial search: Optimization problems, hill climbing search, simulated annealing, local beam
search, genetic algorithms. Optimal decisions in games, alpha beta pruning, cutting of search, forward pruning,
Constraint satisfaction problems: Inference in CSPs, back tracking search for CSPs, Cannibals and missionaries
problem using CSP, solving puzzles using AI: Tic-tac-toe, Sudoku.
CO4: Knowledge and reasoning: knowledge-
based agents, Logic, propositional logics, and horn clauses, first order logic, Inference in first order logic,
Propositional versus first order inference, unification and lifting, forward & backward chaining, resolution,
Conceptual dependency, Semantic nets.
Text Books :Text Books:
T1. Russell, S., & Norvig, P. (2002). Artificial intelligence: a modern approach. (CO1).
T2. Artificial Intelligence, Elaine Rich & Kevin Knight, Shivashankar B Nair, 3rd Edition (CO2, CO3)
T3.
Knowledge Representation and Reasoning, Ronald Bachman, Hector Levesque. (Co4 Topics)
Reference Books :Reference Books:
R1. Patrick Henry Winston, ‘Artificial Intelligence’, Pearson Education (2003)
R2. G. Luger, W. A. Stubblefield, "Artificial Intelligence", Third Edition, Addison-Wesley,(2007)
R3. William F.
Clocksin, Christopher S. Mellish-Programming in Prolog-Springer (2003)
Web Links :Web Links: W1: https://nptel.ac.in/courses/106102220
W2: https://nptel.ac.in/courses/106105077
W3:
https://nptel.ac.in/courses/112103280
Course Rationale :Course Rationale: With the usage of Internet and World Wide Web increasing day by day, the
field of AI and its techniques are being used in many areas such as machine learning, which directly affect human
life. Various techniques for encoding knowledge in computer systems such as predicate logic, production rules, and
semantic networks find application in real world problems. The fields of AI such as Game Playing and puzzles
solving are also important.
This course provides the basic concepts of Artificial Intelligence which is essential for
the student to understand the advanced courses like Machine Learning, Natural Language Processing, Soft
Computing, Data Mining, IoT and so on. In course due, PYTHON is one of the most useful languages to solve AI
problems
Course Objectives :Course Objectives: The emphasis of the course is on understanding the basics, terminology in
AI, Issues and concern around AI, Evolution and future of AI, Stages of AI, Heuristic Techniques, and various
search algorithms that are useful to solve AI problems, Inferences in Constraint satisfaction problems and solving
puzzles, knowledge representation schemes, Game Playing and to solving AI problems using PYTHON language.

COURSE OUTCOMES (COs):

Blooms
CO Taxonomy
Course Outcome (CO) PO/PSO
NO Level
(BTL)
about:blank 1/26
7/8/22, 2:12 PM about:blank

CO1 Demonstrate fundamental understanding of the terminology in PO1,PSO1 2


artificial intelligence (AI) and its foundations
Demonstrate the ability to represent problem as a AI search problem
CO2 PSO2,PO1 3
and apply various heuristic search functions.
Ability to understand Local search and adversarial search algorithms to
CO3 solve various puzzles, Game playing problems in AI and Constraint PO3,PSO2 3
satisfaction problems.
Distinguish between Building Knowledge and reasoning between
CO4 propositional logics and first order logic and solve inference-based PO3,PSO2 4
problem using forward and backward reasoning, resolution.
Choose the appropriate programming logic techniques solve any real-
CO5 PO5,PSO2 5
world AI problems in the laboratory

COURSE OUTCOME INDICATORS (COIs)::

Outcome Highest
COI-1 COI-2 COI-3 COI-4 COI-5
No. BTL
Btl-1 Btl-2

Understand the
Issues
Illustrate
Foundations of and concerns
CO1 2
AI, Terminologies around AI and
and related various stages of
concepts of AI, AI.
Btl-1

Understand the Btl-2



the Btl-3
concept of Illustrate

CO2 3 Applying heuristic


searching uniform search
Techniques
fundamental, strategies.
Intelligent search
Btl-3

the
Analyse
Btl-2

Concept of
Btl-1 Illustration of

Constrain
Understand the genetic
Satisfaction
And
Concepts of Local algorithms.
CO3 3 solving puzzles
Search. Optimal Compare and
using AI.
decision in contrast Min Max
Cannibals and
games. Algorithms, alpha
missionaries
Beta Pruning
problem using
CSP
Btl-4
Btl-2 Btl-3

Comparison of
Btl-1
the


Analyse Comparison of forward and
Understand
syntax and Propositional backward
Outline about the
Semantics of First versus first order reasoning,
CO4 4 Knowledge Based
order logic. inference. Resolution.
Agents,
Assess knowledge Illustrate Illustrate
propositional
representation unification and conceptual
theorem proving
using rules. lifting. dependency and
Semantic nets.
Btl-2

Btl-3
Btl-1 Illustration and
Btl-5

Implementation of Btl-4

Illustration of implementation of
various Applying logical
CO5 5 game tree on Solving
solving various Informed and statements on
different types of puzzles
AI problems Uninformed facts.
games.
search

PROGRAM OUTCOMES & PROGRAM SPECIFIC OUTCOMES (POs/PSOs)

about:blank 2/26
7/8/22, 2:12 PM about:blank

Po Program Outcome
No.
Engineering Knowledge:Apply the knowledge of mathematics, science, engineering fundamentals, and an
PO1
engineering specialization to the solution of complex engineering problems.
Engineering Knowledge:Apply the knowledge of mathematics, science, engineering fundamentals, and an
PO1
engineering specialization to the solution of complex engineering problems.
Problem Analysis: Identify, formulate, review research literature, and analyse complex engineering problems
PO2 reaching substantiated conclusions using first principles of mathematics, natural sciences and engineering
sciences
Problem Analysis: Identify, formulate, review research literature, and analyse complex engineering problems
PO2 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
PO3 components or processes that meet the specified needs with appropriate consideration for the public health
and safety, and the cultural, societal, and environmental considerations
Design/Development of Solutions: Design solutions for complex engineering problems and design system
PO3 components or processes that meet the specified needs with appropriate consideration for the public health
and safety, and the 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
PO4
conclusions for complex problems that cannot be solved by straightforward application of knowledge,
theories and techniques applicable to the engineering discipline.
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
PO4
conclusions for complex problems that cannot be solved by straightforward application of knowledge,
theories and techniques applicable to the engineering discipline.
Modern Tool Usage:Create, select, and apply appropriate techniques, resources, and modern engineering and
PO5 IT tools including prediction and modelling to complex engineering activities with an understanding of the
limitations.
Modern Tool Usage:Create, select, and apply appropriate techniques, resources, and modern engineering and
PO5 IT tools including prediction and modelling 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,
PO6 safety, legal and cultural issues and the consequent responsibilities relevant to the professional engineering
practice.
The Engineer and Society:Apply reasoning informed by the contextual knowledge to assess societal, health,
PO6 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
PO7
and environmental contexts, and demonstrate the knowledge of, and need for sustainable development
Environment and Sustainability:Understand the impact of the professional engineering solutions in societal
PO7
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
PO8
engineering practice
Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of the
PO8
engineering practice
Individual and Team Work: Function effectively as an individual, and as a member or leader in diverse teams,
PO9
and in multidisciplinary settings.
Individual and Team Work: Function effectively as an individual, and as a member or leader in diverse teams,
PO9
and in multidisciplinary settings.
Communication:Communicate effectively on complex engineering activities with the engineering community
PO10 and with 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
Communication:Communicate effectively on complex engineering activities with the engineering community
PO10 and with 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

about:blank 3/26
7/8/22, 2:12 PM about:blank

PO11 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.
Project Management and Finance: Demonstrate knowledge and understanding of the engineering and
PO11 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
PO12
and lifelong learning in the broadest context of technological change.
Life-long Learning: Recognize the need for, and have the preparation and ability to engage in independent
PO12
and lifelong learning in the broadest context of technological change.
An ability to design and develop Artificial Intelligence technology into innovative products for solving real
PSO1
world problems
An ability to design and develop Artificial Intelligence technology into innovative products for solving real
PSO1
world problems.
An ability to design and develop Data Science methods for analyzing massive datasets to extract   insights by
PSO2
applying AI as a tool.
An ability to design and develop Data Science methods for analyzing massive datasets to extract insights by
PSO2
applying AI as a tool

Lecture Course DELIVERY Plan:


Teaching-
Sess.No. CO COI Topic Book No[CH No][Page No] Learning EvaluationComponents
Methods

ALM,Continuous
Evaluation - Lab
Discussion on
COI- Exercise,End Semester
1 CO1 Course 1 Chalk,PPT,Talk
1 Exam,Home
Handout
Assignment,SEM-
EXAM1

ALM,Continuous
Evaluation - Lab
Introduction
COI- Exercise,End Semester
2 CO1 to AI: Impact, T1[5-16] Chalk,PPT,Talk
1 Exam,Home
Terminologies
Assignment,SEM-
EXAM1

Machine ALM,Continuous
Learning, Evaluation - Lab
COI- Neural Exercise,End Semester
3 CO1 T1[25] Chalk,PPT,Talk
1 Networks and Exam,Home
Deep Assignment,SEM-
Learning EXAM1

ALM,Continuous
overview of
Evaluation - Lab
Fuzzy
COI- Exercise,End Semester
4 CO1 Systems, T1[2] Chalk,PPT,Talk
1 Exam,Home
Robotics,
Assignment,SEM-
NLP
EXAM1

about:blank 4/26
7/8/22, 2:12 PM about:blank

Teaching-
Sess.No. CO COI Topic Book No[CH No][Page No] Learning EvaluationComponents
Methods

Issues and
Concerns ALM,Continuous
around AI, AI Evaluation - Lab
COI- Ethical Exercise,End Semester
5 CO1 T1[2-3] Chalk,PPT,Talk
2 Concerns, AI Exam,Home
and Bias, Assignment,SEM-
Trust, Jobs EXAM1
and AI

Employment
and AI, The ALM,Continuous
evolution and Evaluation - Lab
COI- future of AI. Exercise,End Semester
6 CO1 https://nptel.ac.in/courses/106102220 Chalk,PPT,Talk
2 Introduction Exam,Home
to Stages of Assignment,SEM-
Artificial EXAM1
Intelligence

Artificial
Narrow
Intelligence
(ANI), ALM,Continuous
Artificial Evaluation - Lab
COI- General Exercise,End Semester
7 CO1 https://nptel.ac.in/courses/106102220 Chalk,PPT,Talk
2 Intelligence Exam,Home
(AGI), Assignment,SEM-
Artificial EXAM1
Super
Intelligence
(ASI).

ALM,Continuous
Search
Evaluation - Lab
fundamentals,
COI- Exercise,End Semester
8 CO2 the intuition T1[64] Chalk,PPT,Talk
1 Exam,Home
of planning
Assignment,SEM-
and searching
EXAM1

ALM,Continuous
Evaluation - Lab
COI- intelligent Exercise,End Semester
9 CO2 T1[34] Chalk,PPT,Talk
1 search Exam,Home
Assignment,SEM-
EXAM1

ALM,Continuous
Uninformed Evaluation - Lab
COI- search Exercise,End Semester
10 CO2 TI[81] Chalk,PPT,Talk
2 strategies- Exam,Home
BFS, DFS. Assignment,SEM-
EXAM1

about:blank 5/26
7/8/22, 2:12 PM about:blank

Teaching-
Sess.No. CO COI Topic Book No[CH No][Page No] Learning EvaluationComponents
Methods

Iterative
ALM,Continuous
deepening,
Evaluation - Lab
bidirectional
COI- Exercise,End Semester
11 CO2 search and T1[90] Chalk,PPT,Talk
2 Exam,Home
other
Assignment,SEM-
searching
EXAM1
Techniques

ALM,Continuous
informed Evaluation - Lab
COI- (heuristic) Exercise,End Semester
12 CO2 T1[92] Chalk,PPT,Talk
3 search Exam,Home
algorithm A* Assignment,SEM-
EXAM1

ALM,Continuous
AO*,Memory Evaluation - Lab
COI- bounded Exercise,End Semester
13 CO2 T1[102] Chalk,PPT,Talk
3 heuristic Exam,Home
functions Assignment,SEM-
EXAM1

hill climbing ALM,Continuous


search, Evaluation - Lab
COI- simulated Exercise,End Semester
14 CO3 T1[120] Chalk,PPT,Talk
1 annealing, Exam,Home
local beam Assignment,SEM-
search. EXAM2

ALM,Continuous
Evaluation - Lab
COI- genetic Exercise,End Semester
15 CO3 T1[126] Chalk,PPT,Talk
2 algorithms Exam,Home
Assignment,SEM-
EXAM2

ALM,Continuous
Evaluation - Lab
Optimal
COI- Exercise,End Semester
16 CO3 decisions in T1[163] Chalk,PPT,Talk
1 Exam,Home
games
Assignment,SEM-
EXAM2

Alpha-Beta
pruning
ALM,Continuous
,cutting of
Evaluation - Lab
search,
COI- Exercise,End Semester
17 CO3 forward T1[167] Chalk,PPT,Talk
2 Exam,Home
pruning and
Assignment,SEM-
problems on
EXAM2
alpha beta
pruning

about:blank 6/26
7/8/22, 2:12 PM about:blank

Teaching-
Sess.No. CO COI Topic Book No[CH No][Page No] Learning EvaluationComponents
Methods

ALM,Continuous
Inference in
Evaluation - Lab
CSPs, back
COI- Exercise,End Semester
18 CO3 tracking T1[208-214] Chalk,PPT,Talk
3 Exam,Home
search for
Assignment,SEM-
CSPs
EXAM2

ALM,Continuous
solving Evaluation - Lab
COI- puzzles using Exercise,End Semester
19 CO3 T1[161] Chalk,PPT,Talk
3 AI: Tic-tac- Exam,Home
toe, Sudoku. Assignment,SEM-
EXAM2

ALM,Continuous
Evaluation - Lab
Cannibals and
COI- Exercise,End Semester
20 CO3 missionaries R1 Chalk,PPT,Talk
3 Exam,Home
using CSP
Assignment,SEM-
EXAM2

ALM,Continuous
Knowledge
Evaluation - Lab
based agents,
COI- Exercise,End Semester
21 CO4 Propositional T1[235] Chalk,PPT,Talk
1 Exam,Home
Logic, horn
Assignment,SEM-
clauses
EXAM2

Inference in
ALM,Continuous
first order
Evaluation - Lab
logic,
COI- Exercise,End Semester
22 CO4 Propositional T1[322] Chalk,PPT,Talk
2 Exam,Home
versus first
Assignment,SEM-
order
EXAM2
inference

ALM,Continuous
Evaluation - Lab
COI- unification Exercise,End Semester
23 CO4 T1[325] Chalk,PPT,Talk
3 and lifting Exam,Home
Assignment,SEM-
EXAM2

ALM,Continuous
Evaluation - Lab
forward &
COI- Exercise,End Semester
24 CO4 backward T1[330-337] Chalk,PPT,Talk
4 Exam,Home
chaining
Assignment,SEM-
EXAM2

ALM,Continuous
Evaluation - Lab
COI- Exercise,End Semester
25 CO4 Resolution T1[345] Chalk,PPT,Talk
4 Exam,Home
Assignment,SEM-
EXAM2
about:blank 7/26
7/8/22, 2:12 PM about:blank

Teaching-
Sess.No. CO COI Topic Book No[CH No][Page No] Learning EvaluationComponents
Methods

ALM,Continuous
Conceptual Evaluation - Lab
COI- dependency Exercise,End Semester
26 CO4 R2 Chalk,PPT,Talk
4 and Semantic Exam,Home
nets Assignment,SEM-
EXAM2

Lecture Session wise Teaching – Learning Plan

SESSION NUMBER : 1

Session Outcome: 1 Discussion on Course Handout

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
10 Tell the course objectives 1 Chalk APPLICABLE
---
--- NOT
10 List the course outcomes 1 PPT APPLICABLE
---
--- NOT
20 Explain the course structure 2 PPT APPLICABLE
---
--- NOT
5 Recall the session 1 Talk APPLICABLE
---

SESSION NUMBER : 2

Session Outcome: 1 Introduction to AI: Impact, Terminologies

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Recap;Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
10 What is AI 1 Chalk APPLICABLE
---
--- NOT
10 Importance of AI 1 PPT APPLICABLE
---
--- NOT
20 Applications of AI 1 PPT APPLICABLE
---
--- NOT
5 Recall the session 1 Talk APPLICABLE
---
about:blank 8/26
7/8/22, 2:12 PM about:blank

SESSION NUMBER : 3

Session Outcome: 1 Machine Learning, Neural Networks and Deep Learning

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
10 Overview of machine learning 1 PPT APPLICABLE
---
--- NOT
10 Overview of Neural Networks 1 PPT APPLICABLE
---
Group
20 Overview of Deep learning 1 PPT
Discussion
--- NOT
5 Recall the session 1 Talk APPLICABLE
---

SESSION NUMBER : 4

Session Outcome: 1 overview of Fuzzy Systems, Robotics, NLP

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
10 overview of Fuzzy Systems 1 PPT APPLICABLE
---
--- NOT
10 overview of Robotics 1 PPT APPLICABLE
---
--- NOT
20 overview of NLP 1 PPT APPLICABLE
---
--- NOT
5 Recall the session 1 Talk APPLICABLE
---

SESSION NUMBER : 5

Session Outcome: 1 Issues and Concerns around AI, AI Ethical Concerns, AI and Bias, Trust, Jobs and AI

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
10 Overview of Issues and Concerns around AI 2 PPT APPLICABLE
---
10 Discussion on AI Ethical Concerns 2 PPT --- NOT
about:blank 9/26
7/8/22, 2:12 PM about:blank

APPLICABLE
---
--- NOT
20 Explain AI and Bias, Trust, Jobs and AI 2 PPT APPLICABLE
---
--- NOT
5 Recall the session 2 PPT APPLICABLE
---

SESSION NUMBER : 6

Session Outcome: 1 Employment and AI, The evolution and future of AI. Introduction to Stages of Artificial
Intelligence

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
10 Discussion on Employment and AI 2 PPT APPLICABLE
---
--- NOT
10 Explain The evolution and future of AI. 2 PPT APPLICABLE
---
--- NOT
20 Introduction to Stages of Artificial Intelligence 2 PPT APPLICABLE
---
--- NOT
5 Recall the session 1 Talk APPLICABLE
---

SESSION NUMBER : 7

Session Outcome: 1 Artificial Narrow Intelligence (ANI), Artificial General Intelligence (AGI), Artificial Super
Intelligence (ASI).

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
10 Explain Artificial Narrow Intelligence (ANI) 2 PPT APPLICABLE
---
Quiz/Test
10 Explain Artificial General Intelligence (AGI 2 PPT
Questions
--- NOT
20 Explain Artificial Super Intelligence (ASI) 2 PPT APPLICABLE
---
--- NOT
5 Recall the session 1 Talk APPLICABLE
---

SESSION NUMBER : 8

Session Outcome: 2 Search fundamentals, the intuition of planning and searching


about:blank 10/26
7/8/22, 2:12 PM about:blank

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
10 Explain search fundamentals 1 Talk APPLICABLE
---
--- NOT
10 Search fundamentals(contd..) 1 PPT APPLICABLE
---
--- NOT
20 Explain the intuition of planning and searching 1 PPT APPLICABLE
---
--- NOT
5 Recall the session 1 Talk APPLICABLE
---

SESSION NUMBER : 9

Session Outcome: 1 intelligent search

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
10 Overview of intelligent search 1 Talk APPLICABLE
---
--- NOT
10 Concept of intelligent search 1 PPT APPLICABLE
---
--- NOT
20 Discussion on problems 1 PPT APPLICABLE
---
--- NOT
5 Recall the session 1 Talk APPLICABLE
---

SESSION NUMBER : 10

Session Outcome: 2 Uninformed search strategies-BFS, DFS.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
10 Define Uninformed search strategies 1 Talk APPLICABLE
---
--- NOT
10 Explain BFS and DFS 2 PPT APPLICABLE
---

about:blank 11/26
7/8/22, 2:12 PM about:blank

20 Problems on BFS and DFS 2 Chalk Group


Discussion
--- NOT
5 Recall the session 1 Talk APPLICABLE
---

SESSION NUMBER : 11

Session Outcome: 2 Iterative deepening, bidirectional search and other searching Techniques

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
10 Explain Iterative deepening 2 PPT APPLICABLE
---
--- NOT
10 Explain bidirectional search 2 PPT APPLICABLE
---
--- NOT
20 Discussion on other searching techniques 2 PPT APPLICABLE
---
--- NOT
5 Recall the session 1 Talk APPLICABLE
---

SESSION NUMBER : 12

Session Outcome: 2 informed (heuristic) search algorithm A*

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
10 Explain Greedy BFS 1 PPT APPLICABLE
---
--- NOT
10 Overview of Informed Search Strategies: A* Search 2 PPT APPLICABLE
---
--- NOT
20 Solve problems on A* Search 3 PPT APPLICABLE
---
--- NOT
5 Recall the session 1 Talk APPLICABLE
---

SESSION NUMBER : 13

Session Outcome: 2 AO*,Memory bounded heuristic functions

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods

about:blank 12/26
7/8/22, 2:12 PM about:blank

5 Attendance/Recap; Poll/Pop Question 1 Talk --- NOT


APPLICABLE
---
--- NOT
10 Clarifying doubts on A* 1 PPT APPLICABLE
---
Leading
10 Explain AO* 2 PPT
question
--- NOT
Solve problems on AO* and Explain Memory bounded
20 3 Talk APPLICABLE
heuristic functions .
---
--- NOT
5 Recall the session 1 Talk APPLICABLE
---

SESSION NUMBER : 14

Session Outcome: 3 hill climbing search, simulated annealing, local beam search.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
10 Discussion on Optimization problems 1 PPT APPLICABLE
---
--- NOT
10 Illustrate hill climbing search 1 PPT APPLICABLE
---
--- NOT
20 Explain simulated annealing, local beam search. 1 PPT APPLICABLE
---
--- NOT
5 Recall the session 1 Talk APPLICABLE
---

SESSION NUMBER : 15

Session Outcome: 3 genetic algorithms

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
10 Define Genetic algorithm 1 Talk APPLICABLE
---
--- NOT
10 Describe features of genetic algorithm 2 PPT APPLICABLE
---
--- NOT
20 Explain steps involved in genetic algorithm with examples 2 PPT APPLICABLE
---
5 Recall the session 1 Talk --- NOT

about:blank 13/26
7/8/22, 2:12 PM about:blank

APPLICABLE
---

SESSION NUMBER : 16

Session Outcome: 3 Optimal decisions in games

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
10 Define Optimal decision 1 Talk APPLICABLE
---
--- NOT
10 Explain optimal decision in games 1 PPT APPLICABLE
---
--- NOT
20 Examples on optimal decisions in games 1 PPT APPLICABLE
---
--- NOT
5 Recall the session 1 Talk APPLICABLE
---

SESSION NUMBER : 17

Session Outcome: 3 Alpha-Beta pruning ,cutting of search, forward pruning and problems on alpha beta pruning

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 1 Talk APPLICABLE
---
Quiz/Test
10 Adversarial Search: Alpha-Beta pruning 2 PPT
Questions
--- NOT
10 Describe cutting of search 2 PPT APPLICABLE
---
--- NOT
20 Explain forward pruning and problems on alpha beta pruning 2 PPT APPLICABLE
---
--- NOT
5 Recall the session 1 PPT APPLICABLE
---

SESSION NUMBER : 18

Session Outcome: 3 Inference in CSPs, back tracking search for CSPs

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 1 Talk APPLICABLE
---
10 Explain Constraint Satisfaction: Map colouring 2 PPT --- NOT
about:blank 14/26
7/8/22, 2:12 PM about:blank

APPLICABLE
---
--- NOT
10 Demonstrate backtracking search for CSPs. 2 PPT APPLICABLE
---
--- NOT
20 Solve Problems on CSP 3 PPT APPLICABLE
---
--- NOT
5 Recall the session 1 PPT APPLICABLE
---

SESSION NUMBER : 19

Session Outcome: 3 solving puzzles using AI: Tic-tac-toe, Sudoku.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
10 Explain puzzles in AI 2 PPT APPLICABLE
---
--- NOT
10 Solving Tic-tac-toe 3 Chalk APPLICABLE
---
Group
20 Solving Sudoku 3 Chalk
Discussion
--- NOT
5 Recall the session 1 Talk APPLICABLE
---

SESSION NUMBER : 20

Session Outcome: 3 Cannibals and missionaries using CSP

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
10 Recall CSP 1 PPT APPLICABLE
---
--- NOT
10 Explain Cannibals and missionaries using CSP 2 PPT APPLICABLE
---
--- NOT
20 Solve problems on Cannibals and missionaries using CSP 3 PPT APPLICABLE
---
--- NOT
5 Recall the session 1 Talk APPLICABLE
---

SESSION NUMBER : 21

about:blank 15/26
7/8/22, 2:12 PM about:blank

Session Outcome: 4 Knowledge based agents, Propositional Logic, horn clauses

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
10 Define Knowledge based agents, Logic in general 1 Talk APPLICABLE
---
--- NOT
10 Describe Propositional Logic 1 PPT APPLICABLE
---
--- NOT
20 Describe horn clauses 1 PPT APPLICABLE
---
--- NOT
5 Recall the session 1 Talk APPLICABLE
---

SESSION NUMBER : 22

Session Outcome: 4 Inference in first order logic, Propositional versus first order inference

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
Explain the use of predicate logic as a way representing
10 2 PPT APPLICABLE
knowledge
---
--- NOT
10 Explain Inference in first order logic 2 PPT APPLICABLE
---
Quiz/Test
20 Explain Propositional versus first order inference 2 PPT
Questions
--- NOT
5 Recall the session 1 Talk APPLICABLE
---

SESSION NUMBER : 23

Session Outcome: 4 unification and lifting

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
10 Differentiate propositional logic and first order logic 1 PPT APPLICABLE
---
10 Define unification and lifting 2 PPT --- NOT
APPLICABLE
---
about:blank 16/26
7/8/22, 2:12 PM about:blank

--- NOT
20 Explain Unification Algorithm and examples 3 PPT APPLICABLE
---
--- NOT
5 Recall the session 1 Talk APPLICABLE
---

SESSION NUMBER : 24

Session Outcome: 4 forward & backward chaining

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
10 Define forward chaining 1 PPT APPLICABLE
---
--- NOT
10 Define backward chaining 2 PPT APPLICABLE
---
--- NOT
Differentiate forward chaining and backward chaining and
20 4 PPT APPLICABLE
solve problems on them
---
--- NOT
5 Recall the session 1 Talk APPLICABLE
---

SESSION NUMBER : 25

Session Outcome: 4 Resolution

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
10 Define Resolution 1 PPT APPLICABLE
---
--- NOT
10 Explain properties of Resolution 2 PPT APPLICABLE
---
Leading
20 Problems on Resolution 4 PPT
question
--- NOT
5 Recall the session 1 Talk APPLICABLE
---

SESSION NUMBER : 26

Session Outcome: 4 Conceptual dependency and Semantic nets

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
about:blank 17/26
7/8/22, 2:12 PM about:blank

5 Attendance/Recap; Poll/Pop Question 1 Chalk --- NOT


APPLICABLE
---
--- NOT
10 Explain Conceptual dependency 2 Talk APPLICABLE
---
--- NOT
10 Explain Semantic nets 3 PPT APPLICABLE
---
--- NOT
20 Examples on conceptual dependency and Semantic nets 4 PPT APPLICABLE
---
--- NOT
5 Recall the session 1 Talk APPLICABLE
---

Tutorial Course DELIVERY Plan: NO Delivery Plan Exists

Tutorial Session wise Teaching – Learning Plan

No Session Plans Exists

Practical Course DELIVERY Plan:


Tutorial
Session Topics CO-Mapping
no

1 Discussion on python libraries required for programming CO1

2 Experimentation on Chatbot program CO1

3 Experimentation on Sorting water jug problem CO2

4 Experimentation on uninformed search problems CO2

5 Experimentation on informed search problems CO2

6 Experiment on hill climbing search CO3

7 Simulated annealing, local beam search. CO3

8 Demonstrate Adversarial Search Technique(Min-Max) CO3

9 Experimentation on Constraint Satisfaction Techniques CO3

10 Experimentation on predicate logic representation problems CO4

solve problems using forward Inference techniques(forward and backward


11 CO4
chaining)

12 solve problems using Matching procedure(Experiment on Unification problem) CO4

Practical Session wise Teaching – Learning Plan

SESSION NUMBER : 1

about:blank 18/26
7/8/22, 2:12 PM about:blank

Session Outcome: 1 Discussion on python libraries required for mathematical programming

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance/Recap; Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
30 learning python libraries 1 PPT APPLICABLE
---
--- NOT
30 implementing python libraries 3 PPT APPLICABLE
---
--- NOT
20 Evaluating 1 PPT APPLICABLE
---
--- NOT
10 Recall the session 1 Talk APPLICABLE
---

SESSION NUMBER : 2

Session Outcome: 1 Experimentation on Chatbot program

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance/Recap; Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
30 Experimentation on Chatbot program 2 LTC APPLICABLE
---
--- NOT
30 Execution of the experiment 3 LTC APPLICABLE
---
--- NOT
20 Evaluating the experiment 1 PPT APPLICABLE
---
--- NOT
5 Recall the session 1 LTC APPLICABLE
---

SESSION NUMBER : 3

Session Outcome: 3 Experimentation on Sorting water jug problem

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance/Recap; Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
30 Experimentation on Sorting water jug problem 2 LTC APPLICABLE
---
30 Implementation on Sorting water jug problem 3 LTC --- NOT
APPLICABLE
about:blank 19/26
7/8/22, 2:12 PM about:blank

---
--- NOT
20 Evaluating the experiment 1 LTC APPLICABLE
---
--- NOT
10 Recall the session 1 Talk APPLICABLE
---

SESSION NUMBER : 4

Session Outcome: 2 Experimentation on uninformed search problems

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance/Recap; Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
30 Explain uninformed search problems 1 LTC APPLICABLE
---
--- NOT
30 Implementing uninformed search problems 3 LTC APPLICABLE
---
--- NOT
20 Evaluating the experiment 1 LTC APPLICABLE
---
--- NOT
10 Recall the session 1 Talk APPLICABLE
---

SESSION NUMBER : 5

Session Outcome: 2 Experimentation on informed search problems

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance/Recap; Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
30 Explanation of informed search problems 2 LTC APPLICABLE
---
--- NOT
30 Experimentation on informed search problems 3 LTC APPLICABLE
---
--- NOT
20 Evaluating the experiment 1 LTC APPLICABLE
---
--- NOT
10 Recall the session 1 Talk APPLICABLE
---

SESSION NUMBER : 6

Session Outcome: 3 Experiment on hill climbing search

Time(min) Topic BTL Teaching- Active


about:blank 20/26
7/8/22, 2:12 PM about:blank

Learning Learning
Methods Methods
--- NOT
10 Attendance/Recap; Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
30 Explain the hill climbing search 2 LTC APPLICABLE
---
--- NOT
30 Experiment on hill climbing search 3 LTC APPLICABLE
---
--- NOT
20 Evaluating the experiment 1 LTC APPLICABLE
---
--- NOT
10 Recall the session 1 Talk APPLICABLE
---

SESSION NUMBER : 7

Session Outcome: 3 Simulated annealing, local beam search.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance/Recap; Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
30 Explanation of Simulated annealing, local beam search. 2 PPT APPLICABLE
---
--- NOT
30 Experiment on Simulated annealing, local beam search. 3 LTC APPLICABLE
---
--- NOT
20 Evaluating the experiment 1 LTC APPLICABLE
---
--- NOT
10 Recall the session 1 Talk APPLICABLE
---

SESSION NUMBER : 8

Session Outcome: 3 Demonstrate Adversarial Search Technique(Min-Max)

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance/Recap; Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
30 Demonstrate Adversarial Search Technique(Min-Max) 2 LTC APPLICABLE
---
--- NOT
30 Experiment on e Adversarial Search Technique(Min-Max) 3 LTC APPLICABLE
---
20 Evaluating the experiment 1 Talk --- NOT

about:blank 21/26
7/8/22, 2:12 PM about:blank

APPLICABLE
---
--- NOT
10 Recall the session 1 Talk APPLICABLE
---

SESSION NUMBER : 9

Session Outcome: 3 Experimentation on Constraint Satisfaction Techniques

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance/Recap; Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
30 Explanation on Constraint Satisfaction Techniques 2 LTC APPLICABLE
---
--- NOT
30 Experimentation on Constraint Satisfaction Techniques 3 LTC APPLICABLE
---
--- NOT
20 Evaluating the experiment 1 Talk APPLICABLE
---
--- NOT
10 Recall the session 1 Talk APPLICABLE
---

SESSION NUMBER : 10

Session Outcome: 4 Experimentation on predicate logic representation problems

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance/Recap; Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
30 Explanation on predicate logic representation problems 2 LTC APPLICABLE
---
--- NOT
30 Experimentation on predicate logic representation problems 3 LTC APPLICABLE
---
--- NOT
20 Evaluating the experiment 1 Talk APPLICABLE
---
--- NOT
10 Recall the session 1 Talk APPLICABLE
---

SESSION NUMBER : 11

Session Outcome: 4 solve problems using forward Inference techniques(forward and backward chaining)

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods

about:blank 22/26
7/8/22, 2:12 PM about:blank

10 Attendance/Recap; Poll/Pop Question 1 Talk --- NOT


APPLICABLE
---
--- NOT
solve problems using forward Inference techniques(forward
30 2 LTC APPLICABLE
and backward chaining)
---
--- NOT
solve problems using forward Inference techniques(forward
30 3 LTC APPLICABLE
and backward chaining)
---
--- NOT
20 Evaluating the experiment 1 Talk APPLICABLE
---
--- NOT
10 Recall the session 1 Talk APPLICABLE
---

SESSION NUMBER : 12

Session Outcome: 4 solve problems using Matching procedure(Experiment on Unification problem)

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance/Recap; Poll/Pop Question 1 Talk APPLICABLE
---
--- NOT
solve problems using Matching procedure(Experiment on
30 2 LTC APPLICABLE
Unification problem)
---
--- NOT
solve problems using Matching procedure(Experiment on
30 3 LTC APPLICABLE
Unification problem)
---
--- NOT
20 Evaluating the experiment 1 Talk APPLICABLE
---
--- NOT
10 Recall the session 1 Talk APPLICABLE
---

Skilling Course DELIVERY Plan: NO Delivery Plan Exists

Skilling Session wise Teaching – Learning Plan

No Session Plans Exists

WEEKLY HOMEWORK ASSIGNMENTS/ PROBLEM SETS/OPEN ENDEDED PROBLEM-SOLVING EXERCISES etc:

Assignment Assignment
Week Topic Details co
Type No

COURSE TIME TABLE:

Hour 1 2 3 4 5 6 7 8 9
Day Component
Mon Theory --- --- --- --- V-S4 --- --- V-S3 ---
Tutorial --- --- --- --- -- --- --- -- ---
about:blank 23/26
7/8/22, 2:12 PM about:blank

Lab --- --- --- --- -- --- --- -- ---


Skilling --- --- --- --- -- --- --- -- ---
Theory --- --- -- -- --- V-S2 --- --- ---
Tutorial --- --- -- -- --- -- --- --- ---
Tue
Lab --- --- V-S2,V-S2,V-S4,V-S4 V-S2,V-S2,V-S4,V-S4 --- -- --- --- ---
Skilling --- --- -- -- --- -- --- --- ---
Theory -- -- -- -- -- -- -- -- --
Tutorial -- -- -- -- -- -- -- -- --
Wed
Lab -- -- -- -- -- -- -- -- --
Skilling -- -- -- -- -- -- -- -- --
Theory --- --- --- V-S4 --- --- --- --- ---
Tutorial --- --- --- -- --- --- --- --- ---
Thu
Lab --- --- --- -- --- --- --- --- ---
Skilling --- --- --- -- --- --- --- --- ---
Theory --- --- --- --- --- --- --- --- V-S1
Tutorial --- --- --- --- --- --- --- --- --
Fri
Lab --- --- --- --- --- --- --- --- --
Skilling --- --- --- --- --- --- --- --- --
Theory --- --- --- --- --- V-S1,V-S3 --- --- ---
Tutorial --- --- --- --- --- -- --- --- ---
Sat
Lab --- --- --- --- --- -- --- --- ---
Skilling --- --- --- --- --- -- --- --- ---
Theory -- -- -- -- -- -- -- -- --
Tutorial -- -- -- -- -- -- -- -- --
Sun
Lab -- -- -- -- -- -- -- -- --
Skilling -- -- -- -- -- -- -- -- --

REMEDIAL CLASSES:

Supplement course handout, which may perhaps include special lectures and discussions that would be planned, and
schedule notified according

SELF-LEARNING:

Assignments to promote self-learning, survey of contents from multiple sources.


S.no Topics CO ALM References/MOOCS

DELIVERY DETAILS OF CONTENT BEYOND SYLLABUS:

Content beyond syllabus covered (if any) should be delivered to all students that would be planned, and schedule
notified accordingly.
Advanced Topics, Additional Reading, Research
S.no CO ALM References/MOOCS
papers and any

EVALUATION PLAN:

Evaluation Assessment Duration


Evaluation Component Weightage/Marks CO1 CO2 CO3 CO4 CO5
Type Dates (Hours)
End End Semester Exam Weightage 24 180 6 6 6 6
about:blank 24/26
7/8/22, 2:12 PM about:blank

Semester Max Marks 100 25 25 25 25


Summative Weightage 16 16
Evaluation Lab End Semester
Total= 40 120
Exam Max Marks 50 50
%
Weightage 15 7.5 7.5
Semester in Exam-I 90
In Semester Max Marks 50 25 25
Summative
Weightage 15 7.5 7.5
Evaluation
Semester in Exam-II 90
Total= 38
Max Marks 50 25 25
% Weightage 8 8
Lab In Semester Exam 120
Max Marks 50 50
Weightage 8 2 2 2 2
ALM 60
In Semester Max Marks 100 25 25 25 25
Formative

Home Assignment and Weightage 7 1.75 1.75 1.75 1.75


Evaluation
60
Textbook Max Marks 100 25 25 25 25
Total= 22

% Continuous Evaluation Weightage 7 1.75 1.75 1.75 1.75


60
- Lab Exercise Max Marks 100 25 25 25 25

ATTENDANCE POLICY:

Every
student is expected to be responsible for regularity of his/her
attendance in class rooms and laboratories, to
appear in scheduled
tests and examinations and fulfill all other tasks assigned to
him/her in every course

In
every course, student has to maintain a minimum of 85% attendance to
be eligible for appearing in Semester end
examination of the course,
for cases of medical issues and other unavoidable circumstances the
students will be
condoned if their attendance is between 75% to 85%
in every course, subjected to submission of medical certificates,
medical case file and other needful documental proof to the concerned
departments

DETENTION POLICY :

In any course, a student has to maintain a minimum of 85% attendance and In-Semester Examinations to be eligible
for appearing to the Semester End Examination, failing to fulfill these conditions will deem such student to have been
detained in that course.

PLAGIARISM POLICY :

Supplement course handout, which may perhaps include special lectures and discussions

COURSE TEAM MEMBERS, CHAMBER CONSULTATION HOURS AND CHAMBER VENUE DETAILS:

Supplement course handout, which may perhaps include special lectures and discussions
Chamber
Delivery Sections Chamber Chamber Signature of
Name of Consultation
Component of of Consultation Consultation Course
Faculty Timings for each
Faculty Faculty Day (s) Room No: faculty:
day
PRAVEENA 2-MA,1-
L - - - -
MANDAPATI MA
PRAVEENA
P 1-A,2-A - - - -
MANDAPATI
Chayan Paul P 2-B - - - -
Lakshmi Lalitha
L 3-MA - - - -
Vuyyuru
Lakshmi Lalitha
P 3-A - - - -
Vuyyuru
N B Arunekumar
P 1-B - - - -
Balasubramanian

about:blank 25/26
7/8/22, 2:12 PM about:blank

AMIRUL P 4-B - - - -
HOQUE
JAGJIT
L 4-MA - - - -
DHATTERWAL
JAGJIT
P 4-A - - - -
DHATTERWAL
Deepika
P 3-B - - - -
Deenathayalan

GENERAL INSTRUCTIONS

Students should come prepared for classes and carry the text book(s) or material(s) as prescribed by the Course
Faculty to the class.

NOTICES

Most of the notices are available on the LMS platform.

All notices will be communicated through the institution email.

All notices concerning the course will be displayed on the respective Notice Boards.

Signature of COURSE COORDINATOR


(PRAVEENA MANDAPATI)

Signature of Department Prof. Incharge Academics & Vetting Team Member


Department Of AI&DS

HEAD OF DEPARTMENT:

Approval from: DEAN-ACADEMICS


(Sign with Office Seal)


[object HTMLDivElement]

about:blank 26/26

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy