FIFTH SEMESTER (AIDS)

Paper
Group Paper L P Credits
Code
Theory papers
PC AIDS301 Operating Systems 4 -- 4
PC AIDS303 Design and Analysis of Algorithms 4 - 4
PC AIDS305 Data Mining 4 - 4
PC AIDS307 Computer Organization and Architecture 3 - 3
PC AIDS309 Introduction to Internet of Things 3 - 3
HS/MS AIDS311 Principles of Entrepreneurship Mindset 2 - 2
Practical/Viva-Voce
PC AIDS351 Operating Systems Lab - 2 1
PC AIDS353 Design and Analysis of Algorithms Lab - 2 1
PC AIDS355 Data Mining lab - 2 1
PC AIDS357 Introduction to Internet of Things Lab - 2 1
PC AIDS359 Summer Training Report-1** - 2 1
PC Seminar on Case Study of Emerging Areas of
AIDS361 - 1 1
(NUES) Technology*
Total 20 11 26

Note:
* (NUES): Non-University Exam Subject, Comprehensive evaluation by the concerned teacher, out
of 100, as per detailed syllabus

**(NUES): Comprehensive evaluation by a committee of teachers, constituted by the Academic

Programme Committee (APC), out of 100. The training shall be of 4 to 6 weeks duration. The
training can be under the mentorship of a teacher of the school.

Sixth Semester (AIDS)

Paper Code Paper Credit

Group L P
s
Theory Papers
PC AIDS302 Digital Image Processing 3 3
PCE Programme Core Elective Paper (PCE –1) 4
PCE Programme Core Elective Paper (PCE – 2) 4
PCE Programme Core Elective Paper (PCE – 3) 4
EAE / OAE Emerging Area/Open Area Elective Paper (EAE – 1 /OAE – 1) 4
EAE / OAE Emerging Area/Open Area Elective Paper (EAE – 2 /OAE – 2) 4
Practical / Viva Voce
PC AIDS354 Digital Image Processing Lab 2 1

NSS / NCC / Cultural Clubs / Technical Society / Technical

HS/MS HS-352 2
Club**
(NUES)
Total 26

**NUES: Comprehensive evaluation of the students by the concerned coordinator of NCC / NSS / Cultural
Clubs / Technical Society / Technical Clubs, out of 100 as per the evaluation schemes worked out by these
activity societies, organizations; the coordinators shall be responsible for the evaluation of the same. These
activities shall start from the 1st semester and the evaluation shall be conducted at the end of the 6th semester for
students admitted in the first semester and for Students admitted in the 2nd year as lateral entry the activity
shall start from 3rd semester. The detailed document containing the policy for the award of Marks to be
prepared by APC.
 GURU GOBIND SINGH INDRAPRASTHA UNIVERSITY,
EAST DELHI CAMPUS,
SURAJMAL VIHAR-110092

Detailed SYLLABUS
(3rd Year)
Fifth Semester
for

BACHELOR OF TECHNOLOGY
for

Artificial Intelligence and Data Science

Artificial Intelligence and Machine Learning
Applicable from Batch Admitted in Academic Session 2021-2022 Onwards

Approved by BoS of USAR: 15/06/23, Approved by AC sub-committee : 04/07/23

Applicable from Batch Admitted in Academic Session 2022-23 Onwards Page | 78
 GURU GOBIND SINGH INDRAPRASTHA UNIVERSITY,
EAST DELHI CAMPUS,
SURAJMAL VIHAR-110092

Semester: 5th
Paper code: AIDS301/AIML301 L T/P Credits
Subject: Operating Systems 4 0 4
Marking Scheme:
1. Teachers Continuous Evaluation: As per university examination norms from time to time
2. End Term Theory Examination: As per university examination norms from time to time
INSTRUCTIONS TO PAPER SETTERS: Maximum Marks: As per university norms
1. There should be 9 questions in the end term examination question paper.
2. Question No. 1 should be compulsory and cover the entire syllabus. This question should have
objective or short answer type questions.
3. Apart from Question No. 1, the rest of the paper shall consist of four units as per the syllabus.
Every unit should have two questions. However, students may be asked to attempt only 1 question
from each unit.
4. The questions are to be framed keeping in view the learning outcomes of course/paper. The
standard/ level of the questions to be asked should be at the level of the prescribed textbooks.
5. The requirement of (scientific) calculators/ log-tables/ data-tables may be specified if required.
Course Objectives:
1. To understand the basic concepts and functions of operating systems.
2. To use different process scheduling algorithms and synchronization techniques to achieve
better performance of a computer system.
3. To understand Processes, Threads and Deadlocks and Memory Management algorithms of
operating systems.
4. To analyze the several operating systems and their utilities such Linux, Unix, Window to
develop operating system functions in programming.
Course Outcomes:
CO1 Understand fundamental operating system abstractions such as processes, threads, files,
semaphores, IPC abstractions, shared memory regions, etc.
CO2 Apply process scheduling and memory management concepts.

CO3 Analyze the operating system’s resource management techniques, deadlock management
techniques, memory management techniques.
CO4 Design device drivers and multi-threading libraries for a tiny OS and develop application
programs using UNIX system calls.
Course Outcomes (CO) to Programme Outcomes (PO)
Mapping (Scale 1: Low, 2: Medium, 3: High
CO/ PO01 PO02 PO03 PO04 PO05 PO06 PO07 PO08 PO09 PO10 PO11 PO12
PO
CO1 1 - - - - - - - 1 1 1 -
CO2 3 1 - - - - - - 1 1 1 -
CO3 2 2 - 1 1 - - - 2 1 1 1
CO4 2 1 2 1 1 - 1 - 2 1 2 1

Approved by BoS of USAR: 15/06/23, Approved by AC sub-committee : 04/07/23

Applicable from Batch Admitted in Academic Session 2022-23 Onwards Page | 79
 GURU GOBIND SINGH INDRAPRASTHA UNIVERSITY,
EAST DELHI CAMPUS,
SURAJMAL VIHAR-110092

Course Overview:
This course covers the fundamentals of operating systems, mechanisms, and their
implementations. The core of the course contains concurrent programming (threads and
synchronization), inter process communication, process scheduling, memory management,
input output devices and organization.

Unit I [10]
Introduction: Operating system and function, Evolution of operating system, Batch, Interactive,
Time Sharing and Real Time System, System protection. Operating System Structure: System
Components, System structure, Operating System Services.
CPU Scheduling: Scheduling Concept, process scheduling strategies- First-Come, First-Served
(FCFS) Scheduling, Shortest-Job-Next (SJN) Scheduling, Priority Scheduling, Shortest Remaining
Time, Round Robin (RR) Scheduling, Multiple-Level Queues Scheduling, Performance Criteria of
Scheduling Algorithm, Evolution, Multiprocessor Scheduling.

Unit II [10]
Concurrent Processes: Process concept, Principle of Concurrency, Producer Consumer Problem,
Critical Section problem, Semaphores, Binary and counting semaphores, P() and V() operations,
Classical problems in Concurrency, Inter Process Communication, Process Generation, Process
Scheduling.
Deadlocks: examples of deadlock, resource concepts, necessary conditions for deadlock,
deadlock solution, deadlock prevention, deadlock avoidance with Bankers algorithms, deadlock
detection, deadlock recovery.

Unit III [10]

Memory Organization & Management: Memory Organization, Memory Hierarchy, 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.

Unit IV [10]
I/O Device and the organization: I/O Device and the organization of the I/O function, I/O
Buffering, Disk I/O, Disk Scheduling Algorithms, File system: File Concepts, attributes,
operations, File organization and Access mechanism, disk space allocation methods, Directory
structure, free disk space management, File sharing, Implementation issues. Case studies: Unix
system, Windows XP.

Textbooks:
1. Abraham Silberschatz, Peter B. Galvin, Greg Gagne, “Operating System Concepts”, Wiley,
9th Edition
2. Tannenbaum, “Morden Operating Systems”, Pearson, 4th Edition, 2014

Approved by BoS of USAR: 15/06/23, Approved by AC sub-committee : 04/07/23

Applicable from Batch Admitted in Academic Session 2022-23 Onwards Page | 80
 GURU GOBIND SINGH INDRAPRASTHA UNIVERSITY,
EAST DELHI CAMPUS,
SURAJMAL VIHAR-110092

Reference Books:
1. William Stallings, “Operating Systems –Internals and Design Principles”, 8/E, Pearson
Publications, 2014.
2. Dietel, “An introduction to operating system”, Addison Wesley, 1983

Approved by BoS of USAR: 15/06/23, Approved by AC sub-committee : 04/07/23

Applicable from Batch Admitted in Academic Session 2022-23 Onwards Page | 81
 GURU GOBIND SINGH INDRAPRASTHA UNIVERSITY,
EAST DELHI CAMPUS,
SURAJMAL VIHAR-110092

Semester: 5th
Paper code: AIDS303/AIML303 L T/P Credits
Subject: Design and Analysis of Algorithms 4 0 4
Marking Scheme:
1. Teachers Continuous Evaluation: As per university examination norms from time to time
2. End Term Theory Examination: As per university examination norms from time to time
INSTRUCTIONS TO PAPER SETTERS: Maximum Marks: As per university norms
1. There should be 9 questions in the end term examination question paper.
2. Question No. 1 should be compulsory and cover the entire syllabus. This question should have
objective or short answer type questions.
3. Apart from Question No. 1, the rest of the paper shall consist of four units as per the syllabus.
Every unit should have two questions. However, students may be asked to attempt only 1 question
from each unit.
4. The questions are to be framed keeping in view the learning outcomes of course/paper. The
standard/ level of the questions to be asked should be at the level of the prescribed textbooks.
5. The requirement of (scientific) calculators/ log-tables/ data-tables may be specified if required.
Course Objectives:
1. To understand and apply the algorithm analysis techniques to generate solution space.
2. To critically analyze the efficiency of alternative algorithmic solutions for the same problem.
3. To analyze different algorithm design techniques.
4. To classify a problem as computationally tractable or intractable, and discuss strategies to
address intractability
Course Outcomes:
CO1 Understand the asymptotic performance of algorithms to analyze formal correctness proof for
algorithms
CO2 Apply major algorithms’ knowledge and data-structures corresponding to each algorithm
design paradigm
CO3 Design efficient algorithms for common computer engineering design problems
CO4 Classify a problem as computationally tractable or intractable, and discuss strategies to
address intractability
Course Outcomes (CO) to Programme Outcomes (PO) Mapping
(Scale 1: Low, 2: Medium, 3: High)
CO/ PO01 PO02 PO03 PO04 PO05 PO06 PO07 PO08 PO09 PO10 PO11 PO12
PO
CO1 2 1 1 1 1 - - 1 1 1 1 2
CO2 2 2 1 1 1 - - 1 1 1 1 2
CO3 2 2 2 1 1 - - - - - 1 3
CO4 2 2 2 2 1 1 - - - - 1 2

Approved by BoS of USAR: 15/06/23, Approved by AC sub-committee : 04/07/23

Applicable from Batch Admitted in Academic Session 2022-23 Onwards Page | 82
 GURU GOBIND SINGH INDRAPRASTHA UNIVERSITY,
EAST DELHI CAMPUS,
SURAJMAL VIHAR-110092

Course Overview:
This course is designed to enable the student to design and analyze algorithms for the
problems. This course covers basic strategies of algorithm design: top-down design, divide and
conquer, asymptotic costs, applications to sorting and searching, matrix algorithms, shortest-
path and spanning tree problems, dynamic programming, greedy algorithms and graph
algorithms.

UNIT I [10]
Introduction to Algorithms: Time Complexity and Space Complexity, Asymptotic analysis,
Growth rates, some common bounds (constant, logarithmic, linear, polynomial, exponential),
Complexity Analysis techniques: Master theorem, Substitution Method, Iteration Method, Time
complexity of Recursive algorithms. art of problem-solving and decision making, role of data
structure in algorithm design, Basic algorithmic structures of problem-solving and optimization
algorithms, constraints, solution space, and feasible reasons, and representation of solution
space. Sorting and searching algorithms: Selection sort, bubble sort, insertion sort, Sorting in
linear time, count sort, Linear search.

UNIT II [10]
Divide and Conquer Algorithms: Overview of Divide and Conquer algorithms, Quick sort,
Merge sort, Heap sort, Binary search, Matrix Multiplication, Convex hull and Searching, Closest
Pair of Points.
Greedy Algorithms: Greedy methods with examples, Huffman Coding, Knapsack, Minimum cost
Spanning trees – Prim’s and Kruskal’s algorithms, Single source shortest paths – Dijkstra’s and
Bellman Ford algorithms.

UNIT III [10]

Dynamic programming: Dynamic programming with examples such as Knapsack, shortest path
in graph All pair shortest paths –Warshal’s and Floyd’s algorithms, Resource allocation problem.
Backtracking, Branch and Bound with examples such as Traveling Salesman Problem, longest
common sequence, n-Queen Problem.

UNIT IV: [10]

Graph Algorithms: Graphs and their Representations, Graph Traversal Techniques: Breadth
First Search (BFS) and Depth First Search (DFS), Applications of BFS and DFS, Bipartite graphs.
Graph Coloring, Hamiltonian Cycles and Sum of subsets.
Computational complexity: Problem classes: P, NP, NP-complete, NP-hard. Reduction. The
satisfiability problem, vertex cover, independent set and clique problems Cook’s theorem.
Examples of NP-complete problems.

Textbooks:
1. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, “Introduction to
Algorithms”, PHI ,4th Edition
2. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++”, Third Edition, Pearson
Education, 2006

Approved by BoS of USAR: 15/06/23, Approved by AC sub-committee : 04/07/23

Applicable from Batch Admitted in Academic Session 2022-23 Onwards Page | 83
 GURU GOBIND SINGH INDRAPRASTHA UNIVERSITY,
EAST DELHI CAMPUS,
SURAJMAL VIHAR-110092

Reference Books:
1. Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran, “Fundamentals of Computer
Algorithms”, Second Edition, Universities Press, 2011.
2. Anany Levitin. “Introduction to the Design and Analysis of Algorithms”, Pearson.

Approved by BoS of USAR: 15/06/23, Approved by AC sub-committee : 04/07/23

Applicable from Batch Admitted in Academic Session 2022-23 Onwards Page | 84
 GURU GOBIND SINGH INDRAPRASTHA UNIVERSITY,
EAST DELHI CAMPUS,
SURAJMAL VIHAR-110092

Semester: 5th
Paper code: AIDS305 L T/P Credits
Subject: Data Mining 4 0 4
Marking Scheme:
1. Teachers Continuous Evaluation: As per university examination norms from time to time
2. End Term Theory Examination: As per university examination norms from time to time
INSTRUCTIONS TO PAPER SETTERS: Maximum Marks: As per university norms
1. There should be 9 questions in the end term examination question paper.
2. Question No. 1 should be compulsory and cover the entire syllabus. This question should have
objective or short answer type questions.
3. Apart from Question No. 1, the rest of the paper shall consist of four units as per the syllabus.
Every unit should have two questions. However, students may be asked to attempt only 1 question
from each unit.
4. The questions are to be framed keeping in view the learning outcomes of course/paper. The
standard/ level of the questions to be asked should be at the level of the prescribed textbooks.
5. The requirement of (scientific) calculators/ log-tables/ data-tables may be specified if required.
Course Objectives:
1. To identify the different types of data and using data pre-processing techniques applicable on
the dataset.
2. To evaluate various classification and clustering techniques on real world datasets.
3. To apply data mining techniques on complex data types.
4. To analyze different association rule mining and sequence mining techniques.
Course Outcomes:
CO1 Interpret the basic concepts of data mining techniques to identify interesting and relevant
patterns.
CO2 Apply and perform pre-processing steps to prepare the data and get insights into the dataset.

CO3 Analyze different association rules identified using association rule mining or sequence mining
on real life datasets.
CO4 Design and Develop models using classification and clustering techniques on complex data
types.
Course Outcomes (CO) to Programme Outcomes (PO) Mapping
(Scale 1: Low, 2: Medium, 3: High)
CO/ PO01 PO02 PO03 PO04 PO05 PO06 PO07 PO08 PO09 PO10 PO11 PO12
PO
CO1 2 1 2 - 3 - - 1 - - - -
CO2 2 2 2 3 - - - - 1 - - -
CO3 2 - 2 3 - 1 - - 1 - -
CO4 2 2 3 3 - - - - 1 2

Course Overview:
The subject gives a detailed overview on data mining as a process starting from pre-processing
the dataset to classification/clustering techniques on the data. The students are introduced to

Approved by BoS of USAR: 15/06/23, Approved by AC sub-committee : 04/07/23

Applicable from Batch Admitted in Academic Session 2022-23 Onwards Page | 85
 GURU GOBIND SINGH INDRAPRASTHA UNIVERSITY,
EAST DELHI CAMPUS,
SURAJMAL VIHAR-110092

different techniques that can be applied to various types of complex data. Concepts like
association rule mining and ensemble methods are also discussed in this subject.

UNIT I [8]
Data Mining Basics- What is Data Mining, Kinds of Patterns to be Mined, Tasks of Data Mining,
Data Mining Applications- The Business Context of Data Mining, Data Mining as a Research Tool,
Data Mining for Marketing, Benefits of Data Mining, Date Warehousing vs Data Mining.

UNIT II [12]
Data Pre-processing- Review of Data Pre-processing: Types of Data, Data Quality, Measurement
and Data Collection Issues, Feature Subset Selection, Feature Creation, Data Discretization and
Binning, Knowledge Discovery in Databases.

UNIT III [10]

Machine Learning in Data Mining - Types of classifiers, Rule based classifiers, Model Selection,
Model Evaluation, Ensemble Methods, Bias-Variance trade-off, Handling Class Imbalance
Problem, Association Rule Mining - Mining Frequent Patterns, Market Basket Analysis, Apriori
algorithm, Data Mining using decision trees and KNN algorithm.

UNIT IV [10]
Cluster Analysis- Different Types of Clusters, Hierarchical Methods of Clustering, Density based
Clustering: DBSCAN algorithm, Cluster Evaluation. Outlier Analysis, Outlier Detection Methods,
Mining Complex Data Types, avoiding False Discoveries.

Textbooks:
1. Tan Pang- Ning, Steinbach M., Viach, Kumar V., “Introduction to Data Mining”, Second
Edition, Pearson, 2013.
2. Han J., Kamber M. and Pei J., “Data Mining Concepts and Techniques”, Second Edition, Hart
Court India P. Ltd., Elsevier Publications, 2001.

Approved by BoS of USAR: 15/06/23, Approved by AC sub-committee : 04/07/23

Applicable from Batch Admitted in Academic Session 2022-23 Onwards Page | 86
 GURU GOBIND SINGH INDRAPRASTHA UNIVERSITY,
EAST DELHI CAMPUS,
SURAJMAL VIHAR-110092

Reference Books:
1. Zaki M.J., Meira W., “Data Mining and Machine Learning: Fundamental Concepts and
Algorithms”, Second Edition, Cambridge University Press, 2020
2. Witten, E. Frank, M. Hall, “Data Mining: Practical Machine Learning Tools and Techniques”,
Morgan Kaufmann Publishers, 2011.

Approved by BoS of USAR: 15/06/23, Approved by AC sub-committee : 04/07/23

Applicable from Batch Admitted in Academic Session 2022-23 Onwards Page | 87
 GURU GOBIND SINGH INDRAPRASTHA UNIVERSITY,
EAST DELHI CAMPUS,
SURAJMAL VIHAR-110092

Semester: 5th
Paper code: AIML305 L T/P Credits
Subject: Fundamentals of Deep Learning 4 0 4
Marking Scheme:
1. Teachers Continuous Evaluation: As per university examination norms from time to time
2. End Term Theory Examination: As per university examination norms from time to time
INSTRUCTIONS TO PAPER SETTERS: Maximum Marks: As per university norms
1. There should be 9 questions in the end term examination question paper.
2. Question No. 1 should be compulsory and cover the entire syllabus. This question should have
objective or short answer type questions.
3. Apart from Question No. 1, the rest of the paper shall consist of four units as per the syllabus.
Every unit should have two questions. However, students may be asked to attempt only 1 question
from each unit.
4. The questions are to be framed keeping in view the learning outcomes of course/paper. The
standard/ level of the questions to be asked should be at the level of the prescribed textbooks.
5. The requirement of (scientific) calculators/ log-tables/ data-tables may be specified if required.
Course Objectives:
1. To learn basic computational units inspired from biological systems (brain).
2. To study various algorithms in deep learning for various domains.
3. To understand fundamental machine learning concepts w.r.t. neural networks.
4. To apply deep learning models to solve sequence and vision problems.
Course Outcomes:
CO1 Interpret the basic computational units inspired from biological systems (brain).
CO2 Identify the deep learning algorithms which are more appropriate for various types of learning
tasks in various domains.
CO3 Define the fundamental machine learning concepts w.r.t. neural networks.
CO4 Apply basic deep learning models to solve sequence-based problems and vision problems.
Course Outcomes (CO) to Programme Outcomes (PO) Mapping
(Scale 1: Low, 2: Medium, 3: High)
CO/ PO01 PO02 PO03 PO04 PO05 PO06 PO07 PO08 PO09 PO10 PO11 PO12
PO
CO1 3 1 1 1 2 - - - 2 1 2 1
CO2 3 1 1 1 2 1 1 1 2 1 2 2
CO3 3 1 1 1 2 1 1 1 2 1 2 2
CO4 3 1 1 1 2 1 1 1 2 1 2 2

Course Overview:
The main objective of this course is to develop the understanding of key mathematical principles
which are used behind the working of neural networks. Convolution Neural Networks and
Recurrent Neural Networks have also been covered in this course. This course also provides the
details for usage of Deep Learning for Natural Language Processing.

Approved by BoS of USAR: 15/06/23, Approved by AC sub-committee : 04/07/23

Applicable from Batch Admitted in Academic Session 2022-23 Onwards Page | 88
 GURU GOBIND SINGH INDRAPRASTHA UNIVERSITY,
EAST DELHI CAMPUS,
SURAJMAL VIHAR-110092

Unit I: [10]
Introduction to Deep Learning: Introduction to Deep Learning, Bayesian Learning, Overview of
Shallow Machine Learning, Difference between Deep Learning and Shallow Learning, Linear
Classifiers ,Loss Function and Optimization Techniques -Gradient Descent and batch
optimization.

Unit II: [10]

Introduction to Neural Network: Introduction to Neural Network, Biological Neuron, Idea of
computational units, McCulloch–Pitts unit and Thresholding logic Artificial Neural Networks:
Single Layer Neural Network, Multilayer Perceptron, Back Propagation through time.
Architectural Design Issues.

Unit III: [10]

Training deep neural networks: Difficulty of training deep neural networks, Activation Function,
Evaluating, Improving and Tuning the ANN. Hyper parameters Vs Parameters, Greedy layer wise
training, Recurrent Neural Networks, Long Short-Term Memory, Gated Recurrent Units,
Bidirectional LSTMs, Bidirectional RNNs.

Unit IV: [10]

Convolutional Neural Networks: Convolutional Neural Networks, Building blocks of CNN,
Transfer Learning , Pooling Layers , Convolutional Neural Network Architectures.Well known
case studies: LeNet, AlexNet, VGG-16, ResNet, Inception Net.Applications in Vision, Speech, and
Audio-Video.

Text Books
1. Richard O. Duda,” Pattern classification, Wiley, 2022
2. Adam Gibson and Josh Patterson, “Deep Learning: A Practical approach”, 2017
3. Deep Learning, Ian Goodfellow and Yoshua Bengio and Aaron Courville, MIT Press, 2016.

Reference Books
1. Charu C. Aggarwal, “Neural Networks and Deep Learning”, 2018
2. Duda, R.O. and Hart, P.E., Pattern classification. John Wiley & Sons, 2006.

Approved by BoS of USAR: 15/06/23, Approved by AC sub-committee : 04/07/23

Applicable from Batch Admitted in Academic Session 2022-23 Onwards Page | 89
 GURU GOBIND SINGH INDRAPRASTHA UNIVERSITY,
EAST DELHI CAMPUS,
SURAJMAL VIHAR-110092

Semester: 5th
Paper code: AIDS307/AIML307 L T/P Credits
Subject: Computer Organization & Architecture 3 0 3
Marking Scheme:
1. Teachers Continuous Evaluation: As per university examination norms from time to time
2. End Term Theory Examination: As per university examination norms from time to time
INSTRUCTIONS TO PAPER SETTERS: Maximum Marks: As per university norms
1. There should be 9 questions in the end term examination question paper.
2. Question No. 1 should be compulsory and cover the entire syllabus. This question should have
objective or short answer type questions.
3. Apart from Question No. 1, the rest of the paper shall consist of four units as per the syllabus.
Every unit should have two questions. However, students may be asked to attempt only 1 question
from each unit.
4. The questions are to be framed keeping in view the learning outcomes of course/paper. The
standard/ level of the questions to be asked should be at the level of the prescribed textbooks.
5. The requirement of (scientific) calculators/ log-tables/ data-tables may be specified if required.
Course Objectives:
1. To understand the basic concepts of computer operation.
2. To analyze different memory hierarchies along with their mapping.
3. To apply and analyze different pipelining and parallelism.
4. To implement various signed and unsigned arithmetic operations with digital hardware.
Course Outcomes:
CO1 Interpreting the basic concepts of register transfer language and computer operations.
CO2 Apply and analyze various instruction formats for CPU/GPU together with a variety of
addressing modes.
CO3 Analyze different types of Parallel Computer Models.
CO4 Implementing arithmetic operations with digital hardware.
Course Outcomes (CO) to Programme Outcomes (PO) Mapping
(Scale 1: Low, 2: Medium, 3: High)
CO/ PO01 PO02 PO03 PO04 PO05 PO06 PO07 PO08 PO09 PO10 PO11 PO12
PO
CO1 1 1 1 1 1 2
CO2 2 1 1 1 1 3
CO3 3 2 3 2 1 1 1 1 3
CO4 1 1 1 1 2

Course Overview:
This course enables the students to understand the principles of computer organization and the
basic architectural concepts. It begins with basic organization, design, and programming of a
simple digital computer and introduces simple register transfer language to specify various
computer operations. Topics include computer arithmetic, instruction set design,

Approved by BoS of USAR: 15/06/23, Approved by AC sub-committee : 04/07/23

Applicable from Batch Admitted in Academic Session 2022-23 Onwards Page | 90
 GURU GOBIND SINGH INDRAPRASTHA UNIVERSITY,
EAST DELHI CAMPUS,
SURAJMAL VIHAR-110092

microprogrammed control unit, pipelining and vector processing, memory organization and I/O
systems, and multiprocessors.

Unit I [8]
Register Transfer Language: Register transfer language, bus and memory transfer, bus
architecture using multiplexer and tri-state buffer, micro-operation: arithmetic, logical, shift
micro-operation with hardware implementation, arithmetic logic shift unit.
Computer Organization and Design: Instruction codes, general computer registers with common
bus system, computer instructions: memory reference, register reference, input-output
instructions, timing and control, instruction cycle, input-output configuration, and interrupt
cycle. Levels of programming languages: Machine language, Assembly language, High level
language.

Unit II [8]
Central processing Unit: Introduction, general register organization, stack organization,
instruction format, addressing modes. Overview of GPU, CPU vs GPU computing difference.
Memory Hierarchy: Introduction, basics of cache, measuring and improving of cache
performance, cache memory: associative mapping, direct mapping, set-associative mapping,
cache writing and initialization, virtual memory, common framework for memory hierarchies.
Case study of PIV and AMD opteron memory hierarchies.

Unit III [8]

Parallel Computer Models: The state of computing, classification of parallel computers,
multiprocessors and multicomputers, multivector and SIMD computers. Program and Network
Properties: conditions of parallelism, data and resource dependences, hardware and software
parallelism, program partitioning and scheduling, grain size and latency, program flow
mechanisms, control flow versus data flow, data flow Architecture, demand driven mechanisms,
comparisons of flow mechanisms.

Unit IV [8]
Pipelining: Introduction to Flynn‘s classification, arithmetic pipeline, instruction pipeline, pipeline
conflict and hazards, RISC pipeline, vector processing.
Arithmetic for Computers: Unsigned, signed 1‘s, 2‘s compliment notations, addition, subtraction,
multiplication and division (hardware implementation), CPU performance and its factors,
evaluating performance of CPU.

Textbooks:
1. M. Morris, Mano, “Computer System Architecture”, PHI 3rd Edition 2007.
2. Kai Hwang, “Advanced computer architecture”; TMH. 2000
3. D. A. Patterson and J. L. Hennessey, “Computer organization and design”, Morgan
Kaufmann, 2nd Ed. 2002

Reference Books:
1. W. Stallings, “Computer organization and Architecture”, PHI, 7th ed, 2005.

Approved by BoS of USAR: 15/06/23, Approved by AC sub-committee : 04/07/23

Applicable from Batch Admitted in Academic Session 2022-23 Onwards Page | 91
 GURU GOBIND SINGH INDRAPRASTHA UNIVERSITY,
EAST DELHI CAMPUS,
SURAJMAL VIHAR-110092

2. Harvey G.Cragon,”Memory System and Pipelined processors”; Narosa Publication. 1998

3. V.Rajaranam & C.S.R.Murthy, “Parallel computer”; PHI. 2002
4. R.K.Ghose, Rajan Moona & Phalguni Gupta, “Foundation of Parallel Processing”, Narosa
Publications, 2003.

Approved by BoS of USAR: 15/06/23, Approved by AC sub-committee : 04/07/23

Applicable from Batch Admitted in Academic Session 2022-23 Onwards Page | 92
 GURU GOBIND SINGH INDRAPRASTHA UNIVERSITY,
EAST DELHI CAMPUS,
SURAJMAL VIHAR-110092

Semester: 5th
Paper code: AIDS309/AIML309 L T/P Credits
Subject: Introduction to Internet of Things 3 0 3
Marking Scheme:
1. Teachers Continuous Evaluation: As per university examination norms from time to time
2. End Term Theory Examination: As per university examination norms from time to time
INSTRUCTIONS TO PAPER SETTERS: Maximum Marks: As per university norms
1. There should be 9 questions in the end term examination question paper.
2. Question No. 1 should be compulsory and cover the entire syllabus. This question should have
objective or short answer type questions.
3. Apart from Question No. 1, the rest of the paper shall consist of four units as per the syllabus.
Every unit should have two questions. However, students may be asked to attempt only 1 question
from each unit.
4. The questions are to be framed keeping in view the learning outcomes of course/paper. The
standard/ level of the questions to be asked should be at the level of the prescribed textbooks.
5. The requirement of (scientific) calculators/ log-tables/ data-tables may be specified if required.
Course Objectives:
1. To learn fundamentals of IoT and how to build IoT based systems
2. To emphasize on development of Industrial IoT applications
3. To recognize the factors that contributed to the emergence of IoT
4. To utilize and implement solid theoretical foundation of the IoT Platform and System Design.
Course Outcomes:
CO1 Ability to understand design flow of IoT based systems
CO2 Analyse and understand different communication protocols for connecting IoT nodes to server
CO3 Apply coding concepts to design real-time IoT solutions
CO4 Develop the state-of-the-art IoT based systems, suitable for real life and Industry applications
Course Outcomes (CO) to Programme Outcomes (PO) Mapping
(Scale 1: Low, 2: Medium, 3: High)
CO/ PO01 PO02 PO03 PO04 PO05 PO06 PO07 PO08 PO09 PO10 PO11 PO12
PO
CO1 - - 2 2 2 - 1 1 - - 1 1
CO2 - - 2 2 2 - 1 - - - 1 1
CO3 - - 2 2 2 - 1 - - - 1 1
CO4 1 1 3 2 2 1 1 1 1 1 1 1

Course Overview:
The course enables student to understand the basics of Internet of things and protocols. It
introduces some of the application areas where Internet of Things can be applied. Students will
learn about the middleware for Internet of Things. The course addresses various components of
Internet of things such as Sensors, internetworking, protocols. In the end students will also be
able to design and implement IoT circuits and solutions.

Approved by BoS of USAR: 15/06/23, Approved by AC sub-committee : 04/07/23

Applicable from Batch Admitted in Academic Session 2022-23 Onwards Page | 93
 GURU GOBIND SINGH INDRAPRASTHA UNIVERSITY,
EAST DELHI CAMPUS,
SURAJMAL VIHAR-110092

UNIT I [8]
The Internet of Things: An Overview of what is IoT? Why IoT? Explain the definition and usage of
the term "Internet of Things (IOT)" in different contexts. Design Principles for Connected
Devices, internet principles: internet communications-An overview, Physical Design of IoT,
Logical Design of IoT, IoT standards, IoT generic architecture and IoT protocols. IoT future trends,
Understand IoT Applications and Examples. Understand various IoT architectures based on
applications. Understand different classes of sensors and actuators. Sensors: sensor terminology,
sensor dynamics and specifications. Understand the basics of hardware design needed to build
useful circuits using basic sensors and actuators.

UNIT II [8]
Communication protocols and Arduino Programming: Understand various network protocols
used in IoT, Understand various communication protocols (SPI, I2C, UART). Design and develop
Arduino code needed to communicate the microcontroller with sensors and actuators, build
circuits using IoT supported Hardware platforms such as Arduino, ESP8266 etc., Use of software
libraries with an Arduino sketch that allows a programmer to use complicated hardware without
dealing with complexity, Learning IoT application programming and build solutions for real life
problems and test them in Arduino and Node MCU environments. Understand various wireless
Technologies for IoT and its range, frequency and applications.

UNIT III [8]

Fundamentals of IEEE 802.15.4, Zigbee and 6LOWPAN: Importance of IEEE 802.15.4 MAC and
IEEE 802.15.4 PHY layer in constrained networks and their header format, Importance of Zigbee
technology and its applications, use of IPv6 in IoT Environments, Understanding importance of
IPv6 and how constrained nodes deal with bigger headers (IPv6). Understand IPv6 over Low-
Power WPAN (6LoWPAN) and role of 6LoWPAN in wireless sensor network. Various routing
techniques in constrained network. Understanding IoT Application Layer Protocols: HTTP, CoAP
Message Queuing Telemetry Transport (MeTT).

UNIT IV [8]
Application areas and Real-time Case Studies: Role of big data, cloud computing and data
analytics in a typical IoT system. Analyze various case studies implementing IoT in real world
environment and find out the solutions of various deployment issues. Smart parking system,
Smart irrigation system-block diagram, sensors, modules on Arduino and Node MCU.

Text Books:
5. "IoT Fundamentals: Networking Technologies, Protocols, and Use Cases for the Internet of
things" by David Hanes, Cisco Press.
6. Internet of things with ESP 8266, Macro Schwartz, Pact publication.
7. Bahga, A., & Madisetti, V. (2014). Internet of Things: A hands-on approach. Vpt.
8. Francis daCosta, “Rethinking the Internet of Things: A Scalable Approach to Connecting
Everything”, 1st Edition, Apress Publications, 2013

Approved by BoS of USAR: 15/06/23, Approved by AC sub-committee : 04/07/23

Applicable from Batch Admitted in Academic Session 2022-23 Onwards Page | 94
 GURU GOBIND SINGH INDRAPRASTHA UNIVERSITY,
EAST DELHI CAMPUS,
SURAJMAL VIHAR-110092

Reference Books:
5. Building the Internet of Things with IPv6 and MIPv6 The Evolving World of M2M
Communications, Daniel Minoli, Wiley Publications.
6. Mastering internet of things by Peter Waher, Pact publication.
7. The Internet of Things: connecting objects to the web, Hakima chaouchi, Wiley Publications.
8. Course Era: "Interfacing with the Arduino" by Ian Harris, University of Irvine, California.

Approved by BoS of USAR: 15/06/23, Approved by AC sub-committee : 04/07/23

Applicable from Batch Admitted in Academic Session 2022-23 Onwards Page | 95
 GURU GOBIND SINGH INDRAPRASTHA UNIVERSITY,
EAST DELHI CAMPUS,
SURAJMAL VIHAR-110092

Semester: 5th
Paper code: AIDS 311/AIML 311 L T/P Credits
Subject: Principles of Entrepreneurship Mindset 2 0 2
Marking Scheme:
1. Teachers Continuous Evaluation: As per university examination norms from time to time
2. End Term Theory Examination: As per university examination norms from time to time
INSTRUCTIONS TO PAPER SETTERS: Maximum Marks: As per university norms
1. There should be 9 questions in the end term examination question paper.
2. Question No. 1 should be compulsory and cover the entire syllabus. This question should have
objective or short answer type questions.
3. Apart from Question No. 1, the rest of the paper shall consist of four units as per the syllabus.
Every unit should have two questions. However, students may be asked to attempt only 1 question
from each unit.
4. The questions are to be framed keeping in view the learning outcomes of course/paper. The
standard/ level of the questions to be asked should be at the level of the prescribed textbooks.
5. The requirement of (scientific) calculators/ log-tables/ data-tables may be specified if required.
Course Objectives:
1. Identify and apply the attitudes, values, characteristics, behaviour, and processes associated
with possessing an entrepreneurial & innovation mindset and engaging in successful
appropriate entrepreneurial and innovative behaviour.
2. Understand the basic concepts of finance and marketing for first time entrepreneurs.
3. Study Business Model Canvas and apply it for product and services area.
4. Create and write a business plan.
Course Outcomes:
CO1 Apply the attitudes, values, characteristics, behaviour, and processes associated with
possessing an entrepreneurial & innovation mindset and engaging in successful appropriate
entrepreneurial and innovative behaviour.
CO2 Conceptualize the basic concepts of finance and marketing.
CO3 Evaluate the business model canvas and apply the same for product and services area.
CO4 Create and write a business plan.
Course Outcomes (CO) to Programme Outcomes (PO) Mapping
(Scale 1: Low, 2: Medium, 3: High)
CO/ PO01 PO02 PO03 PO04 PO05 PO06 PO07 PO08 PO09 PO10 PO11 PO12
PO
CO1 1 2 3 3 1 1 - 1 1 - - 2
CO2 2 2 3 3 1 1 - 1 1 - - 2
CO3 2 2 3 3 1 1 - 1 2 - - 2
CO4 2 2 3 3 2 1 1 1 2 - - 2

Approved by BoS of USAR: 15/06/23, Approved by AC sub-committee : 04/07/23

Applicable from Batch Admitted in Academic Session 2022-23 Onwards Page | 96
 GURU GOBIND SINGH INDRAPRASTHA UNIVERSITY,
EAST DELHI CAMPUS,
SURAJMAL VIHAR-110092

Course Overview:
This course gives exposure to the students for the core entrepreneurship concepts. Three real
time case studies have been covered to give the students real time understanding of setting up a
startup. Business canvas model has been covered under the syllabus followed by the finance and
marketing skills for budding entrepreneurs. Students will be able to create and write a business
plan after the completion of the course.

Unit I [6]
Introduction to Entrepreneurship and Innovation: Entrepreneurship: Concepts,
entrepreneurship mindset, challenges; Innovation: What is innovation, role of technology,
creating new ventures through innovative initiatives; Business opportunities: concepts &
techniques for identifying opportunities, writing a problem statement, tools and techniques for
idea generation; Introduction to social entrepreneurship. Study and Analyze at least three case
studies of startups in computing (mixture of both successful and failed startups, an Indian
startup, startup by a student)

Unit II [6]
Understanding Business Model Canvas: Introduction to Business Model Canvas; customer
segments; value proposition, distribution channels; Customer Relationship, Revenue Streams,
Key Resources, Key Activities, Key Partnerships, Cost Structure, Preparing a business model
canvas of a problem statement

Unit III [6]

Finance and Marketing for early entrepreneurs: Basic understanding of P&L, Balance sheet and
cash flow; Understanding of terms like CAGR, NPV, Angle funding, Venture capital, Debt
funding, Equity, private equity, valuation, Break-even analysis, Return on Investment, Working
Capital, Cost of Good Sold, Customer Acquisition cost, Customer life time value, profit margins.
Marketing for budding entrepreneurs: Understanding customer requirements, Customer
Profiling and segmentation, Marketing strategy, 4Ps of Marketing, Network effect.

Unit IV [6]
Creating and writing a Business Plan: Introduction to different Business Models. Process of
Business Planning - Purpose, structure and content, business plan outline, how to write Business
plan, Preparing a business plan of a problem statement. Application of Business Model Canvas
in creating the business plan. Understand customer needs, design and conduct a survey.
Presentation of Business Plan. Process of incorporating a new company in India.

Textbooks:
1. “Business Model Generation: A Handbook for Visionaries, Game Changers, and
Challengers” by Alexander Osterwalder, Yves Pigneur
2. “Making Breakthrough Innovation Happen” by Porus Munshi
3. Ries Eric (2011), “The lean Start-up: How constant innovation creates radically successful
businesses”, Penguin Books Limited.

Approved by BoS of USAR: 15/06/23, Approved by AC sub-committee : 04/07/23

Applicable from Batch Admitted in Academic Session 2022-23 Onwards Page | 97
 GURU GOBIND SINGH INDRAPRASTHA UNIVERSITY,
EAST DELHI CAMPUS,
SURAJMAL VIHAR-110092

Reference Books:
1. Blank, Steve (2013), “The Startup Owner’s Manual: The Step-by-Step Guide for Building
a Great Company”, K&S Ranch.
2. S. Carter and D. Jones-Evans, “Enterprise and small business- Principal Practice and
Policy”, Pearson Education (2006)
3. T. H. Byers, R. C. Dorf, A. Nelson, “Technology Ventures: From Idea to Enterprise”,
McGraw Hill (2013)
4. Osterwalder, Alex and Pigneur, Yves (2010) “Business Model Generation”.
5. Kachru, Upendra, “India Land of a Billion Entrepreneurs”, Pearson
6. Bagchi, Subroto, (2008), “Go Kiss the World: Life Lessons for the Young Professional”,
Portfolio Penguin
7. Bagchi, Subroto, (2012). “MBA At 16: a Teenager’s Guide to Business”, Penguin Books
8. Mitra, Sramana (2008), “Entrepreneur Journeys (Volume 1)”, Booksurge Publishin
9. Abrams, R. (2006). “Six-week Start-up”, Prentice-Hall of India
10. Verstraete, T. and Laffitte, E.J. (2011). “A Business Model of Entrepreneurship”, Edward
Elgar Publishing.
11. Johnson, Steven (2011). “Where Good Ideas comes from”, Penguin Books Limited.
12. Gabor, Michael E. (2013), “Awakening the Entrepreneur Within”, Primento.
13. Guillebeau, Chris (2012), “The $100 startup: Fire your Boss, Do what you love and work
better to live more”, Pan Macmillan
14. Kelley, Tom (2011), “The ten faces of innovation, Currency Doubleday”
15. Prasad, Rohit (2013), “Start-up sutra: what the angels won’t tell you about business and life”,
Hachette India.

Approved by BoS of USAR: 15/06/23, Approved by AC sub-committee : 04/07/23

Applicable from Batch Admitted in Academic Session 2022-23 Onwards Page | 98
 GURU GOBIND SINGH INDRAPRASTHA UNIVERSITY,
EAST DELHI CAMPUS,
SURAJMAL VIHAR-110092

Semester: 5th
Paper code: AIDS351/AIML351 L T/P Credits
Subject: Operating Systems Lab 0 2 1
Marking Scheme:
1. Teachers Continuous Evaluation: As per university examination norms from time to time
2. End term Examination: As per university examination norms from time to time
INSTRUCTIONS TO EVALUATORS: Maximum Marks: As per university norms
1. This is the practical component of the corresponding theory paper.
2. The practical list shall be notified by the teacher in the first week of the class
commencement under the intimation to the office of the HOD/ Institution in which they
appear is being offered from the list of practicals below.
3. Instructors can add any other additional experiments over and above the mentioned in the
experiment list which they think is important.
4. At least 8 experiments must be performed by the students.
Course Objectives:
1. To apply the concepts of storage management, process scheduling using programming
languages.
2. To study Several Operating systems and their commands to analyze the memory
management, process scheduling concepts.
Course Outcomes:
CO1 Apply the techniques used to implement processes and threads as well as the different
algorithms for process scheduling.
CO2 Implement the basic commands of the OS and will execute the various system calls,
process synchronization problems using semaphore.
Course Outcomes (CO) to Programme Outcomes (PO) Mapping
(Scale 1: Low, 2: Medium, 3: High)
CO/PO PO01 PO02 PO03 PO04 PO05 PO06 PO07 PO08 PO09 PO10 PO11 PO12
CO1 2 2 - 1 1 - - - 1 1 1 1
CO2 3 2 2 1 1 - 1 - 2 1 2 1

List of Experiments:
1. Write a C program to implement FCFS scheduling algorithm.
2. Write a C program to implement a round robin scheduling algorithm.
3. Implementation of the following Memory Allocation Methods for fixed partition a) First Fit b)
Worst Fit c) Best Fit.
4. Write a program to implement reader/writer problems using semaphore.
5. Write a program to implement Banker’s algorithm for deadlock avoidance.
6. To study of basic UNIX commands and various UNIX editors such as vi, ed, ex and EMACS

Approved by BoS of USAR: 15/06/23, Approved by AC sub-committee : 04/07/23

Applicable from Batch Admitted in Academic Session 2022-23 Onwards Page | 99
 GURU GOBIND SINGH INDRAPRASTHA UNIVERSITY,
EAST DELHI CAMPUS,
SURAJMAL VIHAR-110092

7. Process Management a) fork() b) execv() c) execlp() d) wait() and e) sleep()

A. Program to implement the fork function using C.
B. Program to implement execv function using C.
C. Program to implement execlp function.
D. Program to implement wait function using C.
E. Program to implement sleep function using C.
8. To write simple shell programs by using conditional, branching and looping statements.
9. Write a Shell Program to swap the two integers.

Approved by BoS of USAR: 15/06/23, Approved by AC sub-committee : 04/07/23

Applicable from Batch Admitted in Academic Session 2022-23 Onwards Page | 100
 GURU GOBIND SINGH INDRAPRASTHA UNIVERSITY,
EAST DELHI CAMPUS,
SURAJMAL VIHAR-110092

Semester: 5th
Paper code: AIDS353/AIML353 L T/P Credits
Subject: Design and Analysis of Algorithms Lab 0 2 1
Marking Scheme:
1. Teachers Continuous Evaluation: As per university examination norms from time to time
2. End term Examination: As per university examination norms from time to time
INSTRUCTIONS TO EVALUATORS: Maximum Marks: As per university norms
1. This is the practical component of the corresponding theory paper.
2. The practical list shall be notified by the teacher in the first week of the class
commencement under the intimation to the office of the HOD/ Institution in which they
appear is being offered from the list of practicals below.
3. Instructors can add any other additional experiments over and above the mentioned in the
experiment list which they think is important.
4. At least 8 experiments must be performed by the students.
Course Objectives:
1. To teach students how to analyses solution space of problems
2. To design algorithms based on dynamic programming and greedy algorithms.
Course Outcomes:
CO1 Apply important algorithmic design paradigms and methods of analysis in problem
solving.
CO2 Design and develop dynamic programming and greedy algorithms.
Course Outcomes (CO) to Programme Outcomes (PO) Mapping
(Scale 1: Low, 2: Medium, 3: High)
CO/PO PO01 PO02 PO03 PO04 PO05 PO06 PO07 PO08 PO09 PO10 PO11 PO12
CO1 2 2 2 2 1 - - - - - - 1
CO2 2 2 2 2 1 1 1 1 1 1 1 2

List of Experiments:
1. Sort a given set of elements using the quick sort algorithm and find the time complexity for
different values of n.
2. Implement merge sort algorithm using divide & conquer method to sort a given set of
elements and determine the time and space required to sort the elements.
3. Write a program to implement knapsack problem using greedy method.
4. Program to implement job sequencing with deadlines using greedy method.
5. Write a program to find minimum cost spanning tree using Prim’s Algorithm.
6. Write a program to find minimum cost spanning tree using Kruskal’s Algorithm.
7. Implement 0/1 Knapsack problem using dynamic programming.
8. Write a program to perform Single source shortest path problem for a given graph.
9. Program for finding shortest path for multistage graph using dynamic programming.
10. Program to implement 8-queens problem using backtrack method.

Approved by BoS of USAR: 15/06/23, Approved by AC sub-committee : 04/07/23

Applicable from Batch Admitted in Academic Session 2022-23 Onwards Page | 101
 GURU GOBIND SINGH INDRAPRASTHA UNIVERSITY,
EAST DELHI CAMPUS,
SURAJMAL VIHAR-110092

Semester: 5th
Paper code: AIDS355 L T/P Credits
Subject: Data Mining Lab 0 2 1
Marking Scheme:
1. Teachers Continuous Evaluation: As per university examination norms from time to time
2. End term Examination: As per university examination norms from time to time
INSTRUCTIONS TO EVALUATORS: Maximum Marks: As per university norms
1. This is the practical component of the corresponding theory paper.
2. The practical list shall be notified by the teacher in the first week of the class
commencement under the intimation to the office of the HOD/ Institution in which they
appear is being offered from the list of practicals below.
3. Instructors can add any other additional experiments over and above the mentioned in the
experiment list which they think is important.
4. At least 8 experiments must be performed by the students.
Course Objectives:
1. To perform preprocessing on real world datasets.
2. To develop models using different data mining techniques on complex datasets.
Course Outcomes:
CO1 Analyze and apply pre-processing techniques to prepare and process real life datasets.
CO2 Implement different clustering or classification techniques for varying sets of
problems.
Course Outcomes (CO) to Programme Outcomes (PO) Mapping
(Scale 1: Low, 2: Medium, 3: High)
CO/PO PO01 PO02 PO03 PO04 PO05 PO06 PO07 PO08 PO09 PO10 PO11 PO12
CO1 2 1 - 2 3 - 1 - - 1 - -
CO2 2 2 - 3 3 - - - - - 1 2

List of Experiments
1. Introduction and installation of WEKA tool.
2. Perform data pre-processing including cleaning, integration and transformation on ARFF files
using WEKA.
3. Apply association rule mining on ARFF files using WEKA.
4. Implementation of Visualization technique on ARFF files using WEKA.
5. Implementation of Clustering technique on ARFF files using WEKA.
6. Study of DBMINER tool.
7. Apply pre-processing and classification/regression techniques on a real-world dataset.
8. Evaluate the performance of classification techniques using different parameters.
9. Implementation of Bagging and Boosting techniques on ARFF files using WEKA.
10. Apply the concept of Voting ensemble method to ARFF files and compare the results with
single classifiers.

Approved by BoS of USAR: 15/06/23, Approved by AC sub-committee : 04/07/23

Applicable from Batch Admitted in Academic Session 2022-23 Onwards Page | 102
 GURU GOBIND SINGH INDRAPRASTHA UNIVERSITY,
EAST DELHI CAMPUS,
SURAJMAL VIHAR-110092

Semester: 5th
Paper code: AIML355 L T/P Credits
Subject: Fundamentals of Deep Learning Lab 0 2 1
Marking Scheme:
1. Teachers Continuous Evaluation: As per university examination norms from time to time
2. End term Examination: As per university examination norms from time to time
INSTRUCTIONS TO EVALUATORS: Maximum Marks: As per university norms
1. This is the practical component of the corresponding theory paper.
2. The practical list shall be notified by the teacher in the first week of the class
commencement under the intimation to the office of the HOD/ Institution in which they
appear is being offered from the list of practicals below.
3. Instructors can add any other additional experiments over and above the mentioned in the
experiment list which they think is important.
4. At least 8 experiments must be performed by the students.
Course Objectives:
1. Implementation of deep learning models in Python and train them with real-world
datasets.
2. Implementation of Convolution Neural Network (CNN), Recurrent Neural Network
(RNN) and Deep Learning NLP in Python.
Course Outcomes:
CO1 Design and Implement Convolution Neural Network for object classification from
images or video.
CO2 Implement Autoencoder, Recurrent Neural Network, LSTM, its variants and Deep NLP.
Course Outcomes (CO) to Programme Outcomes (PO) Mapping
(Scale 1: Low, 2: Medium, 3: High)
CO/PO PO01 PO02 PO03 PO04 PO05 PO06 PO07 PO08 PO09 PO10 PO11 PO12
CO1 2 1 1 1 2 1 1 1 2 1 2 2
CO2 2 1 1 1 2 1 1 1 2 1 2 2

List of Experiments:

1. To explore the basic features of Tensorflow and Keras packages in Python

2. Implementation of ANN model for regression and classification problem in Python.
3. Implementation of Convolution Neural Network for MRI Data Set in Python.
4. Implementation of Autoencoders for dimensionality reduction in Python.
5. Application of Autoencoders on Image Dataset.
6. Improving Autocoder’s Performance using convolution layers in Python (MNIST Dataset to be
utilized).
7. Implementation of RNN model for Stock Price Prediction in Python
8. Using LSTM for prediction of future weather of cities in Python

Approved by BoS of USAR: 15/06/23, Approved by AC sub-committee : 04/07/23

Applicable from Batch Admitted in Academic Session 2022-23 Onwards Page | 103
 GURU GOBIND SINGH INDRAPRASTHA UNIVERSITY,
EAST DELHI CAMPUS,
SURAJMAL VIHAR-110092

9. Implementation of transfer learning using the pre-trained model (MobileNet V2) for image
classification in Python.
10. Implementation of transfer learning using the pre-trained model (VGG16) on image dataset in
Python.
11. NLP Analysis of Restaurant Reviews in Python.
12. Building a NLP model for Spam Detection using TFIDF (Term Frequency Inverse Document
Frequency Vectorizer).

Approved by BoS of USAR: 15/06/23, Approved by AC sub-committee : 04/07/23

Applicable from Batch Admitted in Academic Session 2022-23 Onwards Page | 104
 GURU GOBIND SINGH INDRAPRASTHA UNIVERSITY,
EAST DELHI CAMPUS,
SURAJMAL VIHAR-110092

Semester: 5th
Paper code: AIDS357/AIML357 L T/P Credits
Subject: Introduction to Internet of Things Lab 0 2 1
Marking Scheme:
1. Teachers Continuous Evaluation: As per university examination norms from time to time
2. End term Examination: As per university examination norms from time to time
INSTRUCTIONS TO EVALUATORS: Maximum Marks: As per university norms
1. This is the practical component of the corresponding theory paper.
2. The practical list shall be notified by the teacher in the first week of the class
commencement under the intimation to the office of the HOD/ Institution in which they
appear is being offered from the list of practicals below.
3. Instructors can add any other additional experiments over and above the mentioned in the
experiment list which they think is important.
4. At least 8 experiments must be performed by the students.
Course Objectives:
1. To teach students how to analyse different controller boards, simulation platforms and
applications of IoT
2. To design IoT based systems and applications to solve real time problems.
Course Outcomes:
CO1 Apply IoT principles to design programs using a software and hardware to using variety
of available resources to create IoT ecosystem
CO2 Implement applications based on IoT for solving different problems using Arduino and
Node MCU – ESP 8266
Course Outcomes (CO) to Programme Outcomes (PO) Mapping
(Scale 1: Low, 2: Medium, 3: High)
CO/PO PO01 PO02 PO03 PO04 PO05 PO06 PO07 PO08 PO09 PO10 PO11 PO12
CO1 1 1 2 2 2 - 1 1 - - 1 1
CO2 1 1 2 2 3 1 1 1 1 1 1 1

List of Experiments:
1. Introduction to Arduino platform and programming and Introduction to various actuators &
its applications.
2. Introduction with running a blinking LED and fading LED with PWM
A. Arduino IDE and Operators in IDE.
B. Frequently used Functions in Arduino IDE
3. Control Structure writing programs for if else, for and while
4. Custom functions that can be created for specific Needs.
5. Reading and writing digital and analog values. Digital and analog read/write demonstration.
6. Measuring light with Lux and a photoresistor demonstration
Approved by BoS of USAR: 15/06/23, Approved by AC sub-committee : 04/07/23
Applicable from Batch Admitted in Academic Session 2022-23 Onwards Page | 105
 GURU GOBIND SINGH INDRAPRASTHA UNIVERSITY,
EAST DELHI CAMPUS,
SURAJMAL VIHAR-110092

7. Measuring temperature and humidity.

8. Adding an LCD screen and sketch walkthrough.
9. Create an echo server with the Ethernet Shield over Arduino.
10. Upload data from a single sensor to ThingSpeak using ESP8266 (NodeMCU),
11. Upload data from multiple sensors to ThingSpeak using ESP8266 (NodeMCU).
12. Setting up logging and visualizing data on ThingSpeak.
13. Making Project- on real-world Problems.
14. Introduction to Arduino platform and programming and Introduction to various actuators &
its applications.

Approved by BoS of USAR: 15/06/23, Approved by AC sub-committee : 04/07/23

Applicable from Batch Admitted in Academic Session 2022-23 Onwards Page | 106