DETAILED COURSE SYLLABUS

IV SEMESTER

SEMESTER IV

Credit Structure &

COURSE Evaluation Scheme
Total Hours
S Hrs. /
Course Code Course Title L T P C IA ET Tot.
No Week
1 21BTCS24C01 Probability and Statistics 3 0 0 3 3 50 50 100
2 21BTCS24C02 Object Oriented Programming 3 0 0 3 3 50 50 100
3 21BTCS24C03 Theory of Computation 3 0 0 3 3 50 50 100
4& 22TNAC00U02 Indian Constitution (MOOC) 0 0 0 2 - 50 50 100
5 21BTCS24C04 Professional Training (PBEL) 0 0 4 2 4 50 50 100
6 Core Elective – 1 4 0 0 4 4 50 50 100
7 21BTCS99E01 Industry Elective- I (Collaborative) 2 0 2 3 4 50 50 100
8 21BTCS24C05 Object Oriented Programming Lab 0 0 4 2 4 50 50 100
Total 15 0 10 22 25
&MOOC – Pass/Fail Audit Course. Credit Transfer. No Internal assessment / No End Sem Exam – Certi icate of Completion
https://legalaffairs.nalsar.ac.in/students/student/takecourse

Page 67 of 174
 Max.
Course code Course Name Hours/week Credit
Marks
L T P C
21BTCS24C01 Probability and Statistics 100
3 0 0 3
Pre-Requisite NA
Theory Hours Marks
End Semester Examination 2-2.5 50
Internal Assessment - 50
1) Mid Semester Examination (Theory)/Continuous Assessment
Evaluation 1.5 30
Scheme (Practical)
2) Attendance - 10
3) Assignment/Seminar/Activity/ School Approved Certi icate
Course/Events/Professional Societies Membership and - 10
Participants
UNIT-I PROBABILITY AND RANDOM VARIABLE 9

Types of probability, Relative frequency approach, Random variable - Probability mass function - Probability density
functions - Properties-, Moment, probability and moment, generating function, Probability distribution.
UNIT-II SPECIAL DISTRIBUTIONS 9

Special Distributions: Discrete uniform, geometric, negative binomial, hypergeometric, Poisson, continuous uniform,
exponential, gamma, Weibull, Pareto, beta, normal, lognormal, inverse Gaussian, Cauchy, double exponential
distributions, reliability and hazard rate, reliability of series and parallel systems, problems.

UNIT-III HYPOTHESIS TESTING, CHI-SQUARE 9

Meaning and types of hypothesis, Formulation, Basic concept of hypothesis testing, one sample tests, two sample tests,
Chi-square tests – test of independence and Goodness of it.

UNIT-IV CORRELATION AND REGRESSION 9

Correlation, Rank correlation, Regression Analysis, Linear and Nonlinear Regression, Multiple regression, Curve itting
by method of least squares, itting of straight lines, polynomials, exponential curves.
UNIT-V THEORY OF ESTIMATION 9
Theory of estimation, Good estimator, Central Limit theorem, Standard Error, Point estimation method, Interval
estimation method, Examples.

Total hours 45 periods

Course Outcomes: After completion of course, students would be able to:

COs Statements Bloom’s Level

CO1 Understand the basic probability concepts L2

CO2 Explain standard distributions which can describe real life phenomena. L3

Apply statistical methods designed to contribute to the process of making L3

CO3 scienti ic judgments in the face of uncertainty and variation.

Acquire skills in handling situations involving more than one random L3

CO4 variable and functions of random variables.

Page 68 of 174
 Apply notion of sampling distributions and have acquired knowledge of L3
CO5 statistical techniques useful in making rational decision in engineering.
TEXT BOOK:
1 E. Walpole, R. H. Mayers, S. L. Mayers and K. Ye, (2007), Probability and Statistics for Engineers and
. Scientists,8th Edition, Pearson Education, ISBN: 978-8-131-71552-9.

2 Sheldon M. Ross, (2011), Introduction to Probability and Statistics for Engineers and Scientists, 4 th Edition,
. Academic Foundation, ISBN: 978-8-190-93568-5.
REFERENCES:
3 Douglas C. Montgomery, (2012), Applied Statistics and Probability for Engineers, 5 th Edition, Wiley India, ISBN:
. 978-8-126-53719-8.

4 Spiegel, M. R., Schiller, J. and Srinivasan, R. A., (2010), Probability & Statistics, 3 rdEdition, Tata McGraw Hill,
. ISBN: 978-0-070-15154-3.
5 Dr.C.K. Reddy, Quantitative Method for Management Decision, Himalaya Publication House,1st Edition,2009.
.

Course Outcomes with Program Outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 3 3 1 2 - - - - - - - -
3
CO2 3 2 1 - - - - - - - -
3
CO3 3 1 3 - - - - - - - -
3
CO4 3 2 2 - - - - - - - -
3
CO5 3 2 1 - - - - - - - -

Page 69 of 174
 Max.
Course code Course Name Hours/week Credit
Marks
L T P C
21BTCS24C02 Object Oriented Programming 100
3 0 0 3
Pre-requisite NA
Theory Hours Marks
End Semester Examination 2-2.5 50
Internal Assessment - 50
Evaluation 1) Mid Semester Examination (Theory)/Continuous Assessment
1.5 30
Scheme (Practical)
2) Attendance - 10
3) Assignment/Seminar/Activity/ School Approved Certi icate
- 10
Course/Events/Professional Societies Membership and Participants
UNIT-I INTRODUCTION TO OBJECT ORIENTED PROGRAMMING AND JAVA 9
Introduction to OOP concepts – Difference between Procedural vs OOP- Overview of Java -JDK, JVM, JRE– Introducing
Classes – Objects and Methods- Basic syntax of Java program - Java API Packages- Importing Packages-Access Modi iers
- Data Types, Variables, and Arrays - Operators - Control Statements.
UNIT-II INHERITANCE AND POLYMORPHISM IN JAVA 9
Inheritance – Super Class and Subclass- Types of Inheritance- Why Java doesn’t support multiple Inheritance-
Polymorphism – Overloading and Overriding – Runtime Polymorphism in Java.
UNIT-III INTERFACES, EXCEPTIONS AND THREAD 9
Interfaces De inition and Implementation - Exception Handling: Types - Try and Catch - Throw - Multi-threaded
Programming: Creating Threads - Inter Thread Communication.
UNIT-IV FILES AND STRING HANDLING 9
File - The Byte Streams - The Character Streams - Using Stream I/ O – Serialization - String Handling: Special String
operations and Methods - String Buffer - Exploring java.lang and java.util package: Utility Classes- Wrapper - System -
Math - String Tokenizer - Date and Time, Collections Framework: Collections Interfaces and Classes.
UNIT-V APPLETS, GUI AND EVENT HANDLING 9
Introduction to Java Applet - Applet Architecture and Lifecycle- Applet Display Methods - Event Handling Mechanisms -
Event Classes - Event Listener - Working with Windows, Graphics, Colors and Fonts - Example Frameworks: Swing and
AWT - AWT Controls- Layout Managers and Menus- JDBC Architecture and Drivers- Accessing Databases with JDBC.
Total hours: 45 periods
Course Outcomes: At the end of the course, the students will be able to:
Statements Bloom’s Level
COs
Understand the fundamentals of object-oriented programming in Java. L2
CO1
Implement various types of inheritance and polymorphism. L3
CO2
Apply the concept of interfaces, exceptions and multithreading in Java. L3
CO3
Discuss string handling operations in Java. L2
CO4
Analyse user-interface applications using GUI components, Java Applet L4
CO5
and event handling principles.
TEXT BOOK:
1. Timothy Budd, "An Introduction to Object-Oriented Programming”, Third Edition, Pearson Education, 2008.
2. E Balagurusamy, “Programming with Java”, Sixth Edition, TMcGrawHill.
3. Y. Daniel Liang, "Introduction to Java Programming- Comprehensive Version”, Tenth Edition, Pearson.
4. Paul Deitel and Harvey Deitel, "Java How to Program (Early Objects)”, Tenth Edition, Pearson Prentice Hall 2014.
5. Herbert Schildt, Java 2-Complete Reference, Tata Mc Graw Hill, 2015

Page 70 of 174
REFERENCES:
6. Patrick Niemeyer, Daniel Leuck, "Learning Java”, Fourth Edition, Shroff/O'Reilly, 2013.
Joshua Bloch, "Effective Java: A Programming Language Guide”, Second Edition,
7.
Pearson, 2008.
Rod Johnson, Juergen Hoeller, Alef Arendsen, Thomas Risberg, Colin Sampaleanu, Java Development with the
8.
Spring Framework, Wiley-India, 2012

Course Outcomes with Program Outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO 10 PO 11 PO

12
CO 1 3 3 3 - - 1 - - 2 - - 2

CO 2 3 3 3 - 2 - - - 2 - - -

CO 3 3 3 3 - 2 - - - 2 - - -

CO 4 3 3 3 - - - - - - - - -

CO 5 3 3 3 - 3 - - - 2 - - -

Page 71 of 174
 Max.
Course code Course Name Hours/week Credit
Marks
L T P C
21BTCS24C03 Theory of Computation 100
3 0 0 3
Pre-requisite NA
Theory Hours Marks
End Semester Examination 2-2.5 50
Internal Assessment - 50
Evaluation 1) Mid Semester Examination (Theory)/Continuous Assessment (Practical) 1.5 30
Scheme
2) Attendance - 10
3) Assignment/Seminar/Activity/ School Approved Certi icate
- 10
Course/Events/Professional Societies Membership and Participants
UNIT-I AUTOMATA FUNDAMENTALS 9
Introduction to formal proof – Additional forms of Proof – Inductive Proofs –Finite Automata – Deterministic Finite
Automata – Non-deterministic Finite Automata – Finite Automata with Epsilon Transitions
UNIT-II REGULAR EXPRESSIONS AND LANGUAGES 9
Regular Expressions – FA and Regular Expressions – Proving Languages not to be regular – Closure Properties of Regular
Languages – Equivalence and Minimization of Automata.
UNIT-III CONTEXT FREE GRAMMAR AND LANGUAGES 9
CFG – Parse Trees – Ambiguity in Grammars and Languages – De inition of the Pushdown Automata – Languages of a
Pushdown Automata – Equivalence of Pushdown Automata and CFG, Deterministic Pushdown Automata.
UNIT-IV PROPERTIES OF CONTEXT FREE LANGUAGES 9
Normal Forms for CFG – Pumping Lemma for CFL – Closure Properties of CFL – Turing Machines – Programming
Techniques for TM.
UNIT-V UNDECIDABILITY 9
Non Recursive Enumerable (RE) Language – Undecidable Problem with RE – Undecidable Problems about TM – Post‘s
Correspondence Problem, The Class P and NP.
Total hours 45 periods
Course Outcomes: At the end of the course, students will be able to:
COs Statements Bloom’s Level
CO1 Use basic concepts of formal languages of inite automata techniques. L2
Implement Finite Automata for different Regular Expressions and L3
CO2
Languages.
CO3 Construct context free grammar for various languages. L6
Solve various problems of applying normal form techniques, push down L3
CO4
automata and Turing Machines.
CO5 Participate in GATE, PGECET and other competitive examinations. L3
TEXT BOOK:
John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman (2007), Introduction to Automata Theory Languages and
1.
Computation, 3rdedition, Pearson Education, India
2. Michael Sipser, Introduction to the Theory of Computation (Second Edition).
REFERENCES:
K. L. P Mishra, N. Chandrasekaran (2003), Theory of Computer Science-Automata Languages and Computation,
3.
2nd edition, Prentice Hall of India, India. .
4. Thomas Sudkamp, Languages and Machines: An Introduction to the Theory of Computer Science. (Third Edition)

Page 72 of 174
Course Outcomes with Program Outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO PO PO

10 11 12
CO 1 3 3 2 3 2 1 - - - - - -

CO 2 2 3 3 3 2 2 - - - - - -

CO 3 2 2 3 3 2 2 - - - - - -

CO 4 3 3 2 3 2 3 - - - - - -

CO 5 3 2 3 3 3 2 2 - - - - -

Page 73 of 174
 Max.
Course code Course Name Hours/week Credit
Marks
L T P C
22TNAC00U02 Indian Constitution 100
0 0 0 2
Pre-Requisite NA
MOOC Hours Marks
Evaluation Pass/Fail Audit Course - Credit Transfer.
Scheme No Internal assessment / No End Sem Exam – Certi icate 30 100
of Completion and Final Quiz/Viva
UNIT-I Introduction to Constitution 6
Historical development of Constitutional Law, Characteristics of the Indian Constitution: Federal Structure and Unitary
form of Government and Preamble.
UNIT-II Fundamental rights 6
Fundamental Rights- General Scheme of Fundamental Rights, who can claim it, against whom Fundamental Rights are
available, Suspension of Fundamental Rights, and Constitutional remedies under Article 32 and 226.Right to Equality,
Freedom of Speech and Expression, Protection against Conviction. Right to life and Personal Liberty, right against
Exploitation. Right to freedom of Religion, and Rights of Minorities.

UNIT-III Directive Principal of State policies 6

Directive Principles of State Policies: Importance and Relationship with Fundamental Rights, Fundamental Duties and
Amendment of Constitution: Procedure for amending the Constitution & Basic Structure Principle.

UNIT-IV State and Union power 6

Union Parliament: Organization, Procedure regarding the enactment of Legislation, Parliamentary Privileges. Union
Executive: The President, powers, position and Ordinance Making Power, Union Cabinet: Prime Minister and their
cabinet and is PM real Head. The Union and State Judiciary: Establishment, Appointment and Jurisdiction, The State
Executive: The Governor, Power and Position. Emergency Provisions (National Emergency, Constitutional Emergency
and Financial Emergency), B- Trade, Commerce and Inter Course Provisions.

UNIT-V Administrative Power of state and union 6

Distribution of Legislative and Administrative Powers between Union and State: Doctrine of Territorial Nexus, Doctrine
of Pith and Substance, Doctrine of Colourable Legislation etc.
Total hours 30 periods

At the end of the course, the students will be able to:

COs Statements Bloom’s Level
Have general knowledge and legal literacy about the Indian Constitution and L2
CO1 thereby it helps to take up competitive examinations & to manage/face complex
societal issues in society.
Explain state and central policies (Union and State Executive), fundamental L2
CO2
Rights & their duties.
CO3 Understand Electoral Process and special provisions in Constitution. L2
CO4 Discuss the Amendments in Indian Constitution. L2
Understand powers and functions of Municipalities, Panchayats and Co- L2
CO5
operative Societies, with Human Rights and NHRC.
TEXT BOOK:
Durga Das Basu (DD Basu): “Introduction to the Constitution on India”, (Students Edition.) Prentice –Hall EEE,
1.
19th / 20th Edn., (Latest Edition) or 2008.
Shubham Singles, Charles E. Haries, and Et al: “Constitution of India and Professional Ethics” by Cengage
2.
Learning India Private Limited, Latest Edition – 2018.
REFERENCES:

Page 74 of 174
 M.Govindarajan, S.Natarajan, V.S.Senthilkumar, “Engineering Ethics”, Prentice –Hall of India Pvt. Ltd. New Delhi,
3.
2004.
4. M.V.Pylee, “An Introduction to Constitution of India”, Vikas Publishing, 2002.

Course Outcomes with Program Outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO PO PO

10 11 12
CO 1 3 2 3 1 3 - - - - - 1 1

CO 2 3 2 3 1 3 1 - - - - - 1

CO 3 3 1 3 2 3 1 - - - - - 1

CO 4 2 2 3 1 3 - - - - - - -

CO 5 3 1 2 2 2 1 - - - 1 - -

Page 75 of 174
 Max.
Course code Course Name Hours/week Credit
Marks
L T P C
21BTCS24C04 Professional Training (PBEL) 100
0 0 4 2
Pre-Requisite Knowledge of Python Programming and Arti icial Intelligence
Pre-Requisite NA
Practical Hours Marks
End Semester Examination 2-2.5 50
Internal Assessment - 50
Evaluation 1) Mid Semester Examination (Theory)/Continuous Assessment
1.5 30
Scheme (Practical)
2) Attendance - 10
3) Assignment/Seminar/Activity/ School Approved Certi icate
- 10
Course/Events/Professional Societies Membership and Participants
Evaluation Hours Marks
Project Based Evaluation
Scheme 60 100
About Course: The Professional Certi icate Training course aims to equip the students with essential skills and
knowledge required to excel in their professional career. Here the focus is on developing key competencies such as
communication skills, teamwork, problem-solving skills, and professional ethics. Through a combination of theoretical
concepts, hands-on exercises, and real-world case studies, students will gain practical insights into the professional
world and enhance their employability levels.
TOPIC-1 Professional Communication Skills 10
Importance of effective communication in the professional world, Written and oral communication techniques, Active
listening and effective questioning, Non-verbal communication skills.
TOPIC-2 Effective Teamwork and Collaboration 10
Understanding the value of teamwork in the workplace, Team dynamics and roles, Con lict resolution and negotiation
skills, Delegation of roles and responsibilities, Effective collaboration using project management tools.
TOPIC-3 Project Management Skills 20
Introduction to project management, Project Life Cycle Management, Project time and cost estimation, Resource
Management and Cost Management, Project Evaluation.
TOPIC-4 Professional Ethics and Project Development 20
Ethics in profession and decision making, Project Modules Development, Project progress and Performance
Management.
TOPIC-5 Project Demonstration, Presentation and Documentation Skills 10

Demonstration of project, Presentation, Report Formulation and Documentation.

Total hours 60 hours
Course Outcomes: At the end of the course, the students will be able to:

COs Statements Bloom’s Level

CO1 Demonstrate effective communication skills in professional contexts. L1

CO2 Understand the importance of teamwork and collaborate effectively with peers. L2
CO3 Apply project management techniques to analyse and manage projects. L3
Comprehend professional ethics, ethical decision-making and project development
CO4 L5
in the ield of computer science.
Develop project modules, demonstration, professional documents and presentations
CO5 L6
for various purposes.

Page 76 of 174
MOOCs
1. Soft Skills - https://onlinecourses.nptel.ac.in/noc23_hs145/preview

2. Developing Soft Skills & Personality - https://onlinecourses.nptel.ac.in/noc23_hs116/preview

3. Soft Skill Development - https://onlinecourses.nptel.ac.in/noc23_hs80/preview

4. Body Language: Key To Professional Success - https://onlinecourses.nptel.ac.in/noc23_hs146/preview

5. Technical English For Engineers -https://onlinecourses.nptel.ac.in/noc23_hs115/preview

6. Leading Teams | Coursera - https://www.coursera.org/learn/leading-teams

7. Working In Contemporary Teams - https://onlinecourses.nptel.ac.in/noc23_mg123/preview

8. Project Management - https://onlinecourses.nptel.ac.in/noc23_mg124/preview

Course Outcomes with Program Outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO 1 2 1 2 - - - 2 1 2 - - 2

CO 2 2 1 2 1 - - 2 2 3 - - 2

CO 3 2 1 2 1 - - 2 1 2 - 3 2

CO 4 2 1 3 1 - - 2 3 2 - 2 2

CO 5 2 1 2 1 - - 2 1 2 - - 2

Page 77 of 174
 Max.
Course code Course Name Hours/week Credit
Marks
L T P C
21BTAI99E11 Introduction to Arti icial Intelligence 100
4 0 0 4
Pre-requisite NA
Theory Hours Marks
End Semester Examination 2-2.5 50
Internal Assessment - 50
Evaluation 1) Mid Semester Examination (Theory)/Continuous Assessment
1.5 30
Scheme (Practical)
2) Attendance - 10
3) Assignment/Seminar/Activity/ School Approved Certi icate
- 10
Course/Events/Professional Societies Membership and Participants
UNIT-I SCOPE OF AI 10
Introduction to AI Foundations and History. Intelligent Agents- application domains natural language processing, vision
and speech processing, robotics, expert systems, AI techniques- Agent types.

UNIT-II PROBLEM SOLVING STATE SPACE SEARCH 10

Production systems, search space control: depth irst, breadth irst search, heuristic search - hill climbing, best- irst
search, branch and bound. Problem Reduction, Constraint Satisfaction End.

UNIT-III KNOWLEDGE REPRESENTATION & LOGICAL AGENTS 12

Knowledge-Based Agents, Wumpus WorldNet, Propositional Logic, Propositional Theorem, Propositional Model
Checking, Agents Based on Propositional Logic. First-Order Logic: Representation, Syntax and Semantics, Using First-
Order Logic and Knowledge Engineering. Inference in First-Order Logic: Uni ication and Lifting, Forward and Backward
Chaining, Resolution.
UNIT-IV UNCERTAIN KNOWLEDGE AND REASONING 14
Acting under Uncertainty, Probability Notation, Inference, Independence and Bayes’ Rule. Probabilistic Reasoning:
Semantics and Inference of Bayesian Networks, Relational and First-Order Probability Models, Probabilistic Reasoning
over Time: Inference, Hidden Markov Models, Kalman Filters and Dynamic Bayesian Networks. Making Simple Decisions:
Utility Theory and Functions and Decision Networks.
UNIT-V LEARNING FROM EXAMPLES 14
Forms, Decision Trees, Theory of Learning, Linear Models, Arti icial Neural Networks, Nonparametric Models, Support
Vector Machines, Ensemble Learning. Knowledge in Learning: Logical Formulation, Explanation-Based Learning,
Reinforcement Learning: Passive and Active Reinforcement Learning and Generalization.
Total hours 60 periods
Course Outcomes: At the end of the course, the students will be able to:
COs Statements Bloom’s Level
CO1 Analyse the dimensions along which agents and environments. L4
CO2 Implement agents using search algorithms L3
CO3 Implement strategies for agents in games of perfect and imperfect information. L3
CO4 Experiment with knowledge representation. L4
Understand Bayesian network to make quantitative (probabilistic) and L2
CO5
qualitative inferences
TEXT BOOK:
1. Elaine Rich and Kevin Knight, “Arti icial Intelligence”, McGraw-Hill,2017.
2. Stuart Russell, Peter Norvig, “Arti icial Intelligence – A Modern Approach”, Pearson Education,2020.
REFERENCES:
3. E Charniak and D McDermott, “Introduction to Arti icial Intelligence”, Pearson Education.
4. Dan W. Patterson, “Arti icial Intelligence and Expert Systems”, Prentice Hall of India.

Page 78 of 174
Course Outcomes with Program Outcomes and Program Speci ic Outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO PO PO PSO PSO PSO
1 2 3
10 11 12
CO 1 3 3 2 2 1 1 1 1 - - - - 3 1 3

CO 2 3 2 3 3 3 2 3 1 2 - - - 1 3 2

CO 3 2 3 3 3 2 2 - - - - - - 2 2 -

CO 4 3 3 3 3 2 3 - - - - - - 2 2 2

CO 5 3 3 3 3 3 2 2 - - - - - 3 2 2

Page 79 of 174
 Max.
Course code Course Name Hours/week Credit
Marks
L T P C
21BTAI99E12 Machine Learning and Deep Learning Techniques 100
4 0 0 4
Pre-requisite NA
Theory Hours Marks
End Semester Examination 2-2.5 50
Internal Assessment - 50
Evaluation 1) Mid Semester Examination (Theory)/Continuous Assessment
1.5 30
Scheme (Practical)
2) Attendance - 10
3) Assignment/Seminar/Activity/ School Approved Certi icate
- 10
Course/Events/Professional Societies Membership and Participants
UNIT-I INTRODUCTION TO MACHINE LEARNING 12
Introduction, Examples of various Learning Paradigms, Perspectives and Issues, Version Spaces, Finite and In inite
Hypothesis Spaces
Basics of Machine Learning - Types of Machine Learning – Supervised / Unsupervised, Regression / Classi ication,
Feature scaling – KNN – Train/Test data
UNIT-II ADVANCED MACHINE LEARNING 12
Linear regression – Polynomial regularization – Ridge, Feature selection – Feature elimination – Gradient descent –
Logistic regression – Error Matrix, , Confusion matrix – Accuracy, Precision, Recall – Support Vector Machines – Decision
trees – Unsupervised – K-means.
UNIT-III DEEP LEARNING – NEURAL NETWORKS 12
Introduction to Neural networks – Sigmoid, Weights, Layers, Activation, Matrix representation, Training – Forward
propagation – Back propagation – Stochastic gradient descent – Mini-batch – Introduction to Keras – Keras sequential
model - Regularization & Gradient Descent –Early stopping – Reinforcement learning.
UNIT-IV CONVOLUTIONAL NEURAL NETWORKS 12
Introduction to CNNs – Image data, Kernels, convolutions, padding, ConvNets and Transfer learning – Arti icial neural
networks – LeNet-5 – CNN architectures – AlexNet , ResNet.
UNIT-V DEEP LEARNING APPLICATIONS 12
Recurrent Neural Networks – Ordering, Recurrent, Unrolling – Practical details, Weaknesses – LSTM RNNs – Poor
memory problem – LSTM architecture.
Total hours 60 periods
Course Outcomes: At the end of the course, students will be able to:
COs Statements Bloom’s Level
CO1 Recognize the characteristics of machine learning strategies. L2
CO2 Understand the basics of machine learning techniques. L2
CO3 Interpret various techniques involved in neural networks. L3
CO4 Implement convolutional neural networks and its architectures and tools. L3
CO5 Discuss recurrent neural networks and its architecture. L2
TEXT BOOK:
1. Zsolt Nagy, Arti icial Intelligence and Machine Learning Fundamentals, Packt Publishing, 2018.
2. Josh Patterson and Adam Gibson, Deep Learning: A Practitioner’s Approach, O’reilly, 2017.
3 Ian Goodfellow, Yoshua Bengio and Aaron Courvile, Deep Learning, MIT Press, 2016
REFERENCES:
Shai Shalev-Shwartz and Shai Ben-David, Understanding Machine Learning: From Theory to Algorithms,
4.
Cambridge University Press, 2014.

Page 80 of 174
Course Outcomes with Program Outcomes and Program Speci ic Outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO PO PO PSO PSO PSO
1 2 3
10 11 12
CO 1 3 3 3 2 1 1 - - - - - - 2 3 2

CO 2 3 2 3 3 2 2 - - - - - - 1 - -

CO 3 3 3 2 1 - 2 - - - - - - 2 2 -

CO 4 2 2 3 3 2 3 - 2 - - - - 3 - 2

CO 5 2 2 3 1 3 2 2 - - - - - 3 2 1

Page 81 of 174
 Max.
Course code Course Name Hours/week Credit
Marks
L T P C
21BTAI99E13 Business Intelligence 100
4 0 0 4
Pre-requisite NA
Theory Hours Marks
End Semester Examination 2-2.5 50
Internal Assessment - 50
Evaluation 1) Mid Semester Examination (Theory)/Continuous Assessment (Practical) 1.5 30
Scheme
2) Attendance - 10
3) Assignment/Seminar/Activity/ School Approved Certi icate
- 10
Course/Events/Professional Societies Membership and Participants
UNIT-I INTRODUCTION TO BI 12
Understanding the scope of today’s BI solutions and how they it into existing infrastructure. Assessing new options such
as SaaS and cloud- based technologies. Describe BI, its components & architecture. Previewing the future of BI. Crafting
a better experience for all your business users. End User Assumptions. Setting Up Data for BI.
The Functional Area of BI Tools. Query Tools and Reporting. OLAP and Advanced Analytics. Supporting the requirements
of senior executives, including performance management.
UNIT-II ELEMENTS OF BUSINESS INTELLIGENCE SOLUTIONS 12
Reports & ad hoc queries; Analyze OLAP data; Dashboards & Scorecards development Metadata Models; Automated tasks
& events; Mobile & disconnected BI; Collaboration capabilities; Real time monitoring capabilities; Software development
kit; Consume BI through portals, web applications, Desktop applications.
UNIT-III BUILDING THE BI PROJECT 12
Planning the BI project, Project Resources; Project Tasks, Risk Management and Mitigation Cost-justifying BIsolutions
and measuring success, Collecting User Requirements, Requirements-Gathering Techniques; Prioritizing & Validating BI
Requirements, Changing Requirements; BI Design and Development, Best Practices for BI Design; Post-Implementation
Evaluations, Maintaining Your BI Environment.
UNIT-IV REPORTING AUTHORING 12
Building reports with relational vs Multidimensional data models; Types of Reports - List, crosstabs, Statistics, Chart,
map, inancial etc; Data Grouping & Sorting, Filtering Reports, Adding Calculations to Reports, Conditional formatting,
Adding Summary Lines to Reports. Drill- up, drill-down, drill-through capabilities. Run or schedule report, different
output forms – PDF, excel, CSV, xml etc.
UNIT-V BI DEPLOYMENT, ADMINISTRATION AND SECURITY 12
Centralized Versus Decentralized Architecture, BI Architecture Alternatives, phased & incremental BI roadmap, System
Sizing, Measurements, and Dependencies, System Sizing, Measurements, and Dependencies. Setting Early Expectations
and Measuring the Results. End-User Provisos. OLAP Implementations. Expanding BI Authentication, Authorization,
Access Permissions, Groups and Roles, Single-sign on Server Administration, Manage Status & Monitoring, Audit, Mail
server & Portal integration, Back Up and Restore.
Total hours 60 periods
Course Outcomes: At the end of the course, the students will be able to:
COs Statements Bloom’s Level
CO1 Understand the Business Intelligence. L2
CO2 Discuss the elements of Business Intelligence solutions. L2
CO3 Analyse the process of building of BI Projects. L4
CO4 Design a report with various operations. L6
CO5 Understand BI deployment, administration and security. L2
TEXT BOOK:
Rick Sherman, “Business Intelligence Guidebook: From Data Integration to Analytics”, Morgan Kaufmann,
1.
November 2014.
REFERENCES:
David King, Efraim Turban, and Ramesh Sharda, “Business Intelligence: A Managerial Approach”, Pearson
3.
Education India, Jan.2013.

Page 82 of 174
Course Outcomes with Program Outcomes and Program Speci ic Outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO PO PO PSO PSO PSO
1 2 3
10 11 12
CO 1 3 2 2 2 3 2 1 - 1 - 1 - 1 2 2

CO 2 2 3 3 3 2 1 - - - 3 2 2 2 2 3

CO 3 3 3 2 3 3 - - - 1 - 2 - 3 3 3

CO 4 1 2 3 2 2 - - - - - 1 2 1 2 2

CO 5 2 3 3 3 3 2 - 1 - - - - 1 2 2

Page 83 of 174
 Max.
Course code Course Name Hours/week Credit
Marks
L T P C
21BTCS99E01 Industry Elective-1 (Collaborative ) 100
2 0 2 3
Pre-Requisite NA
Theory Hours Marks
End Semester Examination 2-2.5 50
Internal Assessment - 50
Evaluation 1) Mid Semester Examination (Theory)/Continuous Assessment
1.5 30
Scheme (Practical)
2) Attendance - 10
3) Assignment/Seminar/Activity/ School Approved Certi icate
- 10
Course/Events/Professional Societies Membership and Participants
UNIT-I Python Basic and Advance 10
Python Programming Language – Basic, Overview, Python setup – Getting started with programming, Python object,
and data structure – Data types, variables, Python Data structures – Tuples, set, Dictionaries, List, String, Numbers etc,
Python Comparison operators, Python Statements – if & Elif, else, for loops, while loops, Python Methods & function,
Python errors and Exception handling, Python Module and Packages, Final Capstone Project on Python – Simple
application using Python.
UNIT-II Python for Advanced Mathematical Operation – NumPy, and Data
Analysis using Pandas 10

Introduction to NumPy, Statistical analysis using NumPy, Perform Random Number generation using NumPy, Perform
Mathematical Operations using NumPy, Matrix Manipulation, Perform , Various operations on Arrays, Use cases of
NumPy, Introducing Pandas object , Series, and Data Frame, Reading data from a ile, Dropping entries from an axis,
Indexing and selection operators,
Perform Arithmetic and conditional alignment using Pandas, Identify Unique values and value counts, Handle missing
values from the Dataset, and Pandas Group by Methods.
Data Visualization using Matplotlib and Data Visualization using
UNIT-III 10
Seaborn
Introduction to Matplotlib, Various types of plotting and Visualization, Figures and subplot
, Colors, Markers and Line styles, Histograms and Binning, Text and Annotation, Line Plots, Bar Plots, Scatter Plots,
pie chart, Ticks, Labels and Legends, subplots, Three-Dimensional Plotting in Matplotlib, Introduction to Seaborn,
Distribution plot, Categorical plot, Matrix, Grid, Regression plot, Style and color in seaborn, Heatmap and other
plotting styles.
UNIT-IV Arti icial intelligence – Basic and Industry-Speci ic tools – SAP
10
AI – Overview, Market opportunities, Future, AI in different domains, AI in healthcare, AI in education, AI in
automobile, etc., Use cases, Demos, Teachable machine, AI duet etc, SAP – Overview, various services offered by SAP,
SAP products, SAP AI conversational Chatbot application – Hand on, Introduction to chatbot, Deployment of chatbot
to third-party application.
20
UNIT-V Capstone Project
Capstone Project is based on learning and students create prototype-level solution for real-life problems.
Design Thinking – Way to solve problems with creative thinking.

Total hours 60 periods

Course Outcomes: At the end of the course, the students will be able to:

COs Statements Bloom’s Level

Understand the basic concepts of Python and its important terminologies. L2

CO1
Page 84 of 174
 Analyse the key role of the advanced Python algorithm and its application to real-time L4
CO2
problems.
L1
CO3 Describe the Different libraries of Python and its application to real-time problems.

Evaluate the Basic concept of AI in Industry 4.0. L5

CO4

CO5 Create a Capstone project related to Industry 4.0. L6

TEXT BOOK:
Wesley J Chun, “Core Python Applications Programming”, 3rd Edition, Pearson Education India, 2015. ISBN-
1.
13: 978-9332555365.
REFERENCES:
Allen B. Downey, "Think Python: How to Think Like a Computer Scientist”, 2nd Edition, Green Tea Press,
2.
2015, ISBN: 978-9352134755
Charles Dierbach, "Introduction to Computer Science Using Python", 1st Edition, Wiley India Pvt Ltd. ISBN-13:
3.
978-8126556014

Course Outcomes with Program Outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO PO PO

10 11 12
CO 1 3 3 3 3 2 1 - - - - - -

CO 2 1 3 3 3 2 2 - - - - - -

CO 3 2 3 3 3 2 2 - - - - - -

CO 4 3 3 3 3 2 3 - - - - - -

CO 5 3 3 3 3 3 2 2 - - - - -

Page 85 of 174
 Max.
Course code Course Name Hours/week Credit
Marks
L T P C
21BTCS24C05 Object Oriented Programming Lab 100
0 0 4 2
Pre-Requisite Programming Logic
Practical Hours Marks
End Semester Examination 2-2.5 50
Internal Assessment - 50
1) Mid Semester Examination (Theory)/Continuous Assessment
Evaluation Scheme 1.5 30
(Practical)
2) Attendance - 10
3) Assignment/Seminar/Activity/ School Approved Certi icate
- 10
Course/Events/Professional Societies Membership and Participants
S.NO LIST OF EXPERIMENT
Write a java program to ind sum of two numbers using class and object.
Write a java program to demonstrate various
(a) Operators
(b) control statements.
Write a java program to:
(a) ind the factorial of a number entered by the user.
(b) print Fibonacci series.
CO1
(c) ind sum of digits in a given number
Write a Java program to create class Student. The class should have attributes student ID, student name,
marks for 3 subjects and the member functions are setdata() and displaydata(). Calculate the average
marks for student.
Write a Java program to de ine a class, instantiate its object and demonstrate constructor and destructor.
Write a Java program to implement the concept of importing classes from user de ined
package and creating packages.
Write a Java Program to implement various types of inheritance.
CO2
Write a Java program that implements runtime polymorphism.
Write a program to demonstrate use of interfaces.
CO3 Write a Java program to handle exceptions.
Write a Java program to illustrate creation of threads.
Write a Java program to implement string operations.
CO4
Write a Java program to perform ile handling.
Write a Java program to illustrate:
(a) Flow layout
(b) Grid layout
(c) Border layout
Using Java applet, write a program to create:
CO5 (a) A calculator
(b) Registration form
Write a Java program to demonstrate:
(a) Mouse event handling
(b) Key event handling
Write a Java program to establish JDBC using MySQL.
Page 86 of 174
 Total hours: 60 Periods
Course Outcomes: At the end of the course, the students will be able to:
Statements Bloom’s Level
COs
Understand the fundamentals of object-oriented programming in Java. L2
CO1
Implement classes, objects and know interaction between them. L3
CO2
Analyse and use packages, inheritance, interfaces and polymorphism in L4
CO3
Java.
Develop programs with multithreading and exception handling features. L6
CO4
Create GUI components using Java Applet and understand event handling L6
CO5
principles.
TEXT BOOK:
1. Timothy Budd, "An Introduction to Object-Oriented Programming”, Third Edition, Pearson Education, 2008.
2. E Balagurusamy, “Programming with Java”, Sixth Edition, TMcGrawHill.
3. Y. Daniel Liang, "Introduction to Java Programming- Comprehensive Version”, Tenth Edition, Pearson.
REFERENCES:
1. Patrick Niemeyer, Daniel Leuck, "Learning Java”, Fourth Edition, Shroff/O'Reilly, 2013.
Joshua Bloch, "Effective Java: A Programming Language Guide”, Second Edition,
2.
Pearson, 2008.

Course Outcomes with Program Outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO 10 PO 11 PO

12
CO 1 3 3 2 - - 1 - - 2 - - 2

CO 2 3 3 3 - 2 - - - 2 - - -

CO 3 3 3 3 - 2 - - - 2 - - -

CO 4 3 3 3 - 2 - - - - - - -

CO 5 3 3 3 - 3 - - - 2 - - -

Page 87 of 174