1 of 2

Banasthali Vidyapith
Course Handout: December 2019-April 2020
B.Tech(CS)(Batch A & B) VI Semester
Date: 15-December-2019
Course Code: CS 317 Course Name: Artificial Intelligence and Machine Learning
Lecture Hours/ Week: 4 Credit Points: 4
Name of Faculty Member: Dipanwita Thakur
Time Table:
Wednesday & Thursday 1 p.m. – 2 p.m. AI-110 Batch A
Wednesday & Thursday 2 p.m. – 3 p.m. CMS-103 Batch B
Friday & Saturday 4 p.m - 5 p.m AI-110 Batch A
Sunday & Monday 12 p.m – 1 p.m AI-110 Batch B
Learning Outcomes:
On successful completion of the course students will be able to
 Describe the various searching techniques, constraint satisfaction problem and example problems-game
playing techniques.
 Apply these techniques in applications which involve perception, reasoning and learning.
 Explain the role of agents and how it is related with environment and the way of evaluating it and how agents
can act by establishing goals.
 Acquire the knowledge of real world knowledge representation.
 Analyze and design real world problem for implementation and understand the dynamic behavior of a system.
 Use different machine learning techniques to design AI machine and enveloping applications for real world
problems.

Suggested Readings:
R1. Russell, S. & Norvig, P.(2011). Artificial Intelligence A Modern Approach, 3rd Edition: Pearson Education.
R2. Rich E., Knight K. & Nair S.B. (2011). Artificial Intelligence 3rd Edition. Tata McGraw Hill.
R3. Mitchell T.M. (1997). Machine Learning, McGraw Hill International
R4. Flach, P. (2012). Machine learning: the art and science of algorithms that make sense of data. Cambridge
University Press.
R5. Mohri, M., Rostamizadeh, A., & Talwalkar, A. (2018), Foundations of machine learning, MIT press.
R6. Nilsson, N.J., & Nilsson, N.J.(1998). Artificial Intelligence: a new synthesis. Morgan Kaufmann.
Suggested E-Resources:
1. IBM’s Cognitive AI Class
https://cognitiveclass.ai
2. MIT’s Open Courseware on Machine Learning
http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-867-machine-learning-fall-2006/
3. Scikit Learn Online Documentation
https://scikitlearn.org/stable/documentation.html
Continuous Assessment: 40 marks
Sl. No. Component Duration Date(s) Syllabus Marks
1. First Assignment 07 days February 2020 Course related topics 10
2. First Periodical Test 01 hr. 30 mins. February 2020 Lecture No. 01 to 12 10
3. Second Assignment 07 days March 2020 Course related topics 10
4. Second Periodical Test 01 hr. 30 mins. March 2020 Lecture No. 13 to 30 10
End Semester Assessment: 60 marks
Sl. No. Component Duration Date(s) Syllabus Marks
1. Semester Examination 03 hrs. April-May 2020 Section A, B & C 60
The paper will contain nine questions
having at least three questions from each
section. Candidates are required to
attempt six questions in all taking at least
 2 of 2
two questions from each section.
Attendance Requirement: Minimum 70%
Consultation Hours: Sunday & Monday 05:00 p.m. – 06:00 p.m. Room No217 AIM & ACT
Notices: All Notices regarding the course will be displayed on the Notice Board at Reception Area of AIM & ACT
Lecture-Wise Schedule:
Lecture Topics to be Covered Suggested
Number Readings
1 Introduction & Overview of the Course
2 Introduction & History of AI R1/ R2/R6
3-4 General Problem Solving R1/ R2/R6
5–8 State Space and Graph Model techniques R1/ R2/R65
9 – 10 Heuristic Designs R1/ R2/R6
11 – 12 Aim Oriented Heuristic Algorithms Versus Solution Guaranteed Algorithms R1/ R2/R6
13-14 Game Playing Strategies R1/ R2/R6
15-16 Knowledge representation tools R1/ R2/R6
17-18 First Order Predicate Calculus R1/ R2/R6
19-20 Introduction to Machine Learning, Types of Machine Learning, Data Preprocessing, R3/R4/R5
Importance features in learning, Feature Selection, Feature Extraction Process
21-22 Types of Supervised Learning, Difference between Classification and Regression, R3/R4/R5
Understanding Regression: Simple, Multiple, Polynomial
23-26 Exploring popular learning algorithms for regression and classification: Support Vector R3/R4/R5
Machine (Regression and Classification), Decision tree (Regression and Classification),
Naïve Bayes (Classification)
27-28 Evaluation of Classification and Regression Models R3/R4/R5
29-30 Introduction to Clustering, KMeans, Hierarchical R3/R4/R5
31 Introduction to Reinforcement Learning R3/R4/R5
32 Upper Confidence Bound R3/R4/R5
33 Thompson Sampling R3/R4/R5
34-35 Model Selection and Boosting, K-fold Cross Validation, XGBoost R3/R4/R5
36 Natural Language Processing
37 Extraction of features from Text, Tokenization
38 Understanding Markovian Process for Text Processing
39-40 Case Studies