S.T.

Semester –IV
B. Tech. Artificial Intelligence and Data Science
Choice Based Credit Grading Scheme with Holistic and Multidisciplinary Education (CBCGS-HME 2023)
Proposed TCET Autonomy Scheme (w.e.f. A.Y. 2023-24)

Course Description Teaching Scheme (Program Specific) Examination scheme

Sr. Course Code Course Title Modes of Teaching / Learning / Weightage Modes of Continuous Assessment / Evaluation
No. Theory (100/50) Practical / Oral
Hours Per Week 40/20 60/30 / Presentation Term Work (25) Total
Credits IA (25)
Contact ISE IE ESE
Theory Tutorial Practical PR/OR TW
Hours
1 BSC-AIDS401 Mathematics-IV 3 1 - 4 4 20 20 60 - 25 125
2 PCC-AIDS401 Design and Analysis of 20 20 60
3 - 2 5 4 25 25 150
Algorithms
3 PCC-AIDS402 Operating Systems 3 - 2 5 4 20 20 60 25 25 150
4 PCC-AIDS403 Introduction to Artificial 20 20 60
3 - 2 5 4 25 25 150
Intelligence
Total 12 1 6 19 16 Total marks (Academic) 575
Course Description Non-Credited Mandatory Course (Passing is mandatory for this course) Term Work
MC-401 Environmental Studies 1 - - - (Non- - 25 25
1
Credit)
Course Description Contact Hrs. during Weekend / Semester Break/ End of Semester (Between 21st and 25th Week) Term Work
- - 120* 3 - - - 50
1 SI-AIDS401 Summer Internship - 50
Course Description Contact Hrs. during Weekend / Semester Break/ End of Semester (Between 21st and 25th Week)/During Semester
1 AP-AIDS401 Activity Points - - - 52@ - -
Assessment/Evaluation Scheme
Teaching scheme (Holistic and Multidisciplinary
Course Description Education-HME) Presentation Report Term Work
(Conducted in the beginning of Semester during first 3 Weeks) AC AC
1 HME –
Professional Skills III
AIDSPS401 - - 2 2 1 15 10 25
(Data Quality Analyst - II)
2 HME –IP401 Industry Practice-IV
- - 2 2 1 15 10 25
(Employability Skills)
3 HME -ABL401 Activity Based Learning - - 2 2 1 15 10 25
Total - - 6 6 3 Total marks (HME) 75
Total 12 1 12 25 22 Grand Total marks 725
IA- In-Semester Assessment, ESE- End Semester Examination, PR- Practical Examination, TW – Term Work Examination, OR- Oral Examination, AC- Activity evaluation, ISE-In-Semester Examinations, IE-Innovative Examination

P
A
Guidelines for the Semester:

Semester Conduct:
1. The Academic year will be conducted through two semesters. Odd Semester (1st July-31st December) and Even Semester (1st January-30th June).
2. The credit calculation is
a) Theory/Tutorial:1 credit=1 hr b) Practical: 1 credit =2 hrs c) Experiential Learning/Internship: 1 credit= 40 hrs
d) Professional skills/Industry Practices/Industry Certification: 1 credit =2 hrs e)Holistic Development - Activity Based Learning/Project Based
Learning/Research Based Learning: 1 credit=2 hrs
3. Professional Skills & Industry Practice activity will run in the form of integrated theory and practical course & syllabus is linked with level 6 of
NSQF.
4. During Academic conduct, practical load shall be conducted in batches.
Evaluation and Assessment:
5. For continuous evaluation, examination shall be conducted under two heads: IA – In-Semester Assessment, ESE – End Semester Examination. Under
IA, 20 marks of ISE (In-Semester Examination) shall be conducted for 1 hour. 20 marks of IE (Innovative Learning with Examination) shall also be
conducted under IA. ESE shall be conducted for 60 marks with duration of 2 hours.
6. Evaluation and assessment will be formative and summative.
7. Two In semester Examination ISE-I and II (3 modules each) will be summative.
8. One In Semester Examination, ISE-III and Innovative learning with Examination-IE will be formative.
9. End semester Examination, ESE will be Summative and Term Work and Oral/Practical exam and ESE will be conducted at the end of semester.
Internship:
10. * The summer Internship will be conducted in the form of in-house/outhouse internship which is mandatory for all students in semester break.
The internship credits accumulated will be credited in even semester.
AICTE 100 Activity Points:
11. # As per AICTE, Students has to earn 100 Points by participating in 400 Hrs. of activities during 4 years of Engineering. After Completing 48 hrs. of
Activities, Students can earn 12 Points. This Points will not be reflected in Grade Card. Separate transcript will be issued to students after completion
of Final Year.
Other activity which also will be considered are: Participation in Hackathon, Development of new Product/ Business Plan / Registration of start-up,
Participation in IPR workshop/Leadership talks/Idea/ Design / Innovation/Technical Expos, Internship with Industry / Govt. / NGO/ PSU/MSME/Online
Internship, Long Term Goals under Rural IInternshp

P
A
 S.T. Semester –IV
B. Tech. Artificial Intelligence and Data Science
Choice Based Credit Grading Scheme with Holistic and Multidisciplinary Education (CBCGS-HME 2023)
Syllabus under Autonomy Scheme (w.e.f. A.Y. 2023-24)

B. Tech. Artificial Intelligence and Data Science S.T. SEM: IV

Course Name: Mathematics – IV Course Code: BSC- AIDS401
Teaching Scheme (Program Specific) Examination Scheme (Academic)
Modes of Teaching / Learning / Weightage Modes of Continuous Assessment / Evaluation
Theory (100) Practical/Oral Term
Hours Per Week 40 60 / Presentation Work (25) Total
(25)
IA
Theory Tutorial Practical Contact Credits ISE IE ESE PR/OR TW
Hours 125
3 1 - 4 4 20 20 60 - 25
IA: In-Semester Assessment - Paper Duration – 1 Hour
ESE: End Semester Examination - Paper Duration – 2 Hours
The weightage of marks for continuous evaluation of Term work/Report: Formative (40%), Timely completion
of practical (40%) and Attendance / Learning Attitude (20%)
Prerequisite: Basic Mathematics and statistics

Course Objective: The course intends to apply the concept of probability, Correlation and Regression, Testing of
hypotheses for large and small samples to engineering problems and to evaluate the optimization of two and three
variables.

Course Outcomes: Upon completion of the course students will be able to:

Sr. Cognitive levels of

No. Course Outcomes attainment as per POs PSOs
Bloom’s
Taxonomy
1 Apply the concept of probability random L1, L2, L3 1,2,3,5,9,12 2,3
variables, mathematical expectations and
variance.
2 Differentiate the discrete and continuous random L1, L3 1,2,3,5,6,7,9,12 2,3
variables.
3 Apply the concept of test of significance for large L1, L2, L3 1,2,3,4,5,7,9,12 1,2,3
sample test.
4 Apply the concept of test of significance for small L1, L2, L3 1,2,3,4,6,7,9,12 1,2,3
sample test.
5 Apply the concept of Correlation and Regression L1, L2, L3 1,3,4,9,12 1,2,3,4
to the engineering problems.
6 Evaluate the Maximization and minimization of L1, L2, L3 1,2,3,4,5,8,9,12 2,3,4
two and three variables.

P
Detailed Syllabus:

Module Topics Hrs. Cognitive

No. levels of
attainment as
per Bloom’s
Taxonomy
1 Basic Probability
Probability spaces, conditional probability, independence; Discrete
random variables, Independent random variables, sums of 6 L1, L2, L3
independent random variables; Expectation of Discrete and
Continuous Random, Variables, Moments, Variance of a sum
2 Basic Statistics
Measures of Central tendency, Moments, skewness and Kurtosis, 7 L1, L3
Binomial, Poisson and Normal distribution and evaluation of
statistical
parameters for these three distributions
3 Large Samples Test
Test of significance: Large sample test for single proportion, 8 L1, L2
difference of proportions, single mean, difference of means, and
difference of standard deviations.
4 Small Samples Test
Test for single mean, difference of means, test for ratio of variances 8 L1, L2
-Chi-square test for goodness of fit and independence of attributes.

5 Applied Statistics
Correlation and regression – Rank correlation, Curve fitting by the L1, L2, L3
method of least squares- fitting of straight lines, second degree 8
parabolas and more general curves
6 Linear Programming problems
Types of solutions to linear programming problems, standard form
of L.P.P. Simplex method, Big M method (Penalty method) to solve 8 L1, L2, L3
L.P.P, Duality, Dual simplex method and Revised simplex method
to solve L.P.P.
Total Hours 45
Books and References:

Sr. Title Authors Publisher Edition Year

No.

1 Advanced Engineering Erwin kreyszig John Wiley & Sons Ninth Edition 2006
Mathematics
2 A text book of Engineering N.P. Bali and Manish Laxmi Tenth Edition 2008
Mathematics Goyal Publications
3 Engineering Mathematics Veerarajan T Tata McGraw-Hill, Third Edition 2008
New Delhi
4 Introduction to Probability P. G. Hoel, S. C. Port Universal Bookstall Reprint 2003
Theory and C. J. Stone
5 Operations Research S.D. Sharma S. Chand & CO. - -
6 A First Course in Probability S. Ross Pearson Education Sixth Edition 2002
India

Online References:

Sr. Website Name URL Modules

No. Covered
1 www.statisticss https://www.statisticssolutions.com/continuous-probability- M1, M2, M3
olutions.com distribution/
2 nptel.ac.in https://nptel.ac.in/courses/111105123/ M5, M4
3 www.analyticsv https://www.analyticsvidhya.com/blog/2017/02/lintroductory M6
idhya.com - guide-on-linear-programming-explained-in-simple-english/

List of Tutorials:

Sr. Topic Hrs. Cognitive levels of

No attainment as per
Bloom’s Taxonomy
1 Tutorial on Conditional Probability and Bayes theorem 1 L1, L2, L3
2 Tutorial on discrete random variable 1 L1, L2
3 Tutorial on continuous random variable 1 L1, L2, L3
4 Tutorial on measure of Central Tendency and Dispersion 1 L1, L2, L3
5 Tutorial on Binomial and Poisson Distribution 1 L1, L2
6 Tutorial on Normal Distribution 1 L1, L2
7 Tutorial on large sample test for proportion and mean 1 L1, L2
8 Tutorial on large sample test for difference of standard deviations 1 L1, L2, L3
9 Tutorial on small sample test for proportion and mean 1 L1, L2
10 Tutorial on Chi-square test 1 L1, L2, L3
11 Tutorial on Correlation 1 L1, L2, L3
12 Tutorial on Regression 1 L1, L2, L3
13 Tutorial on Curve fitting 1 L1, L2, L3
14 Tutorial on Simplex method 1 L1, L2
15 Tutorial on Dual Simplex method 1 L1, L2, L3
Total Hours 15

P
 S.T. Semester –IV
B. Tech. Artificial Intelligence and Data Science
Choice Based Credit Grading Scheme with Holistic and Multidisciplinary Education (CBCGS-HME 2023)
Syllabus under Autonomy Scheme (w.e.f. A.Y. 2023-24)

B. Tech. Artificial Intelligence and Data Science S.T. SEM: IV

Course Name: Design and Analysis of Algorithm Course Code: PCC-AIDS401
Teaching Scheme (Program Specific) Examination Scheme (Formative/ Summative)
Modes of Teaching / Learning / Weightage Modes of Continuous Assessment / Evaluation
Hours Per Week Theory Practical/Oral Term Work Total
(100) (25) (25)
Theory Tutorial Practical Contact Credits ISE IA ESE PR/OR TW
Hours
150
3 - 2 5 4 20 20 60 25 25

ISE: In-Semester Examination - Paper Duration – 1 Hour

IE: Innovative Examination
ESE: End Semester Examination - Paper Duration - 2 Hours
The weightage of marks for continuous evaluation of Term work/ Report: Formative (40%), Timely completion of
practical (40%), and Attendance/Learning Attitude (20%)
Prerequisites: Computer Basics, Data Structures, Procedural Programming Languages, basic mathematics

Course Objective: The objective of the course is to study various algorithm designing paradigms in computer science
and related areas to illustrate efficient ways of real-time problem solving with the help of a mathematical approach.

Course Outcomes: Upon completion of the course students will be able to:

Cognitive levels of
attainment as per
Sr. Course Outcomes Bloom’s Taxonomy POs PSOs
No.

1 Understand, calculate and Analyze the L1, L2, L3, L4 1,2,3,4,5,9,12 2,3
complexities of various problems in different
domains.
2 Apply and analyze the complexity of divide and L1, L2, L3, L4 1,2,3,4,5,7,9,1 2,3
conquer strategy. 2

3 Apply and analyze the complexity of greedy L1. L2, L3, L4, L5 1,2,3,4,5,7,9,1 1,2,3
method, dynamic programming strategy, 2
backtracking and branch and bound strategy.
4 Understand, apply and analyze different string- L1, L2, L3, L4 1,2,3,4,5,7,9,1 1,2,3
matching algorithms 2

5 Compare and contrast various algorithm L1, L2, L3, L4, L5 1,2,3,4,9,12 1,2,3,4
designing strategies to apply in real world
problems.

6 Understand the classes P, NP, and NP- L1, L2, L3, L4 1,2,3,4,5,9,12 2,3,4
Complete and streaming algorithms

P
Detailed Syllabus:

Module Topics Hrs. Cognitive levels

No. of attainment
as per Bloom’s
Taxonomy
1 Introduction to Algorithm analysis 9
Performance analysis, space and time complexity, Order of Growth
of function. Mathematical background for algorithm analysis,
Analysis of selection sort, insertion sort. Recurrences: -The
substitution method - Recursion tree method -Master method. L1, L2, L3, L4
Relevance of algorithm and its analysis in data science and AI.

Divide and Conquer: Finding Minimum and maximum, Binary

search, Merge sort, Quick sort.

2 Greedy Method 5

Greedy Method: General method, Single source shortest path, L1, L2, L3, L4
Minimum cost spanning trees- Kruskal and prim’s algorithm,
Huffman coding, Job sequencing with deadlines.
3 Dynamic Programming 6

Dynamic Programming: General method, Multistage graphs, L1, L2, L3, L4,
single source shortest path, all pair shortest path, 0/1 knapsack, L5
Travelling salesman problem, Longest common subsequence,
Applications of Dynamic Programming in machine learning

4 Backtracking and Branch & Bound 8

Backtracking: General method, 8 queen problem (N-queen

problem), Sum of subsets, Graph Coloring. L1, L2, L3, L4

Branch and Bound: General method, 15 puzzle problem

5 String Matching Algorithm 8

The naïve string matching Algorithm, The Rabin Karp algorithm, L1, L2, L3, L4,
String matching with finite automata, The Knuth-Morris-Pratt L5
algorithm, Boyer Moore algorithm

6 Introduction to Non-Deterministic Algorithms & Streaming 9

Algorithms

Polynomial time, Polynomial time verification, classes NP, NP

Completeness. L1, L2, L3, L4

Streaming Algorithm: Introduction, Sampling Techniques,

Sketching Technique.

Total Hours 45

P
Books and References:

Sr. Title Authors Publisher Edition Year

No.

1 Introduction to T.H. Coreman, C.E. PHI Third 2009

algorithms. Leiserson, R.L.
Rivest, and C. Stein

2 Fundamentals of Ellis horowitz, Sartaj University Second 2017

computer algorithms. Sahni, S. Rajsekaran. Press

3 Design Methods and S. K. Basu PHI -- 2005

Analysis of
Algorithm

4 Algorithm Design John Kleinberg, Eva Pearson -- 2005

Tardos

5 Algorithms Sanjo Dasgupta, Tata Featured 2017

Christos McGraw- Edition
Papadimitriou, Umesh Hill Edition.
Vazirani

Online References:

Sr. Website Name URL Modules

No. Covered

1 www.geeksforgeeks.org https://www.geeksforgeeks.org/fundamenta M1-M6

ls-of-algorithms/?ref=shm

2 www.studytonight.com https://www.studytonight.com/data- M2
structures/greedy-algorithm

3 NPTEL Course https://nptel.ac.in/courses/106/106/1061061 M1-M6

31
4 Swayam portal https://swayam.gov.in/nd1_noc19_cs47/pre M1-M6
view
5 Coursera https://www.coursera.org/specializations/al M1-M6
gorithms
6 Moocs https://www.mooc-list.com/tags/algorithms M1-M6

P
List of Experiments:

Practical Type of Practical/ Experiment Topic Hrs. Cognitive

Number Experiment levels of
attainment as
per Bloom’s
Taxonomy
Develop a code for Binary Search and 2 L1-L5
1
Basic analyze it.
Experiments Develop a code for Merge Sort and 2 L1-L5
2
analyze it.
Develop a code for Dijkstra’s algorithm 2 L1-L5
3
using Greedy method and analyze it.
Develop a code Minimum spanning tree, 2 L1-L5
4 Kruskal’s algorithm using Greedy method
and analyze it.
Develop a code for Bellman Ford 2 L1-L5
5 problem using dynamic programming and
Design analyze it
Experiments Develop a code for Longest common 2 L1-L5
6 subsequence using dynamic programming
and analyze it
Develop a code for 8 queen’s problem 2 L1-L5
7 using backtracking approach and analyze
it.
Develop a code for Naïve String 2 L1-L5
8
Matching Algorithm and analyze it.
Develop a code for Knuth Moris Pratt 4 L1-L5
9
Algorithm and analyze it.
Develop a code for Rabin Karp Algorithm 2
10
and analyze it.
Mini/Minor Mini Project (sample):
Projects/ 1. Build a Snakes & Ladders game 8 L1, L2, L3, L4
Seminar/ Case 2. Sudoku Solver
11
Studies 3. Maze generator
4. Dictionary implementation
5. Employee Record System
Total Hours 30

P
 S.T. Semester –IV
B. Tech. Artificial Intelligence and Data Science
Choice Based Credit Grading Scheme with Holistic and Multidisciplinary Education (CBCGS-HME 2023)
Syllabus under Autonomy Scheme (w.e.f. A.Y. 2023-24)

B. Tech. Artificial Intelligence and Data Science S.T. SEM: IV

Course Name: Operating Systems Course Code: PCC-AIDS402

Teaching Scheme (Program Specific) Examination Scheme (Formative/ Summative)
Modes of Teaching / Learning / Weightage Modes of Continuous Assessment / Evaluation
(Theory 100) Practical Term
Hours Per Week Total
/Oral (25) Work (25)
Theory Tutorial Practical Contact Credits ISE IE ESE
Hours
150
3 - 2 5 4 20 20 60 25 25

ISE: In-Semester Examination - Paper Duration – 1 Hours IE: Innovative Examination

ESE: End Semester Examination - Paper Duration - 2 Hours
The weightage of marks for continuous evaluation of Term work/ Report: Formative (40%), Timely completion
of practical (40%) and Attendance/Learning Attitude (20%)
Prerequisite: Computer Basics, Data Structures

Course Objectives: The course imparts essential Operating System knowledge, covering process, thread, and resource
management, as well as synchronization, deadlock, and memory/file/I/O techniques.

Course Outcomes: Upon completion of the course students will be able to:

Sr. Course Outcomes Cognitive level POs POs

No. attainment as per revised
Bloom’s Taxonomy

1 Explain the role of operating system in a computer. L1, L2 1,2,9,10 1,2

2 Define a process and compare the different process L1, L2, L3 1,2,3,9,10,12 1,2,3
scheduling algorithms

3 Explain the need of process synchronization and L1, L2, L3 1,2,3,9,10,12 1,2,3
apply deadlock management strategies.

4 Describe various memory management techniques L1, L2, L3, L4 1,2,3,4,5,9,10,12 1,2,3
and analyze their performance.

5 Explain file organization, explore varied file L1, L2, L3, L4 1,2,3,4,5,9,10,12 1,2,3
allocation methods, delve into access control
techniques.

6 Discover functionalities of different operating L1, L2, L3 1,2,3,9,10,12 1,2,3

systems

P
Detailed Syllabus:

Module Topics Hrs. Cognitive level

No. attainment as
per revised
Bloom’s
Taxonomy

1 Introduction to Operating System 6 L1, L2

Introduction: Operating system and functions, Classification of Operating

systems- Batch, Interactive, Time-sharing, Real-Time System, Multiprocessor
Systems, Multiuser Systems, Multiprocessor Systems, Multithreaded Systems,
Operating System Structures, System Calls BASH Shell scripting: Basic shell
commands, shell as a scripting language.

2 Processes and Processor Scheduling 8 L1, L2, L3

Processes: Introduction, Process states, process management, Interrupts, Inter-

process Communication Threads: Introduction, Thread states, Thread Operation,
Threading Models.
Processor Scheduling: Scheduling levels, Pre-emptive vs Non preemptive
Scheduling, Priorities, Scheduling objective, Scheduling criteria, Scheduling
algorithms, Demand Scheduling, Real-time Scheduling.

Process Synchronization and Deadlock 9 L1, L2, L3

3
Process Synchronization: Mutual exclusion, Software solution to Mutual
exclusion problem, Hardware solution to Mutual exclusion problem, Semaphores,
Critical Section Problems: Producer and Consumer problem, Dining philosopher
problem.
Deadlocks: Concept of Deadlock, Necessary conditions for Deadlock, Deadlock
Prevention, Deadlock Avoidance with Bankers algorithms, Deadlock Detection,
Deadlock Recovery.

4 Memory Management and Virtual Memory 10 L1, L2, L3, L4

Memory Management: Memory Management Strategies, Contiguous versus

non- Contiguous memory allocation, Partition Management Techniques, Logical
versus Physical Address space, Swapping, Paging, Segmentation, Segmentation
with Paging
Virtual Memory: Demand Paging, Page Replacement, Page-replacement
Algorithms, Performance of Demand Paging, Thrashing, Demand Segmentation,
and Overlay Concepts.

5 File System and I/O Management 6 L1, L2, L3, L4

File Management: Overview, File Organization and Access, Secondary

Storage Management: File Allocation Methods.
I/O Management and Disk Scheduling: I/O Devices, I/O Buffering, Disk
Scheduling algorithm: FCFS, SSTF,SCAN, CSCAN, LOOK, C-LOOK RAID

6 Case Studies 6 L1, L2, L3

XV6 OS, Distributed OS, Real Time OS, Mobile OS

Total Hours 45

P
Books and References:

Sr. No. Title Authors Publisher Edition Year

1 Operating System Concepts Abrahamilber Schatz, Peter Wiley Ninth 2009

Baer Galvin and Greg Gagne Edition

2 Operating System: Internals William Stallings Prentice Eighth 2018

and Design Principles Hall Edition

3 Modern Operating System Herbert Bos Pearson Fourth 2015

Andrew S. Tanenbaum Edition

4 Linux Shell Shantanu Tushar Packt Second 2013

Scripting Cookbook Sarath Lakshman Publishing Edition

Online References:

Sr. Website URL Modules

No Name Covered

1 tutorials point https://www.tutorialspoint.com/computer_fundamentals/computer M1-M6

_operating_system

2 Geeks for https://www.geeksforgeeks.org/operating-systems-need-and M1-M6

geeks functions/

3 nptel.ac.in https://nptel.ac.in/courses/106106144/2 M1-M6

4 Linux hint https://linuxhint.com/30_bash_script_examples/ M1

List of Practical/ Experiments:

Practical Type of Experiment Practical/ Experiment Topic Hrs. Cognitive levels

Number of attainment as
per Bloom’s
Taxonomy

1 Basic Experiments Explore the internal commands of Linux 2 L1, L2, L3

and Write shell scripts to do the
following:
1.) Display top 10 processes in
descending order.
2.) Display processes with highest
memory usage.
3.) Display current logged in user and
log name.
4.) Display current shell, home directory,
operating system type, current path
setting, current working directory.

P
 5.) Display OS version, release number,
kernel version. Illustrate the use of sort,
grep, awk, etc.

2 Write a program to system calls for file 2 L1, L2, L3

manipulation.

3 Design Experiments Write a program to Building multi- 2 L1, L2, L3

threaded and multi-process applications

4 Write a program to implement Critical 2 L1, L2, L3

Section Problems (Producer Consumer,
Dinning Philosophers)

5 Write a program to implement Banker’s 2 L1, L2, L3

algorithm.

6 Build a program to implement page 2 L1, L2, L3

replacement policies (FIFO, LRU, and
Optimal).

7 Develop a program to implement 4 L1, L2, L3

dynamic partitioning placement
algorithms i.e., Best Fit, First-Fit, Worst-
Fit etc.

8 Build a program to implement FCFS and 4 L1, L2, L3

SSTF disk scheduling algorithm

9 Case Studies/ Case study: 4 L1, L2, L3

Group Presentation 1. Windows Operating System
2. Linux Operating System
3. FAT32 File System
4. NTFS File System

10 Mini Project 1. Build a Multi-Threaded Web Crawler 6 L1, L2, L3, L4

2. Build a Repository/Directory
Synchronizer
3. Build an Android Logger

Total Hours 30

P
 S.T. Semester –IV
B. Tech. Artificial Intelligence and Data Science
Choice Based Credit Grading Scheme with Holistic and Multidisciplinary Education (CBCGS-HME 2023)
Syllabus under Autonomy Scheme (w.e.f. A.Y. 2023-24)

B. Tech. Artificial Intelligence and Data Science S.T. SEM: IV

Course Name: Introduction to Artificial Intelligence Course Code: PCC-AIDS403
Teaching Scheme (Program Specific) Examination Scheme (Formative/ Summative)
Modes of Teaching / Learning / Weightage Modes of Continuous Assessment / Evaluation
Hours Per Week Theory (100) Practical/ Term Total
Oral (25) Work (25)
Theory Tutorial Practical Contact Credits ISE IE ESE PR/OR TW
Hours
3 - 2 5 4 20 20 60 25 25 150

ISE: In-Semester Examination - Paper Duration – 1 Hours IE: Innovative Examination

ESE: End Semester Examination - Paper Duration - 2 Hours
The weightage of marks for continuous evaluation of Term work/ Report: Formative (40%), Timely
completion of practical (40%) and Attendance/Learning Attitude (20%)
Prerequisite: Computer and Programming Basics, Analysis of Algorithms

Course Objective: To create a thorough understanding of AI basics and real-time applications in its sub-domains.
The course explores AI techniques like informed, uninformed, and adversarial searching to solve real-life problems
in a state space tree representation. The course also acquaints learners to advance topics of AI such as planning,
handling uncertainty.

Course Outcomes: Upon completion of the course students will be able to:

Sr. Course Outcomes Cognitive levels of POs POs

No. attainment as per
Bloom’s Taxonomy
1 Understand different types of AI agents. L1, L2 1,2,9,10 1,2

2 Understand and apply EDA using Python L1, L2, L3 1,2,3,9,10,12 1,2
programming and also evaluate the functions of
Pandas Library to implement the operations of data
wrangling.
3 Understand and apply various AI search L1, L2, L3 1,2,3,9,10,12 1,2,3
algorithms (uninformed, informed), local and
adversarial search algorithms to real-world
problems.
4 Understand and apply methods for solving L1, L2, L3 1,2,3,4,9,10,12 1,2,3
Constraint Satisfaction Problems.
5 Analyze AI approaches for knowledge L1, L2, L3,L4 1,2,3,4,9,10,12 1,2,3,4
representation and Uncertain knowledge and
reasoning.
6 Understand various types of planning and forms L1, L2, L3 1,2,3,4,10,12 1,2,3
of learning. Apply decision tree learning to a
given problem.

P
Detailed Syllabus:

Module Topics Hrs. Cognitive

No. levels of
attainment
as per
Bloom’s
Taxonomy
1 Introduction 4 L1, L2
Introduction, History and Foundation of AI, Intelligence and it’s type,
Categorization of Artificial Intelligent based System, Agents & Environments,
Applications, Sub-areas and Current trends in AI
2 Exploratory Data Analysis & Data Wrangling using Pandas 10 L1, L2, L3
Introduction to EDA, Types of EDA, Steps in Data Preprocessing,
Understanding Data, looking at the Data, Dealing with Missing Values,
Standardizing Data, Steps involved in EDA using Python Programming,
Pandas Series, accessing data in series, Pandas DataFrame, Creating
DataFrames, File I/O operations, Pandas Operations: indexing, Conditional
Filtering, Apply Functions Groupby and Sorting Pivot Tables, Merging
DataFrame, Concatenation, Join operations.
3 Problem Solving and Search Methods 7 L1, L2, L3
Solving problems by searching, Search- Issues in The Design of Search
Programs, Un-Informed Search- BFS, DFS; Heuristic Search Techniques:
Generate-and-Test, Hill Climbing, Best-First Search, A* Algorithm, Alpha
beta search algorithm, Problem Reduction, AO*Algorithm, Local beam
search, Minimax Search, Tabu search
4 Constraint Satisfaction Problems (CSPs) 5 L1, L2, L3
Representation of the atomic state, Map Coloring, Examples of CSPs,
Backtracking Search, Variable and Value Ordering in Backtracking Search,
Crypto Arithmetic, N – Queens problem.
5 Knowledge and Reasoning 11 L1, L2, L3,L4
Knowledge based Agents, The Wumpus World, The Propositional logic, First
Order Logic: Syntax and Semantic, Inference in FOL, Forward chaining,
backward Chaining, Knowledge Engineering in First-Order Logic,
Unification, Resolution, Uncertain knowledge and reasoning:
Uncertainty, Representing knowledge in an uncertain domain, The semantics
of belief network, Inference in belief network
6 Planning and Learning 8 L1, L2, L3
The planning problem, Planning with state space search, Partial order
planning, Hierarchical planning, Conditional Planning.
Learning: Forms of Learning, Inductive Learning, Learning Decision Tree.
Expert System: Introduction, Phases in building Expert Systems, Architecture,
Rule base systems, Inference Engine, Match-Resolve-Execute, Rete Net.
Total Hours 45

P
Books and References:

Sr. Title Authors Publisher Edition Year

No.
1 Artificial Intelligence a Modern Stuart J. Russell and McGraw Hill 3rd 2009
Approach Peter Norvig Edition
2 A First Course in Artificial Deepak Khemani McGraw Hill 1st 2013
Intelligence Education (India) Edition
3 Artificial Intelligence and N. P. Padhy Oxford 1st 2005
Intelligent Systems Edition
4 Artificial Intelligence Elaine Rich and Tata McGraw- Hill 3rd 2008
Kevin Knight Education Pvt. Ltd. Edition
5 Artificial Intelligence Rob Callan Palgrave macmillan 1st 2003
Edition
6 Data Science and Analytics for Dr. Jeffrey Lulu Inc. 1st 2018
Ordinary People Strickland Edition

Online References:

Sr. Website Name URL Modules

No. Covered
M1-M6
1 nptel.ac.in https://nptel.ac.in/courses/106102220/
https://onlinecourses.nptel.ac.in/noc20_cs81/previe w M1-M4, M6
2 nptel.ac.in
M1
3 www.coursera.org https://www.coursera.org/learn/introduction-to-ai/
https://www.coursera.org/learn/mind-machine- M2
4 www.coursera.org
problem-solving-methods
https://www.coursera.org/learn/game-theory- M3
5 www.coursera.org
introduction
https://www.coursera.org/learn/automated- M5
6 www.coursera.org
reasoning-sat
https://www.coursera.org/learn/mcmc-bayesian- M5
7 www.coursera.org
statistics
https://www.coursera.org/learn/ai-for- M1, M6
8 www.coursera.org
everyone/home/welcome
https://www.tutorialspoint.com/artificial_intelligen M1, M2, M6
9 www.tutorialspoint.com
ce/artificial_intelligent_systems.htm
https://www.javatpoint.com/history-of-artificial- M1-M6
10 www.javatpoint.com
intelligence

P
List of Practical/ Experiments:

Cognitive levels of
Practical Type of
Practical/ Experiment Topic Hrs. attainment as per
Number Experiment
Bloom’s Taxonomy
1 Demonstrate steps involved in EDA using Python 2 L1, L2
Basic Demonstrate Data Preprocessing and Visualization
2 Experiment 2
using Excel.
Perform the following using Python Pandas
library
• Inserting and deleting columns in data structures.
• Merging and joining data sets.
• Reshaping and pivoting data sets.
• Aligning data and dealing with missing data.
3 • Manipulating data using integrated indexing for 4 L1, L2, L3,L4
DataFrame objects.
• Performing split-apply-combine on data sets using
the group by engine.
• Manipulating high-dimensional data in a data
structure with a lower dimension using hierarchical
axis indexing.
Perform the following using Python Pandas
library
• Subsetting, fancy indexing, and label- based slicing
data sets that are large in size.
• Generating data range, converting frequency, date
shifting, lagging, and other time-series
4 4 L1, L2, L3,L4
Design functionality.
Experiments • Reading from files with CSV, XLSX, TXT, among
other formats.
• Arranging data in an order ascending or descending.
• Filtering data around a condition.
• Analyzing time series iterating over a data set.
5 Apply uninformed search on given problem. 2 L1, L2, L3
6 Apply informed search on given problem. 2 L1, L2, L3
7 Apply Adversarial Search on given problem. 2 L1, L2, L3
8 Apply genetic algorithm on given problem. 2 L1, L2, L3
Apply Minimax with Alpha-Beta Pruning on given
9 2 L1, L2, L3
problem.
Game Development
Capstone Smart Apps Chatbot
10 8 L1, L2, L3, L4, L5, L6
Projects Prediction Systems
Intelligent Systems

Total Hours 30

P
 S.T. Semester –IV
B. Tech. Artificial Intelligence and Data Science
Choice Based Credit Grading Scheme with Holistic and Multidisciplinary Education (CBCGS-HME 2023)
Syllabus under Autonomy Scheme (w.e.f. A.Y. 2023-24)

B. Tech. Artificial Intelligence and Data Science S.T. SEM: IV

Course Name: Environmental Studies Course Code: MC-401
Teaching Scheme (Program Specific) Examination Scheme (Formative/ Summative)
Modes of Teaching / Learning / Weightage Modes of Continuous Assessment / Evaluation
Hours Per Week Theory (100) Practical/ Term Total
Oral (25) Work (25)
Theory Tutorial Practical Contact Credits ISE IE ESE PR/OR TW
Hours
1 - - 1 - - - - - 25 25

ISE: In-Semester Examination - Paper Duration – 1 Hours IE: Innovative Examination

ESE: End Semester Examination - Paper Duration - 2 Hours
The weightage of marks for continuous evaluation of Term work/ Report: Formative (40%), Timely
completion of practical (40%) and Attendance/Learning Attitude (20%)
Prerequisite: Biology, chemistry, geography, geology, physics

Course Objective: The course intends to deliver the fundamental concepts of Environmental Sciences. It will also
help in understanding & analyzing the major challenges and current issues in environment and evaluate possible
solutions.

Course Outcome: Upon completion of the course students will be able to:

Sr. Course Outcomes Cognitive levels of

attainment as per Bloom’s
No. Taxonomy

1 Relate the concept of Environmental Sciences and provide solutions to the L1, L2
major challenges and current issues in Environment.
2 Relate the fundamentals and importance of Natural Resources and L1, L2
understand the importance of Biodiversity and its Conservation.
3 Interpret and Analyze various types of Environmental Pollution and their L1, L2, L3, L4
effects on plants and animals
4 Relate and Apply various laws available in the country to protect the L1, L2, L3
Environment.
5 Interpret and Analyze address social issues for sustainable development. L1, L2, L3, L4

6 Relate and Analyze the importance of Environmental Monitoring. L1, L2, L3, L4

P
Detailed Syllabus:

Module Topics Hrs. Cognitive levels

No. of attainment as
per Bloom’s
Taxonomy

1 Concepts of Environmental Sciences 2 L1, L2

Environment, Levels of organizations in environment, Structure and
functions in an ecosystem; Biosphere, its Origin and distribution on land
in water and in air.

2 Natural Resources, Biodiversity and its conservation 3 L1, L2

Renewable and Non-renewable Resources, Forests, water, minerals,
Food and land (with example of one case study); Energy, Growing
energy needs, energy sources (conventional and alternative),
Biodiversity at global, national and local levels; India as a mega-
diversity nation; and strategies for conservation of Biodiversity.

3 Environmental Pollution 3 L1, L2, L3, L4

Types of pollution- Air, water (including urban, rural, marine), soil,
noise, thermal, nuclear; Pollution prevention; Management of pollution-
Rural/Urban/Industrial waste management [with case study of any one
type, e.g., power (thermal/nuclear), fertilizer, tannin, leather, chemical,
sugar], Solid/Liquid waste management, disaster management.

4 Environmental Biotechnology 2 L1, L2, L3

Biotechnology for environmental protection- Biological indicators, bio-
sensors; Remedial measures- Bio-remediation, photo remediation, bio-
pesticides, bio-fertilizers; Bio-reactors- Design and application

5 Social Issues and Environment 3 L1, L2, L3, L4

Problems relating to urban environment- Population pressure, water
scarcity, industrialization; remedial measures; Climate change-
Reasons, effects (global warming, ozone layer depletion, acid rain) with
one case study; Legal issues- Environmental legislation (Acts and issues
involved), Environmental Ethics

6 Environmental Monitoring 2 L1, L2, L3, L4

Monitoring- Identification of environmental problem, tools for
monitoring (remote sensing, GIS); Sampling strategies- Air, water, soil
sampling Techniques

Total Hours 15

P
Books and References:

Sr. Title Authors Publisher Edition Year

No.

1 Textbook of Erach Bharucha University’s Press Second Edition 2013

Environmental Studies for
Undergraduate Courses

2 Fundamentals of Mahua Basu& Cambridge First Edition 2016

Environmental Studies Xavier Savarimuthu Publication
SJ

3 Environmental Studies Benny Joseph Tata McGraw – First Edition 2015

Hill Publishing
Company Limited

4 Environmental Studies R.J.Ranjit Daniels, Wiley India Private First Edition 2013
Jagadish Ltd., New Delhi.
Krishnaswamy

P
 S.T. Semester –IV
B. Tech. Artificial Intelligence and Data Science
Choice Based Credit Grading Scheme with Holistic and Multidisciplinary Education (CBCGS-HME 2023)
Syllabus under Autonomy Scheme (w.e.f. A.Y. 2023-24)

B. Tech. Artificial Intelligence and Data Science S.T. SEM: IV

Course Name: Professional Skills-III (Data Quality Analyst-II) Course Code: HME –AIDSPS401
Teaching Scheme (Program Specific) Examination Scheme (Formative/ Summative)
Modes of Teaching / Learning / Weightage Modes of Continuous Assessment / Evaluation
Hours Per Week Theory Practical / Term Work Total
(100) Oral (25) (25)
Theory Tutorial Practical Contact Credits ISE IE ESE PR/OR TW
Hours 25
- - 2 30 1 - - - 15 10

ISE: In-Semester Examination - Paper Duration – 1 Hours

IE: Innovative Examination
ESE: End Semester Examination - Paper Duration - 2 Hours
The weightage of marks for continuous evaluation of Term work/ Report: Formative (40%), Timely
completion of practical (40%) and Attendance/Learning Attitude (20%)
Prerequisite: Computer and Programming Basics, Data Types and basic Mathematical concepts

Course Objective: The course intends to deliver knowledge about advanced python concepts by introducing various
Python libraries and thereby implementing data wrangling techniques.

Course Outcomes: Upon completion of the course students will be able to:

Sr. Type of Practical/ Experiment Topic Hrs. Cognitive levels of

No. Experiment attainment as per
Bloom’s
Taxonomy
1 Basic Create a program that asks the user to enter their information 2 L1,L2,L3
Experiments using Python
2 To perform data preprocessing Operations for the Project 2 L1, L2,L3
using Python
3 To Apply mathematical operators’ additions, subtractions on 2 L1, L2, L3
Data column using Python for Project
4 To apply Aggregate Functions for Average, Sum, Min & Max 2 L1, L2, L3
for Data set using Python for Project
5 To apply Quantile Function & Percentile Function on dataset 2 L1, L2, L3
of Project Using Python
6 To apply different functions for Import & Export data from 2 L1, L2, L3
dataset for Project using Python
7 To perform Alias Operations on Dataset using Python for the 2 L1, L2, L3
project
8 To apply Constraint Function on dataset and analysis the 2 L1, L2, L3
result of Project using Python

P
9 Design To apply identifier function on dataset and analysis the result 2 L1, L2, L3
Experiments using Python
10 To apply aggregate function on dataset of Project using 2 L1, L2, L3
Python
11 To apply Modify, Update, alter function of the values of data 2 L1, L2, L3
set of Project using Python
12 To apply Statistical functions on data set of Project using 2 L1, L2, L3
Python and analyze the result
13 To apply automating dataset operation with trigger the dataset 2 L1, L2, L3
of Project using Tools
14 To perform String operation on dataset of Project using
2 L1, L2, L3
Python
15 Mini Project based on content of the syllabus. (Group of 2-3 2 L1, L2, L3
students)
Total Hours 30

P
 S.T. Semester –IV
B. Tech. Artificial Intelligence and Data Science
Choice Based Credit Grading Scheme with Holistic and Multidisciplinary Education (CBCGS-HME 2023)
Syllabus under Autonomy Scheme (w.e.f. A.Y. 2023-24)

B. Tech. Artificial Intelligence and Data Science S.T. SEM: IV

Course Name: Activity Based Learning Course Code: HME –AIDSPS401
Teaching Scheme (Program Specific) Examination Scheme (Formative/ Summative)
Modes of Teaching / Learning / Weightage Modes of Continuous Assessment / Evaluation
Hours Per Week Theory Presentation Term Total
(25) (25) Work (25)
Theory Tutorial Practical Contact Credits ISE IE ESE AC AC
Hours 50
- - 2 2 1 - - - 25 25

ISE: In-Semester Examination - Paper Duration – 1 Hours

IE: Innovative Examination
ESE: End Semester Examination - Paper Duration - 2 Hours
The weightage of marks for continuous evaluation of Term work/ Report: Formative (40%), Timely
completion of practical (40%) and Attendance/Learning Attitude (20%)
Prerequisite: Basics of Computer programming ,General knowledge, Social awareness

Course Objectives:
• The larger objective of the course is to prepare students for Leadership and Excellence in their life roles by
continually engaging students in both individual and team activities that explore important issues or phenomena,
use multiple media and technologies, create products that embody the results of the student’s explorations, and call
the students to explain their work and products to adult and student audience.
• Further the course also aims to develop the Society Sensitive Citizens by creating awareness among students and
take up the initiatives in the Activity mode.
• The course intends to deliver the understanding of the concepts of critical thinking, encourage the students to look
beyond their textual knowledge, establish the relationship between theory and the applications of the learned
concepts.
• It also intends to address the society future in the area of work.

Course Outcomes:

SN Course Outcome Cognitive level

attainment as per
revised Bloom
Taxonomy
1. Students will be able to understand the Thematic Apperception Test (TAT), a type L1, L2, L3
of projective test that involves describing ambiguous scenes to learn more about a
person's emotions, motivations, and personality.

P
 Student will be able to learn on multidisciplinary subjects with an essence of team L1, L2, L3
2. spirit.
This will bring out the excellence attribute in students with updated awareness in
technical topics listed in Technology Vision -2035 related to their domains. They
will explore of a real issue within a defined context, using a variety of data sources
and present Case Study. They will be able to analyse a defined problem consisting
in a real situation and use a real information as methodological tool.

3. Students will be able to outline the procedures for Brainstorming and demonstrate L1, L2, L3
Technical discussion styles.

4. Student will in the process figure out the various benefits of Survey and also Work L1, L2, L3
as a team and think in higher order which facilitate the creative problem-solving
acumen in students to develop realistic solutions to complex problems in
Technology vision -2035.
5. Students will be able to know the strengths of Drama/Skit understanding L1, L2, L3
its effectiveness, generalizability, reliability, and versatility. Students will be able
to make the awareness about various social issues.
6. Students will be able to communicate ideas and render and information to a group. L1, L2, L3
A presentation carries the speaker's personality better and allows immediate
interaction between all the participants.

Detailed Syllabus:

Module Topics Hrs Cognitive level

No. attainment as
per revised
Bloom
Taxonomy
1 Personality Development & Team Building (a part of Student Leadership 4 L1, L2, L3
program)

I. Word association (Test Sentence Building) Students are shown 60 English

words one after other and a short sentence using the words shown are to be
written. Each word will appear for 15 seconds and sentence is to be written
within this period only. At least 45 words are to be attempted to get good marks

II. Thematic Apperception Test (Short Story Writing)

12 Slides will be projected, and stories are to be written in 03 Minutes.
Discussions on Stories written by students
Evaluation by faculty as per format: Students are introduced to team concepts
with four major insights: Setting goals, Role clarification, Problem solving and
Interpersonal- relations. Students will be exposed via Team Rapport, to align the
team members with the goal, to break the communication barriers.

III. To understand what team building is, team formation activities will be
carried out with domain related topics distribution under Theme Technology
Vision -2035.

Evaluation by faculty as per format.

P
2 Case Study or Story Writing 6 L1, L2, L3

I. Introduction Case study and Story weaving. Types of case studies.

In the process of writing a case study paper, one need to have a least four sections
in case study. These are the introduction, background information with reasons as
to why the case study was formulated, presentation of findings and a conclusion.
Problem identification; Domain linked problems that makes our Nation self-reliant
and sustainable can be chosen from listed topics and offer a suggestive solution to
it.
II.Presentation: Showcase the Problems You identified.
Tell the Story of your research Experience of topic chosen related to your domain.
III. Topic: TECHNOLOGY VISION -2035
Introduction: “Technology Vision 2035,” developed by the Technology
Information, Forecasting and Assessment Council, claims to identify key
challenges and needs of India and describe its technology capability landscape in
2035. It is important to understand the backstage process of participation in the
development of this vision document, and bring forth the imagination of the citizen
underlining the vision’s horizon. In the context of its “diversity” claims, it is
essential to ask if one vision is really possible for such a huge and diverse country,
or should we be talking, instead, of many visions, and a diversity of visions?

II Domain wise distribution:

The different branches can plan as per their domain knowledge or can be worked
in multidisciplinary way in the form of case study.
Each Dept will pick domain wise topics listed in Technology vision 2035 booklet.
Evaluation by faculty as per format
3 Brainstorming 4 L1, L2, L3
I. Introduction to Brainstorming, Definition and types of Brainstorming
Brainstorming session among students on various topics floated for debate. Topics
can be Academic or Parliamentary, Financial, International affairs, technology
trends, Technical or philosophical. Expressing views by each student and the team
for /against topic for 3 minute.

II. Paraphrasing/summarizing. Evaluation will be based on Creativity skills

supported by listening and participating proactively by presentation of teams.
Brain storming among the team’s members sequentially, other teams will be
audience to discussing team and vice versa. It’s a team task.
Evaluation by faculty as per format
4 Survey Designing 6 L1, L2, L3
Introduction and Orientation to research methodology emphasizing on survey
designing. Surveys can be administered in many modes, including: online surveys,
email surveys, social media surveys, paper surveys, mobile surveys, telephone
surveys, and face-to-face interview surveys.
Select the topic of survey topic with feasible insight either from choice or in
consultation with teacher. Discussion forum or Use of internet is allowed for the
same. It’s a team task.
Structuring and Designing the Questionnaire
Create the sample questionnaires (max 10) mapping with goal established
Interview the peer team members for data (all students should be asked.) Field
survey topics can also be collected.

II. Collection of the data and use the tools for analyses of the survey incorporated
if any. Finalizing the results
Data analyses in the form of written article and graphs projection for the same.
Presentation of survey results by teams
(a)Demonstration by students 4 teams

P
 b) Presentation of another 4 teams
Submission of projects as hard copy, Evaluation by faculties

5 Drama / Skit (with a connect to society ) 6 L1,L2,L3

I. Introduction: Drama/Learning Program contains three categories of drama
objectives: Self-Management, Collaborative, and Discipline-based Art
Objectives. Self-Management or Intrapersonal Objectives: in order to participate
in drama, which feels like and looks like play, participants must also achieve self-
discipline.
Drama enhances verbal and nonverbal expression of ideas. It improves voice
projection, articulation of words, fluency with language, and persuasive speech.
Listening and observation skills develop by playing drama games, being an
audience, rehearsing, and performing.
Evaluation by faculty as per format
Based on video/types of video captured by students.
6 Presentation and Report 4 L1, L2, L3
I. Presentation will be an amalgamation of four modules, Case study,
brainstorming understanding, Survey and Drama/skit on the topic to connect to
society.

II. Report writing in format.

Evaluation by faculty as per format
Based on Presentation and report written by students
Total Hours (15 hrs. conduct in class in 15 week semester +Self learning 15 30
hours )

Books and References:

Sr. Title Authors Publisher Edition Year

No.

1 Effective Teambuilding. Adair. J Yin Second Edition 1994

Aldershot: GowerCase
study research book

2 A Practical Guide to the Aronow, E., Weiss, Brunner Routledge First Edition 2001
Thematic Apperception K. A., & Rezinkoff
Test. Philadelphia

3 Case Study Research: Gerring, John Cambridge First Edition 2007

Principles and Practices University Press

4 Environmental Studies Nijstad, B. A., European Journal First Edition 2006

Stroebe of Social
Psychology