AIDS Syllabus 2024 25 - Updated - 29 01 2025
AIDS Syllabus 2024 25 - Updated - 29 01 2025
01/08/22
Institute Vision
"To be globally acclaimed Institute in Technical Education and Research for holistic Socio- economic
development".
Institute Mission
• To ensure that 100% students are employable and employed in Industry, Higher Studies, become
Entrepreneurs, Civil / Defense Services / Govt. Jobs and other areas like Sports and Theatre.
• To strengthen Academic Practices in terms of Curriculum, Pedagogy, Assessment and Faculty Competence.
• Promote Research Culture among Students and Faculty through Projects and Consultancy.
• To make students Socially Responsible Citizen.
Department Vision
“To offer quality academic environment with the modern infrastructure to cater the demand of AI and DS
careers with the research aptitude”
Department Mission
• To promote employability and entrepreneurship skills among students in the AI-DS and IT domains.
• To impart quality education with the focus on design, development and analysis using Interdisciplinary
approach.
• To prepare students for solving problems of societal benefits and make them responsible citizens
Graduates will develop expertise in core areas of artificial intelligence and data
Core science, including machine learning, deep learning, big data analytics, and
PEO2 computational intelligence, enabling them to design and implement effective
competence
solutions to real-world challenges.
Problem analysis: Identify, formulate, review research literature, and analyze complex engineering
PO2 problems reaching substantiated conclusions using first principles of mathematics, natural sciences,
and engineering sciences.
Design/development of solutions: Design solutions for complex engineering problems and design
system components or processes that meet the specified needs with appropriate consideration for the
PO3
public health and safety, and the cultural, societal,
and environmental considerations.
Conduct investigations of complex problems: Use research-based knowledge and
PO4 Research methods including design of experiments, analysis and interpretation of
data, and synthesis of the information to provide valid conclusions.
Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern
PO5 engineering and IT tools including prediction and modeling to complex
engineering activities with an understanding of the limitations.
The engineer and society: Apply reasoning informed by the contextual knowledge to
PO6 assess societal, health, safety, legal and cultural issues and the
consequent responsibilities relevant to the professional engineering practice.
Environment and sustainability: Understand the impact of the professional engineering
PO7 solutions in societal and environmental contexts, and demonstrate the knowledge of, and need
for sustainable development.
Ethics: Apply ethical principles And commit to professional ethics and responsibilities
PO8
And norms of the engineering practice.
Individual and teamwork: Function effectively as an individual, and as a member or
PO9
Leader in diverse teams, and in multidisciplinary settings.
Communication: Communicate effectively on complex engineering activities with the engineering
community and with society at large, such as, being able to comprehend and write effective reports
PO10
and design documentation, make effective presentations, and give
and receive clear instructions.
Project management and finance: Demonstrate knowledge and understanding of the
PO11 engineering and management principles and apply the setoone’s own work, as a member and leader in
a team to manage projects and in multidisciplinary environments.
Life-long learning: Recognize the need for, and have the preparation and ability to Engage in
PO12 independent and life-long learning in the broadest context of technological change.
8 - Structure -Module IV 12
9 - Structure -Module V 13
10 - Structure -Module VI 14
14 26
CS2221 Internet of Things
SY AI&DS Module-III
Database 2 2 1 10 - - 20 - 20 30 20
S4 CS2227 Management 100 4
Systems
S5 AI2018 Probability and 2 - 35 - 35 - - - - 30 100 2
Calculus
S6 Design - - - 100
AI2010 - - - - - - 100 - 1
Thinking- III
Engineering
S7 AI2018 Design & - 8 - - 30 - - - - 70 - 100 4
Innovation –
III
Reasoning and
S8 SH2001 Aptitude 1 - - - - - - - - - - 100 - 100 1
Development
SY AI&DS Module-IV
TY AI&DS Module-V
*Audit Courses:
Complexity
S3 AI3011 2 2 1 10 - 20 20 - - 30 20 100 4
Algorithm
Software
S4 AI3012 Design and 2 2 1 10 - 20 - 20 - 30 20 100 4
Methodologies
Engineering
Design &
S5 AI3013 - 12 - - 30 - - - - 70 - 100 6
Innovation –
VI
Design
S6 AI3005 - - - - - - - - - 100 - 100 1
Thinking- VI
Reasoning and
S7 SH2001 Aptitude 1 - - - - - - - - 100 - 100 1
Development
*Audit Courses:
Coursera Courses*
Coursera Courses*
Financial
MD4206 Management &
/MD4227 Costing/ /From 2 - - - 10 30 - 30 - 30 100 2
OE1 campus to
Corporate
Generative AI &
LL4001 2 - - - 10 30 - 30 - 30 100 2
its Applications
AI4025 High
2 - - - 10 30 - 30 - 30 100 2
Performance
Computing
OE2 ET4230 Natural Language 2 - - - 10 30 - 30 - 30 100 2
Processing
IT4216 Data
Management, 2 - - - 10 30 - 30 - 30 100 2
Protection and
Governance
S1 AI4008 Industry
- 32 - - - 30 - 70 - - 100 16
Internship
S2 AI4011 International
- 32 - - - 30 - 70 - - 100 16
Internship
S3 AI4010 Research
- 32 - - - 30 - 70 - - 100 16
Internship
Total - 32 - - - 30 - 70 - - 100 16
Coursera Courses*
FF No.: 654
MD2201: Data Science
Course Prerequisites:
1. Linear Algebra Basics
2. Central Tendency & Measures of Dispersion – Mean, Mode, Median
3. Probability
4. Some exposure to programming environment – C programming; Python
Course Objectives:
1. Understand data processing pipeline
2. Perform dimensionality reduction operations
3. Optimize the performance of functions
4. Apply descriptive statistics tools
5. Deduce meaningful statistical inferences
6. Use unsupervised classification algorithms
7. Use supervised classification algorithms
8. Utilize the data science principles for an entire project life cycle as a case study
Data science definition, raw data, processed data and their attributes, meta data, data cleaning, data
science pipeline. (3 Hours)
Normal distribution, evaluating normal distribution, Binomial distribution, confidence Intervals, central
limit Theorem, hypothesis testing (6 Hours)
Vector norms, Unconstrained Optimization (4 Hours)
Simple and multiple linear regression; Logistic regression, non-linear regression, polynomial
regression (4 Hours)
Nearest Neighbor Classification – Knn approach, branch and bound algorithm, projection algorithm;
Naïve Bayes Classification; Classification using decision trees, divisive and agglomerative clustering,
K-means clustering (6 Hours)
List of Tutorials:
1. Data Visualization
2. Distances and Projections
3. Singular Value Decomposition
4. Principal Component Analysis
5. Optimization
6. Normal & Binomial Distribution
7. Hypothesis Testing
8. ANOVA test
9. Linear Regression
10. Logistic Regression
11. Nearest Neighbor Classification
12. Decision Trees based classification
13. Naive Bayes classification
14. Clustering
15. Evaluation of model performance
16. Bagging & Boosting approaches
Course Outcomes:
Job Mapping:
Job opportunities that one can get after learning this course
1. Data Scientist
2. Data Analyst
3. AI Engineer
4. Data Architect.
5. Data Engineer.
6. Statistician.
7. Database Administrator.
8. Business Analyst
9. Business Intelligence Developer
10. Infrastructure Architect
11. Enterprise Architect
12. Machine Learning Engineering
13. Machine Learning Scientist
FF No.: 654
CS2221:Internet Of Things
Course Prerequisites:
Students should have a basic Understanding of the Internet, Cloud, Networking Concepts and Sensors
Course Objectives:
The student will be able to
1. Understand IoT Architecture and framework.
2. Recognize and differentiate between the various use cases of different sensors, actuators, solenoid
valve etc
3. Learn about fundamental concepts of networking and protocols.
4. Understand IoT Physical, Datalink and Higherlayer Protocols.
5. Apply theoretical knowledge for Cloud computing.
6. Implement an IoT solution practically
Course Relevance:
The Internet of Things is transforming our physical world into a complex and dynamic system of connected
devices on an unprecedented scale. Interne of Things is a system of interrelated computing and sensing
devices and has the ability to transfer data over a network without requiring human-to-human or human-
to-computer interaction.
Advances in technology are making possible a more widespread adoption of IoT, from pill-shaped micro-
cameras that can pinpoint thousands of images within the body, to smart sensors that can assess crop
conditions on a farm, to the smart home devices that are becoming increasingly popular.
IoT is highly relevant in this growing ecosystem of internet-enabled devices. IoT offers increasing
opportunities to collect, exchange, analyse and interpret data in real-time. This robust access to data will
result in opportunities to further enhance and improve operations. In a world which is moving towards an
increasingly connected future, Internet of Things (IoT) is the next big thing. Right from our homes to our
cars to our cities, everything is being connected and the technology of IoT is right in the middle of it.
Introduction to IoT
Physical Design of IOT, Logical Design of IOT, IOT Enabling Technologies, IOT Levels &
Deployment Templates (4 Hours)
IoT Devices
IoT System Design Cycle, Sensors - Terminologies, Calibration, Types, Specification, Use,
Actuators - Types and Use, Prototype Development Platform - Arduino / Raspberry pi / Node
MCU, Interface with Embedded System. (6 Hours)
Introduction to Wireless Sensor Network
Sensor Node, Smart Sensor Network, Wireless Sensor Network, RFID - Principles and
Components, Node MCU (4 Hours)
Connectivity Technologies
Network Configuration in IoT, IoT Stack and Web Stack, IEEE 802.15.4 Standard, Zigbee,
Bluetooth, MQTT, Cloud Architecture and Types, Cloud Service Providers (8 Hours)
Surveys:
1. Autonomous Vehicles
2. List of Indian companies which offer IoT solutions for agriculture and farming.
Describetheproblem they are addressing and their solution.
3. Make a list of Indian companies which offer IoT solutions for healthcare. Describe the
problem they are addressing and their solution.
4. Make an exhaustive list of everything inside, just out side(immediatesurroundings)andon
the auto body which must be “observed” for safe and comfortable driving using
autonomous vehicles.
5. Compare different Cloud Service providers in the market.
Reference Books:
1. Adrian McEwen, Hakim Cassimally “Designing the Internet of Things”, Wiley
2. OvidiuVermesan& Peter Friess“Internet of Things Applications-From Research and
Innovationto Market Deployment”, ISBN:987-87-93102-94-1,River Publishers
3. Joe Biron and Jonathan Follett, "Foundational Elements of an IoT Solution," by Joe
Biron
Course Outcomes
Job Mapping:
The Internet of Things (IoT) is the most emerging field in today’s world. It is revolutionizing every
industry, from home appliances to agriculture to space exploration. Since the advent of cloud
computing, there has been an exponential growth in the number of sensor-enabled devices
connected to the internet and expecting further growth accelerating in the coming years. There are
diversified career opportunities in this field. The various career
positionsavailableasIoTResearchDeveloper,IoTDesignEngineer,IoTProductManager,IoTSoftwar
eDeveloper, IoT Solution Architect, IoT Service Manager and many more.
FFNo.: 654
CS2218 : Object Oriented Programming
Course Prerequisites:
SECTION – I
Introduction:
What is Object Oriented Programming (OOP)? The need of OOP, Characteristics of OOP.
Java overview: Classes and Objects, Java object storage, Access Modifiers, this reference, main
method, Static vs Instance block, Static methods vs Instance methods in Java.
Input and Output: Byte Stream vs Character Stream, use of Scanner Class.
Arrays in Java: Arrays in Java, initialization, Default Array values, multi-dimensional array,
java.util.Arrays class, string class, string buffer, string builder.
Inheritance: Inheritance in Java, Types, Constructor in Inheritance , Using final with Inheritance,
Accessing superclass member, Parent and Child classes having same data member, Base vs derived
class reference. Polymorphism: Method Overloading , Overloading main(), Static vs Dynamic
Binding, Method Hiding. Private and final methods, Passing and Returning Objects in Java
SECTION - II
Interfaces and Abstract Classes: Interface and its usage, Abstract Class and its usage, Difference
between Abstract Class and Interface, Nested Interface, Nested Class, Inner class, Anonymous
Collection in Java: Collections Class, Using Iterators, Iterator vs Foreach, ArrayList, Vector, Map,
Set.
File Handling: File Processing, Primitive Data Processing, Object Data Processing, Connecting
Java with database (JDBC/ODBC).
Java GUI: Swing, Components. Layout Manager: Flow, Border, Grid and Card. Label, Button,
Choice, List, Event Handling (mouse, key).
2. There is a class Adder which has two data members of type 1D int array and int variable. It
has two functions: getdata and numsum. Function getdata accepts non-empty array of
distinct integers from user in 1D int array data member and a targetsum in another data
member. The function numsum adds any two elements from an input array which is equal
to targetsum and return an array of resulting two elements, in any order. If no two numbers
sum up to the target sum, the function should return an empty array. Note that the target
sum is to be obtained by summing two different integers in the array; you can’t add a single
integer to itself in order to obtain the target sum. You can assume that there will be at most
one pair of numbers summing up to the target sum. Use constructor. Use extra variables if
needed
Input:
Array=[3,5,-4,8,11,1,-1,7] targetsum=15
Output: [8,7]
Input:
Array=[3,5,-4,8,11,1,-1,6] targetsum=15
Output: []
3. Write Java program to calculate area of triangle, square & circle using function overloading.
Function parameter accept from user (Use function Overloading concepts and Inheritance).
4. Write a program for following exception, develop a suitable scenario in which the following
exceptions occur:
a. divide by zero
b. Array index out of bounds exception
c. Null pointer Exception
5. Write a java program to solve producer-consumer problem where there are two producer
threads and one consumer thread.
Section A
Section B
Blog:
1. Single and Multidimensional arrays in Java
2. Comparison Inheritance & Polymorphism
3. Need of abstract classes and interfaces in Java
4. Multithreading concept in Java
5. Signed & Unsigned arithmetic operations using JAVA
6. Role of start() and run() methods in multithreading
Survey:
1. Strategies for Migration from C++ to Java
2. Product development using Inheritance and Polymorphism in Industry
3. in Java/OOP features popular amongst developers
4. Which other (non-JVM) languages does your application use?
5. How Java Impacted the Internet
6. How can a ArrayList be synchronised without using vector?
Design :
1. Implementation of Singleton design pattern in Java
2. Notes Repository System for Academic
3. Design for employee management system
4. Design for student management system
5. Inventory Management System
6. Write a program to delete duplicate numbers from the file
Case Study :
1. Java development milestones from 1.0 to 16.0
2. Implementation of Different Methods in Polymorphism
3. Real world systems which use java for its implementation
4. Drawing a flag using java
5. Use of different methods of Class object
6. Drawing a flag using java
1. “JAVA- The Complete Reference”, Herbert Schildt, 11th Edition, McGraw Hill Education.
2. “Java, java, Java – Object-Oriented Problem Solving”, R. Morelli and R. Walde, 3rd edition,
Pearson Education, Inc.
Course Outcomes:
Upon completion of the course, student will be able to –
1. Understand object-oriented programming features.
2. Apply the knowledge of Java IO and arrays to design real world problem.
3. Analyze and implement the complex real world problem using OOP concepts such as classes,
inheritance and polymorphism.
4. Solve computing problems by applying the knowledge of Exception handling and Multithreading
5. Design solutions by choosing suitable data structures such as Array, Vector, Map etc
6. Implement applications using Java I/O and event-based GUI handling principles
Job Mapping:
Java Programmer, Application Developer, Design Engineer, Senior Software Developer
CO - PO Mapping:
Program Outcomes (PO) PSO
CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3 PSO4
CO1 3 2 2 3
CO2 3 3 3 3 2 2 2 3 3
CO3 3 3 3 3 2 2 3 2 3 3
CO4 3 2 3 3 3 2 2 3 2 3
CO5 3 3 3 2 2 2 2 3
CO6 3 2 3 2 3 2 2 3 2 2 3
Average 3 1 2.5 0.33 2.50 2.50 1.33 1.67 2.17 0.00 0.33 0.67 0.83 0.50 1.50 1.50
FFNo.: 654
CS2227 ::Database Management Systems
Course Objectives:
1. Learn the fundamentals of different data modeling techniques.
2. Design and development of relational database management systems.
3. Study the theory behind database systems, the issues that affect their functionality and
performance
4. Design of query languages and the use of semantics for query optimization.
5. Understand the latest trends of data management systems.
Course Relevance:
The course emphasizes on the fundamentals of database modelling and design, the languages and models
provided by the database management systems, and database system implementation techniques. The goal
is to provide an in-depth and up-to-date presentation of the most important aspects of database systems and
applications, and related technologies.
SECTION-I
Topics and Contents
Introduction: Need of Database Management Systems, Evolution, Database System Concepts and
Architecture, Database Design Process
Data Modeling: Entity Relationship (ER) Model, keys, Extended ER Model, , Relational Model,
Codd's Rules;
Database Design: Need of Normalization, Functional Dependencies, Inference Rules, Functional
Dependency Closure, Minimal Cover, Decomposition Properties, Normal Forms: 1NF, 2NF, 3NF
and BCNF, Multi-valued Dependency, 4NF
Query Languages: Relational Algebra, SQL: DDL, DML, Select Queries, Set, String, Date and
Numerical Functions, Aggregate Functions ,Group by and Having Clause, Join Queries, Nested
queries, DCL, TCL, PL/SQL: Procedure, Function, Trigger, Mapping of Relational Algebra to SQL
SECTION-II
11) Implement Map Reduce operation with suitable example using MongoDB.
good choice?Design a schema and show a sample database for that application. What types of
additional information and constraints would you like to representin the schema? Think of several
users of your database, and design a view for each.
Case Study:
1. PostgreSQL
2. Oracle
3. IBM DB2 Universal Database
4. Microsoft SQL Server
5. SQLite database
Blog
1.OLAP tools from Microsoft Corp. and SAP
2.Views in database
3. Dynamic SQL and Embedded SQL
4. Active databases and Triggers
5. SQL injection attack
Surveys
1. Keyword queries used in Web search are quite different from database queries. List key
differences between the two, in terms of the way the queries are specified, and in terms of what is
the result of a query.
2. List responsibilities of a database-management system. For each responsibility,explain the
problems that would arise if the responsibility were not discharged
3. List reasons why database systems support data manipulation using a declarative query language
such as SQL, instead of just providing a a library of C or C++ functions to carry out data
manipulation
4. Consider a bank that has a collection of sites, each running a database system. Suppose the only
way the databases interact is by electronic transfer of money between themselves, using persistent
messaging.Would such a system qualify as a distributed database? Why?
4. Data warehousing products coupled with database systems
Suggest an assessment Scheme:
MSE:10 ESE:20 HA:10 CP:10 Lab:10 Seminar:20 CVV:20
Course Outcomes:
The student will be able to –
1. Design data models as per data requirements of an organization
2. Synthesize a relational data model up to a suitable normal form
3. Develop a database system using relational queries and PL/SQL objects
4. Apply indexing techniques and query optimization strategies
5. Understand importance of concurrency control and recovery techniques
6. Adapt to emerging trends considering societal requirements
CO-PO Mapping:
Program Outcomes (PO) PSO
CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3 PSO4
CO1 3 2 3 2 3 2 2 2 2 2 2
CO2 2 3 3 3 2 2
CO3 3 3 3 2 3 3 3 3 3
CO4 3 2 3 2 3 2 3
CO5 2 3 2 2 2 2
CO6 3 3 3 3 3 2 3
Average 2.66 2.66 2.5 2.5 2.25 2.0 2.0 2.5 2.0
FF No.: 654
AI2018 : Probability And Calculus
Course Prerequisites:
1. Basics of Mathematics.
Course Objectives:
1. To facilitate the students with a concrete foundation of probability and calculus.
2. To analyze problems in Science and Engineering applications through probability and calculus
methods.
Credits: 02 Teaching Scheme: Theory: 2 Hours/Week
Course Relevance: The course is relevant to all branches of Engineering. Its an important foundation for
computer science fields such as machine learning, artificial intelligence, computer graphics, randomized
algorithms, image processing, and scientific simulations.
SECTION-I
UNIT 1: Probability Theory 04 Hours
Definition of probability: classical, empirical and axiomatic approach of probability, Addition theorem
of probability, Multiplication theorem of probability, Baye’s theorem of inverse probability and
examples.
UNIT II: Random Variables and Mathematical Expectation 04 Hours
Random variable, Discrete Random Variable, Continuous Random Variable, Mathematical
Expectation, Addition theorem of Expectation, Multiplication theorem of Expectation, Chebychev's
Inequality.
UNIT III: Probability Distributions 06 Hours
Distribution Function, Probability Mass Function, Probability density function, Continuous
Distributions: Normal Distribution, joint probability distribution, Discrete Distributions: Binomial
distribution, Poisson's distribution-Illustrative examples.
SECTION-II
UNIT IV: Probability Densities 04 Hours
The Uniform Distribution, Log-normal distribution, Beta distribution, Gamma distribution.
UNIT V: Multivariable Calculus 06 Hours
Partial Differentiation and Its Applications: Functions of two or more variables, partial derivative,
euler theorem, total derivative, Jacobian, Maxima and Minima of functions of two variables and
problems.
UNIT VI: Fourier Series and Fourier Transforms 04 Hours
Definition of periodic function, Fourier expansion of periodic functions in a given interval of length
2, Determination of Fourier coefficients – Fourier series of even and odd functions, Fourier integral
theorem.
Text Books:
1. S. C. Gupta, Fundamentals of Statistics, Himalaya Publishing House, 7th Revised and
Enlarged Edition, 2016.
2. Miller & Freund’s Probability And Statistics For Engineers 9th Edition Global Edition by
Richard A. Johnson Pearson Publication.
3. Higher Engineering Mathematics B. S. Grewal Khanna Publishers, 4th Edition, 2017.
4. Erwin kreyszig, Advanced Engineering Mathematics, 9th Edition, John Wiley & Sons, 2006.
Reference Books:
5. Advanced Engineering Mathematics C. Ray Wylie, Louis C.Barrett McGraw-Hill 6th Edition
1995.
6. G. V. Kumbhojkar, Probability and Random Processes, C. Jamnadas and Co., 14th Edition,
2010.
7. G. B. Thomas and R.L. Finney, Calculus and Analytic Geometry, 9th Edition,Pearson, Reprint,
2002.
8. Higher Engineering Mathematics, B. V. Ramana McGraw-Hil 11th Edition, 2010.
9. A Text Book of Engineering Mathematics, N. P. Bali and Manish Goyal Laxmi Publications,
2014.
Course Outcomes:
Upon completion of the course, student will be able to –
1. Illustrate basics of probability and Bayes rule.
2. Solve problems related to random variables and mathematical expectation.
3. Apply discrete and continuous probability distributions in analyzing the probability models
arising in engineering field.
4. Illustrate and analyze various probability densities.
5. Apply partial differentiation for two or more variables.
6. Identify Fourier concepts and techniques to provide mathematical models of real world
situations.
Job Mapping:
1. Financial Analytic.
CO - PO Mapping:
ProgramOutcomes(PO) PSO
CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO PSO3 PSO
2 4
CO1 1 2 2 1 1 1 1
CO2 2 2 2 1 1 1 1
CO3 2 2 2 1 1 1 1
CO4 2 2 2 1 1 1 1
CO5 2 2 2 1 1 1 1
CO6 2 2 2 1 1 1 1
Average 1.88 2 2 1 1 1 1
FF No.: 654
AI2010 : Design Thinking III
Course Prerequisites:
Basic knowledge of research work, research paper and patent.
Course Objectives:
Course Relevance:
The course is offered in S.Y. and T.Y. B.Tech. to all branches of Engineering.
FFNo.: 654
AI2018 - Engineering Design & Innovation III
Course Prerequisites:
Problem Based Learning
Course Objectives:
1. To develop critical thinking and problem solving ability by exploring and proposing solutions to
realistic/social problems.
2. To Evaluate alternative approaches, and justify the use of selected tools and methods,
3. To emphasize learning activities those are long-term, inter-disciplinary and student-centric.
4. To engage students in rich and authentic learning experiences.
5. To provide every student the opportunity to get involved either individually or as a group so as to
develop team skills and learn professionalism.
6. To develop an ecosystem to promote entrepreneurship and research culture among the students.
Course Relevance:
Project Centric Learning (PCL) is a powerful tool for students to work in areas of their choice and strengths.
Along with course-based projects, the curriculum can be enriched with semester-long Engineering Design and
Development courses, in which students can solve socially relevant problems using various technologies from
relevant disciplines. The various socially relevant domains can be like Health care, Agriculture, Defense,
Education, Smart City, Smart Energy, and Swaccha Bharat Abhiyan. To gain the necessary skills to tackle
such projects, students can select relevant online courses and acquire skills from numerous sources under
guidance of faculty and enrich their knowledge in the project domain, thereby achieving project centric
learning. Modern world sustained and advanced through the successful completion of projects. In short, if
students are prepared for success in life, we need to prepare them for a project-based world. It is a style of
active learning and inquiry-based learning. Project based learning will also redefine the role of teacher as
mentor in the learning process. The PCL model focuses the student on a big open-ended question, challenge,
or problem to research and respond to and/or solve. It brings students not only to know, understand and
remember rather it takes them to nalyze, design and apply categories of Bloom’s Taxonomy.
SECTION I
Preamble - The content and process mentioned below is the guideline document for the faculties and
students to start with. It is not to limit the flexibility of faculty and students; rather they are free to
explore their creativity beyond the guideline mentioned herewith. For all courses of ED, laboratory
course contents of “Trends in Engineering Technology” are designed as a ladder to extend connectivity
of software technologies to solve real world problems using an interdisciplinary approach. The ladder in
the form of gradual steps can be seen as below:
Industry Communication Standards, Single Board Computers and IoT, Computational Biology
(Biomedical and Bioinformatics), Robotics and Drone, Industry 4.0 (Artificial Intelligence, Human-
Computer Interfacing, 5G and IoT, Cloud Computing, Big Data and Cyber Security etc).
1. www.nptelvideos.in
Course Outcomes:
On completion of the course, learner will be able to–
CO1: Identify the real life problem from a societal need point of view
CO2: Choose and compare alternative approaches to select the most feasible one
CO3: Analyse and synthesize the identified problem from a technological perspective
CO4: Select the best possible solution to solve the problem.
CO5: Design & Develop a working model of the proposed solution.
CO6: Testing and validating product performance
Major Project
Job Mapping:
CO - PO Mapping:
Program Outcomes (PO) PSO
CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3 PSO4
CO1 2 2 2 2 3 2 2 2 2 3
CO2 2 2 3 2 2 2 3 2 2 2 3 3 2 3
CO3 2 2 3 2 3 2 3 2 2 2 3 3 2 3
CO4 2 2 3 2 3 3 2 3 2 2 2 2 3 3 3
CO5 2 2 3 2 3 2 3 2 2 2 3 3 3 3
CO6 2 2 3 3 2 3 3 2 3 2 3
Average 2.0 2.0 2.83 2.16 2.6 2.5 2.0 2.0 3.0 2.0 2.16 2.0 2.66 2.8 2.5 3.0
FFNo.: 654
AI2021 : Data Structures
Course Prerequisites:
Basic programming Skills (C/C++)
Course Objectives:
1. To impart the basic concepts of data structures and algorithms.
2. To understand concepts about searching and sorting techniques.
3. To construct and implement various data structures and abstract data types including lists, stacks, queues,
trees, and graphs.
4. To make understand about writing algorithms and step by step approach in solving problems with the
help of fundamental data structures.
5. To emphasize the importance of data structures in developing and implementing efficient algorithms.
Course Relevance:
This is a basic Course for Computer allied branches. This course has a high relevance in all domains of computer based
engineering such as in Industries, research etc as a basic prerequisite course. The course is offered in S.Y. B.Tech.
to all branches of Engineering
SECTION-I
Arrays, Stacks, Queues and Linked Lists
Arrays: Representation and application of Single and Multidimensional arrays, Time & Space
Complexity Analysis.
Sorting Techniques: Bubble, Selection, Insertion, Merge, Quick, Heap sort with Analysis.
Stack: Stack representation and Implementation using arrays and Linked lists. Applications of stack in
Recursion, Expression conversions and evaluations.
Queues: Representation and implementation using array and Linked lists, Types of queues.
Applications of Queues: Job Scheduling etc.
Linked Lists: Dynamic memory allocation, Singly Linked Lists, doubly linked Lists, Circular linked lists
and Generalized linked lists, Applications of Linked list.
SECTION-II
Trees, Graphs, Hashing
Trees: - Basic terminology, representation using array and linked lists. Tree Traversals: Recursive and Non
recursive, Operations on binary tree. Binary Search trees (BST).
Advanced Trees: Introduction, AVL tree, R-B tree, B tree and B+ tree.
Graphs: Terminology and representation using Adjacency Matrix and Adjacency Lists, Graph Traversals and
Application: BFS and DFS, connected graph, Bipartite Graph, Detecting Cycle in graph. Minimum Spanning
tree: Prims and Kruskal’s Algorithm, Shortest Path Algorithms, Union Find.
Hashing: Hashing techniques, Hash table, Hash functions. Collision handling and Collision resolution
techniques, Cuckoo Hashing.
List of Tutorials:
1. Sorting Techniques: Insertion, Merge sort, Bubble, Shell Sort, Radix Sort.
4. Expression conversion like infix to prefix and postfix and vice versa.
6. Assignment based on various operations on Binary Tree (Mirror image, Height, Leaf node display,
Level wise display etc.)
5. Bloom Filters.
3. Analysis of Merge Sort, Quick Sort and Bubble Sort for Best, Average and Worst Case.
4. Solving N-queen and Josephus Problem using Backtracking , Stack and Queue respectively.
2. Graphs vs Tree Data Structures: Application based comparison? Which is best? Why? How?
9. Graphs vs Tree Data Structures: Application based comparison? Which is best? Why? How?
Design:
1. Design Single Source multiple destination Shortest Path Algorithm For Driving Application.
Case Study:
1. Consider a Suitable Example for Hashing Application. Study its Merits, Demerits and Design.
2. Consider different real life examples where different sorting, Searching techniques have been used.
Why used? How? Comparative study.
3. Why there is a need of different tree traversal algorithms? Consider different real life examples where
they are used. Why? How?
5. Compare different graph traversal algorithm by considering different real life examples where they
have used.
Blog:
4. How Hashing is useful in recent technologies? Consider any application related to it.
Surveys:
1. How application of Graph Search Algorithms ( DFS and BFS) is there in recent technologies? Consider
some real life technologies.
2. How Advanced Trees Data structure plays important role in Database management?
2. Y. Langsam, M.J. Augenstein, A.M.Tenenbaum, “Data structures using C and C++”,Pearson Education, Second
Edition.
3. Narasimha karumanchi, “Data Structures and Algorithm Made Easy”, Fifth Edition, CareerMonk
publication.
2. G. A.V, PAI , “Data Structures and Algorithms “, McGraw Hill, ISBN -13: 978-0-07-066726-6
1. https://nptel.ac.in
2. https://www.udemy.com
3. https://www.coursera.org
4. www.geeksforgeeks.org
Course Outcomes:
Upon completion of the course, student will be able to –
1. To interpret and diagnose the properties of data structures with their memory representations and time
complexity analysis.(2)
2. To use linear data structures like stacks, queues etc. with their applications (3)
3. To handle operations on various data structures with the help of dynamic storage representation.(4)
4. To demonstrate Non-linear data structures like tree and perform various operations on it.(5)
5. To handle the operations on Graph data structure and to solve the applications of Graph data
structure.(4)
6. To design and analyze the appropriate data structure by applying various hashing Techniques.(2)
Future Courses Mapping: Following courses can be learned after successful completion of this course:
Design and Analysis of Algorithms, Operating Systems, Systems Programming, Data Science and similar
courses.
Job Mapping: Data Structures and Algorithm is the necessary part of any programming job. Without Data
structures it is not possible to be good in Competitive coding. All Industries always looks for a strong knowledge
in Data structures. Without learning this course, one can’t imagine a job in computer/IT related industries and
research.
CO - PO Mapping:
Program Outcomes (PO) PSO
CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3 PSO4
CO1 3 3 1 2 2 1
CO2
2 2 3 3
CO3 2
3 3
CO4 3 1 2
1 3
CO5 3
2 3 2
CO6 2 2 3 3 3 3
2 3
Average 2.1 1.3 2 0.33 0.83 0.83 0.1 0.33 0.5 0.5 0.33 0.5 0.5 0.5 0.5 0.5
FFNo.: 654
AI2014: WEB TECHNOLOGY
Course Prerequisites:
1. Basics of Computer Programming
2. Database Management Systems
Course Objectives:
1. Understand and apply basic HTML5 tags and CSS to structure and style web pages.
2. Develop Proficiency in JavaScript for Client-Side Scripting as client-side technology in web
development.
3. Understand & apply jQuery in designing dynamic and interactive websites to improve user
experience
4. Implement Server-Side Technologies with PHP and with MySQL integration for database
management.
5. Design Modern User Interfaces with React for building complex and dynamic user interfaces
6. Build Robust Backend Systems Using Node.js
7. Integrate Full-Stack Development Skills by combining client-side (JavaScript, jQuery, React) and
server-side (PHP, MySQL, Node.js) technologies
Credits: 4 Teaching Scheme :Theory: 2 Hours/Week
Tut: 1 Hours/Week
Lab: 2 Hours/Week
Course Relevance:
Web development is the work involved in developing a website for the Internet or an intranet. Web
development can range from developing a simple single static page of plain text to complex web-based
internet applications (web apps), businesses, social network services and enterprise application development.
Apparently in today’s technology-driven society, knowing the foundations of the website design is useful.
Actually, it has grown into the world’s most important site for research, education, networking, as well as
entertainment. Most of the jobs available in the IT industries are web technology-related.
SECTION I
Introduction: Introduction to web technology, Internet and WWW, website planning and design issues,
HTML5: structure of html document, commenting, formatting tags, list tags, hyperlink tags, image, table
tags, frame tags, form tags, CSS, Bootstrap, JSON (6Hours)
Client Side Technologies: JavaScript: Overview of JavaScript, Data types, Control Structures, Arrays,
Functions and Scopes, Objects in JS, Form validation, DOM: Introduction, DOM levels, DOM
Objects, their properties and methods, Manipulating DOM (6 Hours)
JQuery: Introduction, Loading JQuery, selecting elements, changing styles, creating elements,
appending elements, removing elements, handling events. (2 Hours)
SECTION-II
ServerSide Technologies: Introduction, Features, PHP syntax, Control structures, Functions, Arrays,
String,Form Handling, File Handling, Session and Cookies, Error Handling, MySQL with PHP
(6 Hours)
React:Introduction,Architecture, Components, JSX, Class, State, Props, Events, Render function, Forms,
Lists, Router, Flux. (4 Hours)
NodeJS:Introduction, Installation of Node JS, Node JS Modules, Node Package Manager (npm), Creating
Web server, File System, Express JS, Serving Static Resources, Database connectivity.
(4 Hours)
7. Express Framework
8. Laravel Framework
9. RESTful API
1. Design and implement a web page to demonstrate the use of different HTML tags.
2. Design and develop a web page demonstrating the use of CSS tags.
3. Design a website that retrieves blog data from a local JSON file and displays it on the website using
HTML, CSS, Bootstrap, and JSON.
4. Design and develop a web page to demonstrate various methods of objects in JavaScript like
Array, String, Math, Date.
5. Design and develop a web page to demonstrate the use of jQuery, focusing on: a. Selecting
elements using different jQuery selectors. b. Performing various DOM manipulations c.
Attaching event handlers to elements and performing actions based on those events. d.
Implementing basic animations using jQuery.
6. Develop a dynamic blogging website using PHP, allowing users to submit their own blog posts
with images. The submitted posts will be stored in a JSON file
7. Installation, configuration and understanding working of XAMPP server for local host.
8. Design a dynamic web application using PHP and MYSQL as back-end to perform insert, delete,
view and update operation.
10. Design a web page demonstrating file handling operations like open, read, write, append copy,
move, delete and rename using NodeJS.
1. Bootstrap
2. Spring Framework
3. Joomla
4. Sass
5. Java Servlets
7. Angular JS
8. VueJS
9. Django
10. Laravel
2. Web Services
6. AJAX
9. Template Engine
Design:
3. Design, Develop and Deploy web application for Electricity Billing System
Case Study:
1. Angular JS
2. VueJS
3. Django
4. Flask
5. Wordpress
Blog:
3. Web Services
4. Web Security
5. Web Evolution
Surveys:
1. Comparison of Web Services
2. Frameworks for Web Development
3. Scripting languages for Web Designing
4. Web Server Vs Application Server
5. Current Technologies for Web Development
5. Robin Nixon, “Learning PHP, MySQL, JavaScript, CSS and HTML 5”,5th Edition, O’Reilly
publication
2. Adam Bretz & Colin J Ihrig, “Full Stack Javascript Development with MEAN”, SPD, ISBN-
13: 978-0992461256
1. https://www.w3schools.com
2. https://www.udemy.com/course/ultimate-web/
3. https://www.coursera.org/learn/html-css-javascript-for-web-developers?
4. https://nptel.ac.in/courses/106106222
5. https://nptel.ac.in/courses/106106156
6. https://www.udemy.com/course/full-stack-web-development-2021-guide-with-nodejs-mongodb/
Course Outcomes:
Upon completion of the course, student will be able to –
1) Design reliable, efficient, scalable front-end view of web pages using HTML5, CSS
2) Perform client-side web page validation and event handling using JavaScript.
3) Develop the web pages more dynamic and interactive using jQuery.
4) Deliver realistic and extensible lightweight web application using suitable server side
web technology like PHP
5) Design and implement User Interface for complex web applications using React
7. Build server-side applications, real time applications, andcross platform applications using NodeJS
framework
Job Mapping:
Job opportunities that one can get after learning this course
1. Frontend Developer
2. Backend Developer
3. DevOps and Software Developer
4. JavaScript Developer
5. MERN Stack Developer
6. Data Engineer
7. Full Stack Developer
CO-PO Mapping :
Program Outcomes (PO) PSO
CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3 PSO4
CO1 3 3 1 2 2 1
CO2
2 2 3 3
CO3 2
3 3
CO4 3 1 2
1 3
CO5
2 3 2 3
CO6 2 2 3 3 3 3
2 3
Average 2.1 1.33 2 0.33 0.83 0.83 0.1 0.33 0.5 0.5 0.33 0.5 0.5 0.5 0.5 0.5
FF No.: 654
AI2003: COMPUTER NETWORK
Course Objectives:
1. Understand the importance of Computer Network and its usage.
2. Study error control and flow control techniques.
3. Solve real-world problems in the context of today’s internet (TCP/IP and UDP/IP).
4. Distinguish and relate various physical Media, interfacing standards, and adapters.
5. Implement mathematically and logically the working of computer protocols in the abstract.
Course Relevance:
A computer network is a system of interconnected computers and computerized peripherals such as printers.
This interconnection among computers facilitates information sharing among them by using data
communication. The main objective of a computer network is to enable seamless exchange of data between
any two points in the world. This course will explore common network services and protocols such as email,
web services, etc. Networking is an ever-growing domain in which there is a constant need for support.
Networks are becoming progressively more and more convoluted as technology is advancing and
flourishing.
SECTION 1
Introduction
Introduction to computer network, LAN, MAN, WAN, PAN, Ad-hoc Networks, Network Architectures-
Client-Server, Peer To Peer, Network Topologies- Bus, ring, tree, star, mesh, hybrid. Communication Models-
OSI Model, TCP/IP Model, Design issues for layers. (3 Hours)
Physical Layer
Transmission media- Guided media, unguided media. Transmission Modes- Simplex, Half-Duplex and
Full-Duplex. Network Devices- Hub, Repeater, Bridge, Switch, Router, Gateways and brouter. Spread spectrum
signal, FHSS, DSSS. (3 Hours)
SECTION 2
Network Layer
Switching techniques, IP Protocol, IPv4 and IPv6 addressing schemes, Subnetting, NAT, CIDR, ICMP,
Routing Protocols- Distance Vector, Link State, Routing in Internet- RIP, OSPF, BGP, Congestion control and
QoS. (6 Hours)
Transport Layer
Services, Socket programming, Addressing, Connection establishment, Connection release, Flow control and
buffering, Multiplexing, TCP and UDP, TCP Timer management, Quality of Service (QoS), Differentiated
services, TCP and UDP for Wireless. (4 Hours)
Application Layer
Domain Name System (DNS), Hyper Text Transfer Protocol (HTTP), Email: SMTP, MIME, POP3, Webmail,
FTP, TELNET, Dynamic Host Control Protocol (DHCP), Simple Network Management Protocol (SNMP).
(3 Hours)
List of Tutorials: (Any Three)
1. Identification of various network components
2. Establishing LAN
3. Installation of network device drivers
4. Use/installation of proxy server
5. Configuration of network devices in CISCO packet tracer (Windows/Linux)
6. Implement communication between various network devices using CISCO packet tracer
(Windows/Linux)
7. Network traffic monitoring using Wireshark/Ethereal (Windows/Linux)
List of Practical’s: (Any Six)
1. Study and implement various networking commands on the terminal.
2. Use Socket programming to create a Client and Server to send a Hello message.
3. Write a program for error detection and correction for 7/8 bits ASCII codes using Hamming
Codes or CRC. Demonstrate the packets captured traces using the Wireshark Packet Analyzer
Tool for peer-to-peer mode. (50% of students will perform Hamming Code and others will
perform CRC)
4. Write a program to simulate Go back N and Selective Repeat Modes of Sliding Window Protocol in peer-
to-peer mode
5. Write a program to find the class and type of a given IP address.
6. Write a program to demonstrate subnetting and find the subnet masks.
7. Write a program using a TCP socket for the wired network for the following:
a. Say Hello to each other (For all students) b. File transfer (For all students)
b. Calculator (Arithmetic) (50% students) d. Calculator (Trigonometry) (50% students)
c.
8. Write a program using UDP Sockets to enable file transfer (Script, Text, Audio and Video on file each)
between two machines.
9. Write a program to implement: a. Network Routing: Shortest path routing, AODV. b. Analysis of
congestion control (TCP and UDP).
10. Write a program to analyze the following packet formats captured through Wireshark for wired networks.
SY-TY-FINAL YEAR AI & DS AY 2024-25 66
Vishwakarma Institute of Technology, Pune Issue 01:Rev No. 00 : Dt. 01/08/22
Blog:
1. Communication Protocol
2. Emerging Trends in Computer Networks
3. Use of IOT in Networks
4. Cloud-based Network Solutions for real-world problems
6. Recent Trends in Computer Security
Surveys:
1. Survey of Wireless Technologies
2. Survey of Congestion control methodologies
3. Survey of Bluetooth Technology
4. Survey of Virtual Private Networks
5. 5 Survey of ADHOC Networks
Assessment Scheme:
Practical End Semester Examination
Lab Assessment
Course Project CVV
Text Books:
1. James F. Kurose, and Keith W. Ross,” A Top-Down Approach,” 4th edition, Publisher: Addison-
Wesley ISBN: 0-321-49770-8
2. Behrouz A. Forouzan ,“Data Communication and Networking”, 4th edition, Tata McGraw Hill
Andrew S. Tanenbaum, “Computer Networks” ,5th Edition,
Pearson Education
Reference Books:
1. Kurose, Ross, “Computer Networking a Top Down Approach Featuring the Internet‖”, Pearson; 6th
edition (March 5, 2012), ISBN-10: 0132856204
2. Holger Karl and Andreas Willig, “Protocols and Architectures for Wireless Sensor Network”, Wiley,
ISBN: 0-470-09510-5
3. C. Siva Ram Murthy and B. S. Manoj, “Ad Hoc Wireless Networks: Architectures and Protocols”, Prentice Hall, 2004
3.
Moocs Links and additional reading material:
1. https://nptel.ac.in/courses/106105183
2.https://www.my-mooc.com/en/categorie/computer-networking
COURSE OUTCOMES
1. Select network architecture, topology and essential components to design computer networks.
2. Estimate reliability issues based on error control, flow control by using bandwidth, latency,
throughput and efficiency.
3. Design mechanisms to demonstrate channel allocation in wired and wireless computer networks.
4. Analyze data flow between peer-to-peer in an IP network using Application, Transport and Network
Layer Protocols.
5. Implement the client server application using socket. Develop Client-Server architectures and
prototypes by the means of correct standards, protocols and technologies.
Future Courses Mapping:
1. Network Security
2. Cybersecurity
3. Software Defined Network
Job Mapping:
Job opportunities that one can get after learning this course
1. Network Administrator
2. System Engineer
3. Network Architect
CO – PO Mapping :
Program Outcomes (PO) PSO
CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3 PSO4
CO1 3 3 3 2 2
CO2 3 2 3 2 2 2 2
CO3 2 2 3 2 2 2
CO4 2 2 3 2 2 2
CO5 2 3 3 2 2 2 2 2
CO6 2 2 3 2 2 2
Average 2.40 2.25 2.67 3.00 2.33 3.00 2.00 2.00 2.00 2.00 2.00 2.00 2.00 2.00 2.00 2.00
FFNo.: 654
Subject Code : DIGITAL ELECTRONICS AND MICROPROCESSOR
Course Prerequisites:
Basic electronics system
Course Objectives:
1. Learn and illustrate the standard representation for logical functions
2. Explore the knowelege of digital electronics.
3. Design applications based on combinational and sequential circuits.
4. Demostrate the concept of microprocessor system.
5. Adopt the knowledge based on microprocessor instuctions.
6. Illustrate the concept of interrupts and service routine.
Course Relevance:
The course is offered in S.Y. B.Tech. (AI & DS) Engineering
SECTION-I
Digital Fundamentals
Number Systems – Decimal, Binary, Octal, Hexadecimal, 1s and 2s complements, Codes – Binary, BCD,
Excess 3, Gray, Alphanumeric codes, Boolean theorems, Logic gates, Universal gates, Sum of products
and product of sums, Minterms and Maxterms, Karnaugh map Minimization
(4 Hours)
Combinational Digital Circuits:
Standard representation for logic functions, simplification of logic functions using K-map, minimization of
logical functions. Dont care conditions.BCD code,Gray code, Excess-3 code, Code converter, 4 bit binary
adder & Sub-tractor:7483, Multiplexers & De-multiplexers, Encoder: Priority encoders, Decoders:
74138,ALU: 74181,Parity generator and checker.
(5 Hours)
Sequential Circuit:
Introduction of flip-flop (F.F), 1 bit memory cell, clocked S-R, J-K, T, DFlip-flop: Truth table, Excitation
table,Characteristics table, Shift Register, Asynchronous and Synchronous counter,Sequence Generator,
Sequences detector (Moore and Mealy).
(5 Hours)
SECTION-II
Introduction to 8086 microprocessor:
Internal Architecture, Generation of physical address8086,8086 memory segmentation, Register
Organization,Addressing modes: Immediate addressing, Register addressing, Direct addressing, Indirect
addressing, Relative addressing, Indexed addressing, Bit inherent addressing, bit direct addressing.
(4 Hours)
8086 Instructions types
Instruction types, formats, timings, Data transfer instructions, Arithmetic instructions, Logical instructions,
Branch instructions, Subroutine instructions, Bit manipulation instruction. 8086 pin functions: Minimum
& Maximum Mode System,Ready and Reset pin significance,
(5 Hours)
Interrupt Structure and Programmable Interval Timer:
Interrupt Structure, Interrupt service Routine, Interrupt Vector Table, Hardware and Software Interrupts,
INTR, NMI, Interrupt Response, Execution of an ISR, Priority of Interrupts.8259-(Programmable Interval
timer/counter) block diagram, control word, Operating modes of 8259, Interfacing with 8086 processor
and Programming. (5 Hours)
1. List of Tutorials:
2. Evolution of Computing Devices
3. Instructions types, formats and execution
4. Interrupts in Microprocessor
5. Trends in computer architecture
6. RISC Vs CISC architecture: A Case Study
7. ARM processor architecture
8. Latest Technology in Embedded systems
9. Multiplier Control Unit
10. Booth’s Encoding Pattern for Fast Scalar Point Multiplication in ECC for Wireless Sensor Networks
11. Internet of Things (IoT) in 5G Wireless Communications
12. State of the art parallel processor design.
13. Memory management in mobile OS.
• String length
• Reverse of String
• Palindrome
2. Memory System
3. Replacement Algorithms
4. Pipelining
5. Cache Coherence
6. Virtual Memory
7. Hazards in Pipelining
8. Super Computer
a. 2013
2. Douglas Hall, “Microprocessors and Interfacing”,2nd Edition, Tata McGraw Hill Publications,
ISBN 0-07-025742-6.
3. “Advanced 80386, programming techniques ” , James Turley , Tata McGraw Hill Publications,
ISBN – 0-07-881342-5
4. Intel 80386 Programmer's Reference Manual 1986, Intel Corporation, Order no.: 231630- 011,
December 1995.
5. R.P. Jain, “Modern Digital Electronics,”3rdEdition, Tata McGraw-Hill, 2003, ISBN 0 - 07 - 049492
– 4.
2. M. Mano, “Digital Design”, 3rd Edition, Pearson Education, 2002, ISBN - 81 - 7808 – 555 – 0.
3. A. Malvino, D. Leach, “Digital Principles and Applications”, 5th Edition, Tata McGraw Hill, 2003,
ISBN 0 - 07 - 047258 – 05.
Course Outcomes:
Upon completion of the course, student will be able to –
1. Learn and illustrate the standard representation for logical functions
2. Explore the knowledge of Digital logic circuits.
3. Design applications based on combinational and sequential circuits.
4. Demonstrate the concepts of microprocessor systems
5. Adapt the knowledge based on microprocessor instructions
6. Illustrate the concept of interrupts and its service routine
Job Mapping:
Job opportunities that one can get after learning this course
1. AI Engineer
2. Data Architect.
3. Data Engineer.
4. Statistician.
5. Database Administrator.
6. Business Analyst
8. Infrastructure Architect
9. Enterprise Architect
CO - PO Mapping:
Program Outcomes (PO) PSO
CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3 PSO4
CO1 3 1 2 2 2 3
CO2 2 3 2
2 3 2 1 3
CO3 2 3 2 2 3
2 3 2 2
CO4 3 2 2
2 2 3 3
CO5 3 2 2 2
2 1 2 3 3
CO6 1 2 2 2 2 2 3
3
Average 2.33 1.67 2.20 1.50 2.25 2.50 2.33 3.00 2.00 2.00 2.00 2.00 3.00 3.00 2.67 2.50
FFNo.: 654
AI2017: AUTOMATA THEORY
Course Prerequisites:
Basic Mathematics and Programming
Course Objectives:
1. To design suitable computational model/s for accepting / recognizing a given formal language
2. To compare computational models with respect to their power in recognizing different types of languages
3. To understand notion of un/decidability of problems
SECTION-I
Finite Automata:
Automaton as a model of computation, Alphabets, Strings, Languages, Deterministic Finite
Automata (DFA), Nondeterministic finite Automata (NFA), State Minimization algorithm, NFA
with epsilon transition, pumping lemma. (5 Hours)
Regular Expression :
Regular Expression (RE) Definition, Application, Kleene’s Theoram; Equivalance of RE and
DFA, Closure properties of Regular Languages, My hill-Nerode theorem and its applications.
(5 Hours)
Grammar:
Chomsky hierarchy, Context Free Grammars (CFG), Derivation, Languages of CFG, Constructing
CFG, Derivation trees, Ambiguity in CFGs, Removing ambiguity, CNF, GNF, Chomsky
hierarchy, Applications of CFG. (4 Hours)
SECTION-II
Pushdown Automata:
Pushdown Automata (PDA), Acceptance by final state /empty stack, Deterministic and Non-
deterministic PDAs, Equivalence of PDA and CFG, Context Sensitive Languages, Context
List of Tutorials:
1. Data Visualization
2. Distances and Projections
3. Singular Value Decomposition
4. Principal Component Analysis
5. Optimization
6. Normal & Binomial Distribution
7. Hypothesis Testing
8. ANOVA test
9. Linear Regression
10. Logistic Regression
11. Nearest Neighbor Classification
12. Decision Trees based classification
13. Naive Bayes classification
14. Clustering
15. Evaluation of model performance
16. Bagging & Boosting approaches
1. Course Outcomes:
2. Students should be able to design Automata / Regular expression for given
computational problems
3. Students should be able to correlate given computational model with its Formal Language
4. Students should be able to understand Chomsky hierarchy and write grammar for languages
Job Mapping:
Job opportunities that one can get after learning this course
1. Software Engineer
2. AI Engineer
3. Machine Learning Engineering
4. Machine Learning Scientist
CO-PO Mapping :
Program Outcomes (PO) PSO
CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3 PSO4
CO1 3 3 2 2 1 - - - - - - 2 - 2 2 -
CO2 - - - - - - 2 2 -
3 3 2 2 1 1 -
CO3 - - - - - - 2 2 -
3 3 2 2 1 1 -
CO4 - - - - - - 1 2 -
3 3 2 2 1 - 2
CO5 - - - - - - 2 2 -
3 3 3 2 1 - 2
CO6 3 1 - - - - - - 1 - 2 2 -
3 3 3
Average 3 3 2.33 2.1 1 - - - - - - 1.33 - 1 1 -
FF No.: 654
AI2012 : Design Thinking IV
Course Prerequisites:
Basic knowledge of research work, research paper and patent.
Course Objectives:
CO-PO Mapping:
Program Outcomes (PO) PSO
CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3 PSO4
CO1 2 1 2 2 1 3 1 3 2 2 2 1 2 2 3 3
CO2 2 2 3 3 2 2 2 3 2 2 1 3 2 3 3 3
CO3 2 2 2 2 2 2 2 3 2 2 3 3 2 3 3 3
CO4 2 2 2 2 2 2 1 3 2 2 2 1 2 3 3 3
CO5 2 2 2 2 2 2 2 3 2 2 2 3 3 2 2 3
CO6 2 2 2 2 2 2 2 3 2 2 2 1 3 2 2 2
CO7 2 2 2 2 2 2 2 3 2 2 2 3 3 3 3 3
Average 2 1.9 2.1 2.1 1.9 2.1 1.7 3.0 2.0 2.0 2.0 2.1 2.4 2.6 2.7 2.9
FFNo.: 654
AI2020 - Engineering Design & Innovation IV
Course Prerequisites:
Problem Based Learning
Course Objectives:
1. To develop critical thinking and problem solving ability by exploring and proposing solutions to
realistic/social problems.
2. To Evaluate alternative approaches, and justify the use of selected tools and methods,
3. To emphasize learning activities those are long-term, inter-disciplinary and student-centric.
4. To engage students in rich and authentic learning experiences.
5. To provide every student the opportunity to get involved either individually or as a group so as to
develop team skills and learn professionalism.
6. To develop an ecosystem to promote entrepreneurship and research culture among the students.
Credits: 4 Teaching Scheme : Theory: 1 Hours/Week
Lab: 6 Hours/Week
Course Relevance:
Project Centric Learning (PCL) is a powerful tool for students to work in areas of their choice and strengths.
Along with course-based projects, the curriculum can be enriched with semester-long Engineering Design
and Development courses, in which students can solve socially relevant problems using various technologies
from relevant disciplines. The various socially relevant domains can be like Health care, Agriculture,
Defense, Education, Smart City, Smart Energy, and Swaccha Bharat Abhiyan. To gain the necessary skills
to tackle such projects, students can select relevant online courses and acquire skills from numerous sources
under guidance of faculty and enrich their knowledge in the project domain, thereby achieving project centric
learning. Modern world sustained and advanced through the successful completion of projects. In short, if
students are prepared for success in life, we need to prepare them for a project-based world. It is a style of
active learning and inquiry-based learning. Project based learning will also redefine the role of teacher as
mentor in the learning process. The PCL model focuses the student on a big open-ended question, challenge,
or problem to research and respond to and/or solve. It brings students not only to know, understand and
remember rather it takes them to nalyze, design and apply categories of Bloom’s Taxonomy.
SECTION I
Preamble - The content and process mentioned below is the guideline document for the faculties and
students to start with. It is not to limit the flexibility of faculty and students; rather they are free to
explore their creativity beyond the guideline mentioned herewith. For all courses of ED, laboratory
course contents of “Trends in Engineering Technology” are designed as a ladder to extend connectivity
of software technologies to solve real world problems using an interdisciplinary approach. The ladder in
the form of gradual steps can be seen as below:
Industry Communication Standards, Single Board Computers and IoT, Computational Biology
(Biomedical and Bioinformatics), Robotics and Drone, Industry 4.0 (Artificial Intelligence, Human-
Computer Interfacing, 5G and IoT, Cloud Computing, Big Data and Cyber Security etc).
2. Problem Based Learning. By Mahnazmoallem, woei hung and Nada Dabbagh, Wiley Publishers. 2019.
3. Stem Project based learning and integrated science, Technology, Engineering and mathematics
approach. By Robert RobartCapraro, Mary Margaret Capraro
1. www.nptelvideos.in
Course Outcomes:
On completion of the course, learner will be able to–
CO1: Identify the real life problem from a societal need point of view
CO2: Choose and compare alternative approaches to select the most feasible one
CO3: Analyse and synthesize the identified problem from a technological perspective
CO4: Select the best possible solution to solve the problem.
CO5: Design & Develop a working model of the proposed solution.
CO6: Testing and validating product performance
Job Mapping:
Software Engineer. Software Developer, IT Engineer, Research Associate.
CO-PO Mapping:
Program Outcomes (PO) PSO
CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3 PSO4
CO1 2 2 2 2 3 2 2 2 2 3
CO2 2 2 3 2 2 2 3 2 2 2 3 3 2 3
CO3 2 2 3 2 3 2 3 2 2 2 3 3 2 3
CO4 2 2 3 2 3 3 2 3 2 2 2 2 3 3 3
CO5 2 2 3 2 3 2 3 2 2 2 3 3 3 3
CO6 2 2 3 3 2 3 3 2 3 2 3
Average 2.0 2.0 2.83 2.16 2.6 2.5 2.0 2.0 3.0 2.0 2.16 2.0 2.66 2.8 2.5 3.0
FFNo.: 654
SY-TY-FINAL YEAR AI & DS AY 2024-25 83
Vishwakarma Institute of Technology, Pune Issue 01:Rev No. 00 : Dt. 01/08/22
Course Objectives:
1. To learn the distinction between optimal reasoning Vs. human like reasoning
2. To understand the concepts of state space representation, exhaustive search, heuristic search
togetherwith the time and space complexities.
Course Relevance:
Technologies driven by artificial intelligence (AI) have transformed industries and everyday life. The
possibilities for AI applications are virtually unlimited and sought after in practically every industry
segment. That's why global organizations are actively recruiting professionals with specialized skills and
proficiencies needed to develop future AI technological innovations.
SECTION-I
Topics and Contents:
Uninformed Search Methods: Depth First Search, Breadth First Search, Depth Limited Search,Iterative
Deepening Depth First Search, Bidirectional Search, Comparison of Uninformed search Strategies.[ CO3
] [ PO3, PSO1 ]
SECTION-II
Topics and Contents:
Knowledge based agents, Wumpus world. Propositional Logic: Representation, Inference, Reasoning
Patterns, Resolution, Forward and Backward Chaining. First order Logic: Representation, Inference,
Reasoning Patterns, Resolution, Forward and Backward Chaining.
[ CO4 ] [ PO2 ]
Representation, Structure, Backtracking. Expert System: Design, Implementation, Case study of Expert
System in PROLOG.[ CO4] [ PO2 ]
Blocks world, STRIPS, Implementation using goal stack, Planning with state space search: Forward
state space search, Backward state space search, Heuristics for state space search. Partial Order Planning,
Planning Graphs, Hierarchical planning, Least commitment strategy.
Conditional Planning, Continuous Planning. [ CO5 ] [ PO4 ]
List of Tutorials:
1. AI problem formulation [ CO1 ] [ PO1 ]
CO1,CO2 ] [ PO1,PO2 ]
1. How Automobile Sector Is Preparing For The 4th Industrial Revolution using AI [CO3][PO3]
2. How Indian Retail Giant Is Using AI And Robots To Prepare For The 4th Industrial
Revolution [CO3] [PO3]
3. Rolls-Royce And Google Partner To Create Smarter, Autonomous Ships Based On AI[CO3]
[PO3].
4. The Amazing Ways Tesla Is Using Artificial Intelligence And Big Data [CO3] [PO3]
5. The Incredible Ways John Deere Is Using Artificial Intelligence To TransformFarming[CO3]
[PO3]
Course Outcomes:
On the completion of course, student will able to
1. Understand the basics of the theory and practice of Artificial Intelligence as a disciplineand
about intelligent agents capable of problem formulation.
2. Identify problems that are amenable to solution by AI methods, and which AI methodsmay be
suited to solving a given problem.
3. Evaluation of different uninformed and informed search algorithms on well formulated
problems along with stating valid conclusions that the evaluation supports.
4. Formulate and solve a given problem using Propositional and First order logic.
5. Analyze the AI problem using different planning techniques.
Design and carry out an empirical evaluation of different algorithms on problemformalization, and
state the conclusions that the evaluation supports.
Job Mapping:
Job opportunities that one can get after learning this course
CO - PO Mapping:
CO Program Outcomes (PO) PSO
PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PSO PSO
1 2 3 4 5 6 7 8 9 0 1 2 1 2 3 4
CS3202.1 2
CS3202.2 2
CS3202.3 2 1
CS3202.4 1
CS3202.5 3
CS3202.6 1
Average 2 3 3 3 1
FFNo.: 654
AI3002 : Operating Systems
Course Prerequisites:
1. Basics of Computer System
2. Computer Organization
3. Data Structures
4. Any Programming Language.
Course Objectives:
1. To understand the basic concepts and functions of Operating Systems.
2. To gain knowledge of process synchronization and its mechanism.
3. To get familiar with CPU scheduling algorithms.
4. To discuss different deadlock handling mechanisms.
5. To learn memory management techniques and virtual memory.
6. To evaluate various disk scheduling algorithms.
Course Relevance:
This course focuses on functions of operating systems. Operating system is a System software that
manages the resources of the computer system and simplifies applications programming. The Operating
System acts as a platform of information exchange between your computer's hardware and the applications
running on it.
SECTION-I
Introduction: What is OS?, Interaction of OS and hardware, Goals of OS, Basic functions of OS, OS Services, System
Calls, Types of System calls, Types of OS: Batch, Multiprogramming, Time Sharing, Parallel, Distributed & Real-
time OS. (4 Hours)
Process management: Process Concept, Process States: 2, 5, 7 state models, Process Description, Process Control,
Multithreading models, Thread implementations – user level and kernel level threads, Concurrency: Issues with
concurrency, Principles of Concurrency, Mutual Exclusion: OS/Programming Language Support: Semaphores,
Mutex, Classical Process Synchronization problems. (6 Hours)
SECTION-II
Deadlock: Principles of deadlock, Deadlock Prevention, Deadlock Avoidance, Deadlock Detection,
Deadlock Recovery. (4 Hours)
Memory Management: Memory Management requirements, Memory Partitioning, Paging, Segmentation,
Address translation, Placement Strategies: First Fit, Best Fit, Next Fit and Worst Fit. Virtual Memory, VM
with Paging, VM with Segmentation, Page Replacement Policies: FIFO, LRU, Optimal. (5 Hours)
I/O management: I/O Devices - Types, Characteristics of devices, I/O Buffering. Disk Scheduling: FCFS,
SSTF, SCAN, C-SCAN (5 Hours)
List of Tutorials:
1. Linux commands
2. Comparison of different OS
3. OS structures
4. Inter Process Communication
5. Symmetric Multiprocessor
6. Thread Scheduling
7. Translation Lookaside buffer
8. Secondary storage management
9. Linux Memory management
10. File System in Windows and Linux
11. Inter process communication in Linux using FIFO
12. Producer Consumer Problem
13. Reader Writer Problem
10. Disk Scheduling Algorithms: SSTF, SCAN, C-Look considering the initial head position moving
away from the spindle.
8. I/O processors
9. Linux Vs Windows OS
10. Best OS for smartphones
2. Silberschatz A., Galvin P., Gagne G.;“Operating System Concepts” ; 9th Edition; John Wiley and
Sons;
3. Yashavant Kanetkar; “Unix Shell Programming”; 2nd Edition, BPB Publications
4. Sumitabha Das; “Unix Concepts and Applications”; 4th Edition, TMH.
5. D M Dhamdhere; “Systems Programming & Operating Systems”; Tata McGraw Hill Publications,
ISBN – 0074635794
6.John J Donovan; “Systems Programming”; Tata Mc-Graw Hill Edition, ISBN-13978-0-07-460482-3
Course Outcomes:
Upon completion of the course, student will be able to –
1. Examine the functions of a contemporary Operating System with respect to convenience, efficiency
and the ability to evolve.
2. Demonstrate knowledge in applying system software and tools available in modern operating
systems for process synchronization mechanisms.
3. Apply various CPU scheduling algorithms to construct solutions to real world problems.
4. Identify the mechanisms to deal with Deadlock.
5. Illustrate the organization of memory and memory management techniques
Acquire a detailed understanding of various I/O buffering techniques and disk scheduling algorithms.
3. Linux programming
4. Distributed System/Computing
System Programming
Job Mapping:
Job opportunities that one can get after learning this course
1. Linux Administration
2. Kernel Developers
3. Application Developers
4. System programmer
1. System architect
CO - PO Mapping:
Program Outcomes (PO) PSO
CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3 PSO4
CO1 3 2 2 3
CO2 3 2 3 1 3 2 1
CO3 2 3 3 2 3 1 1
CO4 3 2 3 3
CO5 3 3 2 3 3
CO6 3 2 2 3 2 1
Average 2.83 2.33 2.66 2 2 3 3 3 3 3 3 3 - 1.66 - 1
FFNo.: 654
AI3003 : Statistical Inference
Course Prerequisites:
1. Basic knowledge of Statistics and Probability, Python
Course Objectives:
1. Get basic understanding about statistical models and their use.
2. Apply regression models with hyper-parameter tuning methods depending upon the problem
context .
3. Get a better understanding of probabilistic models.
Course Relevance:
Machine learning, Data Science
SECTION-I
Topics and Contents (4Hrs):Introduction, Basic concepts from statistics, definition and uses of models,
how models are used in practice, key steps in the modeling process. Linear models and optimization, least
square estimation,principal component analysis, linear discriminant analysis, Factor analysis, Concept of
Outliers
Correlation, Regression and Generalization (4Hrs):Correlation and its type, Assessing performance of
Regression – Error measures,Overfitting and Underfitting
Regression Types (6hrs):Univariate Regression ,Multivariate Linear Regression,Regularized Regression -
Ridge Regression and Lasso, Theory of Generalization: Bias and Variance Dilemma, Training and Testing
Curves, CaseStudy of Polynomial Curve Fitting, Cross validation
SECTION-II
Topicsand Contents(4hrs):Introduction to probabilistic models, some examples of probabilistic models,
noisy channel model, source channel model, joint source channel models, Monte Carlo Simulation
Building blocks of probability models (5hrs), various distributions (Bernoulli, Binomial, Normal
distribution), Key Concepts in Probability Distributions, mixture models, bootstrap maximum likelihood
methods, Bayesian method, expectation maximization
Markov-chain models(5Hrs), Hidden Markov model, Conditional random fields, Latent variable
probability models
Course Outcomes:
Upon completion of the course, student will be able to –
1. Demonstrate various statistical methods used for modeling purpose
2. Analyze various correlation methods that provides insights of the real world problem
3. Apply suitable linear and regression models to evaluate the performance of models
4. Formulate given problem using probabilistic models for concise representation
5. Demonstrate various distribution methods beneficial for model building
6. Apply Markov modeling to compute functions efficiently
Job Mapping:
Job opportunities that one can get after learning this course
1. For all jobs in the domain of AI&DS knowledge of statistical inference is prerequisite. To name a
few Big Data Engineer, Business Intelligence Developer, Data Scientist, Machine Learning
Engineer, Research Scientist, AI Data Analyst, Product Manager, AI Engineer, Robotics Scientist,
Machine Learning Architect etc.
CO - PO Mapping:
Program Outcomes (PO) PSO
CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3 PSO4
CO1 3 2 2 1 1 2 1 1 3 2 3
CO2 3 2 2 1 1 1 1 2 3 2 3
CO3 3 2 2 2 1 2 1 2 3 2 3
CO4 3 2 2 2 1 1 1 2 3 2 3 2
CO5 3 2 2 1 1 1 1 1 3 2 3
CO6 3 2 2 2 1 1 1 1 3 2 3
Average 3 2 2 1.5 1 1.33 1 1.5 3 2 3 2
FFNo.: 654
AI3004 : MACHINE LEARNING
Course Prerequisites:
1. Linear Algebra, Statistics, Probability, Calculus, and Programming Languages
Course Relevance:
Machine Learning is the applicable science of making computers work without being explicitly programmed.
It is mainly an application of Artificial Intelligence (AI) that allows systems to learn and improve from
experience, without any human intervention or assistance. Machine Learning keeps on innovating every
aspect of the business and has been shaping up the futures even more powerfully now.Machine learning is
the fuel we need to power robots, alongside AI. With ML, we can power programs that can be easily
updated and modified to adapt to new environments and tasks- to get things done quickly and efficiently.
Machine learning skills help you expand avenues in your career
SECTION-I
Types of Learning: Supervised, Unsupervised, Reinforcement. Concept Learning: Concept Learning,
General-to-Specific Ordering: Task, search, Find S algorithm, Version space and the candidate elimination
algorithm, inductive bias, Bias, Variance, Underfitting, Overfitting.
Decision Tree Learning: Representation, Basic decision tree learning algorithm, Issues in decision tree
learning, and Random Forest Model.
Validation: Cross validation, Confusion matrix.
Bayesian Learning: Probability, Bayesian Learning: Bayes theorem,Naïve Bayes algorithm, Maximum
likelihood hypothesis. Ensemble Learning: Bagging and boosting.
SVM: Kernel functions, Linear SVM, Nonlinear SVM, Hyper parameter tuning, Handling Imbalanced
Data set. KNN Model.
SECTION-II
Clustering Algorithms- Unsupervised learning, clustering. Partition based clustering, K-means and K-
medoid, Hierarchical clustering, Density based clustering algorithms.
Association rules mining – Apriori Algorithm, Confidence and Support parameters. Introduction to
Hidden Markov model, Genetic algorithm.
Dimensionality Reduction Techniques: PCA, SVD etc.
Reinforcement learning: Exploration, Exploitation, Rewards, Penalties, Markov Decision Process, Q-
Learning and Bellman Equation.
Artificial Neural Networks: Basics of ANN, Feed Forward Neural Networks, Deep neural networks
etc.
8. Cancer Classification
4. Limitations of ML
5. Ensemble Learning
9. Reinforcement Learning
13. Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift
Textbooks
1. T. Mitchell, ― Machine Learning, McGraw-Hill, 1997.
2. Peter Flach: Machine Learning: The Art and Science of Algorithms that Make Sense of Data, Cambridge
University Press, Edition 2012
Course Outcomes:
The student will be able to –
1. Demonstrate knowledge learning algorithms and concept learning.
2. Evaluate Decision tree learning algorithm.
3. Formulate a given problem within the Bayesian learning framework and SVM.
4. Apply different clustering algorithms used in machine learning.
5. Explore Association rule mining and dimensionality reduction.
8. Analyze research-based problems using Machine learning techniques like Reinforcement Learning
and ANN.
Job Mapping:
Job opportunities that one can get after learning this course
1. ML Engineer
2. Data Scientist
CO - PO Mapping:
ProgramOutcomes(PO) PSO
CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3 PSO4
CO1 2 2 1 1
CO2 3 3 3 3 2 2 2
CO3 3 3 3 3 3 2 2 2
CO4 3 2 2 2 2 2 2 3 3
CO5 3 2 2 2 2 2 3 2
CO6 3 3 2 3 3 3 3 3 3 2 2
Average 2.83 2.6 2.4 2.6 2.3 2.3 2 2 2.6 2.5 2
FF No.: 654
AI2012 : Design Thinking V
Course Prerequisites:
Basic knowledge of research work, research paper and patent.
Course Objectives:
CO-PO Mapping:
Program Outcomes (PO) PSO
CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3 PSO4
CO1 2 1 2 2 1 3 1 3 2 2 2 1 2 2 3 3
CO2 2 2 3 3 2 2 2 3 2 2 1 3 2 3 3 3
CO3 2 2 2 2 2 2 2 3 2 2 3 3 2 3 3 3
CO4 2 2 2 2 2 2 1 3 2 2 2 1 2 3 3 3
CO5 2 2 2 2 2 2 2 3 2 2 2 3 3 2 2 3
CO6 2 2 2 2 2 2 2 3 2 2 2 1 3 2 2 2
CO7 2 2 2 2 2 2 2 3 2 2 2 3 3 3 3 3
Average 2 1.9 2.1 2.1 1.9 2.1 1.7 3.0 2.0 2.0 2.0 2.1 2.4 2.6 2.7 2.9
FFNo.: 654
AI2020 - Engineering Design & Innovation V
Course Prerequisites:
Problem Based Learning
Course Objectives:
1. To develop critical thinking and problem solving ability by exploring and proposing solutions to
realistic/social problems.
2. To Evaluate alternative approaches, and justify the use of selected tools and methods,
3. To emphasize learning activities those are long-term, inter-disciplinary and student-centric.
4. To engage students in rich and authentic learning experiences.
5. To provide every student the opportunity to get involved either individually or as a group so as to
develop team skills and learn professionalism.
6. To develop an ecosystem to promote entrepreneurship and research culture among the students.
Credits: 4 Teaching Scheme : Theory: 1 Hours/Week
Lab: 6 Hours/Week
Course Relevance:
Project Centric Learning (PCL) is a powerful tool for students to work in areas of their choice and strengths.
Along with course-based projects, the curriculum can be enriched with semester-long Engineering Design
and Development courses, in which students can solve socially relevant problems using various technologies
from relevant disciplines. The various socially relevant domains can be like Health care, Agriculture,
Defense, Education, Smart City, Smart Energy, and Swaccha Bharat Abhiyan. To gain the necessary skills
to tackle such projects, students can select relevant online courses and acquire skills from numerous sources
under guidance of faculty and enrich their knowledge in the project domain, thereby achieving project centric
learning. Modern world sustained and advanced through the successful completion of projects. In short, if
students are prepared for success in life, we need to prepare them for a project-based world. It is a style of
active learning and inquiry-based learning. Project based learning will also redefine the role of teacher as
mentor in the learning process. The PCL model focuses the student on a big open-ended question, challenge,
or problem to research and respond to and/or solve. It brings students not only to know, understand and
remember rather it takes them to nalyze, design and apply categories of Bloom’s Taxonomy.
SECTION I
Preamble - The content and process mentioned below is the guideline document for the faculties and
students to start with. It is not to limit the flexibility of faculty and students; rather they are free to
explore their creativity beyond the guideline mentioned herewith. For all courses of ED, laboratory
course contents of “Trends in Engineering Technology” are designed as a ladder to extend connectivity
of software technologies to solve real world problems using an interdisciplinary approach. The ladder in
the form of gradual steps can be seen as below:
Industry Communication Standards, Single Board Computers and IoT, Computational Biology
(Biomedical and Bioinformatics), Robotics and Drone, Industry 4.0 (Artificial Intelligence, Human-
Computer Interfacing, 5G and IoT, Cloud Computing, Big Data and Cyber Security etc).
2. Problem Based Learning. By Mahnazmoallem, woei hung and Nada Dabbagh, Wiley Publishers.
2019.
3. Stem Project based learning and integrated science, Technology, Engineering and mathematics
approach. By Robert RobartCapraro, Mary Margaret Capraro
1. www.nptelvideos.in
Course Outcomes:
On completion of the course, learner will be able to–
CO1: Identify the real life problem from a societal need point of view
CO2: Choose and compare alternative approaches to select the most feasible one
CO3: Analyse and synthesize the identified problem from a technological perspective
CO4: Select the best possible solution to solve the problem.
CO5: Design & Develop a working model of the proposed solution.
CO6: Testing and validating product performance
Job Mapping:
Software Engineer. Software Developer, IT Engineer, Research Associate.
CO - PO Mapping:
Program Outcomes (PO) PSO
CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3 PSO4
CO1 2 2 2 2 3 2 2 2 2 3
CO2 2 2 3 2 2 2 3 2 2 2 3 3 2 3
CO3 2 2 3 2 3 2 3 2 2 2 3 3 2 3
CO4 2 2 3 2 3 3 2 3 2 2 2 2 3 3 3
CO5 2 2 3 2 3 2 3 2 2 2 3 3 3 3
CO6 2 2 3 3 2 3 3 2 3 2 3
Average 2.0 2.0 2.83 2.16 2.6 2.5 2.0 2.0 3.0 2.0 2.16 2.0 2.66 2.8 2.5 3.0
FFNo.:654
AI3010: DEEP LEARNING
Course Prerequisites:
Linear algebra, probability theory and statistics, Digital signal processing, Computer vision
Course Objectives:
1. To present the mathematical, statistical and computational concepts for stable representations of high-
dimensional data, such as images ,text
2. To introduce NN and techniques to improve network performance
3. To introduce Convolutional networks
4. To introduce Sequential models of NN
5. To build deep nets with applications to solve real world problem
Course Relevance:
Deep learning is revolutionizing the technology and business world today. It is a subfield of machine learning
concerned with algorithms to train computers to perform tasks by exposing neural networks to large amounts
of data, its analysis and prediction. It is an incredibly powerful field with capacity to execute feature
engineering on its own, uses multiple neural network layers to extract patterns from the data. Top applications
of Deep learning involve, self-driving cars, natural language processing, robotics, finance, and healthcare.
SECTION-I
Foundations of neural networks and deep learning, Logistic regression as a neural network, different
activation function, logistic regression cost function, logistic regression gradient descent, vectorizing
logistic regression, forward and backward propagation, Techniques to improve neural networks:
regularization and optimizations, hyperparameter tuning, batch normalization, data augmentation, deep
learning frameworks, Implementation of neural network for a case study. Convolutional Neural
Networks, padding, strided convolution, pooling layers, convolutional implementation of sliding
windows
SECTION-II
Deep Learning Basics, Deep Feed forward Networks, Regularization of deep learning, Transfer Learning,
Applications. Implementation of Long-Short Term Memory (LSTMs) with keras and tensor flow in
python. Over fitting concepts, Stochastic gradient descent optimizer, encoders decoders, Generative
network GANs, Memory nets, Attention models.
Applications: object classification, object detection, face verification. ResNet, inception networks,
bounding boxes, anchor boxes. Sequence modelling: recurrent nets, architecture, vanishing and exploding
gradient problem, Applications & use cases.
Case Study:
1. Deep learning for security
2. Bag of tricks for efficient text classification
Blog :
1. Brain tumor segmentation with deep neural networks
2. Region-based convolutional networks for accurate object detection and segmentation
3. Human pose estimation via deep neural networks
4. Content Based Image Retrieval
5. Visual Perception with Deep Learning
6. Music genre classification system
Surveys:
1. Machine translation using deep learning -survey
2. Shaping future of radiology using deep learning
3. Training Recurrent Neural Networks
4. Text generation with LSTM
5. Deep learning applications in Biomedicine
Textbooks
1. Goodfellow, I., Bengio, Y., and Courville, A., Deeep Learning, MIT Press,2016.
2.Nikhil Buduma, Fundamentals of Deep Learning, O’Reilly, First Edition, ISBN No. 978-14-9192561-
4
Reference Books
1. Yegnanarayana, B., Artificial Neural Networks PHI Learning Pvt. Ltd,2009.
2. Golub, G.,H., and Van Loan,C.,F., Matrix Computations, JHU Press,2013.
3. 3.SatishKumar,NeuralNetworks:AClassroomApproach,TataMcGraw-HillEducation, 2004.
Moocs Links and additional reading material:
1. www.nptelvideos.in
2. https://nptel.ac.in/noc/courses/noc20/SEM1/noc20-cs11
3. https://nptel.ac.in/noc/courses/noc20/SEM1/noc20-cs50
Course Outcomes:
Job Mapping:
Job opportunities that one can get after learning this course
1. ML Engineer
2. Data Scientist
CO - PO Mapping:
Program Outcomes (PO) PSO
CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3 PSO4
CO1 3 0 0 0 2 0 0 0 0 0 0 2 0 0 0 0
CO2 3 2 2 0 2 0 0 0 2 0 1 3 2 0 3 0
CO3 3 2 0 2 0 0 0 0 2 0 0 2 2 0 2 2
CO4 2 0 0 2 0 0 0 0 2 0 2 2 0 0 2 3
CO5 2 0 2 0 2 0 0 0 0 0 3 2 2 0 3 0
CO6 2 3 2 2 2 0 0 0 0 0 3 2 2 0 2 2
Average 2.33 2.3 2 2 2 0 0 0 2 0 2.25 2.3 2 0 2.4 2.33
FFNo.: 654
AI3011 : Complexity Algorithms
Course Prerequisites:
1. Basic course on Programming, Data structures, Discrete structures
Course Objectives:
1. Formulate a given computational problem in an abstract and mathematically precise manner.
2. Choose a suitable paradigm to design algorithms for given computational problems.
3. Understand asymptotic notations and apply suitable mathematical techniques to find algorithms'
asymptotic time and space complexities.
4. Understand the notion of NP-hardness and NP-completeness and the relationship with the
intractability of decision problems.
5. Apply randomized, approximation algorithms for given computational problems.
SECTION-I
Basic introduction to time and space complexity analysis: Asymptotic notations (Big Oh, small oh, Big
Omega, Theta notations). Best case, average case, and worst-case time and space complexity of algorithms.
Overview of searching, sorting algorithms. Adversary lower bounds (for the comparison-based sorting
algorithms, for finding second minima). Divide and Conquer: General strategy, Binary search and
applications, Analyzing Quick sort ,Merge sort, Counting Inversions, finding a majority element, Order
statistics(randomized and deterministic algorithms, simple dynamic programming based algorithms to
compute Fibonacci Numbers, Optimal binary search tree(OBST)construction, 0- 1 Knapsack, Traveling
Sales person Problem, All pair shortest path algorithm, Longest increasing subsequence problem
SECTION-II
Greedy strategy: General strategy, Analysis and correctness proof of minimum spanning tree and shortest
path algorithms, fractional knapsack problem, Huffman coding, conflict free scheduling.
Backtracking strategy: General strategy, n-queen problem, backtracking strategy for some NP complete
problems(e.g. graph coloring, subset sum problem, SUDOKU)
Introduction to Complexity Classes and NP-completeness: Complexity classes P, NP and their
interrelation, Notion of NP-hardness and NP-completeness,
Introduction to Randomized and Approximation algorithms: Introduction to randomness in computation,
Las-Vegas and Monte-Carlo algorithms, Abundance of witnesses/solutions and application of
randomization, solving SAT for formulas with “many” satisfying assignments, randomized quick sort,
majority search, coupon collector problem, randomized data structures (randomized BST, skip lists)
List of Tutorials:
1. Complexity analysis based on asymptotic notations, solution recurrences.
2. Complexity analysis based on Divide and Conquer strategy.
3. Complexity analysis based on Divide and Conquer strategy.
4. Complexity analysis based on Dynamic Programming strategy.
5. Complexity analysis based on Dynamic Programming strategy.
6. Complexity analysis based on Greedy strategy.
7. Complexity analysis based on Backtracking strategy.
Course Outcomes:
Upon completion of the course, students will be able to –
1. Understand the basic notation for analyzing the performance of the algorithms.
2. To apply appropriate algorithmic paradigms to design efficient algorithms for computational
problems
3. To apply suitable mathematical techniques to analyze the asymptotic complexity of the algorithm
for more complex computational problems.
4. To understand the significance of NP-completeness of some decision problems and its relationship
with the tractability of the decision problems.
5. To understand the significance of randomness, and approximability in computation and design
randomized and approximation algorithms for suitable problems
6. To incorporate appropriate data structures, and algorithmic paradigms to craft innovative scientific
solutions for complex computing problems
Job Mapping:
Job opportunities that one can get after learning this course
1. Software Engineer
2. Data Scientist
3. Business Intelligence
CO - PO Mapping:
Program Outcomes (PO) PSO
CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3 PSO4
CO1 2 2 2 3 2
CO2 3 2 2 3 2 3 2
CO3 2 3 3
CO4 3 2 2 2 2
CO5 2 2 2 2 2 2 2 3
CO6 2 3 3 2 2 3 3
Average 2.2 2.4 2.5 2 2.66 2.5 2.5 2 2.5 2 2 2.0 2 2 2.66
FFNo.: 654
AI3012: SOFTWARE DESIGN AND METHODOLOGIES
Course Prerequisites:
Proficient of programming in a high-level, object-oriented language, Familiarity with data structures and
algorithms.
Course Objectives:
1. Understanding object-oriented analysis and design.
2. Learn different software process models and principles and practices
3. Practicing UML to model OO systems
4. Familiarity with current models and standards for design.
5. Exposure to organizational issues in software design.
6. The skill to analyze problems critically, leveraging both theoretical and technical knowledge to
devise solutions and systems
SECTION-I
Overview of Software Engineering: Software Process Framework, Process Patterns, Process
Models: Code-and-Fix, Waterfall Model, Incremental Models, Evolutionary Models, Iterative
Development, The Unified Process, Agile process, Software Engineering Principles and Practices.
( 4Hours) \
Software Modeling: Introduction to Software Modeling, Advantages of modeling, Principles of
modeling ( 2Hours)
Evolution of Software Modeling and Design Methods: Object oriented analysis and design
methods, Concurrent, Distributed Design Methods and Real-Time Design Methods, Model Driven
Architecture (MDA), 4+1 Architecture, Introduction to UML, UML building Blocks, COMET Use
Case–Based Software Life Cycle.( 4 Hours)
Requirement Study: Requirement Analysis, SRS design, Requirements Modeling. Use Case:
Actor and Use case identification, Use case relationship (Include, Extend, Use case Generalization,
Actor Generalization), Use case templat ( 2 Hours)
Study of classes (analysis level and design level classes)
Methods for identification of classes: RUP (Rational Unified Process), CRC (Class,
Responsibilities and Collaboration), Use of Noun Verb analysis (for identifying entity classes,
controller classes and boundary classes). ( 2 Hours)
SECTION-II
Class Diagram: Relationship between classes, Generalization/Specialization Hierarchy,
Composition and Aggregation Hierarchies, Associations Classes, Constraints. Object diagram,
Package diagram, Component diagram, Composite Structure diagram, Deployment Diagram. ( 4
Hours)
Activity diagram: Different Types of nodes, Control flow, Activity Partition, Exception handler,
Interruptible activity region, Input and output parameters, Pins.( 2Hours)
Interaction diagram: Sequence diagram, Interaction Overview diagram, State machine diagram,
Advanced State Machine diagram, Communication diagram, Timing diagram. ( 3 Hours)
Architecture in the Life Cycle: Architectural styles, Architecture in Agile Projects, Architecture
and Requirements, Designing an Architecture. ( 2 Hours)
Design Patterns: Introduction, Different approaches to select Design Patterns.( 1 Hour)
Creational patterns: Singleton, Factory, Structural pattern: Adapter, Proxy. ( 1 Hour)
Behavioral Patterns: Iterator, Observer Pattern with applications( 1 Hour)
Blog:
1. Software Engg Do’s and Don’ts
2. Which Process Model?
3. Scrum
4. Devops
5. Data ops
Surveys:
1. Software Design
2. Software Methodologies
3. Software Architectures
4. Design Patterns
5. Architechtural Patterns
Course Outcomes:
1. Upon completion of the course, student will be able to –
2. Summarize capabilities and impact of Software Development Process Models and justify
process maturity through application of Software Engineering principles and practices
focusing tailored processes that best fit the technical and market demands of a modern
software project.
3. Discriminate competing and feasible system requirements indicating correct real world
problem scope and prepare stepwise system conceptual model using stakeholder analysis
and requirement validation.
4. Formulate system specifications by analyzing User-level tasks and compose software
artifacts using agile principles, practices and Scrum framework.
Job Mapping:
Job opportunities that one can get after learning this course
1. Requirements Engineer
2. Software Architecht
3. Software Designer
CO - PO Mapping:
Program Outcomes (PO) PSO
CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3 PSO4
CO1 3 3 3 2 3
CO2 2 3 2 2 2 2 2
CO3 2 2 3 2 1
CO4 3 3 3 2 2 2
CO5 2 2 2 2
CO6 2 2 2 3 3 3
Average 2.25 2.6 3 2.5 2.5 2 2 2 2 2 3 3 2 2 3
FF No.: 654
AI3015 : Design Thinking VI
Course Prerequisites:
Basic knowledge of research work, research paper and patent.
Course Objectives:
CO-PO Mapping:
Program Outcomes (PO) PSO
CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3 PSO4
CO1 2 1 2 2 1 3 1 3 2 2 2 1 2 2 3 3
CO2 2 2 3 3 2 2 2 3 2 2 1 3 2 3 3 3
CO3 2 2 2 2 2 2 2 3 2 2 3 3 2 3 3 3
CO4 2 2 2 2 2 2 1 3 2 2 2 1 2 3 3 3
CO5 2 2 2 2 2 2 2 3 2 2 2 3 3 2 2 3
CO6 2 2 2 2 2 2 2 3 2 2 2 1 3 2 2 2
CO7 2 2 2 2 2 2 2 3 2 2 2 3 3 3 3 3
Average 2 1.9 2.1 2.1 1.9 2.1 1.7 3.0 2.0 2.0 2.0 2.1 2.4 2.6 2.7 2.9
FFNo.: 654
AI3016 - Engineering Design & Innovation VI
Course Prerequisites:
Problem Based Learning
Course Objectives:
1. To develop critical thinking and problem solving ability by exploring and proposing solutions to
realistic/social problems.
2. To Evaluate alternative approaches, and justify the use of selected tools and methods,
3. To emphasize learning activities those are long-term, inter-disciplinary and student-centric.
4. To engage students in rich and authentic learning experiences.
5. To provide every student the opportunity to get involved either individually or as a group so as to
develop team skills and learn professionalism.
6. To develop an ecosystem to promote entrepreneurship and research culture among the students.
Credits: 4 Teaching Scheme : Theory: 1 Hours/Week
Lab: 6 Hours/Week
Course Relevance:
Project Centric Learning (PCL) is a powerful tool for students to work in areas of their choice and strengths.
Along with course-based projects, the curriculum can be enriched with semester-long Engineering Design
and Development courses, in which students can solve socially relevant problems using various technologies
from relevant disciplines. The various socially relevant domains can be like Health care, Agriculture,
Defense, Education, Smart City, Smart Energy, and Swaccha Bharat Abhiyan. To gain the necessary skills
to tackle such projects, students can select relevant online courses and acquire skills from numerous sources
under guidance of faculty and enrich their knowledge in the project domain, thereby achieving project centric
learning. Modern world sustained and advanced through the successful completion of projects. In short, if
students are prepared for success in life, we need to prepare them for a project-based world. It is a style of
active learning and inquiry-based learning. Project based learning will also redefine the role of teacher as
mentor in the learning process. The PCL model focuses the student on a big open-ended question, challenge,
or problem to research and respond to and/or solve. It brings students not only to know, understand and
remember rather it takes them to analyze, design and apply categories of Bloom’s Taxonomy.
SECTION I
Preamble - The content and process mentioned below is the guideline document for the faculties and
students to start with. It is not to limit the flexibility of faculty and students; rather they are free to
explore their creativity beyond the guideline mentioned herewith. For all courses of ED, laboratory
course contents of “Trends in Engineering Technology” are designed as a ladder to extend connectivity
of software technologies to solve real world problems using an interdisciplinary approach. The ladder in
the form of gradual steps can be seen as below:
2. Problem Based Learning. By Mahnazmoallem, woei hung and Nada Dabbagh, Wiley Publishers.
2019.
3. Stem Project based learning and integrated science, Technology, Engineering and mathematics
approach. By Robert RobartCapraro, Mary Margaret Capraro
1. www.nptelvideos.in
Course Outcomes:
On completion of the course, learner will be able to–
CO1: Identify the real life problem from a societal need point of view
CO2: Choose and compare alternative approaches to select the most feasible one
CO3: Analyse and synthesize the identified problem from a technological perspective
CO4: Select the best possible solution to solve the problem.
CO5: Design & Develop a working model of the proposed solution.
CO6: Testing and validating product performance
Job Mapping:
Software Engineer. Software Developer, IT Engineer, Research Associate.
CO - PO Mapping:
Program Outcomes (PO) PSO
CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3 PSO4
CO1 2 2 2 2 3 2 2 2 2 3
CO2 2 2 3 2 2 2 3 2 2 2 3 3 2 3
CO3 2 2 3 2 3 2 3 2 2 2 3 3 2 3
CO4 2 2 3 2 3 3 2 3 2 2 2 2 3 3 3
CO5 2 2 3 2 3 2 3 2 2 2 3 3 3 3
CO6 2 2 3 3 2 3 3 2 3 2 3
Average 2.0 2.0 2.83 2.16 2.6 2.5 2.0 2.0 3.0 2.0 2.16 2.0 2.66 2.8 2.5 3.0
FF No.: 654
IT4219 : FROM CAMPUS TO CORPORATE
Course Prerequisites:
1. Fundamental knowledge about Engineering
2. Basic knowledge about business concept
3. Management Knowledge
Course Objectives:
1. Understanding the evolution of technology
2. Understanding Innovation
3. Types of companies and typical organization - Who does What
4. Understanding companies - Domain, Offering, Customers, Strategy, Company Culture & Professionalism
5. Understanding companies financially
Course Relevance:
The course is offered in B.Tech. to all branches of Engineering
The course is relevant to all branches of Engineering and beyond, since students work in different companies after
graduation. So understanding the way different types of companies work is essential for students in final year.
SECTION I
Planning and Execution : Product Development - Understanding beyond the theory, Quality - Understanding
beyond the theory, Product Management, Solutioning and Design - A key step between requirements and
delivery, Site Reliability , Devops, Support - Understanding beyond the theory, Common metrics and
measurements in a software delivery organization ( 6 Hours)
Key Tool types and processes - End to End product lifecycle management, Issues Management and Lifecycle
- A key aspect of customer Satisfaction, Software delivery models and Release cycles - how they work in the
real world, Usability by end user - UI/UX and other key concepts and its importance (6 Hours)
SECTION II
Useful Skills : Continuous learning and improvement - An essential skill, Ownership and Leadership,
Analyzing ones career path and making educated judgements, Time management and multi tasking model,
Being a effective Mentee and Mentor, Being Inquisitive: Why asking questions is more difficult than giving
answers? Hands on exercise (6 Hours)
Effective Articulation and Colaboration, Introducing yourself & Making Effective Presentations, Problem
breakdown and resolving model, Effective project and program management, Mind Mapping - A powerful
technique to learn, Must have tips to succeed in any career (8 Hours)
Case Study: Unique Home assignments will be set up for all groups
Course Outcomes:
Job Mapping:
Job opportunities that one can get after learning this course
1. Business Analyst
2. Infrastructure Architect
3. Enterprise Architect
4. Project Manager
5. Design Engineer
FF No.:654
AI4001: BLOCKCHAIN &CYBER SECURITY
Course Prerequisites:
Computer Networks, knowledge of any programming Language (C/C++/Java/Python)
Course Objectives:
1.To study basics of Blockchain Technology, its applications and different types of use cases
2.To acquire know ledge of smart contract sin ethereum Blockchain and Hyperledger fabric.
Course Relevance:
During the course, students will earn more about the history, the most important block chain concepts, the
philosophy of decentralization behind blockchain, and main discussions happening with in the block chain
environment. In addition, you will learn about (potential)applications of block chain and the impact it could
have on the business world. This course Provides an in depth study of the rapidly changing and fascinating
field of computer forensics. Combines both the technical expertise and the knowledge required to investigate,
detect and prevent digital crimes. Knowledge on digital forensics legislations, digital crime, forensics
processes and procedures, data acquisition and validation, e-discovery tools E-evidence collection and
preservation, investing at in operating systems and file systems, network forensics, art of steganography and
mobile device forensics.
SECTION-I
Private Blockchain, Federated Blockchain with Examples and Difference, Digital Signatures and Demo of
Blockchain Tools, Blockchain Applications and usecases in Government
Real Time Use Case Applications in Blockchain: Consensus and Types of Consensus with examples Smart
Contracts in Blockchain, Need of Smart Contracts with Examples Practical Hands-On with Smart Contracts,
Developing Smart Contracts, Industry use cases of Smart Contracts, Smart Contracts for Business and
Professionals: Smart Contracts in Detail Developing own Smart Contracts, Programming basics of Solidity
(DataTypes) and Advanced Solidity, EV Min relation with Smart Contracts and Gas Price, Running and
Debugging Smart Contracts in Remix (Detailed),
Deploy and Debug Smart Contract with Truffle Smart Contracts in Ethereum Blockchain, Crypto-
Economics and Cryptocurrency, Types of Cryptocurrency and Cryptography, Cryptonomics and
Cryptocurrency Transactions, Validand Invalid Transactions, Previous use cases of Cryptocurrency, Bitcoin
in detail: How Bitcoin System works, Decentralized Cryptocurrency and its use cases, Making your own
Cryptocurrency with Development and deployment, Permissioned Blockchain (RAFT Consensus,
Byzantine General Problem, Practical Byzantine Fault Tolerance), Blockchain for Enterprise–Overview,
Blockchain Components and Concepts, Hyperledger Fabric–Transaction Flow Hyper ledger Fabric Details,
Fabric–Membership and Identity Management, Hyperledger Fabric Network Setup, Fabric Demoon IBM
Blockchain Cloud, Fabric Demoon IBM Blockchain Cloud continued., Fabric Demo, deploy from scratch,
Hyperledger Composer–Application Development, Hyperledger Composer–Network Administration,
Blockchain Use Cases.
SECTION-II
DIGITAL FORENSICS: Introduction to Digital Forensics, Forensic Software and Hardware, Analysis and
Advanced Tools, Forensic Technology and Practices, Forensic Ballistics and Photography, Face, Iris and
Fingerprint Recognition, Audio Video Analysis, Windows System Forensics, Linux System Forensics,
Network Forensics.
Surveys
1. Digital Forensic Investigation Methods
2. Digital Forensics
3. Virtual Currency
4. IoT Security
5. The current state of the Blockchain landscap
Suggest an assessment Scheme: that is best suited for the course. Ensure 360 degree assessment and check
if it covers all aspects of Bloom's Taxonomy.
Course Outcomes:
1. Identify threads in cybersecurity.
2. Use tools for digital forensics.
3. Investigate and Analyze data of cybersecurity.
4. Use the blockchain technology for security in real life application.
5. Study and understand the blockchain concepts and tools required for its implementation.
6. Develop the applications of blockchain for solving social problems.
FF No.: 654
AI4002: OPTIMIZATION TECHNIQUES
Course Prerequisites:
Course Objectives:
Course Relevance: This course is widely applicable in software and manufacturing industries to
improve productivity and quality.
SECTION-I
SECTION-II
FF No.: 654
CS4217: HUMAN COMPUTER INTERACTION
Course Prerequisites:
Course Objectives:
1. Understand the theoretical dimensions of human factors involved in the acceptance of computer
interfaces.
2. Describe and use HCI design principles, standards and guidelines.
3. Identify the various tools and techniques for interface analysis, design, and evaluation.
4. Discuss tasks and dialogs of relevant HCI systems based on task analysis and dialog design.
5. Analyze and discuss HCI issues in groupware, ubiquitous computing and World Wide Web-
related environments.
Course Relevance: This course provides an introduction to and overview of the field of human-
computer interaction (HCI). HCI is an interdisciplinary field that integrates the ries and
methodologies from computer science, cognitive psychology, design, and many other areas.
Students will work on both individual and team projects to design, implement and evaluate
computer interfaces. The course is open to students from all disciplines, providing them with
experience working in interdisciplinary design teams.
SECTION-I
SECTION-II
Case Studies: Web Usability, Mobile Usability, Embedded Systems, Social Networking Sites,
Messengers, E-Governance Sites, Security Tools, e-Health applications
7. Interactive Tables
Case Study:
1. HCI guidelines/principles for designing home page for museum website.
2. Vitalethnographic observations in IT products.
3. Gulf of execution with respect to left-handed users.
4. User-based and expert-based usability evaluation methods.
5. Any mobile app highlighting its ethno-cultural and accessibility features.
Blog
1. Heuristic Evaluation using a Likert’s scale.
2. Golden rules of interface
3. Effects of metaphors in design of social networking sites.
4. LUICD
5. Semioticanalysis.
Surveys
1. Investigate popularity of remote synchronous communication among user groups.
2. e-governance website
3. Ubiquitous and Context-Aware Interaction
4. Iterative Design, Participatory Design, Navigation Design, Visual Design
Cognitive Walk through evaluation technique
Suggest an assessment Scheme: Suggest an Assessment scheme that is best suited for the course.
Ensure 360 degree assessment and check if it covers all aspects of Blooms Taxonomy.
MSE ESE PPT GD VIVAHALAB
2. 2.“Designing the User Interface”, Ben Shneiderman, Pearson Education, ISBN81-7808-262-4,3rd Edition
2. “The Essential Guide to User Interface Design”, Wilbert O. Galitz, Wiley-dreamtech India
(P)Ltd., ISBN 81-265-0280-0, 2nd Edition.
3. “Human-Computer Interaction in the New Millennium”, John M. Carroll, Pearson Education, ISBN 81-
7808-549-6
FF No.: 654
AI4004: PATTERN RECOGNITION USING FUZZY NEURAL NETWORKS
Course Prerequisites:
Course Objectives:
1. To understand fundamentals of pattern recognition.
2. To understand the fuzzy set design
3. To learn fundamentals of fuzzy sets and their use in practice.
4. To learn training of hybrid system-fuzzy neural networks(FNN)
5. To apply trained fuzzy neural networks (FNN) for inferences.
6. To understand evaluating performance of FNNs.
Credits:2 Teaching Scheme Theory:2Hours/Week
Course Relevance: This course applicable for complex pattern recognition tasks
SECTION-I
Topics and Contents
Pattern recognition fundamentals:- Definition of a pattern, statistical and syntactic patterns, feature
vector, feature dimensionality, pattern class, definition of classification, clustering, hybrid
classification-clustering
Introduction to fuzzy set theory:- Definition of fuzzy set, membership function, types of fuzzy sets,
operations on fuzzy sets like union, intersection, compliment, plot of fuzzy membership function, core
and support parts of fuzzy sets
Introduction to Artificial Neural networks:- Biological neuron, McCulloch Pitts model, general
neuron model, perceptron, activation function types, perceptron learning algorithm for 2-class
classification, single layer perceptron classifiers and learning algorithms,brief intro to multilayers
perceptrons
SECTION-II
Topics and Contents
Fuzzy min-maxneural network(FMN) architecture for classification-
Concept of hyper-box, hyper-box as a fuzzy set, hyperbox membership function-definition,
interpretation and use,FMN learning algorithm-hyper-box expansion, overlap test and hyperbox
contraction, FMN recall/testing algorithm, comments on hyperbox size, sensitivity parameter and
performance evaluation.
Concept of hyperline, hyperlineas a fuzzy set, fuzzy membership function design, FHLSNN training
and testing algorithm,
Case Study:
1. HCR using FHLSNN
2. Fourier Fuzzy neural network for pattern recognition
3. Fuzzy neural network by Kawnand Kai
4. UFHLSNN for pattern recognition
5. Some other to pics decided by instructor
Blog
1. Fuzzy neural networks as hybrid system
2. FMN for hybrid classification and clustering by Bargiala
3. FHLSNN membership function design
4. Flaws in the contraction of hyperboxes in FMN
5. Some other topics decided by instructor
Surveys
1. Evolution of Fuzzy neural networks
2. Fuzzy neural networks applications in healthcare/medical diagnosis
3. Developments in Fuzzy systems
4. Back propagation training algorithm
5. Some other topics decided by instructor
Suggest an assessment Scheme: Suggest an Assessment scheme that is best suited for the course.
Ensure 360 degree assessment and check if it covers all aspects of Blooms Taxonomy.
MSE PPT Presentation ESE GD Viva LAB
Text Books:(As per IEEE format)
1. Timothy J Ross, Fuzzy logic with engineering applications, 3rd edition, Wiley, 2010
2. Jacek M. Zurada, Introduction to artificial neural systems, Jaico publishing house, 1992
2. P. K. Simpson, Fuzzy min-max neural networks Part-2.clustering, IEEE Transactions on Fuzzy Systems,
Vol.1(1), 1993
3. U. V. Kulkarni, T. R. Sontakke and G. D. Randale, Fuzzy hyperline segment neural network for rotation in
variant And written character recognition, in Proc. Joint conf. on Neural Networks: IJCNN01, Washington DC,
USA, pp .2918-2923,July2001.
5.Priyadarshan Dhabe, Prashant Vyas, Devrat Ganeriwal, Aditya Pathak, Pattern classification using
updated fuzzy hyper-line segment neural network and it's GPU parallel
implementation for large datasets using CUDA, International Conference on Computing, Analytics and Security
Trends (CAST), 2016
6.Priyadarshan S Dhabe, Sanman D Sabane, Improved UFHLSNN (IUFHLSNN) for Generalized
Representation of Knowledge and Its CPU Parallel Implementation Using Open MP, Springers EAI
International Conference on Big Data Innovation for Sustainable Cognitive Computing, 2020
Moocs Links and additional reading material:
1.https://www.youtube.com/watch?v=ZBCg_nH1hVQ (Video lecture on FMN by Prof. Biswas,
IITKGP)
2.https://www.youtube.com/watch?v=0e0z28wAWfg (Backpropagation algorithm)
Course Outcomes:
The student will be able to–
1. Design fuzzy set for a given application
2. Decide architecture of FNN for a given real problem
3. Apply FMN for solving real world problems
4. Train FNN for pattern recognition
5. Test FNN for their recall in pattern recognition Evaluate performance of FNN
FF No. 654
AI4012: AUGMENTED REALITY AND VIRTUAL REALITY
Course Objectives:
1. Learning different components of Augmented and Virtual Reality Systems
2. Understanding VRmodel development
3. Understanding ARmodel development
4. Integrating different sensors with AR-VR systems
5. Understanding different applications of AR-VR
Course Relevance: This subject is important in all domains to implement simulation or prototype
of different systems.
SECTION-I
SECTION-II
distortion shading.
Elements of image processing required for AR, Object recognition: SIFT, Object tracking.
Vuforia for marker based AR, Pose Estimation for marker based AR, Designing marker.
Case study and sample applications.
Lab Assignments
1. 3D objects display
2. Solar Model
3. Home interior
4. Vehicle Model
5. Hand-watch making and test on Hand
6. 2D Game
7. 3D Maze Game
8. 3D vehicle racing game
9. Ray tracing simulation
10. Photon mapping simulation
4. Mediated reality
5. Vuforia
6. Marker based AR
7. Marker less tracking
8. Euler rotation theorem and axis-anglerotation
9. Quaternion
10. Visual and depth perception
Case Study:
1. Raytracing in Unity
2. Pixelshading in Unity
3. Distortionshading in Unity
4. Imageorderrendering in Unity
5. Poseestimation in AR
Blog
1. AR/VR models for Kids
2. AR/VR models to study machine design
3. AR/VR models to study networking
4. AR/VR models for space research
5. AR/VR models for wearing devices
Surveys
1. Image processing for VR/AR
2. Projections inVR/AR
3. Light effect in VR/AR
4. Texture mapping in AR/VR
5. Shadowing technique in AR/VR
1. Alan B Craig, William R Sherman and Jeffrey D Will, Developing Virtual Reality
Applications: Foundations of Effective Design, Morgan Kaufmann,2009.
2. Gerard Jounghyun Kim, Designing Virtual Systems:The Structured Approach, 2005.
Course Outcomes:
1. Learn AR-VR graphics object creation
2. Design objects in AR-VR environment
3. Develop rendering algorithms
4. Understand modelling and viewing transformations
5. Apply various reality effects like lighting, texture mapping etc.
6. Develop different modelling, gaming applications
FFNo.: 654
AI4015: NETWORK SECURITY
Course Relevance:
The course is offered in S.Y. B.Tech. to all branches of Engineering
Data Science is a multidisciplinary field. It uses scientific approaches, procedures, algorithms and
frameworks to extract knowledge and insight from a huge amount of data.
Data Science uses concepts and methods which belong to fields like information technology,
Mathematics, Statistics, Computer Science etc.
Data Science influences the growth and improvements of the product by providing a lot of intelligence
about customers and operations, by using methods such as data mining and data analysis.
The course is relevant to all branches of Engineering and beyond, since data is generated as an obvious
outcome of many processes.
Unit 1 (5Hours)
Introduction
Introduction to Security: Vulnerabilities, Threats, Threat Modeling, Risk, attack and attack types,
Avoiding attacks, Security services.
key security properties - Confidentiality, Integrity, Availability.
Protocol Vulnerabilities: DoS and DDoS, session hijacking, ARP spoofing, Pharming attack,
Dictionary Attacks.
Software vulnerabilities: Phishing, buffer overflow, Cross-site scripting attack, Virus and Worm
Features, Trojan horse, Social engineering attacks, ransomware, SYN-Flooding, SQL- injection, DNS
poisoning, Sniffing
Unit 2: (4 Hours)
Private key cryptography
Mathematical background for cryptography: modulo arithmetic, GCD (Euclids algorithm),
Role of random numbers in security, Importance of prime number, DES, AES.
Chinese remainder theorem
Unit 3: (5 Hours)
Public key cryptography
RSA: RSA algorithm, Key generation in RSA, attacks on RSA.
Diffie-Hellman key exchange: Algorithm, Key exchange protocol, Attack.
Elliptic Curve Cryptography (ECC), Elliptic Curve arithmetic. Diffie-Hellman key exchange
Unit 4 (5 Hours)
Authentication and access control
Message authentication and Hash Function. Authentication: One-Way Authentication, Mutual
Authentication, SHA-512, The Needham-Schroeder Protocol.
Kerberos, X.509 authentication service, public key infrastructure.
Access Control in Operating Systems: Discretionary Access Control, Mandatory Access Control, Role
Based Access Control.
Unit 5: (5 Hours)
Security application and design
Part A:Network layer security: IPSec for IPV4 and IPV6.
Transport layer security: SSL and TLS.
Application layer security: Security services, S/MIME, PGP, Https, Honey pots.
Security design: End-to-end security, Security composability, Open design, Cost and tradeoffs
Unit 6: (4 Hours)
Cyber Security:
Cyber Attack, Cyber Reconnaissance, Crimes in Cyber Space-Global Trends & classification, e-
commerce security, Computer forensics, facebook forensic, mobile forensic, cyber forensic, digital
forensic
Text Books
1. “Cryptography and Network Security-Principles and Practices” by William Stallings, Pearson
Education, 2006, ISBN 81-7758-774-9, 4th Edition
2. “Network Security and Cryptography”, by Bernard Menezes, Cengage Learning, 2010, ISBN 81-
315-1349-1, 1st Edition
Reference Books
1. “Computer Security: Art and Science”, by Matt Bishop, Pearson Education, 2002, ISBN
0201440997, 1st Edition.
2. “Network security, private communication in a public world”, by Charlie Kaufman, Radia
Perlman and Mike Spencer, Prentice Hall, 2002, ISBN 9780130460196, 2nd Edition
3. “Cryptography and Information Security”, by V.K. Pachghare, PHI, 2015, ISBN-978-81-203-
5082-3, Second Edition
Additional Reading
1.“Security architecture, design deployment and operations”, by Christopher M. King, Curtis Patton and RSA
press, McGraw-Hill, 2001, ISBN 0072133856, 1st Edition.
2 ‘Inside Network Perimeter Security” by Stephen Northcott, Leny Zeltser, et al, Pearson Education Asia, ISBN
8178087618, 1st Edition.
Course Outcomes:
Upon completion of the course, the students will be able to:
1. Analyze cryptographic techniques using a mathematical approach by examining nature of attack.
2. Establish type of attack on a given system.
3. Identify different types of attacks.
4. Justify various methods of authentication and access control for application of technologies to
various sections of industry and society.
5. Design a secure system for protection from the various attacks for 7 layer model by determining
the need of security from various departments of an organization.
6. Estimate future needs of security for a system by researching current environment on a continuous
basis for the benefit of society.
FF No. : 654
AI4025::HIGH PERFORMANCE COMPUTING
Course Prerequisites: Computer Organization, Operating System, Design & Analysis of Algorithms,
Data Structure
Course Objectives:
Students will be able to
1. To introduce the basic concepts of High Performance Computing
2. To understand various GPU Architecture.
3. To write CUDA programs for parallel implementation
4. To organize the memory management in GPU
5. To optimize parallel programs on GPU using CUDA. To solve the scientific problems using GPUs
Course Relevance: High Performance Computing, on the other hand, uses multiple processing elements
simultaneously to solve a problem. This is accomplished by breaking the problem into independent parts
so that each processing element can execute its part of the algorithm simultaneously with the others.
This course is required in the industry & used to set up data centres.
SECTION-1
SECTION-2
GPU Architecture: GPU architecture, Overview of the graphics pipeline, Components of GPU: Parallel
streaming processors, Multiprocessors, Shared instruction caches ,Memory hierarchy – Global, Constant,
Shared, and Texture memory; Case studies: NVIDIA Kepler K20/K40/K80/GP100/GV100/ Ampere.
Memory Organization and Optimization: Global, Shared, constant and texture memory. Memory
coalescing, memory banks and bank conflicts, Page locked host memory. Reduction operation, CUDA
code optimization. Need of profilers and analyzers, Introduction to CUDA Tools: MemCheck, Command
line & Visual Profilers.
Scientific Computing and problem solving on GPU: Single vs. double precision, light weight scientific
computing exercises, Image processing applications, Matrices etc. Parallel reduction on GPU and its
applications. Compute intensive research-oriented problems and their GPU parallelization.
CUDA code optimization and Performance improvement CUDA code optimization: Memory
optimization, Control flow optimization, Execution configuration optimization and Instruction
optimization, Concept and application of page locked host memory, Single Vs. double precision
computing on GPU: precision vss speed of computation, choosing correct precision for a real GPU
application, memory leaks and associated problems, CUDA tools: cuda-memcheck and profiler.
List of Practical :
1. Parallel GPU implementation of vector-vector operations
2. Parallel GPU implementation of vector-Matrix operations
3. Parallel computation of binomial coefficient matrix
4. Parallel GPU implementation of Matrix-Matrix operations
5. Assignment focusing on optimization of data transfer between CPU and GPU: using page locked
host memory and to avoid the data transfer
6. Assignment focusing on memory optimization: use of GPU shared, constant and texture memory.
7. Parallel GPU implementation involving kernel looping.
8. Use CUDA memcheck tool for knowing memory related errors in your source code
9. Profile your CUDA code using nvprof profiler tool for profiling your source code.
10. Write a program to know name of the GPU, its shared memory available and maximum CUDA
block size.
11. Write a program to find the best GPU to execute your CUDA kernel, if multiple GPUs are
connected to your system. Also set this device (GPU) for executing subsequent CUDA kernels.
12. A square matrix of size n x n contains either 1 or 0 in it. Write a CUDA kernel to compliment it
without warp divergence.
List of Project areas:
The given list is indicative. A project area, other than listed here, can also be chosen but need to be
mutually decided by student and teacher.
1. Pattern classification for large data sets
Job Mapping: What are the Job opportunities that one can get after learning this course Full Stack
Architect-GPU Developer Technology Engineer Software Engineer Cloud Data Analytics Engineer
Cloud Developer Senior Software Engineer HPC GPU Application Developer & Consultant GPU
Programming Professional GPU Performance Analysis Lead / Architect GPU Advocate Associate
CO - PO Mapping:
Program Outcomes (PO) PSO
CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3 PSO4
CO1 3
CO2 3
CO3 3
CO4 1
CO5 1
CO6 3
FF No. : 654
AI4007: REINFORCEMENT LEARNING
Course Objectives:
4. To provide a clear and simple account of the key ideas and algorithms of reinforcement
learning.
5. To explore how the learning is valuable to achieve goals in the real world.
6. To explore about how Reinforcement learning algorithms perform better and better in more
ambiguous, real-life environments while choosing from an arbitrary number of possible
actions.
SECTION-1
SECTION-2
Case Study:
1. Challenges in age of Ubiquitous computing
2. Ethnography in Ubiquitous computing
3. Cyber Physical System
4.Approaches to Determining Location Ubiquitous computing
5.Q-Learning for Autonomous Taxi Environment
Blog
1. Smart Devices for smart life
2. 2.Mobile affective computing
3. IOT and Cloud Computing
4. 4.Deep Q-Learning for Flappy Bird
5. 5.Q-Learning for any game Surveys
2.Richard S. Sutton and Andrew G. Barto, Reinforcement learning: An introduction, Second Edition,
MIT Press, 2019
Course Outcomes:
The students should be able to
1) Define the key features of reinforcement learning that distinguishes it from AI and non-interactive
machine learning
2) Formalize problems as Markov Decision Processes
FF No.: 654
AI4022 : BUSINESS INTELLIGENCE AND ANALYTICS
Course Prerequisites:
1. Fundamental knowledge about Business Abalytics
2. Machine Learning
3. Database Management Systems
Course Objectives:
Course Relevance:
Business Analytics and Business Intelligence together provide various industries with the opportunity
to analyze their data which could help them in making more informed decisions. These informed
decisions further impact the present and future operations of the industry.
SECTION-I
Introduction to Business Intelligence & Analytics (BIA), drivers of BIA, types of analytics: descriptive
to prescriptive, vocabulary of business analytics, course plan and resources.Technical architecture of
BIA, case analysis of AT&T Long distance, fundamentals of data management, OnLine Transaction
Processing (OLTP), design process of databases
Relational databases, normalisation, SQL queries, ShopSense case of management questions, data
warehousing, OnLine Analytical Processing (OLAP), data cube. Descriptive analytics, and visualization,
customer analytics, survival analysis, customer lifetime value, case study. Data mining process,
introduction to statistical learning, data pre-processing, data quality, overview of data mining techniques,
case study using regression analysis
SECTION-II
Introduction to classification, classification techniques, scoring models, classifier performance, ROC and
PR curves. Introduction to decision trees, tree induction, measures of purity, tree algorithms, pruning,
ensemble methods. Tree implementation in Python: problem of targeted mailing. Cluster analysis,
measures of distance, clustering algorithms, K-means and other techniques, cluster quality. A store
segmentation case study using clustering, implementation in Python, profiling clusters, cluster
interpretation and actionable insights, RFM sub- segmentation for customer loyalty. Machine learning,
Artificial Neural Networks (ANN), topology and training algorithms, back propagation, financial time
series modelling using ANN, implementation in Python. Text mining, process, key concepts, sentiment
scoring, text mining using R-the case of a movie discussion forum, summary
2. James, G., Witten, D., Hastie, T. and Tibshirani,R. (2013) An Introduction to Statistical Learning
with Applications in R, Springer: NY
Course Outcomes:
Upon completion of the course, student will be able to –
1. Understand basics and architecture of Business Intelligence & Analytics
2. Apply concepts of relational databases, normalisation, and SQL queries.
3. Describe descriptive analytics, and visualization, customer analytics, and survival analysis.
4. Explain data mining process, introduction to statistical learning, data pre-processing, data
quality, and overview of data mining techniques.
5. Describe classification techniques, scoring models, classifier performance, ROC and PR
curves.
6. Illustrate cluster analysis, measures of distance, clustering algorithms, K-means and other
techniques, and cluster quality.
Job Mapping:
Job opportunities that one can get after learning this course
1. Business Analyst
2. Project Manager
3. Data Engineer
4. Business Intelligence Development Analyst
FF No.:654
AI4017: INTERNET OF THINGS
Course Prerequisites:
Course Objectives:
1. Understand the IOT Terminology and Technology
2. Describe intelligent IOT systems.
3. Analyze Protocol standardization for IOT
4. Perform ananalys is of IOT security issues using AI technology.
5. Identify the role of cloud computing in IOT.
Course Relevance: IoT or Internet of Things is primarily a full system of all the interconnected
computing devices, having all the mechanical and digital machines. The Internet of Things is
getting smarter. Companies are in corporating artificial intelligence in particular, machine learning
into their IoT applications. Vendors of IoT platforms—Amazon, GE, IBM, Microsoft, Oracle,
PTC, and Salesforce are integrating AI capabilities IoT is beneficial because it makes our work
easy and is very less time-consuming. IoT has got a lot more scope in terms of making a career
and even exploring more opportunities if starting up with their own business.
SECTION-I
Topics and Contents
Introduction to Internet of Things–Definition & Characteristics, Importance of IoT, Physical
Design of IOT, Logical Design of IOT, IOT Enabling technologies, IOT Levels & Deployment
Templates, IoT and M2M, The role of Artificial Intelligence in IOT, Introduction to A IOT,
Applications of Artificial Intelligence in Internet of Things: Collaborative Robots, Digital
Twins, Drones, Smart Retailing, Smart Cities, Smart Health, etc.
AI and the Internet of Thing: Real World Use-Cases: Automated vacuum cleaners, like that
of the iRobotRoomba, Smart thermostat solutions, like that of Nest Labs
Design Methodology–Purpose & Requirements Specification, Process Specification, Domain
Model Specification, Information model Specification, Service specification, IOT level Speci
fications, Functional View Specifications, Operational View Specification, device and
component integration, application development, Embedded suite for IoT Physical device–
Arduino/Raspberry Pi Interfaces
SECTION-II
Suggest an assessment Scheme: Suggest an Assessment scheme that is best suited or the
course. Ensure 360 degree assessment and check if it covers all aspects of Blooms
Taxonomy.
MSE ESE Course Project GD/PPT
FF No. :654
AI4016:PREDICTIVE ANALYTICS
Course Prerequisites:
Descriptive statistics, Probability Distribution, Hypothesis testing
Course Objectives:
1. To learn, how to develop models to predict categorical and continuous outcomes.
2. Usage of techniques such as neural networks, decision trees, logistic regression, support
vector machines and Bayesian network models.
3. To know the use of the binary classifier and numeric predictor nodes.
4. To get familiarity on automation of model selection.
5. To advice on when and how to use each model.
6. To learn how to combine two or more models to improve prediction performance.
Course Relevance:
This course is widely applicable to all types of industries for improving productivity and quality.
SECTION-I
Combining data files, Aggregate Data, Duplicate Removal, Sampling DATA, Data Caching,
Partitioning data, MissingValues.
SECTION-II
Association rules.
Model Evaluation and Deployment Introduction, Model Validation,Rule Induction
Using CHAID, Automating Models for Categorical and Continuous targets, Comparing and
Combining Models, Evaluation Charts for Model Comparison, Meta Level Modeling, Deploying
Model, Assessing Model Performance,Updating a Model.
List of Course Seminar Topics:
1. Handling missing values
2. Handling outliers in data.
3. Principle Component Analysis.
4. Cross Validation.
5. Variable Importance.
6. Dealing with Nominal Predictors
7. Sampling Techniques.
8. Confusion Matrix
9. Predictive inference
10. Time series for casting
List of Course Group Discussion Topics:
1. BiasVarianceTrade off
2. Explain vs Predict
3. Classification vs Regression
4. Single model vs Ensemble model
5. Supervised vs Unsupervised approaches.
6. Accuracy vs explainability
7. Performance evaluation of classifier vs Performance evaluation of Regressor
8. Auto-regressive and moving average models.
9. Additive & Multiplicative models.
10. SEMMA(SAS) and CRISP(IBM)
List of Home Assignments: Design:
1. Design ac lassifier for real world application.
2. Design aregression model for real world application.
3. Designs voting-based ensemble model for real world application.
Blog
1. Write a blog on data summaries.
2. Write a blog on data visualization.
3. Write a blog on data preprocessing.
4. Write a blog on model evaluation and comparison of models.
5. Write a blog on dimensionality reduction techniques.
Surveys:
1. Take the survey of applications of predictive analytics in banking sector.
2. Take the survey of different model deployment techniques.
3. Take survey inventory classification models using data mining techniques.
4. Take the survey of optimization techniques in data science.
5. Take a survey ont ime series forecasting.
Course Outcomes:
The student will be able to–
1. Understand the process of formulating business objectives
2. Study dataselection/collection, preparation and process.
3. To successfully design, build, evaluate and implement predictive models for a various
business application.
4. Compare the underlying predictive modeling techniques.
5. Select appropriate predictive modeling approaches to identify cases to progress with.
6. Apply predictive modeling approaches using a suitable packages.
FF No. :654
IT4216: DATA MANAGEMENT, PROTECTION AND GOVERNANCE
Course Prerequisites:
Course Objectives:
To facilitate the learner to–
1. Get acquainted with the high-level phases of data life cycle management.
2. Acquire knowledge about the various aspects of data storage, data availability, data protection.
3. Gain exposure to various solutions/reference architectures for various use-casesAI
4. Understand the technical capabilities and business benefits of data protection.
Course Relevance: Since technology trends such as Machine Learning , Data science and AI rely on
data quality, and with the push of digital transformation initiatives across the globe, data management,
governance and security is very much important.
SECTION-I
Data Storage, Availability and Security : Introduction to data life cycle management (DLM):- Goals of
data life cycle management, Challenges involved: Volume of data source, Ubiquity of data locations, User
demand for access; Stages of data life cycle-creation, storage, usage, archival, destruction; Risks involved
without DLM, benefits, best practices.
Data storage and data availability :- Storage technology: Hard Disk Device (HDD), Solid StateDevices
(SSD), memory devices, Data access - block, files, object ; Data center End to EndView – overview of
complete stack including storage, network, host, cluster, applications,virtual machines, cloud storage ;
Storage virtualization technologies - RAID level, storagepooling, storage provisioning ; Advance topics in
storage virtualization – storage provisioning,thin provisioning; Cloud storage – S3, glacier, storage tiering;
High Availability: Introduction to high availability,clustering, failover, parallel access Data Threats and Data
center security:-Type of Threats: Denial of Service(DoS), man in the middle attacks, Unintentional data loss,
Repudiation, Malicious attacks to steal data; Introduction to Ransomware; Understanding, Identification and
Threat modelling tools Security: Authorization and authentication-access control, Transport Layer.
Security(TLS), key management, security in cloud, Design and architecture considerations for security
SECTION-II
Data Protection, Regulation and Governance : Introduction to data protection:- Introduction-Need for
data protection, basic of back-up/ restore; Snapshots for data protection, copy-data management (cloning,
DevOps); De-duplication; Replication; Long Term Retention – LTR; Archival;
Design considerations: Systemrecovery, Solution architecture, Backup v/s Archival, media considerations
and management (tapes, disks, cloud), challenges with new edge technology (cloud, containers)
Data regulation, compliance and governance:-Regulations requirements and Privacy Regulations: The
Health Insurance Portability and Privacy Act of 1996 (HIPPA), PII (Personally Identifiable Information),
General Data Protection Regulation (GDPR); Information Governance: Auditing, Legal Hold, Data
classification and tagging (Natural Language Processing); India’s Personal Data Protection bill
Applications uninterrupted: - Understand data management aspects of traditional and new edgeapplications;
Reference architecture/best practices (pick 2-3 case studies from below topics):Transactional Databases
(Oracle, MySQL, DB2), NoSQL Databases (MongoDB, Cassandra), Distributed applications (microservice
architectures), Cloud applications–Platform as Service (PaaS), Software as Service(SaaS), Kubernetes,
Multi-Tiered applications, ETL workloads, Data analytics (AI/ML)
Case Study:
1. Consider different Transactional and No SQL Databases. Comparative study.
2. Compare various cloud applications based on Platform as service and Software as service.
Blog:
1. Comparative study of data protection schemes.
2. Study of The Health Insurance Portability and Privacy Act of 1996 (HIPPA)
4. How Threat modelling tools are useful? Consider any application related to it.
Surveys:
1. Survey on data protection challenges with new edge technology like cloud
2. Survey on General Data Protection Regulation (GDPR)
3. Surveyon Data classification and tagging in Natural Language Processing
4. Surveyon Ransomware data security.
5. Surveyon Kubernetes.
TextBooks:(AsperIEEEformat)
1. Robert Spalding,‘Storage Networks: The complete Reference’.
Vic(J.R.)Winkler,‘Securing The Cloud: Cloud Computing Security Techniques and Tactics’, Syngress/ Elsevier-978-
1-59749-592-9
Reference Books:(As pe Rieee format)
1.Martin Kleppmann,‘Designing Data-Intensive Applications’, O’Reilly
WebReferences:
1. https://www.enterprisestorageforum.com/storage-hardware/storage-virtualization.html
2. https://searchstorage.techtarget.com/definition/data-life-cycle-management
3. https://www.hitechnectar.com/blogs/three-goals-data-lifecycle-management/
4. https://www.bmc.com/blogs/data-lifecycle-management/
5. https://www.dataworks.ie/5-stages-in-the-data-management-lifecycle-process/
6. https://medium.com/jagoanhosting/what-is-data-lifecycle-management-and-what-
phaseswould-it-pass-through-94dbd207ff54
7. https://www.spirion.com/data-lifecycle-management/
8. https://www.bloomberg.com/professional/blog/7-phases-of-a-data-life-cycle/
9. https://www.datacore.com/storage-virtualization/
10. https://www.veritas.com/content/dam/Veritas/docs/solutionoverviews/
11. V0907_SB_InfoScale-Software-Defined-Infrastructure.pdf
12. https://www.veritas.com/solution/digital-compliance
13. https://www.veritas.com/solution/data-protection
14. https://www.veritas.com/gdpr
Course Outcome:
By taking this course,the learner will be able to–
1. Understand the data management world, challenges and best practices.
2. Compare various concepts and technologies for enabling data storage and high availability.
3. Illustrate various types of data threats and approaches to ensure data center security.
4. Explain the various concepts related to data protection.
5. Outline different standards for compliance and governance of data.
Understand various approaches for designing data intensive enterprise applications and industry standard
solutions in data management.
FF No.: 654
AI3015 : Design Thinking VII
Course Prerequisites:
Basic knowledge of research work, research paper and patent.
Course Objectives:
FFNo.:654
AI4005: MAJOR PROJECT
Course Relevance:
This is a culmination of four years of learning into Practical. This course is essential for Graduate
Engineers to practice the successful management of a software development project. The course
emphasizes on project life cycle phases requirement engineering, system analysis and system design
and gives them the exposure to research in any area of their interest. A further aim is for students to
heighten personal awareness of the importance of developing strategies for themselves and It is a way
of increasing the student’s maturity and preparing him/her for their future career. The students carry
out cutting edge projects with a flexibility to balance between research- and application-oriented work
as per their interest. The program enables the students to find opportunities for higher studies in top
ranking universities abroad, and to find jobs in dream companies .
The Motivation for this Major Project is
a. Synthesis of knowledge
b. To demonstrate the aptitude of applying the own knowledge to solve a specific problem.
c. To mature the knowledge.
d. Preparation for joining the working world.
4. The project must have an experimental component. Students must conceive, design,
implement and operate an appropriate experiment as part of the project. The
5. experiment might be to collect data about some aspect of the design (i.e., to verify that
the design will work as expected). Alternatively, the experiment could be to verify that
the final mechanism performs as expected.
6. Upon receiving the approval, the Student Project Group will prepare a preliminary
project report consisting Requirement Definition Document, Feasibility Study
Document, System Requirement Specification, System Analysis Document, Preliminary
System Design Document. All the documents indicated will have a prescribed format.
7. The Project Work will be assessed jointly by a panel of examiners having more than Five
Years experience. The Project Groups will deliver the presentation of the Project Work
which will be assessed by the panel.
8. The Student Project Group needs to actively participate in the presentation. The panel of
examiners will evaluate the candidate’s performance based on presentation skills,
questions based on the Project Work, understanding of the Project, analysis and design
performed for the project.
9. The Student Project Groups are expected to work on the recommendations given by the
panel of examiners. In no case any variation in Project Theme will be permitted.
10. The outcome of the project should be tangible in terms of paper
publication/patent/SOP/prototype
11. The Project should justify the work worth 10 credits.
Assessment Scheme
Note:
The student needs to identify a technological problem in the area of Computer Engineering or
Information Technology of their choice like signal processing, computer vision, machine
learning and artificial intelligence, control systems, game theory, and communication
networksand address the problem by formulating a solution for the identified problem. The
project work needs to be undertaken by a group of maximum FOUR and minimum of THREE
students. The Project work will be jointly performed by the project team members.
The Project Group will prepare a synopsis of the project work which will be approved by the
concerned faculty member. The project should not be a reengineering or reverse engineering
project. In some cases, reverse engineering projects will be permissible based on the research
component involved in it. The project work aims at solving a real world technical problem.
Hence ample literature survey is required to be done by the students. Application-oriented
projects will not be acceptable. Low-level custom User Interface development and its allied
mapping with a particular technology will not be accepted.
Following is the list of recommended domains for Project Work:
signal processing, computer vision, machine learning and artificial intelligence, IoT, Block
Chain, Image Processing, data Science etc.
Course Outcomes:
Upon completion of the course, graduates will be able to -
FF No.:654
AI4008: INDUSTRY INTERNSHIP
Credit: 16
Course Relevance: Implementation of technical knowledge acquired during previous three years of
Internship and to get acquainted with Industry culture.
SECTION-1
Course Outcomes:
FF No.:654
AI4011: INTERNATIONAL INTERNSHIP
Credit: 16
Course Relevance: Implementation of technical knowledge acquired during previous three years of
Internship and to inculcate research culture.
SECTION-1
FF No.:654
AI4010: RESEARCH INTERNSHIP
Credit: 16
Course Relevance: Implementation of technical knowledge acquired during previous three years of
Internship and to inculcate Industry culture.
SECTION-1
Quality of Work
SECTION-2
Problem Statement
Literature Review
Knowledge of domain, Latest technology, and modern tools used /to be used
FF No.:654
AI4009: PROJECT INTERNSHIP
Credit: 16
Course Relevance: Implementation of technical knowledge acquired during previous three years of
Internship and to get acquainted with Industry culture.
SECTION-1
Get used to corporate culture and get sponsorship from the company
Realization of Internship as per problem statement
Design, Testing / Experimentation, Analysis / Validation
Documentation and Report Writing
Quality of Work
Performance in Question & Answers Session
Regular interaction with guide
SECTION-2
Problem Statement
Literature Review
Clarity about the objectives of Internship activity
Requirement Analysis, Internship Planning
Knowledge of domain, Latest technology, and modern tools used /to be used
Neat project documentation
Assessment Details
S.Y. B.Tech.
Note: Department wise list of courses is given separately in this document in Part IX.
T.Y. B.Tech.
Note: Department wise list of courses is given separately in this document in Part IX.
Partial assessment to be conducted during the 5th, 6th ,7th and 8th week of the Academic
Semester for 50 marks
50 marks to be converted to 30
AND
Summative assessment to be conducted during End of the Academic Semester for 100
marks
Partial assessment to be conducted during the 5th, 6th ,7th and 8th week of the Academic
Semester for 50 marks
Format for Assessment
Sr. No. Parameter Marks
1 Survey about the topic 15
2 Technical content coverage during discussion 20
3 Ability to express technical views 15
TOTAL 50
Note: For the End Semester Assessment, it is expected that the Internship company guide is also
involved. The Department is required to set up communication with the Internship company guide
regarding the End Semester Assessment, requesting their availability, in the interest of fair and
rigorous assessment. No remuneration is to be paid to Internal company guide. They are expected
to be involved along with Examiner/s in the finalization of Marks. The participation from the
Internship company guide is voluntary. If the company guide opts not to join the assessment
activity, it may then be done by the appointed examiner/s only.
Bansilal Ramnath Agarwal Charitable Trust’s
VISHWAKARMA INSTITUTE OF TECHNOLOGY, PUNE – 37
(An Autonomous Institute Affiliated to Savitribai Phule Pune University)
VI. Comprehensive Viva Voce
1. End Semester Assessment – 100 Marks to be converted to 20 Marks.
▪ The student may be encouraged to explain the applicable concepts, ideas, views
with the help of pen and paper/ Whiteboard screen/ Paint etc. if required.
▪ Sufficient time is to be given for every student during the Viva Voce, to
demonstrate the requisite abilities before arriving at the summative assessment
score.
Bansilal Ramnath Agarwal Charitable Trust’s
VISHWAKARMA INSTITUTE OF TECHNOLOGY, PUNE – 37
(An Autonomous Institute Affiliated to Savitribai Phule Pune University)
VIII. Design Thinking
Scope:
Applicable for S.Y. B.Tech. ,T.Y. B.Tech. in both Semesters and for Final Year B.Tech.
students (in Seventh Semester only) as 1 credit group activity
Objective:
To provide ecosystem to students for paper publication and patent filing
Outcome:
Publication of paper or filing of patent