Department of Artificial Intelligence and Data Science

Regulation 2024 Third Semester Curriculum

No. of
Sl. Total
Course Code Course Name Category periods/week Credits
No Periods
L T P
Probability and
1 U24MA341 BSC 3 1 0 4 4
Statistics
2 U24CS321 Data Structures PCC 3 0 0 3 3
Object Oriented
3 U24CS331 Programming using PCC 3 0 0 3 3
Java
4 U24AD311 Computer Networks PCC 3 0 0 3 3
Data Exploration and
5 U24AD323 PCC 3 0 2 5 4
Visualization
Data Structures
6 U24CS352 PCC 0 0 4 4 2
Laboratory
Object Oriented
7 U24CS362 Programming PCC 0 0 4 4 2
Laboratory
Design Thinking and
8 U24EM312 EEC 0 0 2 2 1
Innovation
Total 15 1 12 28 22

HoD – AI&DS

Dean Academics Principal

 Department of Science and Humanities
Third Semester – R2024 Syllabus
B.Tech. Artificial Intelligence and Data Science
L T P C
U24MA341 PROBABILITY AND STATISTICS
3 1 0 4
Course Objectives:

 To provide the required skills to apply statistical tools to engineering problems.

 To introduce the basic concepts of probability and random variables.
 To introduce the basic concepts of two dimensional random variables.
 To acquaint with knowledge of testing of hypothesis for small and large samples which plays an
important role in real life problems.
 To introduce the basic concepts of classifications of design of experiments which play a very
important role in the fields of agriculture and statistical quality control

UNIT I PROBABILITY AND RANDOM VARIABLES 9+3

Axioms of probability – Conditional probability – Baye’s theorem - Discrete and continuous random
variables – Moments – Moment generating functions – Binomial, Poisson, Geometric, Uniform, Exponential
and Normal distributions - Functions of a random variable.

UNIT IITWO – DIMENSIONAL RANDOM VARIABLES 9+3

Joint distributions – Marginal and conditional distributions – Covariance – Correlation and linear regression
– Transformation of random variables.

UNIT IIIESTIMATION THEORY 9+3

Unbiased estimators - Efficiency - Consistency - Sufficiency - Robustness - Method of moments - Method
of maximum Likelihood - Interval estimation of Means - Differences between means, variations and ratio
of two variances.

UNIT IV NON- PARAMETRIC TESTS 9+3

Introduction - The Sign test - The Signed - Rank test - Rank - sum tests - The U test - The H test - Tests
based on Runs - Test of randomness - The Kolmogorov Tests.

UNIT V STATISTICAL QUALITY CONTROL 9+3

Control charts for measurements ( X and R charts) – Control charts for attributes (c, p and np
charts).Tolerance limits - Acceptance sampling.
TOTAL: 60 PERIODS

Text Books
1. Johnson. R.A., Miller. I.R and Freund. J.E, “Miller and Freund’s Probability and Statistics for
Engineers”, Pearson Education, Asia, 9th Edition, 2022.
2. Milton. J. S. and Arnold. J.C., “Introduction to Probability and Statistics”, Tata McGraw Hill, 4th
Edition, 2019.
3. Jain. R.K. and Iyengar. S.R.K., “Advanced Engineering Mathematics”, Narosa Publications, New
Delhi, 5thEdition, 2016.
4. T.Veerarajan "Probability, Statistics and Random Process" 3rdEdition, Tata McGraw Hill Publishing
Company limited, 2008.
 Reference Books

1. Gupta. S.C. and Kapoor. V. K., “Fundamentals of Mathematical Statistics”, Sultan Chand & Sons,
New Delhi, 12th Edition, 2020.
2. Devore. J.L., “Probability and Statistics for Engineering and the Sciences”, Cengage Learning, New
Delhi, 8th Edition, 2014.
3. Ross. S.M., “Introduction to Probability and Statistics for Engineers and Scientists”, 5th Edition,
Elsevier, 2014.
4. Grewal. B.S., “Higher Engineering Mathematics”, Khanna Publishers, New Delhi, 44thEdition, 2018.

Course Outcomes
Knowledge
CO At the end of the course, the students will be able to
level
CO1 Apply discrete and continuous distribution to solve the problems. Applying
Calculate probabilities, marginal and conditional distributions of bivariate
CO2 Applying
random variables.
CO3 Evaluate the properties of estimators. Applying
CO4 Apply various method of non-parametric test to solve the problems. Applying
Apply the concept of statistical quality control to identify the problems
CO5 Applying
through data analysis.

CO-PO/PSO Mapping

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11
CO1 3 3 3 2 2 3
CO2 3 3 3 2 2 3
CO3 3 3 3 2 2 3
CO4 3 3 3 2 2 3
CO5 3 3 3 2 2 3
Avg. 3 3 3 2 2 3
CO-PO/PSO Mapping: 3 – Substantial (High), 2 – Moderate (Medium), 1 – Slight (Low)

Course Coordinator HoD – Science and Humanities

Dean Academics Principal

 Department of Computer Science and Engineering
(Common to B.Tech. Artificial Intelligence and Data Science)

Regulation 2024 Third Semester Syllabus

L T P C
U24CS321 DATA STRUCTURES
3 0 0 3
Course Objective:
1. To insights the concepts of ADTs.
2. To learn linear data structures–list, stack and queue.
3. To apply sorting, searching and hashing algorithms.
4. To apply tree data structures.
5. To apply Graph structures.

Unit I LISTS 9
Abstract Data Types (ADTs) – List ADT – Array-based implementation – Linked list
implementation – Singly linked lists–Circularly linked lists – Doubly-linked lists – Applications
of lists – Polynomial ADT – Radix Sort – Multilists.
Unit II STACK AND QUEUE 9
Stack ADT – Operations – Applications – Balancing Symbols – Evaluating arithmetic
expressions - Infix to Postfix conversion–Function Calls– Queue ADT–Operations–Circular
Queue–DeQueue – Applications of Queues.
Unit III SEARCHING, SORTING AND HASHING TECHNIQUES 9
Searching – Linear Search – Binary Search. Sorting – Merge Sort – Quick Sort - Insertion
sort – Bubble sort – Selection sort – Shell sort –– Hashing –Hash Functions – Separate Chaining
– Open Addressing – Rehashing – Extendible Hashing.
Unit IV TREE 9
Tree ADT – Tree Traversals-Binary Tree ADT – Expression trees – Binary Search Tree ADT –
AVL Trees – B-Tree – B+Tree – Priority Queue (Heaps) – Binary Heap

Unit V GRAPH 9
Graph Definition – Representation of Graphs – Types of Graph - Breadth- first traversal –
Depth-first traversal –– Bi-connectivity – Euler circuits – Topological Sort –Dijkstra's algorithm
– Minimum Spanning Tree –Prim's algorithm –Kruskal's algorithm

Total Periods: 45
TEXT BOOKS
1 Michael T. Goodrich, Roberto Tamassia, and Michael H. Goldwasser, Data Structures &
Algorithms in Python”, John Wiley & Sons Inc., 2021.
2 Lee, Kent D., Hubbard, Steve, “Data Structures and Algorithms with Python” Springer
Edition 2015.
 REFERENCE BOOKS
1 Thomas H. Cormen, Charles E Leiserson, Ronald L. Rivest, Clifford Stein, “Introduction
to Algorithms” Fourth Edition, PHI, 2022
2 Kruse, “Data Structures and Program Design”, Pearson Education, 2006

ONLINE REFERENCES

1. https://nptel.ac.in/courses/106/102/106102064/
2. https://nptel.ac.in/courses/106/106/106106133/
Course Outcomes

Knowledge
CO At the end of the course, the students will be able to
Level
CO1 Apply linked list including singly, double and circular list for solving Applying
Problems
CO2 Apply linear data structure including stack, queue and dequeue to solve Applying
a given problem
CO3 Analyze the various searching and sorting algorithms. Applying
CO4 Apply appropriate algorithms for tree applications Applying
CO5 Apply appropriate algorithms for graph applications Applying

CO-PO/PSO Mapping
CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2
CO1 3 3 3 3 2 2 2 3 3
CO2 3 3 3 3 2 2 2 3 3
CO3 3 3 3 3 2 2 2 3 3
CO4 3 3 3 3 2 2 2 3 3
CO5 3 3 3 3 2 2 2 3 3
Avg. 3 3 3 3 2 2 2 3 3
CO-PO/PSO Mapping: 3 – Substantial (High), 2 – Moderate (Medium), 1 – Slight (Low)

Course Coordinator HoD – CSE

Dean Academics Principal

 Department of Computer Science and Engineering
(Common to B.Tech. Artificial Intelligence and Data Science)
Regulation 2024 Third Semester Syllabus

L T P C
U24CS331 Object Oriented Programming using Java
3 0 0 3
Course Objective:
• To understand Object Oriented Programming concepts and basics of Java programming language.
• To learn the principles of packages, inheritance and interfaces
• To apply a java application with threads and an exception handling mechanism
• To apply generic classes and use I/O streams and string classes
• To design and build Graphical User Interface Application using JAVAFX

Unit I INTRODUCTION TO OOP AND JAVA 9

Overview of OOP-Features of Object Oriented Programming –Java Buzzwords – Overview of Java–
Data Types, Variables and Arrays –Operators – Control Statements – Programming Structures in
Java -Defining classes in Java – Constructors-Methods -Access specifiers - Static members- Java Doc
comments.
Unit II INHERITANCE , PACKAGES AND INTERFACES 9
Overloading Methods –Objects as Parameters- Returning Objects-Static, Nested and Inner Classes.
Inheritance: Basics– Types of Inheritance -Super keyword -Method Overriding – Dynamic Method
Dispatch –Abstract Classes – final with Inheritance. Packages and Interfaces: Packages –Packages
and Member Access –Importing Packages – Interfaces.
Unit III EXCEPTION HANDLING AND MULTITHREADING 9
Exception Handling basics – T r y a n d C a t c h - Multiple catch – Nested try Statements
– Java’s Built-in Exceptions – User defined Exception. Multithreaded Programming: Java Thread
Model–Creating a Thread and Multiple Threads – Priorities – Synchronization – Inter Thread
Communication-Suspending –Resuming, and Stopping Threads –Multithreading.
Unit IV I/O, GENERICS, STRING HANDLING 9
I/O Basics – Reading and Writing Console I/O – Reading and Writing Files. Generics: Generic
Programming – Generic classes – Generic Methods – Bounded Types – Restrictions and Limitations.
Strings: Basic String class, methods and String Buffer Class.

Unit V JAVAFX EVENT HANDLING, CONTROLS AND COMPONENTS 9

JAVAFX Events and Controls: Event Basics – Handling Key and Mouse Events. Controls:
Checkbox, Toggle Button – Radio Buttons – ListView – ComboBox – ChoiceBox – Text Controls –
ScrollPane. Layouts – FlowPane – HBox and VBox – Border Pane – StackPane – GridPane.Menu-
Menu bars-MenuItem.

Total Periods: 45
 TEXT BOOKS
1 Herbert Schildt, “Java: The Complete Reference”, 11th Edition, McGraw Hill Education,
New Delhi, 2021.
2 Herbert Schildt, “Introducing JavaFX 8 Programming”, 1st Edition, McGraw Hill
Education, New Delhi, 2021.

REFERENCE BOOKS
1 Cay S. Horstmann, “Core Java Fundamentals”, Volume 1, 11th Edition, Prentice Hall, 2018.
2 K. Arnold and J. Gosling, “The JAVA programming language”, Third edition, Pearson Education,
2000.

ONLINE REFERENCES
1. https://nptel.ac.in/courses/106/105/106105191/
2. https://onlinecourses.nptel.ac.in/noc21_cs56/preview
3. https://www.hackerrank.com/domains/java
4. https://www.codechef.com/wiki/java
Course Outcome
Knowledge
CO At the end of the course, the students will be able to
Level
CO1 Apply the basic concepts of OOP. Applying
CO2 Apply the principles of packages, inheritance and interfaces Applying
CO3 Apply the exception handling mechanisms and multithreaded model to solve Applying
real world problems
CO4 Develop Java applications with I/O packages, string classes, Collections and Applying
generics concepts
CO5 Implement the concepts of event handling and JavaFX components and controls Applying
for developing GUI based applications
CO-PO/PSO Mapping
CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2
CO1 3 3 3 3 2 2 2 3 3 3
CO2 3 3 3 3 2 2 2 3 3 3
CO3 3 3 3 3 2 2 2 3 3 3
CO4 3 3 3 3 2 2 2 3 3 3
CO5 3 3 3 3 2 2 2 3 3 3
Avg. 3 3 3 3 2 2 2 3 3 3
CO-PO/PSO Mapping: 3 – Substantial (High), 2 – Moderate (Medium), 1 – Slight (Low)

Course Coordinator HoD – CSE

Dean Academics Principal

 Department of Artificial Intelligence and Data Science

Regulation 2024 Third Semester Syllabus

L T P C
U24AD311 Computer Networks 3 0 0 3
Course Objective:
 To explain the protocol layering , Architecture of the Internet and Physical Layer.
 To learn the node-to -node data flow in Data link layer
 To examine network layer protocols and the functions of various routing protocols using
a simulator tool.
 To familiarize the functions and protocols of the Transport layer.
 To learn the functions of Application layer and fundamentals in Network Security.

UNIT I INTRODUCTION 9
Data communication System-Network Types-Network Topologies- Protocol Layering-TCP/IP
Protocol suite – OSI Reference Model- Interbet Architecture- Physical Layer: Data and
Signals- Performance- wireless transmission, the public switched telephone networks, mobile
telephone system.
UNIT II DATA LINK LAYER 8
Data Link Layer-Framing-Flow Control-Error Control-Data Link Layer Protocols: HDLC-
PPP-Media Access Control,Ethernet Basics: CSMA/CD-Virtual LAN – Wireless LAN
(802.11) Simulation of an error correction code using NS simulator.

UNIT III NETWORK LAYER 10

Internet protocol - IPV4 - IP Addressing -Forwarding of IP Packets -Subnetting - IPV6,
Address Mapping- ARP, RARP, ICMP, DHCP. Routing and protocols: Unicast routing -
Distance Vector Routing - RIP - Link State Routing – OSPF – Path-vector routing - BGP -
Multicast Routing: DVMRP – PIM - Packet Capturing and its examination using WireShark,
Simulation of routing algorithms using NS simulator.
UNIT IV TRANSPORT LAYER 9
Introduction-Transport Layer Protocols -Services - Port Numbers - User Datagram Protocol -
Transmission Control Protocol – Quality of Service(QoS )-Congestion Control: Leaky Bucket
and Token Bucket Algorithm- Congestion avoidance (DECbit, RED).
UNIT V APPLICATION LAYER AND NETWORK SECURITY 9
Introduction to sockets-Application Layer Protocols: DNS,EMAIL, FTP, HTTP Concepts of
symmetric and asymmetric key cryptography. Sharing of symmetric keys - Diffie Hellman.
Firewalls.
Total Periods:45
Text Books
1 Behrouz A. Forouzan, Data Communications and Networking with TCP/IP Protocol
Suite, Sixth Edition TMH, 2022.
2 AS Tanenbaum, DJ Wetherall, Computer Networks, 5th Ed., Prentice-Hall, 2010
Reference Books
1 JF Kurose, KW Ross, Computer Networking: A Top-Down Approach, 5th Ed., Addison-
Wesley, 2009.
2 Larry L. Peterson, Bruce S. Davie, Computer Networks: A Systems Approach, Fifth
Edition, Morgan Kaufmann Publishers Inc., 2012.
3 W Stallings, Cryptography and Network Security, Principles and Practice, 5th Ed.,
Prentice-Hall, 2010
4 Ying-Dar Lin, Ren-Hung Hwang, Fred Baker, “Computer Networks: An Open Source
Approach”, McGraw Hill, 2012.
5 Teerawat Issariyakul and Ekram Hossain, Introduction to Network Simulator NS2,
Springer Publisher, 2009
Course Outcomes
Knowledge
CO At the end of the course, the students will be able to
Level
CO1 Explain the basic layers functionalities and working of Physical Layer Applying
CO2 Illustrate the basics of data flow in data link layer Applying
CO3 Illustrate the network layer protocolsa and evaluate different routing Analyzing
algorithms using NS simulator.
CO4 Determine various Transport Layer protocols & parameters for Applying
congestion control using different algorithms.
CO5 Illustrate the basics of data flow in data link layer Applying
CO-PO & PSO MAPPING

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2
CO1 3 2 - - 3 - - 3 3 - 3 3 2
CO2 3 3 - - 2 - - 3 3 - 3 2 2
CO3 2 2 - - 2 - - 3 3 - 3 2 2
CO4 2 3 - - 2 - - 3 3 - 3 2 3
CO5 3 2 - - 2 - - 3 3 - 3 3 2
AVG 2 .6 2 .4 - - 2 .2 - - 3 3 - 3 2 .4 2 .2
CO-PO/PSO Mapping: 3 – Substantial (High), 2 – Moderate (Medium), 1 – Slight (Low)

Course Coordinator HoD – AI&DS

Dean Academics Principal

 Department of Artificial Intelligence and Data Science
Regulation 2024 Third Semester Syllabus
L T P C
U24AD323 DATA EXPLORATION AND VISUALIZATION 3 0 2 4
Course Objective:
1. To outline an overview of exploratory data analysis.
2. To implement data visualization using Matplotlib.
3. To perform univariate data exploration and analysis.
4. To apply bivariate data exploration and analysis.
5. To use Data exploration and visualization techniques for multivariate and time
series data.

UNIT I EXPLORATORY DATA ANALYSIS 9

EDA fundamentals – Understanding data science – Significance of EDA – Making sense of data –
Comparing EDA with classical and Bayesian analysis – Software tools for EDA - Visual Aids for
EDA- Data transformation techniques-merging database, reshaping and pivoting, Transformation
techniques - Grouping Datasets - data aggregation – Pivot tables and cross-tabulations.

UNIT II VISUALIZING USING MATPLOTLIB 9

Importing Matplotlib – Simple line plots – Simple scatter plots – visualizing errors – density and
contour plots – Histograms – legends – colors – subplots – text and annotation – customization –
three dimensional plotting - Geographic Data with Basemap - Visualization with Seaborn.

UNIT III UNIVARIATE ANALYSIS 9

Introduction to Single variable: Distributions and Variables - Numerical Summaries of Level and
Spread - Scaling and Standardizing – Inequality - Smoothing Time Series.

UNIT IV BIVARIATE ANALYSIS 9

Relationships between Two Variables - Percentage Tables - Analyzing Contingency Tables -
Handling Several Batches - Scatterplots and Resistant Lines – Transformations.

UNIT V MULTIVARIATE AND TIME SERIES ANALYSIS 9

Introducing a Third Variable - Causal Explanations - Three-Variable Contingency Tables and
Beyond - Longitudinal Data – Fundamentals of TSA – Characteristics of time series data – Data
Cleaning – Time-based indexing – Visualizing – Grouping – Resampling.

Total Periods: 45
Laboratory Exercises
1. Install the data Analysis and Visualization tool: R/ Python /Tableau Public/ Power BI.
2. Perform exploratory data analysis (EDA) on with datasets like email data set. Export
all your emails as a dataset, import them inside a pandas data frame, visualize them
and get different insights from the data.
3. Working with Numpy arrays, Pandas data frames , Basic plots using Matplotlib.
 4. Explore various variable and row filters in R for cleaning data. Apply various plot
features in R on sample data sets and visualize.
5. Perform Time Series Analysis and apply the various visualization techniques.
6. Perform Data Analysis and representation on a Map using various Map data sets with
Mouse Rollover effect, user interaction, etc.
7. Build cartographic visualization for multiple datasets involving various countries of
the world; states and districts in India etc.
8. Perform EDA on Wine Quality Data Set.
9. Use a case study on a data set and apply the various EDA and visualization techniques
and present an analysis report.

Total Periods: 30
Text Books
1. Suresh Kumar Mukhiya, Usman Ahmed, “Hands-On Exploratory Data Analysis with
Python”, Packt Publishing, 2020.
2. Jake Vander Plas, "Python Data Science Handbook: Essential Tools for Working with
Data", Oreilly, 1st Edition, 2016.
3. Catherine Marsh, Jane Elliott, “Exploring Data: An Introduction to Data Analysis for
Social Scientists”, Wiley Publications, 2nd Edition, 2008.
Reference Books
1. Eric Pimpler, Data Visualization and Exploration with R, GeoSpatial Training
service, 2017.
2. Claus O. Wilke, “Fundamentals of Data Visualization”, O’reilly Publications, 2019.
3. Matthew O. Ward, Georges Grinstein, Daniel Keim, “Interactive Data Visualization:
Foundations, Techniques, and Applications”, 2nd Edition, CRC Press, 2015.

Course Outcomes
Knowledge
CO At the end of the course, the students will be able to
Level
CO1 Understand the fundamentals of exploratory data analysis. Understanding
CO2 Implement the data visualization using Matplotlib. Applying
CO3 Perform univariate data exploration and analysis. Applying
CO4 Apply bivariate data exploration and analysis. Applying
CO5 Apply Data exploration and visualization techniques for Applying
multivariate and time series data.

CO-PO/PSO Mapping
CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2
CO1 3 2 2 2 2 2 2 2 2
CO2 3 2 2 3 2 2 2 2 2
CO3 3 2 2 2 2 2 2 2 2 2
CO4 3 2 2 3 2 2 2 2 2
CO5 3 2 2 2 2 2 2 2 2 2
Avg. 3 2 2 2.5 2 2 2 2 2 2
CO-PO/PSO Mapping: 3 – Substantial (High), 2 – Moderate (Medium), 1 – Slight (Low)
Course Coordinator HoD – AI&DS

Dean Academics Principal

 Department of Computer Science and Engineering
(Common to B.Tech. Artificial Intelligence and Data Science)

Regulation 2024 Third Semester Syllabus

L T P C
U24CS352 DATA STRUCTURES LABORATORY
0 0 4 2
Course Objective:
• To demonstrate array implementation of linear data structure algorithms.
• To implement the applications using Stack.
• To implement the applications using Linked list
• To implement Binary search tree and AVL tree algorithms.
• To implement the Heap algorithm.
• To implement Dijkstra’s algorithm.
• To implement Prim’s algorithm
• To implement Sorting, Searching and Hashing algorithms

Sl.
List of experiments
No
1 Design and develop a Python-based application that implements Stack, Queue, and Circular
Queue using arrays. Apply these data structures to solve practical problems such as browser
history navigation (Stack), customer service ticketing system (Queue), and a circular buffer
for real-time data streaming (Circular Queue).
2 Design and develop an application that utilizes a linked list to manage dynamic data efficiently.
Apply it to real-world scenarios such as contact management in a phonebook, playlist
management in a music player.
3 Design and develop an application that implements Stack and Queue Abstract Data Types
(ADTs) to solve practical problems such as expression evaluation (infix to postfix conversion).
4 Design and develop an application that demonstrates the real-world use of List, Stack, and
Queue ADTs. Implement scenarios such as task management using a Queue, expression
evaluation using a Stack, and dynamic data storage using a List in a contact management
system or social media feed.
5 Design and develop an application that implements Binary Search Trees (BST) to efficiently
manage and retrieve data. Apply BST to solve real-world problems such as contact management
in a phonebook, auto-suggestion in search engines.
6 Develop an application that implements AVL Trees to maintain balanced and efficient data
retrieval. Apply AVL Trees to real-world scenarios such as optimizing database indexing, managing
dynamic leaderboards in gaming applications, or implementing auto-balancing dictionaries for fast
search operations.
7 Implement heaps using priority queues, applying them to problems like task scheduling and
resource allocation.
8 Develop an application that implements Dijkstra’s Algorithm to find the shortest path in a
network. Apply this algorithm to real-world scenarios such as GPS-based navigation systems,
network routing optimization, or emergency response route planning.
 9 Develop an application that implements Prim’s Algorithm to find the Minimum Spanning Tree
(MST) of a network. Apply this algorithm to solve real-world problems such as optimizing road
networks, minimizing wiring costs in circuit design, or designing efficient communication
networks.
10 Develop an application that implements Linear Search and Binary Search to efficiently retrieve
data from a dataset. Apply these searching techniques to real-world scenarios such as product
search in an e-commerce platform, student record retrieval in a database, or keyword search in a
text document.
11 Develop an application that implements Insertion Sort and Selection Sort to efficiently organize
and manage data. Apply these sorting techniques to real-world scenarios such as ranking student
grades, arranging customer transaction records, or sorting a list of product prices in an e-
commerce platform.
12 Develop an application that implements Merge Sort to efficiently sort large datasets. Apply
Merge Sort in real-world scenarios such as sorting customer transaction records in an e-
commerce platform, organizing log files in a server, or optimizing search results in a database
system.
13 Develop an application that implements Open Addressing techniques, including Linear Probing
and Quadratic Probing, for efficient hash table management. Apply these techniques to solve
real-world problems such as fast data retrieval in database indexing, caching mechanisms in web
browsers, or duplicate detection in large datasets.
Total Periods: 60

Course Outcomes:

CO At the end of the course, the students will be able to Knowledge Level
CO1 Apply Linear data structure -Linked lists. Applying
CO2 Apply Stacks and Queue for real time applications. Applying
CO3 Apply Binary Search tree and AVL tree operations. Applying
CO4 Develop applications using graph algorithms. Applying
CO5 Analyze the various searching and sorting algorithms. Analysing

CO-PO/PSO Mapping

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2
CO1 3 3 3 3 3 2 3 3 3 2 2 3 3
CO2 3 3 3 3 3 2 3 3 3 2 2 3 3
CO3 3 3 3 3 3 2 3 3 3 2 2 3 3
CO4 3 3 3 3 3 2 3 3 3 2 2 3 3
CO5 3 3 3 3 3 2 3 3 3 2 2 3 3
Avg 3 3 3 3 3 2 3 3 3 2 2 3 3
CO-PO/PSO Mapping: 3 – Substantial (High), 2 – Moderate (Medium), 1 – Slight (Low)

Course Coordinator HoD – CSE

Dean Academics Principal

 Department of Computer Science and Engineering
(Common to B.Tech. Artificial Intelligence and Data Science)
Regulation 2024 Third Semester Syllabus
L T P C
U24CS362 Object Oriented Programming Laboratory
0 0 4 2
Course Objective:
• To build real-world applications using java.
• To understand and apply the concepts of classes, packages, interfaces, inheritance,
Exception handling and file processing.
• To develop applications using multithreading
• To Build applications using generic programming
• To Develop the java application using JavaFX controls and events programming
Sl. No. List of Experiments

1 Develop a Java application that allows users to search and sort data efficiently. Implement
sequential search and binary search to find specific records (e.g., student details, product
inventory). Integrate selection sort and insertion sort to organize datasets, such as sorting
customer orders by date or arranging exam scores in ascending orr.
2 Develop a Java application that implements Stack and Queue data structures using classes
and objects. Apply these structures to real-world scenarios such as managing browser
history (Stack) and handling customer requests in a service center (Queue).
3 Develop a Java application that demonstrates multilevel inheritance by simulating a
realworld scenario, such as a company’s employee management system. Implement a
class hierarchy where a base class Person is extended by Employee, which is further
extended by specialized roles like Manager or Developer. Include methods to display
employee details and calculate salaries based on roles.
4 Create an abstract class Shape with two integer attributes and an abstract
method print Area(). Implement three subclasses: Rectangle, Triangle, and Circle, each
overriding print Area() to calculate and display their respective areas.
5 Develop a Java application that demonstrates the use of the extends keyword with
interfaces.
Implement a real-world scenario such as a payment system where multiple payment
methods (Credit Card, PayPal, UPI) extend a common payment interface to ensure
seamless transactions.
6 Develop a Java application that demonstrates exception handling by creating user-defined
exceptions. Apply this in a real-world scenario, such as validating user input in a banking
system, handling insufficient balance exceptions in an ATM simulation, or managing
invalid login attempts in an authentication system.

7 Develop a Java-based multi-threaded application to simulate the Producer-Consumer

problem using Threads. Implement synchronization techniques to ensure proper
coordination between producers and consumers, such as managing a shared buffer for
real-world applications like job scheduling in an operating system or message queues in a
communication system.
 8 Develop a Java application that performs essential file operations such as creating, reading,
writing, and deleting files. Implement real-world use cases like logging system activities,
managing user data, or handling configuration files for an application.

9 Develop a Java applications to demonstrate the features of generic classes.

10 Develop a JavaFX-based desktop application that utilizes various controls, layouts, and
menus to create an interactive user interface. Implement features such as a to-do list
manager, a student record system, or a simple inventory management system, ensuring a
user-friendly experience with responsive design.
11 Write a java program that connects to a database using JDBC
Develop a Java-based application that connects to a database using JDBC. Implement
functionality to insert user data, such as a registration form for a library management
system, employee records for an HR system, or product details for an inventory
management system Develop a Java-based application that connects to a database using
JDBC. Implement functionality to manage and delete records, such as removing outdated
user information from a customer database or deleting inactive product listings from an
inventory system.
Total Periods: 60

Course Outcomes
Knowledge
CO At the end of the course, the students will be able to Level
CO1 Apply java programs using object-oriented programming concepts Applying
CO2 Apply object-oriented concepts such as package, exceptions for simple Applying
applications.
CO3 Apply multithreading concept for simple java program. Applying
CO4 Develop Simple application using generic classes. Applying
CO5 Create GUIs and event driven programming applications for real world Applying
problems.

CO-PO/PSO Mapping
CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2
CO1 3 3 3 3 3 2 2 2 3 3 3 3 3
CO2 3 3 3 3 3 2 2 2 3 3 3 3 3
CO3 3 3 3 3 3 2 2 2 3 3 3 3 3
CO4 3 3 3 3 3 2 2 2 3 3 3 3 3
CO5 3 3 3 3 3 2 2 2 3 3 3 3 3
Avg. 3 3 3 3 3 2 2 2 3 3 3 3 3
CO-PO/PSO Mapping: 3 – Substantial (High), 2 – Moderate (Medium), 1 – Slight (Low)

Course Coordinator HoD – CSE

Dean Academics Principal

 Department of Mechanical Engineering

Regulation 2024 Third Semester Syllabus

L T P C
U24EM312 DESIGN THINKING AND INNOVATION
0 0 2 1
Course Objective:
▪ Empathizing with users to uncover their real problems and desires.
▪ Promoting out-of-the-box thinking to develop unique and effective solutions.
▪ Using prototyping, testing, and refining ideas to ensure the best outcome.
▪ Testing assumptions early to prevent costly mistakes and enhance decision-making.
▪ Creating innovative products, services, or processes that improve market competitiveness.

Sl
List of Exercises No of periods
No
1 Design Thinking – models – Why design thinking? Case Studies. Innovation 4
– 7Cs of Innovation. Identify a case study.
2 Empathize – tools - customer Journey map – case studies – Empathize your 4
case
3 Analyse –toos, Multi-Whys, case study, conflict of interest. Applying 4
analyse to your case study
4 Ideate and solve – brainstorming – TRIZ method, trial and error method – 4
Solve your case study
5 Prototype/process and test – tools and methods – create a prototype for your 4
6 Iterate to improve the prototype/process – revisit the methods to improve the 8
prototype.
7 Submit the report and final prototype.process of your case study. 2
Total Periods 30

Text Books
1 Pavan Soni, Design your thinking, Penguin Random House India Pvt, Ltd., India, 2022
2 Don Norman, The Desing of everyday things, Basic Books, New York, 2013

Reference Books
1 B.K. Chakravarthy, Janaki Krishnamoorthi, Innovation by Design Lessons from Post Box
Design & Development, Springer, New Delhi 2013
2 Balaramadurai, Karmic Design Thinking, 2020
3 Design by Innovation NPTEL Course B.K. Chakravarthy IIT Bombay
4 Design Thinking and Innovation NPTEL Cours Ravi Poovaiah, IIT Bombay
5 Design Thinking A Premier NPTEL Course, Prof. Ashwin Mahalingam, Prof. Bala Ramadurai,
Course Outcomes

CO At the end of the course, the students will be able to Knowledge Level
CO1 Apply the tools to empathize the case identifies Applying
CO2 Analyse the data and information to conceptualize the solution for Analyzing
the case
CO3 Ideate and solve the case using appropriate tools Applying
CO4 Create a prototype of the model Creating
CO5 Iterate to improvise the model Analyzing

CO-PO/PSO Mapping

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2
CO1 2 2 2 2 2 2 2 2 2 2
CO2 2 2 2 2 2 2 2 2 2 2
CO3 2 2 2 2 2 2 2 2 2 2
CO4 2 2 2 2 2 2 2 2 2 3
CO5 2 2 2 2 2 2 2 2 2 3
Average 2 2 2 2 2 2 2 2 2 2 3

CO-PO/PSO Mapping: 3 – Substantial (High), 2 – Moderate (Medium), 1 – Slight (Low)

Course Coordinator HoD – Mechanical

Dean Academics Principal