Department of CSE (AI &ML) COURSE STRUCTURE

(Applicable from the academic year 2023-24 onwards)

B.Tech.– II Year I Semester

S.No. Course Code Title L T P Credits

1 Discrete Mathematics & Graph 3 0 0 3
1000232105
Theory
2 Universal Human Values 2- 2 1 0 3
1099232101 Understanding Harmony &
Ethical Human Conduct
3 Principles of Artificial 3 0 0 3
1042232101
Intelligence
4 Advanced Data Structures & 3 0 0 3
1005232103
Algorithms Analysis
5 Object Oriented Programming 3 0 0 3
1005232102
Through Java
6 Advanced Data Structures and 0 0 3 1.5
1005232112
Algorithms Analysis Lab
7 Object Oriented Programming 0 0 3 1.5
1005232111
Through Java Lab
8 Python programming 0 1 2 2
1005232180
9 1000232125 Environmental Science 2 0 0 -
Total 16 2 8 20

B.Tech.– II Year II Semester

S.No. Course Code Title L T P Credits

1 Managerial Economics and 2 0 0 2
1099232201
Financial Analysis
2 1000232202 Probability & Statistics 3 0 0 3
3 1042232201 Machine Learning 3 0 0 3
4 1005232202 Database Management Systems 3 0 0 3
5 Digital Logic & Computer 3 0 0 3
1004232104
Organization
6 1042232210 Machine Learning Lab 0 0 3 1.5
7 Database Management Systems 0 0 3 1.5
1005232211
Lab
8 1005232280 Full Stack development -1 0 1 2 2
9 1002232220 Design Thinking & Innovation 1 0 2 2
Total 15 1 12 21
Mandatory Community Service Project Internship of 08 weeks duration during summer
vacation
1
II Year I Semester L T P C
Course Code: Discrete Mathematics & Graph Theory 3 0 0 3
1000232105

DISCRETE MATHEMATICS & GRAPH THEORY

Course Objectives:

 To understand mathematical arguments using logical connectives and quantifiers and

verify the validity of logical flow of arguments using propositional, predicate logic and
truth tables.
 To expose the students to Binary relations, posets, Hasse diagram, lattice, and discuss
various properties of relations.
 To introduce generating functions and recurrence relations.

Course Outcomes:
 Apply principles of mathematical logic to statement calculus and Predicate calculus(K3)
 Apply principles of mathematical logic to Predicate calculus(K3)
 Use and interpret the concepts of combinatorics, set theory, posets and lattices (K3)
 Use and interpret the concepts of algebraic structures (K3)
 Solve the recurrence relations by Method of substitution ,characteristic roots, Generating functions(K3)

Unit-I:
Mathematical Logic & Statement Calculus
Statements and Connectives: statements, connectives, compound statements (Formulas),
well-formed formulas, truth tables, tautologies, equivalence of ormulas, converse,
contrapositives& inverse of an implication, duality law, tautological implications, Normal
forms: Principal disjunctive and conjunctive normal forms; Statement calculus: Validity
of an argument using truth tables and rules of inference, consistency of premises, indirect
method of proof.

Unit-II:
Predicates &Predicate Calculus
Predicate calculus: Predicates, statement of functions, variables and quantifiers, predicate
formulas, free and bound variables, universe of discourse, valid formulas and equivalences
involving quantifiers, rules of inference, theory of inference for predicate calculus

Unit-III:
Combinatorics, Set Theory, Posets and Lattices
Combinatorics: Principles of counting (product and sum rules), Pigeonhole principle and
its applications, Principle of Inclusion-Exclusion and its applications.
Relations: Binary relation, properties, equivalence relation, partition of a set,
equivalence classes Partial ordering: Partial order relation, partially ordered set(poset),
Chanhassen diagrams, Lattices.

Unit-IV:
Algebraic Structures
Algebraic Systems (Structures): Binary operation, algebraic structures such as Semi group,
Monoid, Group, commutative group with suitable examples, properties satisfied by the
algebraic structures and the elements; Special group structures: Sub group and its criteria,
2
order of an element, Cosets ,index of sub group ,properties of cosets, order of a group,
Lagrange’s theorem

Unit-V:
Recurrence Relations & Generating Functions
Recurrence Relations: Formation, iterative method of solving recurrence relations, solving
homogeneous and non-homogeneous recurrence relations by characteristic roots method;
Generating Functions: Generating functions of sequences, calculation of coefficients of
expansions, solving recurrence relations by generating functions
.
Textbooks:
1. J.P.Tremblay and R.Manohar, Discrete Mathematical Structures with Applications to
CSc, TataMcGrawHill,1997
2. S. Santha and EV Prasad, Mathematical Foundations for Computer Science, CENG AGE
Publishers

Reference Books:
1. Kenneth. H.Rosen,Discrete Mathematics and itsApplications,6/e, Tata McGraw-Hill,
2009.
2. Dr.DSChandrasekharaiah, Mathematical Foundations of Computer Science ,Prism Book
Pvt Ltd.
3. Swapan Kumar Sarkar, Mathematical Foundation of Computer Science,9th Edition,
SChand Publishers.

******

3
 II Year I Semester L T P C
Universal Human Values – Understanding Harmony
Course Code: & Ethical Human Conduct 2 1 0 3
1099232101

UNIVERSAL HUMAN VALUES – UNDERSTANDING HARMONY AND

ETHICAL HUMAN CONDUCT

Course Objectives:

 To develop a holistic perspective based on self exploration and value education.

 To understand method to fulfill human aspiration. .
 To understand harmony in human being, family and society.
 To understand harmony in nature and its existence.
 To understand holistic understanding of harmony on professional ethics.

Course Outcomes:

 Describe the Value Education

 Illustrate Understanding the activities in the Self and the activities in the Body.
 Discuss Harmony in Nature: The Four Orders in Nature.
 Demonstrate Defects in Ethical Human Conduct.
 Generalize Competence in Professional Ethics.

Course Topics
The course has 28 lectures and 14 tutorials in 5 modules. The lectures and tutorials are of 1-
hour duration. Tutorial sessions are to be used to explore and practice what has been proposed
during the lecture sessions.
The Teacher’s Manual provides the outline for lectures as well as practice sessions. The teacher
is expected to present the issues to be discussed as propositions and encourage the students to
have a dialogue.

UNIT I Introduction to Value Education (6 lectures and 3 tutorials for practice session)
Lecture 1: Right Understanding, Relationship and Physical Facility (Holistic
Development and the Role of Education)
Lecture 2: Understanding Value Education
Tutorial 1: Practice Session PS1 Sharing about Oneself
Lecture 3: self-exploration as the Process for Value Education
Lecture4: Continuous Happiness and Prosperity – the Basic Human Aspirations
Tutorial 2: Practice Session PS2 Exploring Human Consciousness
Lecture 5: Happiness and Prosperity – Current Scenario
Lecture 6: Method to Fulfill the Basic Human Aspirations

4
 Tutorial 3: Practice Session PS3 Exploring Natural Acceptance

UNIT II Harmony in the Human Being (6 lectures and 3 tutorials for practice session)
Lecture 7: Understanding Human being as the Co-existence of the self and the
body.
Lecture 8: Distinguishing between the Needs of the self and the body
Tutorial 4: Practice Session PS4 Exploring the difference of Needs of self and
body.
Lecture 9: The body as an Instrument of the self
Lecture 10: Understanding Harmony in the self
Tutorial 5: Practice Session PS5 Exploring Sources of Imagination in the self
Lecture 11: Harmony of the self with the body
Lecture 12: Programme to ensure self-regulation and Health
Tutorial 6: Practice Session PS6 Exploring Harmony of self with the body

UNIT III Harmony in the Family and Society (6 lectures and 3 tutorials for practice
session)
Lecture 13: Harmony in the Family – the Basic Unit of Human Interaction
Lecture 14: 'Trust' – the Foundational Value in Relationship
Tutorial 7: Practice Session PS7 Exploring the Feeling of Trust
Lecture 15: 'Respect' – as the Right Evaluation
Tutorial 8: Practice Session PS8 Exploring the Feeling of Respect
Lecture 16: Other Feelings, Justice in Human-to-Human Relationship
Lecture 17: Understanding Harmony in the Society
Lecture 18: Vision for the Universal Human Order
Tutorial 9: Practice Session PS9 Exploring Systems to fulfil Human Goal

UNIT IV Harmony in the Nature/Existence (4 lectures and 2 tutorials for practice session)
Lecture 19: Understanding Harmony in the Nature
Lecture 20: Interconnectedness, self-regulation and Mutual Fulfilment among
the Four Orders of Nature
Tutorial 10: Practice Session PS10 Exploring the Four Orders of Nature
Lecture 21: Realizing Existence as Co-existence at All Levels
Lecture 22: The Holistic Perception of Harmony in Existence
Tutorial 11: Practice Session PS11 Exploring Co-existence in Existence

UNIT V Implications of the Holistic Understanding – a Look at Professional Ethics (6

lectures and 3 tutorials for practice session)
Lecture 23: Natural Acceptance of Human Values
Lecture 24: Definitiveness of (Ethical) Human Conduct
Tutorial 12: Practice Session PS12 Exploring Ethical Human Conduct
Lecture 25: A Basis for Humanistic Education, Humanistic Constitution and
Universal Human Order
Lecture 26: Competence in Professional Ethics
Tutorial 13: Practice Session PS13 Exploring Humanistic Models in Education
Lecture 27: Holistic Technologies, Production Systems and Management
Models-Typical Case Studies

5
 Lecture 28: Strategies for Transition towards Value-based Life and Profession
Tutorial 14: Practice Session PS14 Exploring Steps of Transition towards
Universal Human Order

Practice Sessions for UNIT I – Introduction to Value Education

PS1 Sharing about Oneself
PS2 Exploring Human Consciousness
PS3 Exploring Natural Acceptance

Practice Sessions for UNIT II – Harmony in the Human Being

PS4 Exploring the difference of Needs of self and body
PS5 Exploring Sources of Imagination in the self
PS6 Exploring Harmony of self with the body

Practice Sessions for UNIT III – Harmony in the Family and Society
PS7 Exploring the Feeling of Trust
PS8 Exploring the Feeling of Respect
PS9 Exploring Systems to fulfil Human Goal

Practice Sessions for UNIT IV – Harmony in the Nature (Existence)

PS10 Exploring the Four Orders of Nature
PS11 Exploring Co-existence in Existence

Practice Sessions for UNIT V – Implications of the Holistic Understanding – a Look at

Professional Ethics
PS12 Exploring Ethical Human Conduct
PS13 Exploring Humanistic Models in Education
PS14 Exploring Steps of Transition towards Universal Human Order

Readings:
Textbook and Teachers Manual
a. The Textbook A Foundation Course in Human Values and Professional Ethics, R R Gaur, R
Asthana, G P Bagaria, 2nd Revised Edition, Excel Books, New Delhi, 2019. ISBN 978-93-
87034-47-1
b. The Teacher’s Manual Teachers’ Manual for A Foundation Course in Human Values and
Professional Ethics, R R Gaur, R Asthana, G P Bagaria, 2nd Revised Edition, Excel Books,
New Delhi, 2019. ISBN 978-93-87034-53-2

Reference Books
1. JeevanVidya: EkParichaya, A Nagaraj, JeevanVidyaPrakashan, Amarkantak, 1999.
2. Human Values, A.N. Tripathi, New Age Intl. Publishers, New Delhi, 2004.
3. The Story of Stuff (Book).
4. The Story of My Experiments with Truth - by Mohandas Karamchand Gandhi
5. Small is Beautiful - E. F Schumacher.
6. Slow is Beautiful - Cecile Andrews
7. Economy of Permanence - J C Kumarappa
8. Bharat Mein Angreji Raj – PanditSunderlal

6
9. Rediscovering India - by Dharampal
10. Hind Swaraj or Indian Home Rule - by Mohandas K. Gandhi
11. India Wins Freedom - Maulana Abdul Kalam Azad
12. Vivekananda - Romain Rolland (English)
13. Gandhi - Romain Rolland (English)

Mode of Conduct:
Lecture hours are to be used for interactive discussion, placing the proposals about the topics
at hand and motivating students to reflect, explore and verify them.
Tutorial hours are to be used for practice sessions.
While analysing and discussing the topic, the faculty mentor’s role is in pointing to essential
elements to help in sorting them out from the surface elements. In other words, help the students
explore the important or critical elements.
In the discussions, particularly during practice sessions (tutorials), the mentor encourages the
student to connect with one’s own self and do self-observation, self-reflection and self-
exploration.
Scenarios may be used to initiate discussion. The student is encouraged to take up” ordinary”
situations rather than” extra-ordinary” situations. Such observations and their analyses are
shared and discussed with other students and faculty mentor, in a group sitting.

Tutorials (experiments or practical) are important for the course. The difference is that the
laboratory is everyday life, and practical are how you behave and work in real life. Depending
on the nature of topics, worksheets, home assignment and/or activity are included. The practice
sessions (tutorials) would also provide support to a student in performing actions
commensurate to his/her beliefs. It is intended that this would lead to development of
commitment, namely behaving and working based on basic human values.
It is recommended that this content be placed before the student as it is, in the form of a basic
foundation course, without including anything else or excluding any part of this content.
Additional content may be offered in separate, higher courses. This course is to be taught by
faculty from every teaching department, not exclusively by any one department.
Teacher preparation with a minimum exposure to at least one 8-day Faculty Development
Program on Universal Human Values is deemed essential.

******

7
II Year I Semester L T P C
Course Code: Principles of Artificial Intelligence 3 0 0 3
1042232101

PRINCIPLES OF ARTIFICIAL INTELLIGENCE

Pre-requisite:

1. Knowledge in Computer Programming.

2. A course on “Mathematical Foundations of Computer Science”.
3. Background in linear algebra, data structures and algorithms, and probability.

Course Objectives:
The student will be able to:
1. Know the methodology of Problem solving
2. Implement basic AI algorithms
3. Design and carry out an empirical evolution of different algorithms on a problem
Formalization.
4. To learn various approaches for Knowledge representation.
5. To understand expert systems and to build various applications in it.
Course Outcomes:
After completion of the course the student will be able to:
 Discuss the fundamental concepts in Artificial Intelligence (K2)
 Develop the Problem solving and search strategies in real time applications. (K3).
 Apply the mathematical logic concepts for pattern prediction. (K3).
 Analyze the Knowledge representations in Artificial Intelligence (K4).
 Discuss Expert Systems in various domains for user interaction (K3).

UNIT - I

Introduction: AI problems, foundation of AI and history of AI intelligent agents: Agents and

Environments, the concept of rationality, the nature of environments, structure of agents,
problem solving agents, problem formulation.

UNIT - II

Searching- Searching for solutions, uniformed search strategies – Breadth first search, depth
first Search. Search with partial information (Heuristic search) Hill climbing, A*, AO*
Algorithms, Problem reduction, Game Playing-Adversial search, Games, mini-max algorithm,
optimal decisions in multiplayer games, Problem in Game playing, Alpha-Beta pruning,
Evaluation functions.

UNIT - III

Representation of Knowledge: Knowledge representation issues, predicate logic- logic

programming, semantic nets- frames and inheritance, constraint propagation, representing
knowledge using rules, rules-based deduction systems. Reasoning under uncertainty, review of
probability, Bayes’ probabilistic interferences and dempstershafer theory.

8
UNIT - IV

Logic concepts: First order logic. Inference in first order logic, propositional vs. first order
inference, unification & lifts forward chaining, Backward chaining, Resolution, learning from
observation Inductive learning, Decision trees, Explanation based learning, Statistical Learning
methods, Reinforcement Learning.

UNIT - V

Expert Systems: Architecture of expert systems, Roles of expert systems – Knowledge

Acquisition Meta knowledge Heuristics. Typical expert systems – MYCIN, DART, XCON:
Expert systems shells.

Textbooks:

1. S. Russel and P. Norvig, “Artificial Intelligence – A Modern Approach”,

SecondEdition, Pearson Education.
2. Kevin Night and Elaine Rich, Nair B., “Artificial Intelligence (SIE)”, Mc Graw Hill
Reference Books:

1. David Poole, Alan Mackworth, Randy Goebel,”Computational Intelligence: a logical

approach”, Oxford University Press.
2. G. Luger, “Artificial Intelligence: Structures and Strategies for complex
problemsolving”, Fourth Edition, Pearson Education.
3. J. Nilsson, “Artificial Intelligence: A new Synthesis”, Elsevier Publishers.
4. Artificial Intelligence, SarojKaushik, CENGAGE Learning.
Online Learning Resources:

1. https://ai.google/
2. https://swayam.gov.in/nd1_noc19_me71/preview

******

9
II Year I Semester 3 0 0 3
Course Code: Advanced Data Structures & Algorithms 3 0 0 3
1005232103 Analysis

ADVANCED DATA STRUCTURES & ALGORITHM ANALYSIS

Course Objectives:
The main objectives of the course is to
 To provide knowledge on advance data structures frequently used in Computer Science
domain
 To Develop skills in algorithm design techniques popularly used
 To Understand the use of various data structures in the algorithm design

Course Outcomes:
After completion of the course the student will be able to –

 Illustrate the working of the advanced tree data structures and their applications (K3)
 Understand the Graph data structure, traversals and apply them in various contexts. (K3)
 Apply various data structures in the design of algorithms (K3)
 Apply Branch and Bound to solve problems such as knapsack and travelling salesman. (K3)
 Analyze algorithms with respect to space and time complexities (K4)

UNIT – I:
Introduction to Algorithm Analysis, Space and Time Complexity analysis, Asymptotic
Notations.
AVL Trees – Creation, Insertion, Deletion operations and Applications
B-Trees – Creation, Insertion, Deletion operations and Applications

UNIT – II:
Heap Trees (Priority Queues) – Min and Max Heaps, Operations and Applications
Graphs – Terminology, Representations, Basic Search and Traversals, Connected
Components and Biconnected Components, applications
Divide and Conquer: The General Method, Quick Sort, Merge Sort, Strassen’s matrix
multiplication, Convex Hull

UNIT – III:
Greedy Method: General Method, Job Sequencing with deadlines, Knapsack Problem,
Minimum cost spanning trees, Single Source Shortest Paths
Dynamic Programming: General Method, All pairs shortest paths, Single Source Shortest
Paths – General Weights (Bellman Ford Algorithm), Optimal Binary Search Trees, 0/1
Knapsack, String Editing, Travelling Salesperson problem

UNIT – IV:
Backtracking: General Method, 8-Queens Problem, Sum of Subsets problem, Graph
Coloring, 0/1 Knapsack Problem
Branch and Bound: The General Method, 0/1 Knapsack Problem, Travelling Salesperson
problem

10
UNIT – V:
NP Hard and NP Complete Problems: Basic Concepts, Cook’s theorem
NP Hard Graph Problems: Clique Decision Problem (CDP), Chromatic Number Decision
Problem (CNDP), Traveling Salesperson Decision Problem (TSP)
NP Hard Scheduling Problems: Scheduling Identical Processors, Job Shop Scheduling

Textbooks:

1. Fundamentals of Data Structures in C++, Horowitz, Ellis; Sahni, Sartaj; Mehta, Dinesh
2nd Edition Universities Press
2. Computer Algorithms/C++ Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran 2nd
Edition University Press

Reference Books:

1. Data Structures and program design in C, Robert Kruse, Pearson Education Asia
2. An introduction to Data Structures with applications, Trembley & Sorenson, McGraw
Hill
3. The Art of Computer Programming, Vol.1: Fundamental Algorithms, Donald E Knuth,
Addison-Wesley, 1997.
4. Data Structures using C & C++: Langsam, Augenstein&Tanenbaum, Pearson, 1995
5. Algorithms + Data Structures & Programs: N. Wirth, PHI
6. Fundamentals of Data Structures in C++: Horowitz Sahni& Mehta, Galgottia Pub.
7. Data structures in Java: Thomas Standish, Pearson Education Asia

Online Learning Resources:

1. https://www.tutorialspoint.com/advanced_data_structures/index.asp
2. http://peterindia.net/Algorithms.html
3. Abdul Bari,1. Introduction to Algorithms (youtube.com)

******

11
 II Year I Semester L T P C
Course Code: 3 0 0 3
Object Oriented Programming through Java
1005232102

OBJECT-ORIENTED PROGRAMMING THROUGH JAVA

Course Objectives:

The learning objectives of this course are to:

 To identify Java language components and how they work together in applications
 To learn the fundamentals of object-oriented programming in Java, including defining classes, invoking
methods, using class libraries.
 To learn how to extend Java classes with inheritance and dynamic binding and how to use exception handling
in Java applications
 To understand how to design applications with threads in Java
 To understand how to use Java APIs for program development

Course Outcomes:
After completion of the course, students will be able to
 Interpret the concepts of Object Oriented Programming and the Java Programming Constructs (K2)
 Demonstrate the concepts of Object Orientation like Objects, Classes, Methods, Constructors alongside the
usage of various keywords(K2)
 Apply the concepts of Array operations, Inheritance and Interfaces to solve the real-world problems(K3)
 Examine the usage of Packages and Exception handling to build the Java Applications(K3)
 Analyze the methods of String handling, Survey the techniques of Multithreading and Connect the front-end
with the back-end through Java Database Connectivity.(K4)

UNIT I:
Object Oriented Programming: Basic concepts, Principles, Program Structure in Java: Introduction,
Writing Simple Java Programs, Elements or Tokens in Java Programs, Java Statements, Command
Line Arguments, User Input to Programs, Escape Sequences Comments, Programming Style.
Data Types, Variables, and Operators :Introduction, Data Types in Java, Declaration of Variables,
Data Types, Type Casting, Scope of Variable Identifier, Literal Constants, Symbolic Constants,
Formatted Output with printf() Method, Static Variables and Methods, Attribute Final, Introduction
to Operators, Precedence and Associativity of Operators, Assignment Operator ( = ), Basic
Arithmetic Operators, Increment (++) and Decrement (- -) Operators, Ternary Operator, Relational
Operators, Boolean Logical Operators, Bitwise Logical Operators.
Control Statements: Introduction, if Expression, Nested if Expressions, if–else Expressions, Ternary
Operator?:, Switch Statement, Iteration Statements, while Expression, do–while Loop, for Loop,
Nested for Loop, For–Each for Loop, Break Statement, Continue Statement.
UNIT II:
Classes and Objects: Introduction, Class Declaration and Modifiers, Class Members, Declaration of
Class Objects, Assigning One Object to Another, Access Control for Class Members, Accessing
Private Members of Class, Constructor Methods for Class, Overloaded Constructor Methods,

12
Nested Classes, Final Class and Methods, Passing Arguments by Value and by Reference, Keyword
this.
Methods: Introduction, Defining Methods, Overloaded Methods, Overloaded Constructor Methods,
Class Objects as Parameters in Methods, Access Control, Recursive Methods, Nesting of Methods,
Overriding Methods, Attributes Final and Static.
UNIT III:
Arrays: Introduction, Declaration and Initialization of Arrays, Storage of Array in Computer
Memory, Accessing Elements of Arrays, Operations on Array Elements, Assigning Array to
Another Array, Dynamic Change of Array Size, Sorting of Arrays, Search for Values in Arrays,
Class Arrays, Two-dimensional Arrays, Arrays of Varying Lengths, Three- dimensional Arrays,
Arrays as Vectors.

13
 Inheritance: Introduction, Process of Inheritance, Types of Inheritances, Universal
Super Class- Object Class, Inhibiting Inheritance of Class Using Final, Access
Control and Inheritance, Multilevel Inheritance, Application of Keyword Super,
Constructor Method and Inheritance, Method Overriding, Dynamic Method
Dispatch, Abstract Classes, Interfaces and Inheritance.
Interfaces: Introduction, Declaration of Interface, Implementation of Interface,
Multiple Interfaces, Nested Interfaces, Inheritance of Interfaces, Default Methods in
Interfaces, Static Methods inInterface, Functional Interfaces, Annotations.
UNIT IV:
Packages and Java Library: Introduction, Defining Package, Importing Packages and
Classes into Programs, Path and Class Path, Access Control, Packages in Java SE,
Java. Lang Package and its Classes, Class Object, Enumeration, class Math,
Wrapper Classes, Auto- boxing and Auto- unboxing, Java util Classes and
Interfaces, Formatter Class, Random Class, Time Package, Class Instant (java. time.
Instant), Formatting for Date/Time in Java, Temporal Adjusters Class.
Exception Handling: Introduction, Hierarchy of Standard Exception Classes,
Keywords throws and throw, try, catch, and finally Blocks, Multiple Catch Clauses,
Class Throwable, Unchecked Exceptions, Checked Exceptions.
Java I/O and File: Java I/O API, standard I/O streams, types, Byte streams, Character
streams, Scanner class, Files in Java(Text Book 2)
UNIT V:
String Handling in Java: Introduction, Class String, Methods for Extracting
Characters from Strings, Comparison, Modifying, Searching; Class String Buffer.
Multithreaded Programming: Introduction, Need for Multiple Threads Multithreaded
Programming for Multi-core Processor, Thread Class, Main Thread-Creation of New
Threads, Thread States, Thread Priority- Synchronization, Deadlock and Race
Situations, Inter-thread Communication - Suspending, Resuming, and Stopping of
Threads.
Java Database Connectivity: Introduction, JDBC Architecture, Installing MySQL
and MySQL Connector/J, JDBC Environment Setup, Establishing JDBC Database
Connections, Result Set Interface
Java FX GUI: Java FX Scene Builder, Java FX App Window Structure, displaying
text and image, event handling, laying out nodes in scene graph, mouse events (Text
Book 3)

Text Books:
1. JAVA one step ahead, Anitha Seth, B.L.Juneja, Oxford.
2. Joy with JAVA, Fundamentals of Object Oriented Programming, DebasisSamanta,
MonalisaSarma, Cambridge, 2023.
3. JAVA 9 for Programmers, Paul Deitel, Harvey Deitel, 4th Edition, Pearson.

References Books:
1. The complete Reference Java, 11thedition, Herbert Schildt,TMH
2. Introduction to Java programming, 7th Edition, Y Daniel Liang, Pearson

14
Online Resources:
1. https://nptel.ac.in/courses/106/105/106105191/
2. https://infyspringboard.onwingspan.com/web/en/app/toc/lex_auth_012880464547618
816347_shared/overview
******

15
 II Year I Semester L T P C
Course Code:
Advanced Data Structures & Algorithm 0 0 3 1.5
1005232112 Analysis Lab

ADVANCED DATA STRUCTURES & ALGORITHM ANALYSIS LAB

Course Objectives:
The objectives of the course is to
 Acquire practical skills in constructing and managing Data structures
 Apply the popular algorithm design methods in problem-solving scenarios

Course Outcomes:
After completion of the course, students will be able to
 Design and develop programs to solve real world problems with the popular algorithm
design methods. (K5)
 Demonstrate an understanding of Non-Linear data structures by developing
implementing the operations on AVL Trees, B-Trees, Heaps and Graphs.(K2)
 Critically assess the design choices and implementation strategies of algorithms
and data structures in complex applications. (K5)
 Utilize appropriate data structures and algorithms to optimize solutions for specific
computational problems. (K3)
 Compare the performance of different of algorithm design strategies (K4)

Experiments covering the Topics:

 Operations on AVL trees, B-Trees, Heap Trees

 Graph Traversals
 Sorting techniques
 Minimum cost spanning trees
 Shortest path algorithms
 0/1 Knapsack Problem
 Travelling Salesperson problem
 Optimal Binary Search Trees
 N-Queens Problem
 Job Sequencing

Sample Programs:

1. Construct an AVL tree for a given set of elements which are stored in a file. And
implement insert and delete operation on the constructed tree. Write contents of tree
into a new file using in-order.
2. Construct B-Tree an order of 5 with a set of 100 random elements stored in array.
Implement searching, insertion and deletion operations.
3. Construct Min and Max Heap using arrays, delete any element and display the content
of the Heap.
4. Implement BFT and DFT for given graph, when graph is represented by
16
 a) Adjacency Matrix b) Adjacency Lists
5. Write a program for finding the bi-connected components in a given graph.
6. Implement Quick sort and Merge sort and observe the execution time for various input
sizes (Average, Worst and Best cases).
7. Compare the performance of Single Source Shortest Paths using Greedy method when
the graph is represented by adjacency matrix and adjacency lists.
8. Implement Job sequencing with deadlines using Greedy strategy.
9. Write a program to solve 0/1 Knapsack problem Using Dynamic Programming.
10. Implement N-Queens Problem Using Backtracking.
11. Use Backtracking strategy to solve 0/1 Knapsack problem.
12. Implement Travelling Sales Person problem using Branch and Bound approach.

Reference Books:

1. Fundamentals of Data Structures in C++, Horowitz Ellis, SahniSartaj, Mehta, Dinesh,

2ndEdition, Universities Press
2. Computer Algorithms/C++ Ellis Horowitz, SartajSahni, SanguthevarRajasekaran,
2ndEdition, University Press
3. Data Structures and program design in C, Robert Kruse, Pearson Education Asia
4. An introduction to Data Structures with applications, Trembley& Sorenson, McGraw
Hill

Online Learning Resources:

1. http://cse01-iiith.vlabs.ac.in/
2. http://peterindia.net/Algorithms.html

******

17
 II Year I Semester L T P C
Object Oriented Programming through Java
Course Code: 0 0 3 1.5
1005232111 Lab

OBJECT-ORIENTED PROGRAMMING THROUGH JAVA LAB

Course Objectives:
The aim of this course is to
 Practice object-oriented programming in the Java programming language
 Implement Classes, Objects, Methods, Inheritance, Exception, Runtime Polymorphism,User
defined Exception handling mechanism
 Illustrate inheritance, Exception handling mechanism, JDBC connectivity
 Construct Threads, Event Handling, implement packages, Java FX GUI
Course Outcomes:
 After completion of the course, students will be able to
 Make use of Primitive Data Types, Expressions, Classes and Methods to conduct
investigations of various problems (K3).
 Simulate Inheritance, Exception Handling Mechanism and Runtime Polymorphism to design
solutions for complex problems (K3).
 Discriminate Standalone Applications with the Graphical User Interface Environment to
understand the procedure of Event Handling (K4).

Experiments covering the Topics:

● Object Oriented Programming fundamentals- data types, control structures
● Classes, methods, objects, Inheritance, polymorphism,
● Exception handling, Threads, Packages, Interfaces
● Files, I/O streams, JavaFX GUI

Sample Experiments:
Exercise – 1:
1. Write a JAVA program to display default value of all primitive data type of JAVA
2. Write a java program that display the roots of a quadratic equation ax2+bx=0. Calculate
the discriminate D and basing on value of D, describe the nature of root.

Exercise - 2
1. Write a JAVA program to search for an element in a given list of elements using binary
search mechanism.
2. Write a JAVA program to sort for an element in a given list of elements using bubble
sort
3. Write a JAVA program using StringBuffer to delete, remove character.

Exercise - 3
1. Write a JAVA program to implement class mechanism. Create a class, methods and
invoke them inside main method.
2. Write a JAVA program implements method overloading.
3. Write a JAVA program to implement constructor.
4. Write a JAVA program to implement constructor overloading.

Exercise - 4
1. Write a JAVA program to implement Single Inheritance
18
 2. Write a JAVA program to implement multi level Inheritance
3. Write a JAVA program for abstract class to find areas of different shapes

Exercise - 5
1. Write a JAVA program give example for “super” keyword.
2. Write a JAVA program to implement Interface. What kind of Inheritance can be
achieved?
3. Write a JAVA program that implements Runtime polymorphism

Exercise - 6
1. Write a JAVA program that describes exception handling mechanism
2. Write a JAVA program Illustrating Multiple catch clauses
3. Write a JAVA program for creation of Java Built-in Exceptions
4. Write a JAVA program for creation of User Defined Exception

Exercise - 7
1. Write a JAVA program that creates threads by extending Thread class. First thread
display “Good Morning “every 1 sec, the second thread displays “Hello “every 2
seconds and the third display “Welcome” every 3 seconds, (Repeat the same by
implementing Runnable)
2. Write a program illustrating is Alive and join ()
3. Write a Program illustrating Daemon Threads.
4. Write a JAVA program Producer Consumer Problem

Exercise – 8
1. Write a JAVA program that import and use the user defined packages
2. Without writing any code, build a GUI that display text in label and image in an
ImageView (use JavaFX)
3. Build a Tip Calculator app using several JavaFX components and learn how to respond
to user interactions with the GUI

Exercise – 9
1. Write a java program that connects to a database using JDBC
2. Write a java program to connect to a database using JDBC and insert values into it.
3. Write a java program to connect to a database using JDBC and delete values from it
******

19
II Year I Semester L T P C
Course Code: 0 1 2 2
1005232180
Python Programming

PYTHON PROGRAMMING

Course Objectives: (Skill Enhancement Course)

20
The main objectives of the course are to
 Introduce core programming concepts of Python programming language.
 Demonstrate about Python data structures like Lists, Tuples, Sets and dictionaries
 Implement Functions, Modules and Regular Expressions in Python Programming and to create practical
and contemporary applications using these
 Implement Dictionary keys in python convert this dictionary as a pandas data frame

Course Outcomes:
After completion of the course, students will be able to
 Write a program to define a function using default arguments
 Write a program to sum all the items in a given dictionary
 Write a program to define a function with multiple return values.
 Python program to check whether a JSON string contains complex object or not

UNTI-I:
History of Python Programming Language, Thrust Areas of Python, Installing Anaconda
Python Distribution, Installing and Using Jupyter Notebook.

Parts of Python Programming Language: Identifiers, Keywords, Statements and

Expressions,
Variables, Operators, Precedence and Associativity, Data Types, Indentation, Comments,
Reading Input, Print Output, Type Conversions, the type () Function and Is Operator, Dynamic
and Strongly Typed Language.
Control Flow Statements: if statement, if-else statement, if...elif…else, Nested if statement,
while Loop, for Loop, continue and break Statements, Catching Exceptions Using try and
except Statement.
Sample Experiments:
1. Write a program to find the largest element among three Numbers.
2. Write a Program to display all prime numbers within an interval
3. Write a program to swap two numbers without using a temporary variable.

4. Demonstrate the following Operators in Python with suitable examples.

i) Arithmetic Operators ii) Relational Operators iii) Assignment Operators iv) Logical
Operators v) Bit wise Operators vi) Ternary Operator vii) Membership Operators viii)
Identity Operators
21
5. Write a program to add and multiply complex numbers
6. Write a program to print multiplication table of a given number.

UNIT-II:
Functions: Built-In Functions, Commonly Used Modules, Function Definition and Calling the
function, return Statement and void Function, Scope and Lifetime of Variables, Default
Parameters, Keyword Arguments, *args and **kwargs, Command Line Arguments.

Strings: Creating and Storing Strings, Basic String Operations, Accessing Characters in String
by Index Number, String Slicing and Joining, String Methods, Formatting Strings.
Lists: Creating Lists, Basic List Operations, Indexing and Slicing in Lists, Built-In Functions
Used on Lists, List Methods, del Statement.
Sample Experiments:
7. Write a program to define a function with multiple return values.
8. Write a program to define a function using default arguments.

9. Write a program to find the length of the string without using any library functions.

10. Write a program to check if the substring is present in a given string or not.
11. Write a program to perform the given operations on a list:
i. Addition ii. Insertion iii. slicing

12. Write a program to perform any 5 built-in functions by taking any list.
UNIT-III:
Dictionaries: Creating Dictionary, Accessing and Modifying key:value Pairs in Dictionaries,
Built-In Functions Used on Dictionaries, Dictionary Methods, del Statement.

Tuples and Sets: Creating Tuples, Basic Tuple Operations, tuple() Function, Indexing and
Slicing in Tuples, Built-In Functions Used on Tuples, Relation between Tuples and Lists,
Relation between Tuples and Dictionaries, Using zip() Function, Sets, Set Methods, Frozenset.

Sample Experiments:
13. Write a program to create tuples (name, age, address, college) for at least two members
and concatenate the tuples and print the concatenated tuples.
14. Write a program to count the number of vowels in a string (No control flow allowed).
15. Write a program to check if a given key exists in a dictionary or not.
22
16. Write a program to add a new key-value pair to an existing dictionary.
17. Write a program to sum all the items in a given dictionary.

UNIT-IV:
Files: Types of Files, Creating and Reading Text Data, File Methods to Read and Write Data,
Reading and Writing Binary Files, Pickle Module, Reading and Writing CSV Files, Python os
and os.path Modules.

Object-Oriented Programming: Classes and Objects, Creating Classes in Python, Creating

Objects in Python, Constructor Method, Classes with Multiple Objects, Class Attributes Vs
Data Attributes, Encapsulation, Inheritance, Polymorphism.
Sample Experiments:
18. Write a program to sort words in a file and put them in another file. The output files

23
should have only lower-case words, so any upper-case words from source must be
lowered.
19. Python program to print each line of a file in reverse order.
20. Python program to compute the number of characters, words and lines in a file.

21. Write a program to create, display, append, insert and reverse the order of the items in
the array.
22. Write a program to add, transpose and multiply two matrices.
23. Write a Python program to create a class that represents a shape. Include methods to
calculate its area and perimeter. Implement subclasses for different shapes like circle,
triangle, and square.

UNIT-V:
Introduction to Data Science: Functional Programming, JSON and XML in Python, NumPy
with Python, Pandas.

Sample Experiments:
24. Python program to check whether a JSON string contains complex object or not.
25. Python Program to demonstrate NumPy arrays creation using array () function.

26. Python program to demonstrate use of ndim, shape, size, dtype.

27. Python program to demonstrate basic slicing, integer and Boolean indexing.
28. Python program to find min, max, sum, cumulative sum of array

29. Create a dictionary with at least five keys and each key represent value as a list where
this list contains at least ten values and convert this dictionary as a pandas data frame
and explore the data through the data frame as follows:
a) Apply head () function to the pandas data frame
b) Perform various data selection operations on Data Frame
30. Select any two columns from the above data frame, and observe the change in one
attribute with respect to other attribute with scatter and plot operations in matplotlib

24
Reference Books:
1. Gowri shankar S, Veena A., Introduction to Python Programming, CRC Press.
2. Python Programming, S Sridhar, J Indumathi, V M Hariharan, 2nd Edition, Pearson,
2024

3. Introduction to Programming Using Python, Y. Daniel Liang, Pearson.

Online Learning Resources/Virtual Labs:

1. https://www.coursera.org/learn/python-for-applied-data-science-ai

2. https://www.coursera.org/learn/python?specialization=python#syllabus

******

25
 II Year I Semester L T P C
Course Code: 2 0 0 0
1000232125 Environmental Science
ENVIRONMENTAL SCIENCE

Course Objectives:
 Basic understanding of the ecosystem and its diversity.
 Overall understanding of the natural resources.
 Acquaintance on various environmental challenges induced due to unplanned
anthropogenic activities.
 Awareness on the social issues, environmental legislation and global treaties.
 An understanding of the environmental impact of developmental activities.

Course Outcomes:
At the end of course student will be able to:
 Describe the Natural resources and their importance for the sustenance of the life and learn to
conserve the natural resources.(K2)
 Interpret the concepts of Eco-system and its function in the environment.(K3)
 Predict the control or reduce pollution with waste management practices.(K3)
 Illustrate Environmental legislations of India and the first global initiatives towards
sustainable development with Case Studies.(K3)
 Relate human Population size to natural resources and resource Consumption.(K3)

UNIT I
Multidisciplinary Nature of Environmental Studies: – Definition, Scope and Importance –
Need for Public Awareness.
Natural Resources : Renewable and non-renewable resources – Natural resources and
associated problems – Forest resources – Use and over – exploitation, deforestation, case
studies – Timber extraction – Mining, dams and other effects on forest and tribal people –
Water resources – Use and over utilization of surface and ground water – Floods, drought,
conflicts over water, dams – benefits and problems – Mineral resources: Use and exploitation,
environmental effects of extracting and using mineral resources, case studies – Food resources:
World food problems, changes caused by agriculture and overgrazing, effects of modern
agriculture, fertilizer-pesticide problems, water logging, salinity, case studies. – Energy
resources:

UNIT II
Ecosystems: Concept of an ecosystem. – Structure and function of an ecosystem – Producers,
consumers and decomposers – Energy flow in the ecosystem – Ecological succession – Food
chains, food webs and ecological pyramids – Introduction, types, characteristic features,
structure and function of the following ecosystem:
a. Forest ecosystem.
b. Grassland ecosystem

26
 c. Desert ecosystem.
d. Aquatic ecosystems (ponds, streams, lakes, rivers, oceans, estuaries)
Biodiversity and its Conservation : Introduction 0 Definition: genetic, species and ecosystem
diversity – Bio-geographical classification of India – Value of biodiversity: consumptive use,
Productive use, social, ethical, aesthetic and option values – Biodiversity at global, National
and local levels – India as a mega-diversity nation – Hot-sports of biodiversity – Threats to
biodiversity: habitat loss, poaching of wildlife, man-wildlife conflicts – Endangered and
endemic species of India – Conservation of biodiversity: In-situ and Ex-situ conservation of
biodiversity.

UNIT III
Environmental Pollution: Definition, Cause, effects and control measures of:
a. Air Pollution.
b. Water pollution
c. Soil pollution
d. Marine pollution
e. Noise pollution
f. Thermal pollution
g. Nuclear hazards
Solid Waste Management: Causes, effects and control measures of urban and industrial
wastes – Role of an individual in prevention of pollution – Pollution case studies – Disaster
management: floods, earthquake, cyclone and landslides.

UNIT IV
Social Issues and the Environment: From Unsustainable to Sustainable development –
Urban problems related to energy – Water conservation, rain water harvesting, watershed
management – Resettlement and rehabilitation of people; its problems and concerns. Case
studies – Environmental ethics: Issues and possible solutions – Climate change, global
warming, acid rain, ozone layer depletion, nuclear accidents and holocaust. Case Studies –
Wasteland reclamation. – Consumerism and waste products. – Environment Protection Act. –
Air (Prevention and Control of Pollution) Act. – Water (Prevention and control of Pollution)
Act – Wildlife Protection Act – Forest Conservation Act – Issues involved in enforcement of
environmental legislation – Public awareness.

UNIT V
Human Population and the Environment: Population growth, variation among nations.
Population explosion – Family Welfare Programmes. – Environment and human health –
Human Rights – Value Education – HIV/AIDS – Women and Child Welfare – Role of
information Technology in Environment and human health – Case studies.

Field Work: Visit to a local area to document environmental assets River/forest

grassland/hill/mountain – Visit to a local polluted site-Urban/Rural/Industrial/Agricultural
Study of common plants, insects, and birds – river, hill slopes, etc..

Textbooks:
1. Textbook of Environmental Studies for Undergraduate Courses Erach Bharucha for
University Grants Commission, Universities Press.
2. Palaniswamy, “Environmental Studies”, Pearson education
27
 3. S.Azeem Unnisa, “Environmental Studies” Academic Publishing Company
4. K.Raghavan Nambiar, “Text book of Environmental Studies for Undergraduate
Courses as per UGC model syllabus”, Scitech Publications (India), Pvt. Ltd.

References:
1. Deeksha Dave and E.Sai Baba Reddy, “Textbook of Environmental Science”, Cengage
Publications.
2. M.Anji Reddy, “Text book of Environmental Sciences and Technology”, BS
Publication.
3. J.P.Sharma, Comprehensive Environmental studies, Laxmi publications.
4. J. Glynn Henry and Gary W. Heinke, “Environmental Sciences and Engineering”,
Prentice Hall of India Private limited
5. G.R.Chatwal, “A Text Book of Environmental Studies” Himalaya Publishing House
6. Gilbert M. Masters and Wendell P. Ela, “Introduction to Environmental Engineering
and Science, Prentice Hall of India Private limited.

******

28
 II Year II Semester Managerial Economics and Financial L T P C
Course Code: 2 0 0 2
1099232201 Analysis

MANAGERIAL ECONOMICS AND FINANCIAL ANALYSIS

Course Objectives:
● To inculcate the basic knowledge of microeconomics and financial accounting
● To make the students learn how demand is estimated for different products, input-
output relationship for optimizing production and cost
● To Know the Various types of market structure and pricing methods strategy
● To give an overview on investment appraisal methods to promote and the students to
learn how to plan long-term investment decisions.
● To provide fundamental skills on accounting and to explain the process of preparing
financial statements.
Course Outcomes:
 Demonstrate managerial economics & elasticity of demand (K2)
 Generalize production function and cost concepts (K2)
 Explain market structures and industrial organizations (K2)
 Determine financial performance of a company (K3)
 Apply capital budgeting techniques in Investment proposals (K3)

UNIT - I
Managerial Economics
Introduction – Nature, meaning, significance, functions, and advantages. Demand-Concept,
Function, Law of Demand - Demand Elasticity- Types – Measurement. Demand Forecasting-
Factors governing Forecasting, Methods. Managerial Economics and Financial Accounting and
Management.

UNIT - II
Production And Cost Analysis
Introduction – Nature, meaning, significance, functions and advantages. Production Function–
Least- cost combination– Short run and long run Production Function- Isoquants and Is costs, Cost
& Break-Even Analysis - Cost concepts and Cost behaviour- Break-Even Analysis (BEA)
- Determination of Break-Even Point (Simple Problems).

UNIT - III
Business Organizations and Markets
Introduction – Forms of Business Organizations- Sole Proprietary - Partnership - Joint Stock
Companies - Public Sector Enterprises. Types of Markets - Perfect and Imperfect Competition
- Features of Perfect Competition Monopoly- Monopolistic Competition–Oligopoly-Price- Output
Determination - Pricing Methods and Strategies

29
 UNIT - IV
Capital Budgeting
Introduction – Nature, meaning, significance. Types of Working Capital, Components, Sources of
Short-term and Long-term Capital, Estimating Working capital requirements. Capital Budgeting–
Features, Proposals, Methods and Evaluation. Projects – Pay Back Method, Accounting Rate of
Return (ARR) Net Present Value (NPV) Internal Rate Return (IRR) Method (sample problems)

UNIT - V

Financial Accounting and Analysis

Introduction – Concepts and Conventions- Double-Entry Bookkeeping, Journal, Ledger, Trial
Balance- Final Accounts (Trading Account, Profit and Loss Account and Balance Sheet with
simple adjustments). Introduction to Financial Analysis - Analysis and Interpretation of Liquidity
Ratios, Activity Ratios, and Capital structure Ratios and Profitability.

Textbooks:
1. Varshney & Maheswari: Managerial Economics, Sultan Chand.
2. Aryasri: Business Economics and Financial Analysis, 4/e, MGH.

Reference Books:
1. Ahuja Hl Managerial economics Schand.
2. S.A. Siddiqui and A.S. Siddiqui: Managerial Economics and Financial Analysis, NewAge
International.
3. Joseph G. Nellis and David Parker: Principles of Business Economics, Pearson, 2/e,New
Delhi.
4. Domnick Salvatore: Managerial Economics in a Global Economy, Cengage.

Online Learning Resources:

https://www.slideshare.net/123ps/managerial-economics-ppt
https://www.slideshare.net/rossanz/production-and-cost-45827016
https://www.slideshare.net/darkyla/business-organizations-19917607
https://www.slideshare.net/balarajbl/market-and-classification-of-
market https://www.slideshare.net/ruchi101/capital-budgeting-ppt-
59565396 https://www.slideshare.net/ashu1983/financial-accounting

******

30
 II Year II Semester L T P C
Course Code: Probability & Statistics
1000232202
3 0 0 3

PROBABILITY & STATISTICS

Course Objectives:

 To familiarize the students with the foundations of probability and statistical methods.
 To impart probability concepts and statistical methods in various applications Engineering

Course Outcomes:
After successful completion of this course, the students should be able to:

 Classify the concepts of data science and its importance. (K2)

 Use discrete and continuous probability distributions to solve problems. (K3)
 Identify the types of sampling methods for different data samples.(K3)
 Test suitable sample statistical tests in testing hypothesis data.(K4)
 Interpret the association of characteristics through correlation and regression methods.(K3)

UNIT I:
Descriptive statistics
Statistics Introduction, Population vs Sample, Collection of data, primary and secondary data,
Measures of Central tendency, Measures of Variability (spread or variance) Skewness, Kurtosis,
correlation, correlation coefficient, rank correlation, regression coefficients, method of least
squares, regression lines.

UNIT II:
Probability
Probability, probability axioms, addition law and multiplicative law of probability, conditional
probability, Baye’s theorem, random variables (discrete and continuous), probability density
functions, properties, mathematical expectation.

UNIT III:
Probability distributions

Probability distributions: Binomial, Poisson and Normal-their properties (Chebyshevs

inequality). Approximation of the binomial distribution to normal distribution.

UNIT IV:
Estimation and Testing of hypothesis, large sample tests

Estimation-parameters, statistics, sampling distribution, point estimation, Formulation of null

hypothesis, alternative hypothesis, the critical and acceptance regions, level of significance, two
types of errors and power of the test. Large Sample Tests: Test for single proportion, difference

31
of proportions, test for single mean and difference of means. Confidence interval for parameters
in one sample and two sample problems of fit.

UNIT V:
Small sample tests

Student t-distribution (test for single mean, two means and paired t-test), testing of equality of variances
(F-test), χ2 - test for goodness of fit, χ2 - test for independence of attributes.

Textbooks:

1. Miller and Freunds, Probability and Statistics for Engineers,7/e, Pearson, 2008.
2. S.C. Gupta and V.K. Kapoor, Fundamentals of Mathematical Statistics, 11/e, Sultan
Chand & Sons Publications, 2012.

Reference Books:

1. B. V. Ramana, Higher Engineering Mathematics, Mc Graw Hill Education.

Scientists,8th Edition, Pearson 2007.
2. S. Ross, a First Course in Probability, Pearson Education India, 2002.
3. W. Feller, an Introduction to Probability Theory and its Applications, 1/e, Wiley, 1968.

Online Learning Resources:

1. https://onlinecourses.nptel.ac.in/noc21_ma74/preview
2. https://onlinecourses.nptel.ac.in/noc22_mg31/preview

******

32
II Year I Semester L T P C
Course Code: 3 0 0 3
1042232201
Machine Learning

MACHINE LEARNING
Course Objectives:

The objectives of the course are to

 Define machine learning and its different types (supervised and unsupervised) and
understand their applications.
 Apply supervised learning algorithms including decision trees and k-nearest neighbours
(k-NN).
 Implement unsupervised learning techniques, such as K-means clustering.

Course Outcomes:

Students will be able to:

 Understand the key a foundational concepts and stages in the machine learning process(K2)
 Apply and evaluate nearest neighbor-based algorithms, including K-Nearest Neighbor (KNN)
and radius distance algorithms. (K3)
 Develop decision tree models for classification and regression, understand the impurity
measures utilizing random forests and implement the Bayes classifier. (K3)
 Apply linear classifiers like perceptrons and support vector machines for classification
tasks in designing and training neural networks using multi-layer perceptrons (MLPs).(K3)
 Use various clustering methods, including K-Means, fuzzy C-Means, and spectral
clustering. (K3)

UNIT-I:

Introduction to Machine Learning: Evolution of Machine Learning, Paradigms for ML,

Learning by Rote, Learning by Induction, Reinforcement Learning, Types of Data, Matching,
Stages in Machine Learning, Data Acquisition, Feature Engineering, Data Representation, Model
Selection, Model Learning, Model Evaluation, Model Prediction,Search and Learning, Data Sets.
UNIT-II:

Nearest Neighbor-Based Models: Introduction to Classification, Introduction to Proximity

Measures, Distance Measures, Non-Metric Similarity Functions, Proximity Between Binary
Patterns, Different Classification Algorithms Based on the Distance Measures ,K-Nearest
Neighbor Classifier, Radius Distance Nearest Neighbor Algorithm, KNN Regression,
Performance of Classifiers, Performance of Regression Algorithms.

UNIT-III:

Models Based on Decision Trees: Decision Trees for Classification, Impurity Measures,
Properties, Regression Based on Decision Trees, Bias–Variance Trade-off, Random Forests for
Classification and Regression.

33
The Bayes Classifier: Introduction to the Bayes Classifier, Bayes’ Rule and Inference, The
Bayes Classifier and its Optimality, Multi-Class Classification | Class Conditional Independence
and Naive Bayes Classifier (NBC)

UNIT-IV:

Linear Discriminants for Machine Learning: Introduction to Linear Discriminants, Linear

Discriminants for Classification, Perceptron Classifier, Perceptron Learning Algorithm, Support
Vector Machines, Linearly Non-Separable Case, Non-linear SVM, Kernel Trick, Logistic
Regression, Linear Regression, Multi-Layer Perceptrons (MLPs), Backpropagation for Training
an MLP.

UNIT-V:

Clustering: Introduction to Clustering, Partitioning of Data, Matrix Factorization | Clustering of

Patterns, Divisive Clustering, Agglomerative Clustering, Partitional Clustering, K-Means
Clustering, Soft Partitioning, Soft Clustering, Fuzzy C-Means Clustering, Rough Clustering,
Rough K-Means Clustering Algorithm, Expectation Maximization-Based Clustering, Spectral
Clustering.

Text Books:

1. “Machine Learning Theory and Practice”, M N Murthy, V S Ananthanarayana, Universities

Press (India), 2024

Reference Books:
1. “Machine Learning”, Tom M. Mitchell, McGraw-Hill Publication, 2017
2. “Machine Learning in Action”,Peter Harrington, DreamTech
3. “Introduction to Data Mining”, Pang-Ning Tan, Michel Stenbach, Vipin Kumar, 7th Edition,
2019.

******

34
 II Year II Semester L T P C
Course Code: 3 0 0 3
1005232202
Database Management Systems

DATABASE MANAGEMENT SYSTEMS

Course Objectives:
The main objectives of the course is to
• To study about the theoretical knowledge and practical skills in the use of databases and
database management systems in information technology applications.
• To understand about the logical design, physical design and implementation of relational
databases are covered.
• To understand and construct ER Model on various applications.

Course Outcomes:
After completion of the course, students will be able to
• Discuss elements of Database System and its Architecture for defining the schema.
• Make Use of relational model concepts and create queries using Basic SQL.
• Develop ER Model and perform various query operations on SQL.
• Construct the relations using different normal forms without redundant information.
• Illustrate state of the transaction using ACID properties and Organize database storage
structures and access techniques using file organization, indexing methods include B+ Tree,
Hashing.

UNIT I:
Introduction: Database system, Characteristics (Database Vs File System), Database Users,
Advantages of Database systems, Database applications. Brief introduction of different Data
Models; Concepts of Schema, Instance and data independence; Three tier schema architecture
for data independence; Database system structure, environment, Centralized and Client Server
architecture for the database.
Entity Relationship Model: Introduction, Representation of entities, attributes, entity set,
relationship, relationship set, constraints, sub classes, super class, inheritance, specialization,
generalization using ER Diagrams.

Unit II:

Relational Model: Introduction to relational model, concepts of domain, attribute, tuple,

relation, importance of null values, constraints (Domain, Key constraints, integrity constraints)
and their importance, Relational Algebra, Relational Calculus. BASIC SQL: Simple Database
schema, data types, table definitions (create, alter), different DML operations (insert, delete,
update).

UNIT III:

SQL: Basic SQL querying (select and project) using where clause, arithmetic & logical
operations, SQL functions (Date and Time, Numeric, String conversion). Creating tables with
relationship, implementation of key and integrity constraints, nested queries, sub queries,
grouping, aggregation, ordering, implementation of different types of joins, view (updatable
35
and non-updatable), relational set operations.

UNIT IV:

Schema Refinement (Normalization): Purpose of Normalization or schema refinement,

concept of functional dependency, normal forms based on functional dependencyLossless join
and dependency preserving decomposition, (1NF, 2NF and 3 NF), concept of surrogate key,
Boyce-Codd normal form (BCNF), MVD, Fourth normal form(4NF), Fifth Normal Form
(5NF).

UNIT V:
Transaction Concept: Transaction State, ACID properties, Concurrent Executions,
Serializability, Recoverability, Implementation of Isolation, Testing for Serializability, lock
based, time stamp based, optimistic, concurrency protocols, Deadlocks, Failure Classification,
Storage, Recovery and Atomicity, Recovery algorithm.
Introduction to Indexing Techniques: B+ Trees, operations on B+Trees, Hash Based
Indexing:

Text Books:

1. Database Management Systems, 3rd edition, Raghurama Krishnan, Johannes Gehrke,

TMH (For Chapters 2, 3, 4)
2. Database System Concepts,5th edition, Silberschatz, Korth, Sudarsan, TMH (For
Chapter 1 and Chapter 5)

Reference Books:

1. Introduction to Database Systems, 8thedition, C J Date, Pearson.

2. Database Management System, 6th edition, RamezElmasri, Shamkant B. Navathe,
Pearson
3. Database Principles Fundamentals of Design Implementation and Management, Corlos
Coronel, Steven Morris, Peter Robb, Cengage Learning.

Web-Resources:

1. https://nptel.ac.in/courses/106/105/106105175/
2. https://infyspringboard.onwingspan.com/web/en/app/toc/lex_auth_0127580666728202
2456_shared/overview
******

36
 II Year II Semester L T P C
Course Code: Digital Logic & Computer Organization 3 0 0 3
1004232104

DIGITAL LOGIC & COMPUTER ORGANIZATION

Course Objectives:
The main objectives of the course is to
 To learn fundamental concepts of Number representation and Conversion and Boolean
Algebra.
 Designing of different types of Sequential logic circuits.
 Discuss about the Components in computer.
 To Analyze Arithmetic operation of computers and processor organization.
 Study the Different units in computer organization.

Course Outcomes:
After completion of the course, students will be able to
 Analyze the Digital Circuit using basic Boolean algebra.
 Designing of Registers and counters using flipflops and Describe the concepts of computers
and processors.
 Design different Digital circuits using arithmetic operations in computers.
 Explain the organization of Memory by using Register concepts.
 Explain about the Input and output access in Computer Organization.

UNIT – I:
Data Representation: Binary Numbers, Fixed Point Representation. Floating Point
Representation. Number base conversions, Octal and Hexadecimal Numbers, components,
Signed binary numbers, Binary codes
Digital Logic Circuits-I: Basic Logic Functions, Logic gates, universal logic gates,
Minimization of Logic expressions. K-Map Simplification, Combinational Circuits, Decoders,
Multiplexers

UNIT – II:
Digital Logic Circuits-II: Sequential Circuits, Flip-Flops, Binary counters, Registers, Shift
Registers, Ripple counters
Basic Structure of Computers: Computer Types, Functional units, Basic operational
concepts, Bus structures, Software, Performance, multiprocessors and multi computers,
Computer Generations, Von- Neumann Architecture

UNIT – III:
Computer Arithmetic: Addition and Subtraction of Signed Numbers, Design of Fast Adders,
Multiplication of Positive Numbers, Signed-operand Multiplication, Fast Multiplication,
Integer Division, Floating-Point Numbers and Operations
Processor Organization: Fundamental Concepts, Execution of a Complete Instruction,
Multiple-Bus Organization, Hardwired Control and Multi programmed Control

UNIT – IV:
The Memory Organization: Basic Concepts, Semiconductor RAM Memories, Read-Only
Memories, Speed, Size and Cost, Cache Memories, Performance Considerations, Virtual
Memories, Memory Management Requirements, Secondary Storage
37
UNIT – V:
Input/Output Organization: Accessing I/O Devices, Interrupts, Processor Examples, Direct
Memory Access, Buses, Interface Circuits, Standard I/O Interfaces.

Textbooks:

1. Computer Organization, Carl Hamacher, ZvonkoVranesic, SafwatZaky, 6th edition,

McGraw Hill, 2023.
2. Digital Design, 6th Edition, M. Morris Mano, Pearson Education, 2018.
3. Computer Organization and Architecture, William Stallings, 11thEdition, Pearson,
2022.

Reference Books:

1. Computer Systems Architecture, M.Moris Mano, 3rdEdition, Pearson, 2017.

2. Computer Organization and Design, David A. Paterson, John L. Hennessy, Elsevier,
2004.
3. Fundamentals of Logic Design, Roth, 5thEdition, Thomson, 2003.

Online Learning Resources:

https://nptel.ac.in/courses/106/103/106103068/
******

38
 II Year II Semester L T P C
Course Code: 0 0 3 1.5
1042232210 Machine Learning Lab

MACHINE LEARNING LAB

Course Objectives:

 To learn about computing central tendency measures and Data preprocessing techniques
 To learn about classification and regression algorithms
 To apply different clustering algorithms for a problem.

Course Outcomes:
Students will be able to:
1. Interpret central tendency measures (mean, median, mode) and dispersion measures
(variance, standard deviation) to summarize and analyze datasets effectively.
2. Use data pre-processing techniques including attribute selection, handling missing values,
discretization, and elimination of outliers to prepare datasets for analysis.
3. Apply the K-Nearest Neighbors (KNN) algorithm for both classification and regression
tasks, and evaluate the model's performance based on accuracy and other relevant
metrics.
4. Demonstrate the ability to build and tune decision tree models for classification and
regression, and apply Random Forest algorithms to enhance model accuracy and robustness
5. Develop clustering algorithms including K-Means, Fuzzy C-Means, and Expectation
Maximization, and assess their performance based on clustering metrics and parameter

Software Required: Python/R/Weka

Lab should cover the concepts studied in the course work, sample listof Experiments:
1. Compute Central Tendency Measures: Mean, Median, Mode Measure of Dispersion:
Variance, Standard Deviation.
2. Apply the following Pre-processing techniques for a given dataset.
a. Attribute selection
b. Handling Missing Values
c. Discretization
d. Elimination of Outliers
3. Apply KNN algorithm for classification and regression
4. Demonstrate decision tree algorithm for a classification problem and perform parameter
tuning for better results
5. Demonstrate decision tree algorithm for a regression problem
6. Apply Random Forest algorithm for classification and regression
7. Demonstrate Naïve Bayes Classification algorithm.
8. Apply Support Vector algorithm for classification
9. Demonstrate simple linear regression algorithm for a regression problem
10. Apply Logistic regression algorithm for a classification problem
39
11. Demonstrate Multi-layer Perceptron algorithm for a classification problem
12. Implement the K-means algorithm and apply it to the data you selected. Evaluate
performance by measuring the sum of the Euclidean distance of each example from its
class center. Test the performance of the algorithm as a function of the parameters K.
13. Demonstrate the use of Fuzzy C-Means Clustering
14. Demonstrate the use of Expectation Maximization based clustering algorithm.
******

40
II Year II Semester L T P C
Course Code: Database Management Systems Lab 0 0 3 1.5
1005232211

DATABASE MANAGEMENT SYSTEMS LAB

Course Objectives:
This Course will enable students to
 Populate and query a database using SQL DDL/DML Commands
 Declare and enforce integrity constraints on a database
 Writing Queries using advanced concepts of SQL
 Programming PL/SQL including procedures, functions, cursors and triggers

Course Outcomes:
After completion of the course, students will be able to
 Write a PL/SQL program to check whether the given number is ARMSTRONG or not.
 Write a PL/SQL Code Creation of forms for any Information System such as Student
Information System, Employee Information System etc.

Experiments covering the topics:

 DDL, DML, DCL commands

 Queries, nested queries, built-in functions,
 PL/SQL programming- control structures
 Procedures, Functions, Cursors, Triggers,
 Database connectivity- ODBC/JDBC

Sample Experiments:

1. Creation, altering and droping of tables and inserting rows into a table (use constraints
while creating tables) examples using SELECT command.
2. Queries (along with sub Queries) using ANY, ALL, IN, EXISTS, NOTEXISTS,
UNION, INTERSET, Constraints. Example:- Select the roll number and name of the
student who secured fourth rank in the class.
3. Queries using Aggregate functions (COUNT, SUM, AVG, MAX and MIN), GROUP
BY, HAVING and Creation and dropping of Views.
4. Queries using Conversion functions (to_char, to_number and to_date), string
functions (Concatenation, lpad, rpad, ltrim, rtrim, lower, upper, initcap, length, substr
and instr), date functions (Sysdate, next_day, add_months, last_day, months_between,
least, greatest, trunc, round, to_char, to_date)
5.
i. Create a simple PL/SQL program which includes declaration section,
executable section and exception –Handling section (Ex. Student marks can be
selected from the table and printed for those who secured first class and an
exception can be raised if no records were found)
ii. Insert data into student table and use COMMIT, ROLLBACK and
41
 SAVEPOINT in PL/SQL block.
6. Develop a program that includes the features NESTED IF, CASE and CASE
expression. The program can be extended using the NULLIF and COALESCE
functions.
7. Program development using WHILE LOOPS, numeric FOR LOOPS, nested loops
using ERROR Handling, BUILT –IN Exceptions, USE defined Exceptions, RAISE-
APPLICATION ERROR.
8. Programs development using creation of procedures, passing parameters IN and OUT
of PROCEDURES.
9. Program development using creation of stored functions, invoke functions in SQL
Statements and write complex functions.
10. Develop programs using features parameters in a CURSOR, FOR UPDATE
CURSOR, WHERE CURRENT of clause and CURSOR variables.
11. Develop Programs using BEFORE and AFTER Triggers, Row and Statement Triggers
and INSTEAD OF Triggers
12. Create a table and perform the search operation on table using indexing and non-
indexing techniques.
13. Write a Java program that connects to a database using JDBC
14. Write a Java program to connect to a database using JDBC and insert values into it
15. Write a Java program to connect to a database using JDBC and delete values from it

Text Books/Suggested Reading:

1. Oracle: The Complete Reference by Oracle Press

2. Nilesh Shah, "Database Systems Using Oracle”, PHI, 2007
3. Rick F Vander Lans, “Introduction to SQL”, Fourth Edition, Pearson Education, 2007.

******

42
II Year II Semester L T P C
Course Code: Full Stack Development – 1
0 1 2 2
1005232280

FULL STACK DEVELOPMENT – 1

(Skill Enhancement Course)
Course Objectives:
The main objectives of the course are to
 Design static web pages by utilizing HTML components and their properties.
 Apply the proper CSS styles to the HTML elements to create a webpage.
 Create dynamic web pages and verify forms by experimenting with JavaScript.

Course Outcomes:
 Develop static web pages using HTML Elements (K3)
 Apply CSS styles to the HTML elements to create web pages(K3)
 Prepare dynamic web pages using JavaScript and validate the fields in the web page(K3)

Sample Experiments:

1. Lists, Links and Images

a. Write a HTML program, to explain the working of lists.
Note: It should have an ordered list, unordered list, nested lists and ordered list in an
unordered list and definition lists.
b. Write a HTML program, to explain the working of hyperlinks using <a> tag and href, target
Attributes.
c. Create a HTML document that has your image and your friend’s image with a specific
height and width. Also, when clicked on the images it should navigate to their respective
profiles.
d. Write a HTML program, in such a way that, rather than placing large images on a page, the
preferred technique is to use thumbnails by setting the height and width parameters to
something like to 100*100 pixels. Each thumbnail image is also a link to a full-sized version
of the image. Create an image gallery using this technique

2. HTML Tables, Forms and Frames

● Write a HTML program, to explain the working of tables. (use tags: <table>, <tr>, <th>,
<td> and attributes: border, rowspan, colspan)
● Write a HTML program, to explain the working of tables by preparing a timetable. (Note:
Use <caption> tag to set the caption to the table & also use cell spacing, cell padding, border,
rowspan, colspan etc.).
● Write a HTML program, to explain the working of forms by designing Registration form.
(Note: Include text field, password field, number field, date of birth field, checkboxes, radio

43
 buttons, list boxes using <select>&<option> tags, <text area> and two buttons ie: submit
and reset. Use tables to provide a better view).
● Write a HTML program, to explain the working of frames, such that page is to be divided
into 3 parts on either direction. (Note: first frame ◻ image, second frame ◻ paragraph,
third frame ◻ hyperlink. And also make sure of using “no frame” attribute such that frames
to be fixed).

3. HTML 5 and Cascading Style Sheets, Types of CSS

a. Write a HTML program, that makes use of <article>, <aside>, <figure>, <figcaption>,
<footer>, <header>, <main>, <nav>, <section>, <div>, <span> tags.
b. Write a HTML program, to embed audio and video into HTML web page.
c. Write a program to apply different types (or levels of styles or style specification formats)
- inline, internal, external styles to HTML elements. (identify selector, property and value).

4. Selector forms
a. Write a program to apply different types of selector forms
● Simple selector (element, id, class, group, universal)
● Combinator selector (descendant, child, adjacent sibling, general sibling)
● Pseudo-class selector
● Pseudo-element selector
● Attribute selector

5. CSS with Color, Background, Font, Text and CSS Box Model
a. Write a program to demonstrate the various ways you can reference a color in CSS.
b. Write a CSS rule that places a background image halfway down the page, tilting it
horizontally. The image should remain in place when the user scrolls up or down.
c. Write a program using the following terms related to CSS font and text:
i. font-size ii. font-weight iii. font-style
iv. text-decoration v. text-transformation vi. text-alignment
d. Write a program, to explain the importance of CSS Box model using
i. Content ii. Border iii. Margin iv. padding

6. Applying JavaScript - internal and external, I/O, Type Conversion

a. Write a program to embed internal and external JavaScript in a web page.
b. Write a program to explain the different ways for displaying output.
c. Write a program to explain the different ways for taking input.
d. Create a webpage which uses prompt dialogue box to ask a voter for his name and age.
Display the information in table format along with either the voter can vote or not

7. JavaScript Pre-defined and User-defined Objects

a. Write a program using document object properties and methods.
b. Write a program using window object properties and methods.
c. Write a program using array object properties and methods.
d. Write a program using math object properties and methods.
e. Write a program using string object properties and methods.
f. Write a program using regex object properties and methods.
g. Write a program using date object properties and methods.

44
h. Write a program to explain user-defined object by using properties, methods, accessors,
constructors and display.

8. JavaScript Conditional Statements and Loops

a. Write a program which asks the user to enter three integers, obtains the numbers from the
user and outputs HTML text that displays the larger number followed by the words
“LARGER NUMBER” in an information message dialog. If the numbers are equal, output
HTML text as “EQUAL NUMBERS”.
b. Write a program to display week days using switch case.
c. Write a program to print 1 to 10 numbers using for, while and do-while loops.
d. Write aprogram to print data in object using for-in, for-each and for-of loops
e. Develop a program to determine whether a given number is an ‘ARMSTRONG NUMBER’
or not. [Eg: 153 is an Armstrong number, since sum of the cube of the digits is equal to the
number i.e.,13 + 53+ 33 = 153]
f. Write a program to display the denomination of the amount deposited in the bank in terms
of 100’s, 50’s, 20’s, 10’s, 5’s, 2’s & 1’s. (Eg: If deposited amount is Rs.163, the output
should be 1-100’s, 1-50’s, 1- 10’s, 1-2’s & 1-1’s)
9. Javascript Functions and Events
a. Design a appropriate function should be called to display
● Factorial of that number
● Fibonacci series up to that number
● Prime numbers up to that number
● Is it palindrome or not
b. Design a HTML having a text box and four buttons named Factorial, Fibonacci, Prime, and
Palindrome. When a button is pressed an appropriate function should be called to display
8. Factorial of that number
9. Fibonacci series up to that number
10. Prime numbers up to that number
11. Is it palindrome or not
c. Write a program to validate the following fields in a registration page
i. Name (start with alphabet and followed by alphanumeric and the length should not
be less than 6 characters)
ii. Mobile (only numbers and length 10 digits)
iii. E-mail (should contain format like [email protected])
10. Write a program to implement XMl Elements

Text Books:
1. Programming the World Wide Web, 7th Edition, Robet W Sebesta, Pearson, 2013.
2. Web Programming with HTML5, CSS and JavaScript, John Dean, Jones & Bartlett
Learning, 2019 (Chapters 1-11).
3. Pro MERN Stack: Full Stack Web App Development with Mongo, Express, React, and
Node, Vasan Subramanian, 2nd edition, APress, O’Reilly.
Web Links:

1. https://www.w3schools.com/html
2. https://www.w3schools.com/css
3. https://www.w3schools.com/js/
4. https://www.w3schools.com/nodejs
5. https://www.w3schools.com/typescript

45
II Year II Semester L T P C
Course Code: Design Thinking & Innovation 1 0 2 2
1002232220

DESIGN THINKING & INNOVATION

Course Objectives:
The objective of this course is to
 Familiarize students with design thinking process as a tool for breakthrough innovation.
 Equip students with design thinking skills and ignite the minds to create innovative ideas,
develop solutions for real-time problems.

Course Outcomes:
 Define the concepts related to design thinking. (K2)
 Explain the fundamentals of Design Thinking and innovation (K2)
 Apply the design thinking techniques for solving problems in various sectors. (K3)
 Analyze to work in a multidisciplinary environment (K4)
 Evaluate the value of creativity (K5)
 Formulate specific problem statements of real time issues (K3)

UNIT I
Introduction to Design Thinking
Introduction to elements and principles of Design, basics of design-dot, line, shape, form as
fundamental design components. Principles of design. Introduction to design thinking, history
of Design Thinking, New materials in Industry.

UNIT II
Design Thinking Process
Design thinking process (empathize, analyze, idea & prototype), implementing the process in
driving inventions, design thinking in social innovations. Tools of design thinking - person,
costumer, journey map, brainstorming, product development

Activity: Every student presents their idea in three minutes, Every student can present design
process in the form of flow diagram or flow chart etc. Every student should explain about
product development.

UNIT III
Innovation
Art of innovation, Difference between innovation and creativity, role of creativity and
innovation in organizations- Creativity to Innovation- Teams for innovation- Measuring the
impact and value of creativity.
Activity: Debate on innovation and creativity, Flow and planning from idea to innovation,
Debate on value-based innovation.

46
UNIT IV
Product Design
Problem formation, introduction to product design, Product strategies, Product value, Product
planning, product specifications- Innovation towards product design- Case studies
Activity: Importance of modelling, how to set specifications, Explaining their own product
design.

UNIT V
Design Thinking in Business Processes
Design Thinking applied in Business & Strategic Innovation, Design Thinking principles that
redefine business – Business challenges: Growth, Predictability, Change, Maintaining
Relevance, Extreme competition, Standardization. Design thinking to meet corporate needs-
Design thinking for Startups- Defining and testing Business Models and Business Cases-
Developing & testing prototypes.
Activity: How to market our own product, About maintenance, Reliability and plan for startup.

Textbooks:
1. Tim Brown,Change by design, Harper Bollins (2009)
2. Idris Mootee, Design Thinking for Strategic Innovation, 2013, John Wiley & Sons.

Reference Books:
1. David Lee, Design Thinking in the Classroom, Ulysses press
2. Shrutin N Shetty, Design the Future, Norton Press
3. William Lidwell, Universal Principles of Design- Kritinaholden, Jill Butter.
4. Chesbrough. H, The Era of Open Innovation – 2013

Online Learning Resources:

 https://nptel.ac.in/courses/110/106/110106124/
 https://nptel.ac.in/courses/109/104/109104109/
 https://swayam.gov.in/nd1_noc19_mg60/preview

******

47