SEMESTER III

Sr. Hrs/ Evaluation Scheme

Category Course Code Course Name L T P Credits
No. Week (Components)
ISE1 10
MSE 30
1 PC UDSPC0301 Linear Algebra 3 1 - 4 4 40
ISE2 10
ESE 50 20
ISE1 10
Discrete Mathematics and MSE 30
2 PC UDSPC0302 3 - - 3 3 40
Graph Theory ISE2 10
ESE 50 20
ISE1 10
MSE 30
3 PC UDSPC0303 Advanced Data Structures 3 - - 3 3 40
ISE2 10
ESE 50 20
ISE1 10
Database Management MSE 30
4 PC UDSPC0304 3 - - 3 3 40
System ISE2 10
ESE 50 20

5 VEC UDSVE0305 Constitution of India 2 - - 2 2 ISE 50 20 20

6 HSSM UDSEM0306 Principles of AIDS 2 - - 2 2 ESE 50 20 20

ISE 25 10
Advanced Data Structures
7 PC UDSPC0331 - - 2 2 1 ESE
Laboratory 50 20
(POE)
ISE 25 10
Database Management
8 PC UDSPC0332 2 2 1 ESE
System Laboratory 25 10
(POE)
Software System Tools
9 PC UDSPC0333 2 2 1 ISE 25 10
Laboratory

10 OJT UDSIL0371 Mini Project-I 2 2 1 ISE 50 20

11 MM UDSMM03** MM-1 2 2 2 ESE 100 40

Total Marks: 800

Total: 27 23
Total Credit: 23
Title of the Course: Discrete Mathematics & Graph Theory L T P Credits
Course Code: UDSPC0302 3 - -- 3

Course Pre-Requisite: Basic Mathematics

Course Description: This course focuses on concepts of Discrete Mathematical Structures such as Set
Theory & Relations, Mathematical Logic, Algebraic systems, Lattices, Graphs, Counting Theory
Principles etc. These topics form the basis of modern mathematics and have applications in computer
science, engineering, and cryptography, and operations research. Through the study of discrete structures
and their applications, students will develop critical thinking, problem-solving skills, and logical
reasoning abilities.

Course Objectives:
1. To introduce students to fundamental concepts in discrete mathematics, including Sets, relations,
Functions, Algebraic Systems, Graphs, Groups ,lattices and logic and use mathematically correct
terminology and notations.
2.To understand and critically analyze, formulate and solve the mathematical problems and proofs
3. To cultivate students' ability to solve complex problems using discrete mathematical methods and
algorithms.
4.To design and implement experiments on Discrete Structures – Truth tables of statement formula, Set
operations, tree traversal techniques. and explore applications of discrete mathematics in computer
science, cryptography, and other fields.
Course Outcomes:
COs After the completion of the course the student will be able to

CO1 Understand and work with the discrete mathematical structures such as Sets, Algebraic
systems, Groups, Probability in the field of Computer Science.

CO2 Gain proficiency in algorithmic thinking to illustrate the problems related to the topics on
discrete mathematics in Computer Science
CO3 Make use of discrete mathematical terminology and concepts of counting theory, design and
analyze algorithms for solving various computational problems in different areas of
Computer Science.

CO-PO Mapping:
CO PO PO PO PO PO PO PO PO PO PO PO P PSO PSO2
1 2 3 4 5 6 7 8 9 10 11 O 1
12
CO1 3 2 2 2 1
CO2 1 3 2 2 1
CO3 1 2 2 1 1

Assessment Scheme:
Two components of In Semester Evaluation (ISE), One Mid Semester Examination (MSE) and one End
Semester Examination (ESE) having 20%, 30% and 50% weightage respectively.

Assessment Component Marks

ISE 1 10
MSE 30
 ISE 2 10
ESE 50

ISE 1 and ISE 2 are based on Assignment / Declared test / Quiz / Seminar / Group discussions /
presentation, etc. is 20% weightage.
MSE is based on 50% of Course content (first three units).
ESE is based on 100% Course content with 60-70% weightage for Course content (last three units)
covered after MSE.

Course Contents:
Unit I : Mathematical logic
Statements and Notations, Connectives – negation, Conjunction, disjunction, conditional,
bi-conditional, Statement formulas and truth tables, Well-formed formulas, Tautologies,
Equivalence of formulas, Duality law, Tautological implications, functionally complete
sets of connectives, other connectives, Normal and principal normal forms, completely 08 Hrs.
parenthesized infix and polish notations, Theory of Inference for statement calculus –
validity using truth table, rules of inference, consistency of Premises and indirect method
of proof.
Unit II : Set Theory
Basic concepts of set theory, Operations on sets, Ordered pairs, Cartesian Products,
Representation of discrete structures, Relation and ordering - properties of binary relations
in a set, Relation matrix and the graph of a relation, Partition and Covering of set, 08 Hrs.
Equivalence relations, Composition of Binary relations, Partial ordering , POSET and
Hasse diagram. Functions – types, composition of functions, Inverse functions.
Unit III : Algebraic systems
Algebraic systems, properties and examples ,Semigroups and Monoids, properties and
05 Hrs.
examples, Homomorphism of Semigroups and Monoids , Groups: Definition and
examples, Subgroups and homomorphism.
Unit IV : Lattices and Boolean algebra
Lattice as POSETs , definition , examples and properties ,Lattice as algebraic systems, 05 Hrs.
Special lattices, Boolean algebra definition and examples, Boolean functions
Unit V : Permutations, Combinations
The Basics of Counting, The Pigeonhole Principle, Permutations and Combinations, 05 Hrs
Generalized Permutations and Combinations
Unit VI : Graph Theory
Basic concepts of Graph Theory, Storage Representation and Manipulation of Graphs,
09 Hrs
Eulerian and Hamiltonian Graphs, Graph Colouring-chromatic, Trees-Definitions,
Examples and Properties, PERT & Related Technologies
Text Books:
1. Discrete Mathematical Structures with Application to Computer Science- J. P. Tremblay & R. Manohar
(MGH International).
2. Discrete Mathematics and its Applications- Kenneth H. Rosen (AT & T Bell Labs)
Reference Books:
1. Discrete Mathematics- Semyour Lipschutz, MarcLipson (MGH)- Schaum’s Outlines
2. C.L. Liu and D. Mohapatra, “Elements of Discrete Mathematics”- SiE Edition,
TMGH,2008,ISBN10:07-066913-9
Title of the Course: Linear Algebra L T P Credits
Course Code: UDSPC0301 3 1 --- 4
Course Pre-Requisite: Basics of Matrix Algebra, Vectors and Set Theory.
Course Description: This Course contains Linear Algebra concepts for AI and ML
Course Objectives:
1. To learn mathematical methodologies and models in linear algebra.
2. To develop mathematical skills and enhance logical thinking power of students.
3. To provide students with skills in linear algebra which would enable them to devise engineering
solutions for given situations they may encounter in their profession.
4. To increase interest towards the use of mathematics in engineering module.
Course Outcomes:
COs After the completion of the course the student will be Bloom’s Cognitive
able to level Descriptor
CO1 Demonstrate the basic mathematical concepts in AI and data 2 Demonstrate
science related to linear algebra and Statistics
CO2 Explain Vector Space concepts in dealing with problems in 2 Explain
AI and data science.
CO3 Apply the knowledge of Linear transformation, Statistics 3 Apply
to solve problems arising in AI and data science.
CO-PO Mapping:
CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO PS PS
12 O1 O2
CO1 - 2 - - - - - - - - - 2 2 2
CO2 3 - - - - - - - - - - 2
CO3 - - 3 - - - - - - - - 2 2 2
Assessment Scheme:
Two components of In Semester Evaluation (ISE), One Mid Semester Examination (MSE) and one End
Semester Examination (ESE) having 20%, 30% and 50% weightage respectively.
Assessment Marks
Component
ISE 1 10
MSE 30
ISE 2 10
ESE 50

ISE 1 and ISE 2 are based on Assignment / Declared test / Quiz / Seminar / Group discussions /
presentation, etc.
MSE is based on 50% of course content (first three units).
ESE is based on 100% course content with 60-70% weightage for course content (last three units)
coveredafter MSE.
Course Contents:
Unit 1: Matrices:
1.1 Matrices and Computation of Eigen value by power method,

1.2 Iterative Method for AX = B : Gauss Jacobi , Gauss-Siedel Method,

7 Hrs.
1.3 LU Decomposition,
1.4 Computation with Matrices - Matrix Norms, Condition Numbers
1.5 Inner and outer products,
1.6 Hermitian, skew-Hermitian and unitary matrices.

Unit 2 :Vector Algebra:

2.1 Vector Spaces,
2.2 Subspaces, Span, 7 Hrs.
2.3 Linear Independence, Basis and Dimension,
2.4 Orthogonality - Orthogonal Vectors and Subspaces,
2.5 Cosines and Projections onto Lines
2.6 Orthogonal Bases and Gram – Schmidt
Unit 3 :Linear Algebra-I:
3.1 Eigen value Problems: Diagonalization of a Matrix, Powers
3.2 Differential Equations 7 Hrs.
3.3 Positive Definite Matrices - Minima,Maxima
3.4 Saddle Points, Tests for Positive Definiteness
3.5 Singular value decomposition.
Unit 4: Linear Algebra-II:
4.1 Linear Transformations Definition and example of linear transformation,
4.2 Null space, range, rank and nullity of linear transformation, 8 Hrs.
4.3 Matrix representation of a linear transformation
4.4 Composition of linear transformation.
4.5 Transformation Diagonalization : Diagonalizability

Unit 5: Exploratory Data Analysis:

5.1 Elements of Structured Data, Rectangular Data,
5.2 Mean , Median, Mode 8 Hrs.
5.3 Standard Deviation, Percentiles and Boxplots
5.4 Expected Value.
 5 Hrs.
Unit 6: Statistical Techniques for data analysis.
6.1 Correlation and Coefficient of correlation.
6.2 Linear Regression.
6.3 Fitting of curves by method of least-squares
6.3.1 Fitting of Straight lines
6.3.2 Fitting of Parabolic Curves.
6.3.3 Fitting of Exponential curves.

Text Books:
1. Linear Algebra and Its Applications - by Gilbert Strang, 4th Edition, Thomson Brooks/Cole.
2. Stephen H. Friedberg, Arnold J. Insel, Lawrence E. Spence, Linear Algebra, 4th Ed., PrenticeHall of
India Pvt. Ltd., New Delhi, 2004.
Reference Books:
1. Numerical Linear Algebra, Allaire, Grégoire, Kaber, Sidi Mahmoud, Springer (2008)
2. Applied Numerical Linear Algebra, by James W. Demmel, SIAM (1997)
3. Numerical Linear Algebra, by Lloyd Trefethen and David Bau III, SIAM, 1997. [Lectures 1-29, 32-
35 covered in chapter 1-6 of the Text Book]
4. David C. Lay, Linear Algebra and its Applications, 3rd Ed., Pearson Education Asia, Indian Reprint,
2007.
5. S. Lang, Introduction to Linear Algebra, 2nd Ed., Springer, 2005. 4. Gilbert Strang, Linear Algebra
and its Applications, Thomson, 2007.
Course Code: UDSPC0303 L T P Credit
Course Name: Advanced Data Structures 3 - - 3

Course Prerequisites:
C Programming
Basic Data Structures
Course Description:
This course covers Introduction to Linear Data structure, Linked List and its applications. It explains non-Linear data
structures Viz. Tress and Graphs in depth. This course also covers sorting techniques and Hashing
Course Outcomes: After the completion of the course the student will be able to -
CO1 Evaluate the efficiency of algorithms using appropriate notations and techniques.
Apply data structures to solve a wide range of computational problems, including searching, sorting, graph
CO2
traversal, various algorithms etc.
CO3 Analyze different hashing methods and their performance characteristics.

CO-PO Mapping:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PS PSO2
O1
CO1 2 1 2 2 2 2 1 2 1 2 2
CO2 2 1 2 3 2 2 1 3 1 2 2
CO3 2 2 3 3 2 2 1 1 2 2

Assessment Scheme:
SN Assessment Weightage Remark
1 In Semester Evaluation 1 (ISE1) 10% Assignment, Test, Quiz, Seminar, Presentation, etc.
2 Mid Semester Examination (MSE) 30% 50% of course contents
3 In Semester Evaluation 2 (ISE2) 10% Assignment, Test, Quiz, Seminar, Presentation, etc.
4 End Semester Examination (ESE) 50% 100% course contents

Course Contents:
UNIT 1 Introduction to Data Structure 6 Hours

Data Structures, Types of Data Structures, Algorithm and its efficiency, Notations foranalysis of an algorithm,
Recursion- Tower of Hanoi, Ackermann’s function, Recursion

UNIT 2 Stacks and Queues 6 Hours

Stack- Definition, operations, represent at ions using array, Linked List, Queue- Definition, operations, Types of Queue
Circular Queue, Priority Queues applications representation using array and Linked list.

UNIT 3 Linked List 6 Hours

Linked List and its Types-Singly Linked List, Circular Linked List, Doubly Linked List, Applications of Linked List:
Polynomial Representation and Polynomial Arithmetic. Reversing a string
UNIT 4 Trees 8 Hours
Basic terminology, binary tree and its representation, binary tree traversal methods, binary search tree, AVL tree, B tree,
B+ tree, Heaps and its operations, M-way Search Tree,,RB trees

UNIT 5 Graphs 8 Hours

Graph Terminologies, Representation of the Graph- Adjacency Matrix and Adjacency List, Graph Traversal Techniques-
BFS and DFS, Warshall’s Algorithm, Shortest Path Algorithm, Dijkshtra algorithm, spanning tree algorithms,
Applications- Dictionaries

UNIT 6 Hashing 6 Hours

Hashing – concept, hashing methods, hash collision, hash collision resolution methods.

Text Books:

1. Data Structure using C- A. M. Tanenbaum, Y. Langsam, M. J. Augenstein (PHI)

2. Data Structures- A Pseudo code Approach with C – Richard F. Gilberg and Behrouz A. Forouzon, Cengage Learning,
Second Edition.
3. Schaum’s Outlines Data Structures – Seymour Lipschutz (MGH), Tata McGraw-Hill.

Reference Books:
1. Fundamentals of Data Structures – Horowitz, Sahni CBS India
2. An introduction to data structures with Applications- Jean-Paul Tremblay, Paul. G. Soresan, Tata McGraw Hill
International Editions, Second Edition.
Course Code: UDSPC0304 L T P Credit
Course Name: Database Management System 3 - - 3
Course Prerequisites:
Basic Computer Skills, Programming skills, Mathematics skills, Data Structures, Computer Science
Fundamentals, Database Concepts.

Course Description:
This course presents the fundamental concepts of database design and use. It provides a study of data models,
data□description languages, relational algebra, SQL, data normalization and transactions.

Course Outcomes: After the completion of the course the student will be able to
CO1 Explain the fundamental database concepts.
CO2 Apply the normalization techniques and SQL queries on database.
CO3 Interpret various indexing and concurrency control techniques.
CO4 Develop a database application using database design principles.
CO-PO Mapping:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3
CO2 2 3 1
CO3 2 1 2
CO4 3
Assessment Scheme:
SN Assessment Weightage Remark
1 In Semester Evaluation 1 (ISE1) 10% Assignment, Test, Quiz, etc.
2 Mid Semester Examination (MSE) 30% 50% of course contents
3 In Semester Evaluation 2 (ISE2) 10% Assignment, Test, Quiz, etc.
4 End Semester Examination (ESE) 50% 100% course contents
Course Contents:
UNIT-I Introduction to Database Concepts 8 Hours
Purpose of Database Systems, View of Data, Data Models, Database Architecture, Roles in Database
Environment, The Entity-Relationship Model, Entity-Relationship Diagrams, Reduction to Relational Schemas,
Introduction to Relational Model, Relational Query Languages- The Relational Algebra.

UNIT-II Relational Database Design 6 Hours

The purpose of Normalization, Data Redundancies and Update Anomalies, Functional Dependencies, The
Process of Normalization, First Normal Form, Second Normal Form, Third Normal Form, Boyce-Codd Normal
Form, Fourth Normal Form, Fifth Normal Form

UNIT-III Relational Model and Structured query Language 8 Hours

Structure of Relational Databases, SQL Data Definition Language, Basic Structure of SQL Queries, Primary key
Foreign key, Cursors, Views, Procedures, indexes, triggers, Null Values, Aggregate Functions, Nested
Subqueries, Modification of the Database, Join Expressions, Views, Integrity Constraints, Accessing SQL from
a Programming Language, Side Effect of Schema Update
 UNIT-IV Transactions and Concurrency Control 8 Hours
Simple Transaction Model, Serializability, Concurrency Control- Lock-Based Protocols, Two phase locking
protocols, Graph-based protocols, Multiple Granularity, Timestamp-Based Protocols, Validation-Based Protocols

UNIT-V File Structure, Indexing and Hashing 6 Hours

Overview of Physical Storage Media, File Organization, Organization of Records in Files, Data-Dictionary
Storage, Database Buffer. Basic Concepts of Indexing and Hashing, Ordered Indices, B+-Tree Index Files, B-
Tree Index Files, Multiple-Key Access, Static Hashing, Dynamic Hashing

UNIT-VI Overview of NoSQL 6 Hours

Overview and History of NoSQL Databases. Definition of the Four Types of NoSQL Database, The Value of
Relational Databases, Getting at Persistent Data, Concurrency, Integration, Impedance Mismatch, JSON File
introduction, Introduction to Mongodb database

Text Books:
1. Fundamentals of Database Systems – by Ramez Elmasri and Shamkant Navathe Publisher -Pearson
Education,
5th Edition.
2. Database Systems: Design, Implementation and Management.- PeterRof, Carlos Coronel (7th Edition),
Cengage□Learning.

Reference Books:
1. Database System Concept by Henry F. Korth, Abraham Silberschatz, Sudarshan (McGraw Hill Inc.) Sixth
Edition.
2. Database Systems- A practical approach to Design, Implementation and Management by Thomos Connolly,
Carolyn Begg, 3rd Edition, Pearson Education
Title of the Course: Constitution of India L T P Credit
Course Code: UDSVE0305 2 - - 2

Course Pre-Requisite: Basics of Indian History, Independence Movement, Fundamentals of Civics.

Course Description: This Course is an introduction of Indian Constitution and basic concepts highlighted in
this course for understanding the Constitution of India. This course is structured to give a deeper insight for
making the nexus between the other law subjects.
Course Objectives
At the end of the course the student is expected to have acquired:
1. A basic understanding of Constitution of India.
2. Builds the ability to apply the knowledge gained from the course to current social legal issues.
3. Ability to understand and solve the contemporary challenges.
4. Understanding constitutional remedies.
Course Learning Outcomes:

CO After the completion of the course the student Bloom’s Cognitive

should be able to level Descriptor
CO1 Explain the significance of Indian Constitution as the Cognitive
II
fundamental law of the land (Understand)
CO2 Exercise his fundamental rights in proper sense at the
Cognitive
same time Identifies his responsibilities in national II
(Applying)
building.
CO3 Analyze the Indian political system, the powers and
Cognitive
functions of the Union, State and Local Governments II
(Understand)
in detail
CO4 Understand Electoral Process, Emergency provisions Cognitive
II
and Amendment procedure. (Understand)
CO-PO Mapping:

CO 1 2 3 4 5 6 7 8 9 10 11 12 PSO1 PSO2 PSO3

CO1 3 3 3
CO2 3 3 3 3 3
CO3 3 3 3
CO4 3 3 3
Assessments:
Teacher Assessment:
One End Semester Examination (ESE) having 100% weights respectively.
Assessment Marks
ESE 100
ESE: Assessment is based on 100% course content
Course Contents:
Unit 1:- Constitution – Structure and Principles (03) Hrs
1.1: Meaning and importance of Constitution 1.2: Making of Indian Constitution – Sources
1.3: Salient features of Indian Constitution
Unit 2:- Fundamental Rights and Directive Principles (10) Hrs
2.1: Fundamental Rights & Fundamental Duties 2.2: Directive Principles of State Policy
Unit 3:- Union Government & Executive (04) Hrs
3.1: President of India – Qualification, Powers and Impeachment 3.2: Lok Sabha & Rajya
Sabha Sabha- Composition, Powers & Functions, Scope to amendment in Constitution
Unit 4:- State Government & Executive (03) Hrs
4.1: Governor – Qualification, Appointment, Powers & Functions 4.2: Legislative
Assembly & Legislative Council – Composition, Powers & Functions
Unit 5:- The Judiciary (03) Hrs
5.1: Features of Judicial System in India 5.2: Hierarchy of Courts, Composition and
Jurisdiction
Unit 6:- Local Self Government and other constitutional Organizations (03) Hrs
6.1: 73rd and 74th Constitutional Amendments 6.2: Public Service Commission, Election
Commission, CAG, National Commissions for SC, ST etc.
Textbooks:
1. M.P. Jain, Indian Constitutional Law
2. M.P. Singh (ed.),V.N. Shukla, Constitutional Law of India
3. D.D. Basu, Commentary on the Constitution of India
4. S.S. Desai, Constitutional Law--I & II
References:
1. Durga Das Basu, Introduction to the Constitution of India, Gurgaon; LexisNexis, 2018 (23rd edn.)
2. J.N. Pandey, The Constitutional Law of India, Allahabad; Central Law Agency, 2018 (55th edn.)
3. Shripad Shridhar Desai, Constitutional Law--I, S.S. Law Publication, 2021
4. Shripad Shridhar Desai, Constitutional Law --II, S.S. Law Publication, 2021
5. Constitution of India (Full Text), India.gov.in., National Portal of India,
https://www.india.gov.in/sites/upload_files/npi/files/coi_part_full.pdf
6. Durga Das Basu, Bharatada Samvidhana Parichaya, Gurgaon; LexisNexis Butterworths Wadhwa, 2015
Course Code: UDSEM0306 L T P Credit
Course Name: Principles of AIDS 2 2

Course Prerequisites:
Basic Programming Concepts
Course Description:
This course provides a comprehensive introduction to Artificial Intelligence (AI) and Data
Science. It covers fundamental AI concepts, including intelligent agents, problem-solving
techniques, and search strategies. The course also introduces the basics of data science,
exploring its importance, tools, skills, and data handling techniques. By the end of the
course, students will be equipped with the foundational knowledge to apply AI and data
science in practical scenarios.
Course Outcomes: After the completion of the course the student will be able to
CO1 Understand the core concepts of artificial intelligence and applications.
Understand the various aspects of data science and the skill sets necessary for a data
CO2
scientist.
CO-PO Mapping:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 2 2 1 1 3 2
CO2 3 2 2 2 3 1 3 2

Assessment Scheme:
SN Assessment Weightage Remark
1 In Semester Evaluation 1 (ISE1) 10% Assignment, Test, Quiz, etc.
2 Mid Semester Examination (MSE) 30% 50% of course contents
3 In Semester Evaluation 2 (ISE2) 10% Assignment, Test, Quiz, etc.
4 End Semester Examination (ESE) 50% 100% course contents

Course Contents:
UNIT-I Introduction to Artificial Intelligence and Problem-Solving 7 Hours
Agent
Introduction to AI, Intelligent Agents, Agents & environment, nature of the environment,structure
of agents, goal-based agents, utility-based agents, learning agents. Defining the problem asstate
space search, production system, problem characteristics, and issues in the design of
searchprograms.

UNIT-II Search Techniques 7 Hours

Problem solving agents, searching for solutions; uniform search strategies: breadth first search,
depth first search, depth limited search, bidirectional search, comparing uniform search strategies.
Heuristic search strategies Greedy best -first search, A* search, AO* search, memory bounded
heuristic search: local search algorithms & optimization problems: Hill climbing search, simulated
annealing search, local beam search.

UNIT-III Knowledge & Reasoning 7 Hours

Statistical Reasoning: Probability and Bays’ Theorem, Certainty Factors and Rule-Base Systems,
Bayesian Networks, Dempster-Shafer Theory, Fuzzy Logic. AI for knowledge representation, rule-
based knowledge representation, procedural and declarative knowledge, Logic programming,
Forward and backward reasoning.
UNIT-IV Basics Of Data Science 7 Hours
Importance of Data Science, Data Science relation to other fields, Data Science and Information
Science, Computational Thinking, Skills and tools needed to do Data Science, Storing data,
Combining bytes into larger structures, Creating datasets, Identifying data problems,
Understanding data sources, Exploring data models

Text Books:
1. S. Russell and P. Norvig, “Artificial Intelligence: A Modern Approach”, Prentice Hall,
Third Edition, 2015.
2. Nils J. Nilsson, “Artificial Intelligence: A New Synthesis”, 1st Edition, Morgan-
Kaufmann, 1998.
3. Jeffrey S. Saltz, Jeffrey M. Stanton, 2018, An Introduction to Data Science, SAGE
Publications

Reference Books:
1. Elaine Rich, Kevin Knight, & Shivashankar B Nair, “Artificial Intelligence”, McGraw Hill, 3rd
ed.,2017.
2. Patterson, “Introduction to Artificial Intelligence & Expert Systems”, Pearson, 1st ed. 2015.
3. Saroj Kaushik, “Logic &Prolog Programming”, New Age International, Ist edition, 2002.
4. Chirag Shah, 2020, A Hands-On Introduction to Data Science, Cambridge University Press.
Course Code: UDSPC0331 L T P Credit
Course Name: Advanced Data Structures Laboratory - - 2 1

Course Prerequisites:
C programming, Python Programming, Linear Data structure

Course Description:
This course covers Introduction to implementation of Linear Data structure, Linked List and its applications. It implements
non-Linear data structures Viz. Tress and Graphs in depth. This course also implements sorting techniques
and Hashing

Course Outcomes: After the completion of the course the student will be able to -
CO1 Construct a C Code for implementation of various linear and non-linear data structures.
CO2 Apply linear and non-linear data structures to solve certain real life problems.
CO3 Implement various sorting methods, Hashing and collision resolution techniques.

CO-PO Mapping:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 2 2 1 2 2 1 3
CO2 2 2 2 2 2 3 3
CO3 1 2 2 3 2 3 2

Assessment Scheme:
SN Assessment Weightage Remark
1 ISE 1 30% Lab Performance, Quiz, Programming Test
2 ISE2 20% Oral Examination
3 POE 50% External Practical Oral Examination

Course Contents:
EXPERIMENT NO. 1 2 Hours
Recursion (Tower Of Hanoi)

EXPERIMENT NO. 2 2 Hours

Implementation of Stack using array and Linked List

EXPERIMENT NO. 3 2 Hours

Implementation of Queue using array and Linked List

EXPERIMENT NO. 4 2 Hours

Implementation of Linear, Circular, Double Linked list

EXPERIMENT NO. 5 2 Hours

Application of Linked List

EXPERIMENT NO. 6 2 Hours

Implementation of Binary Search Tree
EXPERIMENT NO. 7 2 Hours
Implementation of AVL Tree,RB Tree

EXPERIMENT NO. 8 2 Hours

Implementation of BFS and DFS

EXPERIMENT NO. 9 2 Hours

Implementation of all Shortest Path Algorithm Dijkstra , Floyd Warshall

EXPERIMENT NO. 10 2 Hours

Implementation of Heap sort

EXPERIMENT NO. 11 2 Hours

Implementation of Various Collision Resolution Techniques

Text Books:
1. Data Structure using C- A. M. Tanenbaum, Y. Langsam, M. J. Augenstein (PHI)
2. Data Structures- A Pseudo code Approach with C – Richard F. Gilberg and Behrouz A. Forouzon, Cengage Learning,
Second Edition.
3. Schaum’s Outlines Data Structures – Seymour Lipschutz (MGH), Tata McGraw-Hill.

Reference Books:
1. Fundamentals of Data Structures – Horowitz, Sahni CBS India
2. An introduction to data structures with Applications- Jean-Paul Tremblay, Paul. G. Soresan, Tata McGraw Hill
International Editions, Second Edition.
Course Code: UDSPC0332 L T P Credit
Course Name: Database Management System Laboratory - - 2 1
Course Prerequisites:
Basic Computer Skills, Programming skills, Mathematics skills, Data Structures, Computer Science
Fundamentals, Database Concepts.

Course Description:
Upon completion, student should be able to write programs for database design and execute SQL queries

Course Outcomes: After the completion of the course the student will be able to
CO1 Design conceptual models of a database using ER modelling
CO2 Apply normalization techniques for database design.
CO3 Develop relational models for the real time applications and apply SQL queries for the same

CO-PO Mapping:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 1 2 2
CO2 1 2 2
CO3 3 2
Assessment Scheme:
SN Assessment Weightage Remark
Quiz/ Mini-Project / Presentation/ Group
1 In Semester Evaluation (ISE) 100%
Discussion/□Internal Oral
Assessment is based on practical-oral
2 End Semester Examination (POE/OE) 100%
examination
Course Contents:
Experiment No. 1 2 Hours
Draw ER diagram for your application use case using any suitable software & convert it into table.

Experiment No. 2 2 Hours

Consider your application database ER Diagram and create tables, Primary key and Foreign keys for tables.

Experiment No. 3 2 Hours

Consider your application database and create views, indexes for your application schema. Perform testing of
views.

Experiment No. 4 2 Hours

Consider your application database with 10 tables. Apply step by step normalization and understand how
manipulation of rows and column data
 Experiment No. 5 2 Hours
Consider your application database, use thick client and thin client tools to perform create, add, update, delete,
drop operation for your application schema.

Experiment No. 6 2 Hours

Write a program to implement any concurrency control protocol.

Experiment No. 7 2 Hours

Write a PL/SQL program to demonstrate Functions.

Experiment No. 8 2 Hours

Perform installation of NoSQL database and explore the tools and commands available with database

Experiment No. 9 2 Hours

Design a simple NoSQL database e. g. MongoDB (Installation, Basic CRUD operations, Execution).

Experiment No. 10 2 Hours

Design a NoSQL database for your application database. Create ER Diagram with keys, indexes, views,
functions. Use any thick client or thin client tool to create Application Schema, Tables, Views, Triggers and
functions.

Text Books:

1. Fundamentals of Database Systems – by Ramez Elmasri and Shamkant Navathe Publisher -Pearson Education,
5th Edition.
2. Database Systems: Design, Implementation and Management. - PeterRof, Carlos Coronel (7th Edition),
Cengage Learning

Reference Books:

1. Database System Concept by Henry F. Korth, Abraham Silberschatz, Sudarshan (McGraw Hill Inc.) Sixth
Edition.
2. Database Systems- A practical approach to Design, Implementation and Management by Thomos Connolly,
Carolyn Begg, 3rd Edition, Pearson Education.
Course UDSPC0333
L T P Credit
Code:
Course Software System Tools Laboratory
- - 2 1
Name:
Course Prerequisites:
Basic Computer Skills

Course Description:
In Software Systems students will learn necessary tools and techniques required for report writing and
project management. This course will empower students with knowledge and practices that will
help student in versioning projects, testing authenticity of work, generating reports and developing build
for deployment of project.

Course Outcomes: After the completion of the course the student will be able to
CO Apply report writing tools and plagiarism testing tools for checking research work for
1 genuine and authenticity
CO Utilize Smart Tools & Technologies in Industry 4.0 project management tools to track
2 and manage progress of project.
CO
Describe the processes in product design & development tools like Watson Deep Learning
3

CO-PO Mapping:
PO PO PO PO PO PO PO PO PO PO PO PO PS PSO
1 2 3 4 5 6 7 8 9 10 11 12 O1 2
CO1
2 2 3 3 2 3 3 2 3 3

CO2
2 2 3 3 3 1 1 3 2 3 3

CO3
3 3 3 3 3 1 1 3 2 3 3

Assessment Scheme:
Weightag
SN Assessment Remark
e
Quiz/ Mini-Project / Presentation/
1 In Semester Evaluation (ISE) 100%
Group Discussion/ Internal Oral
Assessment is based on practical-oral
2 End Semester Examination (POE/OE) 100%
examination
Course Contents:
Experiment No. 1 LaTeX Document Formatting and Graphics Insertion 2 Hours
Create a technical report, resume, PPT using LaTeX, including sections, figures, and tables.

Experiment No. 2 Language Checking and Plagiarism Detection 2 Hours

Design review research paper using latex check the plagiarism and use Language Checking tools

Experiment No. 3 Agile Project Management with JIRA 2 Hours

Create user stories, plan sprints, and track progress using JIRA boards.

Experiment No. 4 Build management system. 2 Hours

To Installation Build tools understand the basics of Maven as a build management system.
Understand the concepts of building, installing, and configuring software.
Experiment No. 5 Git and GitHub 2 Hours
Version Control and Collaboration: Leveraging GitHub for Team-Based Development Projects

Experiment No. 6 Ideas Boards 2 Hours

Explore tools for Project Planning and Management

Experiment No. 7 Weka 2 Hours

Exploring Machine Learning with Weka: Hands-On Data Analysis and Modelling

Experiment No. 8 Introduction to Data Platform Tools 2 Hours

Explore tools like Canva for data visualization and analysis.

Experiment No. 9 UI-UX Designing 2 Hours

User Experience Design: Prototyping Wireframes using Figma and Creating Idea Boards

Experiment No. 10 Creating UML Diagrams with StarUML and 2 Hours

Rational Rose
Create UML diagrams (e.g., class diagrams, sequence diagrams) using StarUML and Rational Rose.

Experiment No. 11 Watson Deep Learning Exploration 2 Hours

Create the IBM Watson's deep learning tools to train a neural network on a sample dataset and
analyze the results.

Text Books:
1. LaTeX: A Document Preparation System (2nd Edition)by Leslie Lamport
2. Learning Agile by Andrew Stellman & Jennifer Greene
3. Learning Python: Powerful Object-Oriented Programming 4th Edition by Mark Lutz
4. R for Data Science: Import, Tidy, Transform, Visualize, and Model Data 1st Edition by Hadley
Wickham, Garrett Grolemund
5. Smart Product Design, Sendpoints Publications, 2017

Reference Books:
1. Git online documentation. https://git-scm.com/docs/git-help
2. Pyplot online documentation https://matplotlib.org/api/pyplot_api.html.
Course Code: UDSIL0371 L T P Credit
Course Name: Mini Project-I - - 2 1

Course Prerequisites:
Knowledge of Project Based Learning (PBL) concepts.

Course Description:
In this mini project, the students will apply Project Based Learning to a multi-course environment for solving different
real-world problems. The students shall use the concepts they have learned in their S.Y. B.Tech Program (SEM-III) & the
courses they are learning in the current semester i.e. SEM-IV. Students will develop a solution to an identified problem.

Course Outcomes: Student should be able to

CO1 Identify real world problems which can be solved using CS concepts and technologies.
CO2 Describe the the proposed solution to the real world problem using technical report.
CO3 Implement the proposed solution using Computer Science & Engineering techniques.
CO4 Build detailed project report.

CO-PO Mapping:
CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 2 1 1 1 3 2 2 3 3 3
CO2 2 2 3 3 1 2 3 2 3 3 3 3
CO3 2 2 3 3 1 2 3 2 3 3 3 3
CO4 2 1 1 3 1 2 3 3 3 3 3 3

Assessment Scheme:
SN Assessment Weightage Remarks
1 ISE 1 50% In Semester Evaluation based on Progress of the project
4 ISE 2 50% In Semester Evaluation based on Progress of the project

Course Contents:
Guidelines for Mini Project -I

1 The primary objective of the mini project-I is to achieve multi course project based learning.
2 Course Instructor shall form the project team of 3 to 4 students in the batch of students
Each team shall use the knowledge they learned in the SY B.Tech courses to identify the real world problem which can
3 be solved using technology
The solution shall be using the tools & techniques from multiple courses - e.g a solution shall be using data structures,
4 networking algorithm, Web Technology to develop mini project
As students have undertaken Fundamentals of Web - its recommended to develop user interface using HTML
5
6 The evaluation shall be done in two phases
Phase 1 ISE-1 In ISE 1 the students shall be graded based on the skills demonstrated to identify the problem
statement, define the problem statement & Designing its solution. The partial working model is
expected to be completed.
Phase 2 ISE-2 In ISE 2 the students shall be graded based on the complete project implementation and its working.
Followed by the detailed project report which shall cover the technical aspects of the project.
7 Its recommended to share a common project report format to all batches.
8 All course instructors shall coordinate and work towards common evaluation process.
 Kolhapur Institute of Technology’s
College of Engineering (Autonomous), Kolhapur

Department of _ CSE (Data Science) Curriculum and

Syllabus for
B. Tech. CSE (Data Science) Scheme: 2024-25 (As Per NEP)

Multi-Disciplinary Minor Courses

Sr. Course Code Course Name L T P Hrs. / Week Credits
No.
- -
1 UDSMM0341 Basics of Biomedical Engineering 2 2 2
(MM-I)
- -
2 UDSMM0342 Fundamentals of Finance for 2 2 2
Engineering (MM-I)
- -
3 UDSMM0343 Digital Electronics (MM-I) 2 2 2
Course Code: UDSMM0341 L T P Credit
Course Name: Basics of Biomedical Engineering 2 - - 2

Course Prerequsites:
Mathematics, Programming, Basic concepts in biology and physiology.

Course Description:
This course introduces students to the fundamental principles and applications of biomedical engineering.
Students will gain an understanding of human anatomy and physiology, biomedical instrumentation, medical
imaging techniques, and data analysis methods. Emphasis will be placed on the interdisciplinary nature of
biomedical engineering and its role in developing innovative solutions for healthcare challenges.

Course Outcomes: After the completion of the course the student will be able to -
CO1 Explain the concepts and principles of Understanding of Biomedical Engineering.
CO2 Develop skills in implementing and applying Biomedical Engineering Techniques.
CO3 Outline the strengths, limitations, and applications of Biomedical Engineering.

CO-PO Mapping:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 2 3 0 0 1 0 1 0 0
CO2 2 1 2 1 1 0 1 2 2
CO3 1 3 0 2 1 0 3 2 2

Assessment Scheme:
SN Assessment Weightage Remark
1 In Semester Evaluation 1 (ISE1) 10% Assignment, Test, Quiz, Seminar, Presentation, etc.
2 Mid Semester Examination (MSE) 30% 50% of course contents
3 In Semester Evaluation 2 (ISE2) 10% Assignment, Test, Quiz, Seminar, Presentation, etc.
4 End Semester Examination (ESE) 50% 100% course contents

Course Contents:
UNIT 1 Introduction to Biomedical Engineering 8 Hours
Definition and Scope of Biomedical Engineering,Historical Development and Evolution of the Field, Importance
and Applications of Biomedical Engineering in Healthcare, Ethical and Regulatory Considerations in Biomedical
Engineering.

UNIT 2 Anatomy and Physiology Fundamentals 8 Hours

Basic Human Anatomy and Physiology, Overview of Organ Systems: Cardiovascular, Respiratory, Nervous, etc.
Biomechanics and Biomaterials in Biomedical Engineering, Introduction to Medical Imaging Techniques
UNIT 3 Biomedical Instrumentation and Devices 8 Hours
Principles of Biomedical Instrumentation, Measurement Techniques in Biomedical Engineering, Types of
Biomedical Devices: Diagnostic, Therapeutic, Monitoring, etc., Design and Development of Biomedical Devices

UNIT 4 DatatoAnalysis
Introduction and AIininBiomedical
Data Analysis BiomedicalEngineering,
EngineeringStatistical Methods for Biomedical Data Analysis,
8 Hours
Applications of Artificial Intelligence and Machine Learning in Biomedical Engineering, Case Studies and Examples
of AI Applications in Healthcare.

Text Books:
1. "Introduction to Biomedical Engineering" by John Enderle, Susan Blanchard, and Joseph Bronzino

Reference Books:
1. "Biomedical Engineering: Bridging Medicine and Technology" by W. Mark
2. "Fundamentals of Biomedical Engineering" edited by G. K. Viswanath
3. "Biomedical Instrumentation and Measurements" by Leslie Cromwell, Fred J. Weibell, and Erich A. Pfeiffer
4. "Medical Imaging Signals and Systems" by Jerry L. Prince and Jonathan Links
5. "Biomechanics: Concepts and Applications" by Gordon R. Oatis
Course Code: UDSMM0342 L T P Credit

Course Name: Fundamental of Finance for Engineers 2 - - 2

Course Prerequsites:
Basic understanding of arithmetic and mathematics, Familiarity with business terminology
Course Description:
Gain a comprehensive understanding of accounting principles and financial statements, Interpret key financial
metrics such as gross and net profit, return on investment (ROI), and understand the impact of factors like
dividends, depreciation, taxes, and reserves on financial performance.

Course Outcomes: After the completion of the course the student will be able to:
CO1 Interpret the basic concepts in finance domain.
CO2 Explain the financial performance metrices.
Interpret the financial terms related to startups, project management, personal finance and investment
CO3
management.

CO-PO Mapping:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 1 0 0 0 3 0 0 0 0 0 0 2 0 0
CO2 1 0 0 0 3 0 0 0 0 0 0 2 0 0
CO3 1 0 0 0 3 0 0 0 0 0 1 2 0 0

Assessment Scheme:
SN Assessment Weightage Remark
4 End Semester Examination (ESE) 100% 100% course contents

Course Contents:
UNIT 1 Accounting Foundations and Financial Statements Analysis 6 Hours
Understanding types of accounts-Basic Accounting Process-Overview of Assets, Liabilities and Net worth
- Depreciation-Introduction to Cash Flow Statements-Basic Understanding of Balance Sheet and Profit & Loss
Account with Simple Examples.B32Financial Performance Metrics and Cost Management

UNIT 2 Financial Performance Metrics and Cost Management 8 Hours

Conceptual Understanding of Revenue and Capital Expenditure- Explaining Gross & Net Profit-Basic ratio analysis
Overview of Dividends and Taxes-Sources of Finance of a Business
UNIT 3 Financing for Startups and Project Management 8 Hours

Introduction to Government Schemes for Startups-Sources of Funding a Startup-Overview of Project Budgeting

and Expenditure Management- Importance of Cost Tracking in Project Execution-Pitch presentation

UNIT 4 Personal Finance and Investment Management 6 Hours

Introduction to Personal Financial Planning-Key Savings and Investment Options: Debt vs. Equity-Basics of
Mutual Funds and their Benefits-Brief Introduction to the Stock Market-Overview of Government and Private
Agencies for Financial Assistance

Text Books:
Financial Accounting" by Jerry J. Weygandt, Paul D. Kimmel, and Donald E. Kieso
"The Total Money Makeover: A Proven Plan for Financial Fitness" by Dave Ramsey
"Financial Management: Theory & Practice" by Eugene F. Brigham and Michael C. Ehrhardt

Reference Books:

Learn finance for non Finanace- https://www.udemy.com/course/finance-for-non-financials-make-profitable-

decisions/?couponCode=NVDPRODIN35
Course Code: UDSMM0343 L T P Credit
Course Name: Digital Electronics 2 - - 2

Course Prerequsites:
Basic knowledge of numbering system and logic gates.
Course Description:
It is a core and fundamental subject. The course focuses on basic skills in method of design.
and analysis of digital system like counters, registers,FSM etc

Course Outcomes: After the completion of the course the student will be able to -
CO1 Apply Boolean laws/K-Map-method to reduce a given Boolean function.
CO2 Design & realize combinational logic circuits using logic gates.
CO3 Demonstrate the operation of flip-flops, counters and shift registers.

CO-PO Mapping:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 1 2 0 0 0 0 0 0 0 0 0 0 1
CO2 2 2 2 0 0 0 0 0 0 0 0 0 1 2
CO3 2 0 1 2 0 0 0 0 0 0 0 0 2 2

Assessment Scheme:
SN Assessment Weightage Remark
1 End Semester Examination (ESE) 100% 100% course contents

Course Contents:
UNIT 1 Logic Simplification 4 Hours
Boolean expression & representation using logic gates, Boolean optimization, K-map optimization

UNIT 2 Combinational Logic Circuits 8 Hours

Adder, Subtractor, code converters (binary to gray & gray to binary, BCD to Excess 3 and vice versa, BCD to 7
segment display), Multiplexer and Demultiplexer, encoder, priority encoder, decoder, adder with look ahead
carry generator
UNIT 3 Sequential Logic Circuits 8 Hours
1 Bit Memory Cell Flip-flop & Timing Circuits: SR latch, Gated latch, Edge triggered flip-plop:- D, JK, T Flip-flop,
flip flop asynchronous inputs ,characteristic table of Flip-flop,

UNIT 4 Applications Sequential Logic Circuits 8 Hours

Shit resistor,r SISO, SIPO, PISO, PIPO,universal shift resistor. Counter,up-down counter, Mod-n counter,
synchronous counter, Ring counter

UNIT 5 Logic Families 6 Hours

Characteristic of Digital ICs, Transistor – Transistor Logic, Complementary MOS (CMOS) Logic, Comparison of TTL
and CMOS families. Memory Devices: ROM, PROM, EPROM, EEPROM, RAM, SRAM, DRAM.

Text Books:
1. Anand Kumar ‗Fundamentals of Digital Circuits‘--. PHI
2. M. Morris Mano ‗Digital Design‘-- (Third Edition),. PHI

Reference Books:

1] Willim I. Fletcher.‘An Engineering Approach to Digital Design‘—PHI/ Pearson

2] NormanBalabanianBradle Carlson. ‗Digital Logic Design Principals,.‘ Wiley Publication.
3] Rajkamal ‗Digital Systems Principals and Design‘—Pearson
4] A.P. Malvino, D.P. Leach ‗Digital Principles &Applications‘ -VIth Edition-Tata McGraw
Hill, Publication.5] R.P. Jain-‗Modern Digital Electronics‘ IIIrd Edition- Tata McGraw Hill,
Publication
 SEMESTER IV
Sr. Hrs/ Evaluation Scheme
Category Course Code Course Name L T P Credits
No. Week (Components)
ISE1 10
MSE 30
1 PC UDSPC0401 Computer Networks 2 - - 2 2 40
ISE2 10
ESE 50 20
ISE1 10
MSE 30
2 PC UDSPC0402 Automata Theory 3 - - 3 3 40
ISE2 10
ESE 50 20
ISE1 10
Design And Analysis of MSE 30
3 PC UDSPC0403 3 - - 3 3 40
Algorithms ISE2 10
ESE 50 20
ISE1 10
Statistics and MSE 30
4 PC UDSPC0404 3 - - 3 3 40
Probability ISE2 10
ESE 50 20
ISE1 10
Object Oriented MSE 30
5 PC UDSPC0405 2 - - 2 2 40
Programming in Java ISE2 10
ESE 50 20

6 VEC UDSVE0406 Environmental Studies 2 - - 2 2 ISE 50 20 20

ISE 25 10
Object Oriented
7 PC UDSPC0431 - - 2 2 1 ESE
Programming Laboratory 25 10
(POE)
Data Analytics &
8 PC UDSPC0432 Visualization Tools - - 2 2 1 ISE 25 10
Laboratory

9 OJT UDSIL0471 Mini Project-II - - 2 2 1 ISE 25 10

ISE 25 10
10 VSEC UDSVS0433 AI DS Tools Laboratory - - 2 2 1 ESE
25 10
(POE)

11 CC UDSCC0434 Co-curricular Activities-II - - 2 2 1 ISE 50 20

12 MM UDSMM04** MM-2 3 - 3 3 ESE 100 40

Total Marks: 850

Total: 28 23
Total Credit: 23
Course Code: UDSPC0401 L T P Credit
Course Name: Computer Networks 2 2

Course Prerequsites:

Course Description:
This course provides a fundamental understanding of the networking concepts such as – communication medium,
topologies, protocols, networking models, addresses used in the networks. Students will get a sound
understanding of the working of the wired networks.

Course Outcomes: After the completion of the course the student will be able to -
CO1 Explain the fundamentals of computer networks
CO2 Interpret the working of layers of the networking models.
CO3 Describe the working of different application layer protocols.

CO-PO Mapping:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 1 1 1 1 1 1 1 3 1 2 1 1
CO2 1 1 2 1 1 1 1 1 1 1 1 1
CO3 1 1 2 1 1 1 1 1 1 1 1 1

Assessment Scheme:
SN Assessment Weightage Remark
1 In Semester Evaluation 1 (ISE1) 10% Assignment, Test, Quiz, Seminar, Presentation, etc.
2 Mid Semester Examination (MSE) 30% 50% of course contents
3 In Semester Evaluation 2 (ISE2) 10% Assignment, Test, Quiz, Seminar, Presentation, etc.
4 End Semester Examination (ESE) 50% 100% course contents

Course Contents:
UNIT 1 Introduction to Computer Networks 6 Hours
Components of Communication, Modes of Communication, Computer Networks Definition, Network Devices,
Classification of Computer Networks, Network Topologies, OSI and TCP/IP Model.

UNIT 2 Physical and Data Link Layer 8 Hours

Physical Layer – Guided and Unguided media, Errors in Transmission, Analog and Digital Signals, Encoding
Techniques, Line and Block encoding.
Data Link Layer – Error detection and correction techniques, Channel Access Methods - Aloha, CSMA, CSMA/CD,
CSMA/CA protocols.
UNIT 3 Network & Transport Layer 8 Hours

Network Layer-Introduction to IPv4 and IPv6, Subnet mask, Classful and classless addressing, Subnetting and
supernetting, Network layer Design Issues, Routing Algorithms, IP Header.
Transport Layer-Introduction to Transport Layer, Multiplexing and Demultiplexing, Connectionless and
Connection Oriented Services, Congestion Control Algorithms.

UNIT 4 Session, Presentation and Application Layer 6 Hours

Session Layer-Functionality, Protocols, Working.
Presentation Layer- Functionality, Protocols, Working.
Application Layer- Protocols-DNS, URL, WWW, SNMP, SMTP, IMAP, HTTP, FTP,Application based simulators

Text Books:
A.S. Tanenbaum, “Computer Networks”, 5th Edition, PHI 2010

Reference Books:

Behrouz A. Forouzan (2006), Data communication and Networking, 4th Edition, Mc Graw-Hill, India.
Course Code: UDSPC0402 L T P Credit
Course Name: Automata Theory 3 - - 3

Course Prerequisites:
Discrete Mathematics, Sets, Cartesian Product and Functions
Course Description:
The Automata Theory course introduce students to a core area of theoretical computer science such as formal
languages, Automata, recursion, and computability. Through the study of abstract computational models and formal
languages, students will develop a deep understanding of the principles that underlie the design and analysis of
algorithms and computational systems.

Course Outcomes: After the completion of the course the student will be able to -
CO1 Explain the formal languages theory and types with their acceptors.
Apply automata concepts to the problems in areas such as compiler design, formal verification, Natural
CO2
Language Processing and Artificial Intelligence.
CO3 Analyze computational problems to model them using formal language theory and automata.

CO-PO Mapping:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 - - - - - - - - - - 1 2 -
CO2 2 2 2 - - - - - - - 1 2 -
CO3 1 1 2 2 - - - - - - - 1 2 -

Assessment Scheme:
SN Assessment Weightage Remark
1 In Semester Evaluation 1 (ISE1) 10% Assignment, Test, Quiz, Seminar, Presentation, etc.
2 Mid Semester Examination (MSE 30% 50% of course contents
3 In Semester Evaluation 2 (ISE2) 10% Assignment, Test, Quiz, Seminar, Presentation, etc.
4 End Semester Examination (ESE) 50% 100% course contents

Course Contents:
UNIT 1 Mathematical Induction & Finite Automata 8 Hours
Mathematical Preliminaries with basic concepts of languages,The Principle of Mathematical Induction, Inductive
proofs, Recursive Definitions, Finite automata-definition and representation, Deterministic Finite Automata(DFA),
Non-deterministic Finite Automata(NFA), NFA with null transitions, Equivalence of FA’s , NFA’s and NFA’s with
null transitions.

UNIT 2 Regular languages and Regular Expressions 8 Hours

Regular expressions and corresponding regular languages, examples and applications, unions, intersection &
complements of regular languages,The Pumping Lemma for Regular Languages, minimizing number of states in
Finite Automata, Kleene’s Theorem: Part I & II statements and proofs.
UNIT 3 Context Free Grammars and Languages 10 Hours
Context-Free Grammars: Definitions and More Examples, Derivation and ambiguity, Simplified Forms - Eliminating
Null productions , Unit productions from CFG, Eliminating useless variables from a context Free Grammar.and
Normal Forms - BNF & CNF notations, Converting a CFG to CNF, Parsing: Top-Down, Recursive Descent and
Bottom-Up Parsing

UNIT 4 Pushdown Automata 5 Hours

Definitions and Examples, Deterministic Pushdown Automata & types of acceptance, Equivalence of CFG’s &
PDA’s

UNIT 5 Context-Free and Non-Context-Free Languages 5 Hours

The Pumping Lemma for Context-Free Languages examples, Intersections and Complements of
CFLs, intersections and complements, Union, Concatenation and *’s of CFLs,

UNIT 6 Turing Machines 10 Hours

Models of computation, definition of Turing Machine as Language acceptors, combining Turing Machines,
Computing a function with a TM, Non-deterministic TM and Universal TM, Recursively Enumerable Languages.

Text Books:
1. Introduction to languages & Theory of computations – John C. Martin (MGH) –Chapters 1, 2,3,4,5,6,7,8.
2. Discrete Mathematical Structures with applications to Computer Science—J. P. Trembley & Manohar (MGH)
Chapter 1

Reference Books:
1. Introduction to Automata Theory, Languages and computation – John E. Hopcraft , Rajeev Motwani , Jeffrey D.
Ullman (Pearson Edition).
2. Introduction to Theory of Computations – Michael Sipser (Thomson Brooks / Cole)
3. Theory Of Computation- Vivek Kulkarni, 1st edition OXFORD university Press
4.Theory Of Computation A problem Solving Approach Kavi Mahesh Wiley India
Title of the Course: Design and Analysis of Algorithms L T P Credits
Course Code: UDSPC0403 3 3
Course Pre-Requisite: Data Structures
Course Description: This course introduces fundamental concepts and key techniques for designing
and analyzing algorithms along with studying and applying different algorithm design methods namely,
greedy method, divide and conquer, dynamic programming and backtracking.
Course Learning Objectives:

1. To introduce to the students the methods of algorithm designs .

2. To expose students to various searching and sorting techniques.
3. To make students understand how to analyze algorithms.
4. To show how to tackle real life problems with the help of algorithm design.

Course Outcomes:

COs After the completion of the course the student will be Bloom’s Cognitive
able to level Descriptor
CO1 Explain basic concepts of algorithms and measure the efficiency 2 Understand
of algorithms.
CO2 Apply various algorithmic strategies such as divide and 3 Apply
conquer, greedy algorithms, dynamic programming,
backtracking to solve real life problems
CO3 Analyze performance efficiency of designed algorithm’s time 4 Analyze
and space complexity .

CO-PO Mapping:

CO P PO PO PO PO PO PO PO PO PO PO PO PS PS
O 2 3 4 5 6 7 8 9 10 11 12 O1 O2
1
CO1 3 2 1 2 1 1 2
CO2 1 2 3 3 1 2 3
CO3 1 3 3 3 1 2 3

Course Contents:
Unit 1:--- Introduction: 6 Hrs

What is algorithm, Algorithm Specification: Pseudocode Conventions, Recursive Algorithm,

Performance Analysis: Space Complexity, Time Complexity, Asymptotic Notations,
Practical Complexities, Performance Measurement Recurrences: The substitution method,
recursion tree method, Master Theorem

Unit 2:--- Algorithm Design and Analysis Techniques – I: 6 Hrs

Divide and Conquer-The general method, Binary search, Finding the maximum and
minimum, Merge sort, Quick sort,Shell sort and analysis of these algorithms.
 6 Hrs
Unit 3 :The Greedy method: The general method, Knapsack problem, Job sequencing
with deadlines, Optimal storage on tapes, Optimal merge patterns, Huffman codes.

Unit 4 : Algorithm Design and Analysis Techniques – II: 9 Hrs

Dynamic Programming & Backtracking : The general method, Multistage graphs,

Optimal binary search trees, 0/1 knapsack, Reliability design, Traveling Salesperson
problem.

Backtracking:

The general method, 8-queen problem, Sum of subsets, Graph Coloring, Knapsack Problem,
Branch & Bound Algorithms , Hamiltonian Cycle.

Unit 5:--- Graph Algorithms: Elementary Graph Algorithms:

8 Hrs
Representations of graphs , Breadth-first search, Depth first search, Strongly connected
components, Minimum Spanning Trees: Growing a minimum spanning tree, The
algorithms of Kruskal and Prim
Single-Source Shortest Paths: The Bellman-Ford algorithm, Single-source shortest paths
in directed acyclic graphs, Dijkstra’s algorithm, The Floyd-Warshall algorithm
Unit 6: Complexity classes :P & NP-Complete: 5 Hrs

Polynomial time, Polynomial-time verification, Decidability , NP completeness and

reducibility, NP-complete problems ,string matching algorithms, case studies

Text Books:

1. Thomas Cormen, Charles Leiserson, Ronald Rivest and Cliford Stein, “Introduction to
Algorithms”, PHI
2. Fundamentals of Computer Algorithms - Ellis Horowitz, Satraj Sahani, Saguthevar Rajasejaran,
Universities Press, Second Edition.

References:

1. Fundamentals of Algorithmics – Gilles Brassard, Paul Bratley (Pearson Education).

2. Mastering Algorithms with C – Kyle Loudon (SPD O’Reilly).
3. Computer Algorithms- Introduction to Design and Analysis – Sara Baase, Allen Van Gelder
(Pearson Education).
Title of the Course: Statistics and Probability L T P Credits
Course Code: UDSPC0404 3 - --- 3

Course Pre-Requisite: Basic terminologies on probability and exploratory data analysis

Course Description: This course contains study of probability distribution, test of significance,
regression analysis and analysis of variance.

Course Objectives:
1. To make familiar the prospective computer science engineers with techniques in data analysis
techniques, probability, probability distributions and test of significance.
2. To enable students to use statistical techniques learned for the analysis, modeling and solution of
realistic engineering problems.
3. To develop abstract, logical and critical thinking and the ability to reflect critically upon their work.
Course Outcomes:
COs After the completion of the course the student will be Bloom’s Cognitive
able to level Descriptor
CO1 Understand various concepts of data, statistical techniques, 2 Understandin
probability and test of significance. g
CO2 Solve problems on tendency of data and bivariate data using 3 Applying
statistical techniques.
CO3 Use knowledge of probability, probability distributions and 3 Applying
test of significance on biological experiments.
CO4 Apply the knowledge of probability distributions to the 4 Analyzing
given data and select the appropriate method for testing of
significance and analyze the variance.
CO-PO Mapping:
CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO PS PS
12 O1 O2
CO1 3 2 - 1 - - - - - - - 2 2 2
CO2 3 2 - 1 - - - - - - - 2 2
CO3 3 2 - 2 - - - - - - - 1 2 2
CO4 3 2 - 2 - - - - - - - 1 2
Assessment Scheme:
Two components of In Semester Evaluation (ISE), One Mid Semester Examination (MSE) and one End
Semester Examination (ESE) having 20%, 30% and 50% weightage respectively.

Assessment Marks
Component
ISE 1 10
MSE 30
ISE 2 10
ESE 50

ISE 1 and ISE 2 are based on Assignment / Declared test / Quiz / Seminar / Group discussions / presentation,
etc.
MSE is based on 50% of course content (first three units).
 ESE is based on 100% course content with 60-70% weightage for course content (last three units) covered
after MSE.

Course Contents:
Unit1:Probability 8
1.1Statistical Probability. Hrs
1.2 Conditional probability. .
1.3 Baye’s Theorem

Unit 2: Probability Distributions 7

2.1 RandomVariable, Probability mass function and Probability density function. Hrs
2.2 Discrete Distributions: Binomial, Poisson distribution and their properties. .
2.3 Continuous Distributions: Normal distribution and their properties.
Unit 3: Mathematical Expectations 6
3.1 Expectation of a Discrete and Continuous Function of a Single Random Hrs
Variable. .
3.2 Mean, Median, Quartiles, Mode, Variance, and Standard Deviation of a
Distribution.
3.3 Moment Generating Function.
Unit 4: Test of Significance - I 8
4.1 Parameter and Statistic. Hrs
4.2 Confidence Interval, p - value. .
4.3 Large sample tests:
4.3.1 Test of significance for single population mean.
4.3.2 Test of significance for equality of two population means.
4.4 Small sample tests:
4.4.1 t-test for single mean.
4.4.2 t-test for difference of mean.
4.4.3 Paired t-test for difference of mean.
Unit 5: Test of Significance - II 6
5.1 Chi – square distribution. Hrs
5.2 Test for single variance. .
5.3 Goodness of fit test.
5.4 Test for independence of attributes by Yates’s Correction.
Unit 6: Analysis of Variance 7
6.1 F- distribution. Hrs
6.2 Test by using F- Test .
6.3 Principles of experimental designs.
6.4 Analysis of variance (ANOVA) and its uses in the designs.
6.5 One Way Analysis of variance followed by t test (pair wise).
6.6 Two Way Analysis of variance followed by t test (pair wise).
Course Code: UDSPC0405 L T P Credit

Course Name: Object oriented programming in Java 2 - - 2

Course Prerequisites:
Basic Concepts of Programming

Course Description:

In this course students will be introduced to strict oop programming environment of Java programming
language. Students will learn advanced feature of Java, such as platform independent architecture, JVM, JIT
components

Course Outcomes: After the completion of the course the student will be able to-
CO1 Use knowledge of fundamental and oop concepts for programming.
CO2 Apply OOP concepts for program design
CO3 Develop programming solutions to given problem

CO-PO Mapping:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 2 1 2 2 1 1 2
CO2 1 1 2 2 2 1 3 2 2
CO3 1 1 2 2 2 1 2 2 3

Assessment Scheme:
SN Assessment Weightage Remark
1 InSemesterEvaluation1(ISE1) 10% Assignment ,Test ,Quiz ,Seminar ,Presentation,etc.
2 Mid Semester Examination(MSE) 30% 50%ofcoursecontents
3 InSemesterEvaluation2(ISE2) 10% Assignment,Test,Quiz,Seminar,Presentation,etc.
4 End Semester Examination(ESE) 50% 100%coursecontents

Course Contents:
UNIT1 Fundamental Programming in Java 7Hours
The Java Programming Environment- JVM, JIT Compiler, A Simple Java Program, , Data Types, Variables,
Operators, Strings, Input and Output, Control, Flow Declaring Classes, Declaring Member Variables, Defining
Methods, Constructor, Passing Information to a Method or a Constructor, Creating and using objects,
Controlling Access to Class Members, Static Fields and Methods, this keyword
UNIT2 Interface ,Inheritance and Packaging 6Hours

Interfaces: Defining an Interface, Implementing an Interface, Using an Interface as a Type, Evolving Interfaces,
and Default Methods. Inheritance: Definition, Super classes, and Subclasses, Overriding and Hiding Methods
Polymorphism, Inheritance Hierarchies, Super keyword, Final Classes and Methods, Abstract Classes and
Methods, casting, Design Hints for Inheritance, Nested classes & Inner Classes
Creating a Package, Naming a Package, Using Package Members, Managing Source and Class Files. Developing
and deploying (executable) Jar File.

UNIT3 Files IO & Exception Handling 6Hours

Exception: Definition, Dealing with Errors, The Classification of Exceptions, Declaring Checked Exceptions,
Throw an Exception, Creating Exception Classes, Catching Exceptions, Catching Multiple Exceptions, Re-
throwing and Chaining Exceptions,
I/OStreams:ByteStream–InputStream,OutputStream,DataInputStream,DataOutputStream,
File Input Stream, File Output Stream, Character Streams, Buffered Stream,Scanner,File,Random Access File.

UNIT4 Collection Framework 6Hours

Collections: Collection Interfaces,Concrete Collections-List,Queue,Set,Map,the Collections Framework.

Textbooks:

1.CoreJava-VolumeIFundamentals:CayHorstmannandGaryCornell,Pearson,Eightedition

Reference Books:

1] The Java Tutorials From ORACLE Java Documentation URL: http://docs.oracle.com/javase/tutorial/

2]JAVA-The Complete Reference: Herbert Schildt, Oracle Press, McGraw Hill,(9th Edition).
3]Thinking in Java by Bruce Eckel,Prentice Hall,(4thEdition)
Title of the Course: Environmental Studies L T P Credits
Course Code: UDSVE0406 2 - - 2

Course Pre-Requisite: Students shall have knowledge of:

• Basic Science (Physics and Chemistry)

Course Description: The objective of the course is imparting fundamental knowledge and awareness of
Environmental Studies among students and importance of conservation of environment.
Course Learning Objectives:

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

1. Study scope and importance of natural resources, ecosystems, biodiversity for creating awareness
and their conservation in multiple disciplines.
2. Learn various types of pollution, their impacts and control measures for minimizing pollution and
sustainable development.
3. Understand social issues related to environment, environmental ethics and human rights towards
environment.
4. Study various laws and regulations related to environment and its applicability in society and
industries
Course Outcomes:
COs After the completion of the course the student will be Bloom’s Cognitive
able to Level Descriptor
CO1 Summarize natural resources, importance of ecosystem and 2 Understanding
conservation of biodiversity with respect to multiple disciplines
CO2 Explain causes, effects, solutions for various pollution 2 Understanding
problems and its minimization strategies.
CO3 Interpret environmental ethics and their implementation for 2 Understanding
betterment of environment and human life.
CO4 Summarize the requirements of laws and regulations for 2 Understanding
environmental conservation and applicability of legislations in
society and industries.

CO-PO Mapping:

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2
CO2 3
CO3 2
CO4 2

CO PSO1 PSO2
CO1
CO2 1 1
CO3 1
CO4 1

Assessment Scheme:
ESE: Assessment is based on 100% course content
 Assessment Marks
Component
ISE 50
Course Contents:
Unit 1: Nature of Environmental Studies 4 Hrs.
Definition, scope and importance, Multidisciplinary nature of environmental studies, Need for
public awareness.
5 Hrs.
Unit 2: Natural Resources and Associated Problems

a) Forest resources: Use and over-exploitation, deforestation, dams and their effects on forests
and tribal people.

b) Water resources: Use and over-utilization of surface and ground water, floods, drought,
conflicts over water, dam’s benefits and problems.

c) Mineral resources: Usage and exploitation. Environmental effects of extracting and using
mineral resources.

d) Food resources: World food problem, changes caused by agriculture effect of modern
agriculture, fertilizer-pesticide problems.

e) Energy resources: Growing energy needs, renewable and nonrenewable energy resources, use
of alternate energy sources. Solar energy, Biomass energy, Nuclear energy.

f) Land resources: Solar energy, Biomass energy, Nuclear energy, Land as a resource, land
degradation, man induced landslides, soil erosion and desertification. Role of individuals in
conservation of natural resources.

Unit 3: Ecosystems 4 Hrs.

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, characteristics features, structure and function of the following ecosystem :-
a) Forest ecosystem, b) Grassland ecosystem, c) Desert ecosystem, d) Aquatic ecosystems
(ponds, streams, lakes, rivers, oceans, estuaries).
Unit 4:Biodiversity and its conservation 4 Hrs.

Introduction- Definition: genetic, species and ecosystem diversity.

Bio-geographical classification of India.
Value of biodiversity: consumptive use, productive use, social, ethical, aesthetic and option
values.
India as a mega- diversity nation, Western Ghat as a biodiversity region.
Hot-spot 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 5: Environmental Pollution 4 Hrs.

Definition: Causes, effects and control measures of: Air pollution, Water pollution, soil pollution,
Marine pollution, Noise pollution, Thermal pollution, Nuclear hazards. Solid waste Management:
Causes, effects and control measures of urban and industrial wastes. Role of an individual in
prevention of pollution.
Unit 6: Social Issues and the Environment
Disaster management: floods, earthquake, cyclone, tsunami and landslides. Urban problems
related to energy Water conservation, rain water harvesting, watershed management, Resettlement
and rehabilitation of people; its problems and concerns.

Environmental ethics: Issue and possible solutions. Global warming, acid rain, ozone layer
depletion, nuclear accidents and holocaust. Wasteland reclamation.

Consumerism and waste products.

Unit 7:Environmental Protection 5 Hrs.
From Unsustainable to Sustainable development.
Environmental Protection Act.
Air (Prevention and Control of Pollution) Act.
Water (Prevention and control of Pollution) Act.
Wildlife Protection Act.
Forest Conservation Act.
Population Growth and Human Health, Human Rights.

Textbooks:

1. Environmental Studies by Dr. P.D.Raut (Shivaji University, Kolhapur)

Reference Books:

1. Miller T.G. Jr., Environmental Science. Wadsworth Publications Co.(TB).

2. Odum, E.P.1971, Fundamentals of Ecology, W.B. Saunders Co. USA,574p
3. Trivedi R.K. Handbook of Environmental Laws, Rules, Guidelines, Compliances and Standards, vol. I and
II, Environmental Media (R)

Unit wise Learning Outcomes:

At the end of the course the students will be able to:
UO 1: Describe scope and importance of environmental studies.
UO 2: Describe types of natural resources, their use and conservation.
UO 3: Explain structure and functions of ecosystem, their types and importance.
UO 4: Discuss biodiversity, endangered species and methods of biodiversity conservation.
UO 5: Explain causes, effects and solutions to pollution problems.
UO 6: Discuss environmental ethics and various social issues related to environment.
UO 7: Discuss laws and regulations for conservation of environment.
Course Code: UDSPC0431 L T P Credit

Course Name: Object Oriented Programming in Java Laboratory 0 0 2 1

Course Prerequsites:
Knowledge of any Programming language basics

Course Description:
This course is designed to develop Java programming expertise. Upon completion, students should be able to
write programs in Java. Emphasis is on Class design, Implementation, File Handling, Exception Handling and
Collection Framework

Course Outcomes: After the completion of the course the student will be able to -
CO1 To expose the students to concepts of Object-Oriented Paradigm
CO2 To make students understand the use of Java for OOP implementation
CO3 Develop Java application by applying OOP concepts and Java Features

CO-PO Mapping:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 1 2 2 2 3 1 1 2 3 2
CO2 1 2 2 3 3 1 1 2 3 2
CO3 2 2 2 3 3 3 2 1 2 3 3

Assessment Scheme:
SN Assessment Weightage Remark
1 ISE 100% Lab assignments, Quiz, etc. (25 Marks)
2 ESE(OE) 100% (25 Marks)

Course Contents:
EXPERIMENT NO. 1 2 Hours
Develop Java Program for multiple number functions and operations

EXPERIMENT NO. 2 2 Hours

Develop Java Program to create Classes and Objects to perform methods on Object of Class

EXPERIMENT NO. 3 2 Hours

Develop Java Program to access and test the functions of various Java Keywords

EXPERIMENT NO. 4 2 Hours

Develop Java Program to demostrate use of Abstract Class and Abstract Methods

EXPERIMENT NO. 5 2 Hours

Develop Java Program to demostrate use and implementation of Java Inheritance
EXPERIMENT NO. 6 2 Hours
Develop Java Program to demostrate use and implementation of Java Inferfaces

EXPERIMENT NO. 7 2 Hours

Develop Java Program to implement Java Exception Handling Mechanism

EXPERIMENT NO. 8 2 Hours

Develop Java Program for various File Operations and methods

EXPERIMENT NO. 9 2 Hours

Develop Java Program to implement various Input and OutPut streams

EXPERIMENT NO. 10 2 Hours

Develop Java Program to Implement various Collection and Collection Methods

Text Books:
1. Core Java- Volume I Fundamentals: Cay Horstmann and Gary Cornell

Reference Books:
1] The Java Tutorials From ORACLE Java Documentation URL: http://docs.oracle.com/javase/tutorial/ (Refer For
All Units)
2] The Java Tutorial: A Short Course on the Basics by Raymond Gallardo, Scott Hommel, Sowmya Kannan,
Publisher: Addison-Wesley Professional. (6th Edition)
3] JAVA-The Complete Reference: Herbert Schildt, Oracle Press, Mcgraw Hill,(9th Edition).
4]Thinking in Java by Bruce Eckel, Prentice Hall,( 4th Edition)
Course Code: UDSPC0432 L T P Credit
Course Name: Data Analytics & Visualization Tools Laboratory - - 2 1

Course Prerequisites:
Linear Algebra, Statistical and Probability Theory

Course Description:

This course focuses on the practical implementation of various statistical methods in the first few practical
assignments. Later the focus is on learning the different visualization techniques using Python, R, and PowerBi.

Course Outcomes: After the completion of the course the student will be able to -
CO1 Illustrate the working of different statistical analysis methods.
CO2 Make use of different visualization libraries to visualize real life data.
CO3 Build dashboards on real life datasets using visualization tools such as PowerBI.

CO-PO Mapping:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 1 1 1 1 1 1 1
CO2 2 2 2 1 3 1 2 3 1 2 2 3
CO3 2 3 1 2 3 1 2 3 1 2 2 3 2

Assessment Scheme:
SN Assessment Weightage Remark
Quiz/ Mini-Project / Presentation/ Group Discussion/
1 In Semester Evaluation (ISE) 100%
Internal Oral (25 Marks)
End Semester Examination Assessment is based on practical-oral examination
2 100%
(OE) (25 Marks)

Course Contents:
EXPERIMENT NO. 1 Normal Distribution 2 Hours

a) Write a Python function generate_normal_data(mean, std_dev, size) that generates random numbers from a
normal distribution with a given mean, standard deviation, and size.
b) Write a Python function calculate_statistics(data) that calculates the mean, standard deviation, median,
minimum, and maximum of the given dataset.
c) Plot a histogram of the generated data to visualize its distribution.
d) Test your functions with different parameters and analyze the generated data statistically.

EXPERIMENT NO. 2 Poisson's Distribution 2 Hours

a) Write a Python function simulate_poisson_distribution(lambda_, size) that generates random numbers following
a Poisson distribution with parameter lambda_, for a given size.
b) Write a Python function calculate_statistics(data) that calculates the mean, standard deviation, median,
minimum, and maximum of the given dataset.
c) Plot a histogram of the generated data to visualize its distribution.
d) Test your functions with different parameters and analyze the generated data statistically.
EXPERIMENT NO. 3 Binomial Distribution 2 Hours
a) Write a Python function simulate_binomial_distribution(n, p, size) that generates random numbers following a
binomial distribution with parameters n (number of trials) and p (probability of success), for a given size.
b) Write a Python function calculate_statistics(data) that calculates the mean, standard deviation, median,
minimum, and maximum of the given dataset.
c) Plot a histogram of the generated data to visualize its distribution.
d) Test your functions with different parameters and analyze the generated data statistically.

EXPERIMENT NO. 4 Correlation & Its Coefficient 2 Hours

a) Write a Python function pearson_correlation(x, y) that calculates the Pearson correlation coefficient between two
lists of numerical data, x and y.
b) Write a Python function spearman_correlation(x, y) that calculates the Spearman correlation coefficient between
two lists of numerical data, x and y.

EXPERIMENT NO. 5 Hypothesis Testing using t-test 2 Hours

a) Write a Python function t_test(sample_data, population_mean, alpha) that performs a one-sample t-test on the
given sample_data with a null hypothesis that the population mean is equal to population_mean.
b) Implement the t-test formula to calculate the t-statistic and p-value.
c) Determine whether to reject the null hypothesis based on the calculated p-value and significance level alpha.
d) Print out the result of the hypothesis test along with the calculated t-statistic and p-value.
e) Test your function with sample data.

EXPERIMENT NO. 6 Testing using Chi square Hypothesis -test 2 Hours

a) Write a Python function chi-square_test(observed, expected) that performs a chi-square test on the given
observed frequencies observed and expected frequencies expected.
b) Implement the chi-square test formula to calculate the chi-square statistic and p-value.
c) Determine whether to reject the null hypothesis based on the calculated p-value and significance level.
d) Print out the result of the hypothesis test along with the calculated chi-square statistic and p-value.
e) Test your function with sample data.

EXPERIMENT NO. 7 Visualizations using Python Programming 2 Hours

Draw different visualizations such as – bar chart, histogram, pie chart, area chart, line chart, scatter plot, box plot
etc. Using Python programming.

EXPERIMENT NO. 8 Visualizations using R Programming 2 Hours

Draw different visualization such as – barchart, histogram, pie chart, area chart, line chart, scatter plot, box plot etc.
Using R programming.

EXPERIMENT NO. 9 PowerBI Dashboard 2 Hours

PowerBI charts. Include and Exclude. VIew Data and Export.

Given a dataset, create a dashboard using PowerBI tool.
EXPERIMENT NO. 10 PowerBI Dashboard 2 Hours
PowerBI- maps, matrics, tables, aggregating table, conditional formating, filter on visuals, hierarchies, totals and
subtotals, number formatting
Given a dataset, create a dashboard using PowerBI tool abd create a report and export it.

EXPERIMENT NO. 11 PowerBI Dashboard 2 Hours

PowerBI service, and Query

Given a dataset, create a dashboard using PowerBI tool.

EXPERIMENT NO. 12 PowerBI Dashboard 2 Hours

PowerBI DAX
Given a dataset, create a dashboard using PowerBI tool.

Text Books:
1. Data Science from Scratch, Joel Grus, Oreilly Publications.
2. Youtube channel (Edureka-PowerBi) - https://www.youtube.com/watch?v=hUacMEcLBKQ
3. Youtube channel (Pavan Lalwani-PowerBi) -
https://www.youtube.com/watch?v=H84UJn1CiWo&list=PL6Omre3duO-OGTAMuFuDOS8wMuuxmyaiX&index=1
4. Python for Data Visualization - A Beginner's Guide, Meta Brains, Packt Publishing
5. Beginning Data Science in R 4: Data Analysis, Visualization, and Modelling for the Data Scientist, Thomas Mailund,
Apress Publications.
6. Youtube channel (House of Concepts-PowerBi Complete DAX Course) -
https://www.youtube.com/watch?v=KmIdcQCcfzg

Reference Books:
Fundamentals of Mathematical statistics, S. C. Gupta and V. K. Kapoor, Sultan Chand and Sons,
Course Code: UDSIL0471 L T P Credit
Course Name: Mini Project-II - - 2 1

Course Prerequisites:
Knowledge of Project Based Learning (PBL) concepts.

Course Description:
In this mini project, the students will apply Project Based Learning to a multi-course environment for solving different
real-world problems. The students shall use the concepts they have learned in their S.Y. B.Tech Program (SEM-III) & the
courses they are learning in the current semester i.e. SEM-IV. Students will develop a solution to an identified problem.

Course Outcomes: Student should be able to

CO1 Identify real world problems which can be solved using CS concepts and technologies.
CO2 Describe the the proposed solution to the real world problem using technical report.
CO3 Implement the proposed solution using Computer Science & Engineering techniques.
CO4 Build detailed project report.

CO-PO Mapping:
CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 2 1 1 1 3 2 2 3 3 3
CO2 2 2 3 3 1 2 3 2 3 3 3 3
CO3 2 2 3 3 1 2 3 2 3 3 3 3
CO4 2 1 1 3 1 2 3 3 3 3 3 3

Assessment Scheme:
SN Assessment Weightage Remarks
1 ISE 1 50% In Semester Evaluation based on Progress of the project
4 ISE 2 50% In Semester Evaluation based on Progress of the project

Course Contents:
Guidelines for Mini Project -I

1 The primary objective of the mini project-I is to achieve multi course project based learning.
2 Course Instructor shall form the project team of 3 to 4 students in the batch of students
Each team shall use the knowledge they learned in the SY B.Tech courses to identify the real world problem which can
3 be solved using technology
The solution shall be using the tools & techniques from multiple courses - e.g a solution shall be using data structures,
4 networking algorithm, Web Technology to develop mini project
As students have undertaken Fundamentals of Web - its recommended to develop user interface using HTML
5
6 The evaluation shall be done in two phases
Phase 1 ISE-1 In ISE 1 the students shall be graded based on the skills demonstrated to identify the problem
statement, define the problem statement & Designing its solution. The partial working model is
expected to be completed.
Phase 2 ISE-2 In ISE 2 the students shall be graded based on the complete project implementation and its working.
Followed by the detailed project report which shall cover the technical aspects of the project.
7 Its recommended to share a common project report format to all batches.
8 All course instructors shall coordinate and work towards common evaluation process.
Course Code: UDSVS0433 L T P Credit
Course Name: AI & DS Tools Laboratory - - 2 1

Course Prerequsites:
Basic understanding of - Python Programming, R Programming

Course Description:

This course provides a comprehensive introduction to object-oriented programming (OOP) concepts using Python
programming and practical applications of NumPy and Pandas libraries for data manipulation and analysis. Via hands-
on exercises, students will learn the fundamentals of OOP, numpy and pandas.

Course Outcomes: After the completion of the course the student will be able to -
CO1 Understand the principles and concepts of object-oriented programming.
CO2 Make use of appropriate numpy functions to solve real world problems.
CO3 Make use of appropriate pandas functions to solve real world problems.

CO-PO Mapping:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 2 1 2 1 2 1 3 1 1 2 3
CO2 2 1 2 1 2 1 3 1 1 3 3
CO3 2 1 2 1 2 1 3 1 2 1 3 3

Assessment Scheme:
SN Assessment Weightage Remark
1 ISE 100% Lab assignments, Quiz, etc. (25 Marks)

Course Contents:
EXPERIMENT NO. 1 Object Oriented Python Programming-1 2 Hours

Assignment 1: Class and Object Basics

a. Create a class called Rectangle with attributes length and width.
b. Implement methods to calculate the area and perimeter of the rectangle.
c. Create instances of the Rectangle class and test the methods.
Assignment 2: Inheritance and Polymorphism
a. Define a base class Shape with a method area() and perimeter() and subclasses like Rectangle, Circle, etc.
b. Implement the area() and perimeter() methods for each subclass.
EXPERIMENT NO. 2 Object Oriented Python Programming-2 2 Hours

Assignment 1: Encapsulation and Access Control

a. Create a class BankAccount with private attributes like balance.
b. Implement methods to deposit, withdraw, and check balance, ensuring proper encapsulation.
c. Test the methods to ensure correct behavior and proper access control.
Assignment 2: Operator Overloading
a. Create a class Vector to represent a mathematical vector.
b. Implement methods to perform vector addition, subtraction, scalar multiplication, and dot product using
operator overloading.
c. Test the vector operations with different instances of the Vector class.

EXPERIMENT NO. 3 Object Oriented Python Programming-3 2 Hours

Assignment 1: Exception Handling

a. Write a program that takes two numbers as input from the user. Divide the first number by the second and
print the result. Implement exception handling to catch and handle a ZeroDivisionError and ValueError.
b. Write a program to read a file specified by the user. Implement exception handling for the following scenarios:
(i) File not found.
(ii) Insufficient permissions to read the file.

EXPERIMENT NO. 4 Object Oriented Python Programming-4 2 Hours

Assignment 1: Data Abstraction

a. Create an abstract class Shape with an abstract method area.
b. Create subclasses Circle and Rectangle that inherit from Shape.
c. Implement the area method in both subclasses.
d. Write a function that takes a list of shapes and prints the area of each shape.

EXPERIMENT NO. 5 Numpy Program-1 2 Hours

a. Write a program to perform basic matrix operations such as addition, subtraction, multiplication, and division
using NumPy arrays.
b. Implement functions to calculate the determinant, inverse, and transpose of a matrix.

EXPERIMENT NO. 6 Numpy Program-2 2 Hours

Generate random data using NumPy arrays and perform statistical analysis.
Calculate mean, median, mode, standard deviation, and variance of the data.
EXPERIMENT NO. 7 Numpy Program-3 2 Hours

a. Implement linear regression using NumPy to fit a line to a given set of data points.
b. Use gradient descent or normal equation methods to optimize the regression coefficients.
c. Visualize the fitted line along with the data points.

EXPERIMENT NO. 8 Pandas Program-1 2 Hours

Load a dataset (e.g., CSV or Excel file) using Pandas and perform data cleaning tasks such as handling missing values,
removing duplicates, and converting data types.

EXPERIMENT NO. 9 Pandas Program-2 2 Hours

Combine multiple datasets using Pandas' merge and join functions.
Perform inner, outer, left, or right joins based on common keys.
Handle duplicate keys and missing values appropriately.

EXPERIMENT NO. 10 Pandas Program-3 2 Hours

Aggregate data using Pandas' pivot_table function to create summary tables.
Calculate statistics for different groups and display results in a tabular format.
Customize pivot tables by specifying aggregation functions and row/column indices.

Text Books:
1] “Python for data analysis “, Oreilly Publications , Wes Mckinney
2] "Python Feature Engineering Cookbook" by Soledad Galli - Packt Publication.
3] "Object-Oriented Python", Oreilly Publications, Irv Kalb, No Starch Press Publication

Reference Books:
1] The Java Tutorial: A Short Course on the Basics by Raymond Gallardo, Scott Hommel, Sowmya Kannan, Publisher:
Addison-Wesley Professional. (6th Edition)
2] JAVA-The Complete Reference: Herbert Schildt, Oracle Press, Mcgraw Hill,(9th Edition).
3] Thinking in Java by Bruce Eckel, Prentice Hall,( 4th Edition)
 Kolhapur Institute of Technology’s
College of Engineering (Autonomous), Kolhapur

Department of _ CSE (Data Science) Curriculum and Syllabus for

B. Tech. CSE (Data Science) Scheme: 2024-25 (As Per NEP)

Multi-Disciplinary Minor Courses (MM-II)

Sr. Course Code Course Name L T P Hrs. / Week Credits

No.
1 UDSMM0441 Biostatistics and Algorithms (MM-II) 3 - - 3 3
Blockchain Technologies and FinTech (MM- - -
2 UDSMM0442 3 3 3
II)
3 Microprocessor and Microcontrollers - -
UDSMM0443 3 3 3
(MM-II)
Course Code: UDSMM0441 L T P Credit
Course Name: Biostatistics and Algorithms 3 - - 3

Course Prerequsites:
A basic foundation in linear algebra, discrete mathematics, probability and statistics, and data structures ML, DL.

Course Description:

The course is designed to provide students with a comprehensive understanding of the fundamental principles of
biostatistics and their applications in the field of public health.

Course Outcomes: After the completion of the course the student will be able to -
CO1 Understand the roles biostatistics serves in the discipline of public health.
Analyze among the different measurement scales and the implications for selection of statistical
methods.
CO2

CO3 Apply descriptive techniques commonly used to summarize public health data.

CO-PO Mapping:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 2 3 0 0 0 0 1 0 0
CO2 2 1 2 0 0 0 1 0 0
CO3 1 3 0 1 0 0 3 0 0

Assessment Scheme:
SN Assessment Weightage Remark
1 In Semester Evaluation 1 (ISE1) 10% Assignment, Test, Quiz, Seminar, Presentation, etc.
2 Mid Semester Examination (MSE) 30% 50% of course contents
3 In Semester Evaluation 2 (ISE2) 10% Assignment, Test, Quiz, Seminar, Presentation, etc.
4 End Semester Examination (ESE) 50% 100% course contents

Course Contents:
UNIT 1 Introduction 8 Hours
Overview of biostatistics and its applications in computer science and AI/ML,Basic concepts: data types, variables,
and measures of central tendency and dispersion,Probability distributions and their significance in analyzing
biological data,Introduction to hypothesis testing and its relevance in biological research.

UNIT 2 Statistical Methods and Algorithms for Biostatistics 8 Hours

Overview of statistical methods commonly used in AI/ML applications, Regression analysis: linear regression,
logistic regression, and their applications in predictive modeling, Analysis of variance (ANOVA) and its role in
comparing multiple groups or treatments, Basics of experimental design and its importance in designing AI/ML
experiments.
UNIT 3 Limitations and Misinterpretations of Biostatistics 6 Hours
The roles biostatistics serves in the discipline of public health, statistical analyses found in public health
studies,basic informatics techniques with vital statistics and public health records.

UNIT 4 6 Hours

Overview of public health programs with biostatistics principles and methodologies to collect, analyze use, and
present data, health related applications and contributions to biostatistics concepts.

UNIT 5 6 Hours

Case studies demonstrating the application of biostatistics and algorithms in AI/ML.

Reference Books:

1. Pandey M. (2015): Biostatistics-Basic and Advanced-MV Learning.

2.Larry Pace (2012), Beginning R: An Introduction to Statistical Programming, A
press.
3. Cinlar E. (1975).Introduction to Stochastic Process.Prentice Hall.
Course Code: UDSMM0442 L T P Credit

Course Name: Blockchain Technologies and FinTech 3 - - 3

Course Prerequsites:
Basic understanding of computer science and financial concepts.
Course Description:
Gain foundational knowledge of blockchain technology and cryptocurrency, enabling understanding of their
applications, limitations, and potential impact in various industries.

Course Outcomes:
CO1 Explain the fundamental concepts of Blockchain technology and cryptography.
CO2 Interpret the application of Blockchain Technology.
CO3 Summarize the limitations, opportunities, and challenges in Blockchain.

CO-PO Mapping:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 1 2 0 0 0 0 0 1 1 0 2 2 1 0
CO2 1 2 0 2 0 0 0 1 1 0 2 2 2 1
CO3 1 2 0 2 0 0 0 2 1 0 2 2 2 1

Assessment Scheme:
SN Assessment Weightage Remark
1 End Semester Examination (ESE) 100% 100% course contents

Course Contents:
UNIT 1 Introduction to Blockchain Technology 8 Hours
• Understanding the Need for Decentralized Ledger Systems
• Exploring Centralized vs. Decentralized Systems: Advantages and Disadvantages
• Security, Integrity, and Privacy Issues in Decentralized Systems
• Overview of Blockchain Technology and Its Trust Mechanisms

UNIT 2 Fundamentals of Cryptography in Blockchain 8 Hours

• Introduction to Public and Private Keys
• Basics of Digital Signatures and Hash Values
• Real-life Challenges and Applications of Cryptographic Elements
• Ensuring Privacy and Security in Blockchain Transactions
UNIT 3 Overview of Blockchain Platforms 8 Hours
• Classification of Blockchain Platforms: Perspectives and Major Platforms
• Introduction to Ethereum and Its Role in FinTech
• Understanding Trustlessness, Immutability, and Consensus Mechanisms
• Tokenization and Fundraising on Blockchain Platforms

UNIT 4 Applications of Blockchain Technology 8 Hours

• Selection Criteria for Blockchain Applications: Key Factors and Best Fit
• Blockchain in Enterprise: Coordination and Decision Making
• Use Cases: Blockchain in Trade Finance, Supply Chain Financing, and Cross-Border Connectivity
• Benefits of Permissioned Blockchains in Enterprise Networks

UNIT 5 Limitations, Opportunities, and Challenges of Blockchain 10 Hours

• Understanding the Limitations and Risks of Blockchain Technology
• Exploring Security Risks and Privacy Concerns
• Opportunities and Risks of Smart Contracts in Enterprise Applications
• Use Cases: Blockchain in Health Insurance, PropTech, Banking, and Healthcare Industries
• Institutional Investment Opportunities in the Digital Asset Space

Text Books:
"Mastering Blockchain: Unlocking the Power of Cryptocurrencies, Smart Contracts, and Decentralized
Applications" by Imran Bashir
BlockChain Technology :Algorithms and application by Asharaf S
Mastering Blockchain by Lorne Lantz, Daniel Cawrey

Reference Books:
"Blockchain: Blueprint for a New Economy" by Melanie Swan
Crypto Condensed: Complete Guide To Blockchain Technology
Udemy coursehttps://www.udemy.com/course/blockchain/?couponCode=NVDPRODIN35
Course Code: UDSMM0443 L T P Credit
Course Name: Microprocessor and Microcontroller 3 - - 3

Course Prerequsites:
Fundamentals of Digital Electronics
Course Description:
This syllabus covers the fundamental concepts, architectures, programming, interfacing, and applications of
microprocessors and microcontrollers, providing students with both theoretical knowledge and practical skills
essential for working in the field of embedded systems and related areas.

Course Outcomes: After the completion of the course the student will be able to -
CO1 Explain the fundamental concepts, architectures, and components of microprocessors and microcontrollers.
Develop programs microprocessors and microcontrollers using both assembly language and higher-
CO2
level languages such as C.
Design interfacing pf microprocessors and microcontrollers with various memory devices,
CO3
input/output peripherals.

CO-PO Mapping:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 2 0 0 0 0 0 0 0 0 0 0 0 3 2
CO2 2 2 2 1 3 0 0 0 0 0 0 0 3 3
CO3 2 2 2 1 3 0 0 0 0 0 0 0 3 2

Assessment Scheme:
SN Assessment Weightage Remark
1 End Semester Examination (ESE) 100% 100% course contents

Course Contents:
UNIT 1 Introduction to Microprocessors and Microcontrollers 6 Hours
Overview of microprocessors and microcontrollers,Evolution and history,Basic architecture and components

UNIT 2 8085 Microprocessor 8 Hours

Architecture and pin diagram,Instruction set and programming,Addressing modes, Interfacing with memory
and I/O devices
UNIT 3 8086 Microprocessor 8 Hours

Architecture and pin diagram ,Instruction set and programming (including assembly language),Memory
segmentation,Interfacing with memory and I/O devices

UNIT 4 PIC Microcontrollers 6 Hours

Introduction to PIC architecture,Programming in assembly and C.Peripheral interfacing

UNIT 5 Interfacing and Applications 8 Hours

Interfacing with sensors and actuators,Communication protocols (UART, SPI, I2C),Interrupts and
timers,,Applications in embedded systems, robotics, IoT, etc.

Text Books:
1. "Microprocessor Architecture, Programming, and Applications with the 8085" by Ramesh S. Gaonkar - This
book covers the architecture, programming, and applications of the 8085 microprocessor comprehensively.
2."PIC Microcontroller and Embedded Systems: Using Assembly and C for PIC18" by Muhammad Ali Mazidi,
Rolin D. McKinlay, and Danny Causey - This book provides a comprehensive introduction to PIC
microcontrollers, covering both assembly and C programming along with practical applications.

Reference Books:

1."The 8086 Microprocessor: Programming and Interfacing the PC" by Kenneth J. Ayala - This book focuses on
programming and interfacing the 8086 microprocessor, particularly in the context of personal computers.
2."Programming PIC Microcontrollers with XC8" by Armstrong Subero - This book focuses on programming PIC
microcontrollers using the XC8 compiler, providing practical examples and projects.