SHARNBASVA UNIVERSITY, KALABURAGI

Faculty of Engineering & Technology (Co-Ed)

Scheme of Teaching and Examination 2022-23
[As Per NEP, Outcome Based Education (OBE) and Choice Based Credit System (CBCS)
Scheme] (Effective from the academic year 2022-23)
Programme: B. Tech: Artificial Intelligence & Data Science
III SEMESTER
Teaching Examination

Teaching Dept.
Hours/week

(TD) Question
Paper Setting
Board (PSB)
Sl. Course Course Course Title

Total Marks

Credits
Practical
Tutorial

Durationin
No Category Code

Lecture
Theory

Hours

Marks
Marks

SEE
CIE
L T P
1 BS 22MATS31 Mathematics for Computer Science Mathematics
3 03 50 50 100 03
Engineering Stream-III
2 PCC 22AD32 Logic Design & Computer Organization AD/CSE/AIML
3 1 03 50 50 100 04
3 PCC 22AD33 Data Structures using C AD/CSE/AIML
3 03 50 50 100 03
4 PCC 22AD34 Fundamentals of Operating System AD/CSE/AIML
3 03 50 50 100 03
5 PCC 22AD35 Java Programming AD/CSE/AIML
3 03 50 50 100 03
6 PCC 22ADL36 Data Structures using C Lab AD/CSE/AIML
2 03 50 50 100 01
7 PCC 22ADL37 Fundamentals of Operating System Lab AD/CSE/AIML
2 03 50 50 100 01
8 PCC 22ADL38 Java Programming Lab AD/CSE/AIML
2 03 50 50 100 01
9 PW 22PRJ39 Project-III AD/CSE/AIML
2 03 50 50 100 01
10 HSS 22HSM310A Soft Skills and Personality Development Humanities
1 03 50 50 100 01
11 AEC 22AAD311X Ability Enhancement Course-III AD/CSE/AIML
2 03 50 50 100 01
Total 16 1 10 32 550 550 1100 22
BS: Basic Science, PCC: Programme Core Course, AEC: Ability Enhancement Course, HSS: Humanities and Social Science, PW: Project work, NCMC: Non-Credit
Mandatory Course

Page 1 of
 Project(PRJ): A Batch of 4 students (Same branch or different branches with a guide, may undertake one project.). Based on the ability /abilities of the student/s and
recommendations of the mentor, a single discipline or multidisciplinary mini project can be assigned to a group having not more than 4 students.
Ability Enhancement Course-III
Course code under 22AAD311X Course Title
22AAD311A Unix Shell Programming
22AAD311B Data Analytics with Excel
Courses prescribed to lateral entry Diploma holders admitted to III semester of Engineering
programs
12 NCMC 22MATDIP31 Additional Mathematics – I Mathematics 3 1 - 3 00 100 100 00
1) Non-Credit Mandatory Courses (NCMC) Additional Mathematics-I and II prescribed for III and IV semesters respectively, to the lateral entry Diploma
holders admitted to III semester of B. Tech. programs, shall attend the classes during the respective semesters to complete all the formalities of the course
and appear for the university examination. In case any student fails to register for the said course/fails to secure the minimum 50% of the prescribed CIE
marks, he/she shall be deemed to have secured F grade. In such a case, the students have to fulfill the requirements during subsequent semester/s to
appear for SEE.
2) These courses shall not be mandatory for vertical progression, but completion of the courses shall be mandatory for the award of degree.
AICTE Activity Points to be earned by students admitted to B.Tech. programme (For more details refer to Chapter 6, AICTE Activity Point
Programme, Model Internship Guidelines):
Over and above the academic grades, every regular student admitted to the 4 years degree programme and every student entering 4 years degree programme
through lateral entry, shall earn 100 and 75 activity points respectively for the award of degree through AICTE Activity Point Programme. Students
transferred from other universities to fifth semester are required to earn 50 activity points from the year of entry to Sharnbasva University. The activity
points earned shall be reflected on the students eighth semester grade card.
The activities can be spread over the years, anytime during the semester weekends holidays, as per the liking and convenience of the student fromthe year
of entry to the programme. However, minimum hours requirement should be fulfilled. Activity Points (non credit) have no effect on SGPA/CGPA and shall
not be considered for vertical progression.
In case students fail to earn the prescribed activity points, eighth semester grade card shall be issued only after earning the required activity points.
Student shall be admitted for the award of the degree only after the release of the eighth semester grade card.

Page 2 of
 SHARNBASVA UNIVERSITY, KALABURAGI
Faculty of Engineering & Technology (Co-Ed)
Scheme of Teaching and Examination 2022-23
[As Per NEP, Outcome Based Education (OBE) and Choice Based Credit System (CBCS)
Scheme] (Effective from the academic year 2022-23)
Programme: B. Tech: Artificial Intelligence & Data Science
IV SEMESTER
Teaching Examination
Hours/week

Teaching Dept.
(TD) Question
Paper Setting
Board (PSB)
Sl. Course Course Course Title

Total Marks
Practical
Tutorial

Credits
Lecture

Durationin
Theory
No Category Code

Hours

Marks
Marks

SEE
CIE
L T P
BS 22MATS41 Mathematics for Computer Science Mathematics 3 03 50 50 100 03
1
Engineering Stream-IV
PCC 22AD42 Design and Analysis of Algorithms AD/CSE/AIML 3 03 50 50 100 03
2
PCC 22AD43 Introduction to Database AD/CSE/AIML 3 03 50 50 100 03
3
Management System
PCC 22AD44 Problem Solving using Python AD/CSE/AIML 3 03 50 50 100 03
4
PCC 22AD45 Principles of Artificial Intelligence AD/CSE/AIML 3 03 50 50 100 03
5
PCC 22ADL46 AD/CSE/AIML 2 03 50 50 100 01
6 Design and Analysis of Algorithms Lab
PCC 22ADL47 Introduction to Database AD/CSE/AIML 2 03 50 50 100 01
7
Management System Lab
PCC 22ADL48 Python Programming Lab AD/CSE/AIML 2 03 50 50 100 01
8
PW 22PRJ49 Project-IV AD/CSE/AIML 2 03 50 50 100 01
9
HSS 22UHV410 Universal Human Values Humanities 3 02 50 50 100 03
10
AEC 22AAD411X Ability Enhancement Course-IV AD/CSE/AIML 2 03 50 50 100 01
11
Total 18 0 10 32 550 550 1100 23
BS: Basic Science, PCC: Programme Core Course, AEC: Ability Enhancement Course, HSS: Humanities and Social Science, PW: Project work, NCMC: Non-Credit
Mandatory Course

Page 3 of
Project (PRJ): A Batch of 4 students (Same branch or different branches with a guide, may undertake one project.). Based on the ability /abilities of the student/s and
recommendations of the mentor, a single discipline or multidisciplinary mini project can be assigned to a group having not more than 4 students.
Ability Enhancement Course-IV
Course code under 22AAD411X Course Title
22AAD411A Java Script
22AAD411B MongoDB
Courses prescribed to lateral entry Diploma holders admitted to III semester of Engineering
programs
12 NCMC 22MATDIP41 Additional Mathematics – II Mathematics 3 1 - 3 00 100 100 00
1) Non-Credit Mandatory Courses (NCMC) Additional Mathematics-I and II prescribed for III and IV semesters respectively, to the lateral entry Diploma
holders admitted to III semester of B. Tech. programs, shall attend the classes during the respective semesters to complete all the formalities of the course and
appear for the university examination. In case any student fails to register for the said course/fails to secure the minimum 50% of the prescribed CIE marks,
he/she shall be deemed to have secured F grade. In such a case, the students have to fulfill the requirements during subsequent semester/s to appear for SEE.
2) These courses shall not be mandatory for vertical progression, but completion of the courses shall be mandatory for the award of degree.

AICTE Activity Points to be earned by students admitted to B.Tech. programme (For more details refer to Chapter 6, AICTE Activity Point
Programme, Model Internship Guidelines):
Over and above the academic grades, every regular student admitted to the 4 years degree programme and every student entering 4 years degree programme
through lateral entry, shall earn 100 and 75 activity points respectively for the award of degree through AICTE Activity Point Programme. Students
transferred from other universities to fifth semester are required to earn 50 activity points from the year of entry to Sharnbasva University. The activity points
earned shall be reflected on the students eighth semester grade card.
The activities can be spread over the years, anytime during the semester weekends holidays, as per the liking and convenience of the student fromthe year
of entry to the programme. However, minimum hours requirement should be fulfilled. Activity Points (non credit) have no effect on SGPA/CGPA and shall
not be considered for vertical progression.
In case students fail to earn the prescribed activity points, eighth semester grade card shall be issued only after earning the required activity points.
Student shall be admitted for the award of the degree only after the release of the eighth semester grade card.

Page 4 of
 DEPARTMENT OF MATHEMATICS, FACULTY OF ENGG. &TECH., SHARNBASVA UNIVERSITY,

Course Title: Mathematics for Computer science Engineering

Stream-III
Course Code: 22MATS31 CIE Marks 50
Course Type: Theory SEE Marks 50
Total Marks 100
Teaching Hours/Week (L:T:P:S) 2:2:0:0 Exam Hours 03
Total Hours of Pedagogy 40 hours Theory Credits 03
Course objectives: The goal of the course Mathematics for Computer science Engineering Stream-
III(22MATS31)is to
 Familiarize the importance of Random variable and Probability distribution essential for
Mechanical engineering.
 Analyze computer science engineering problems applying Statistical methods to fit a curve
and understand co-variance of two variables and its correlation coefficient.
 Understand the vector space and associated results.
 Understand the basic concepts of set theory, relations, functions
 Develop the knowledge of solving Mechanical engineering problems numerically.
Teaching-Learning Process
Pedagogy(General Instructions):
These are sample Strategies, which teachers can use to accelerate the attainment of the various
course outcomes.
1. In addition to the traditional lecture method, different types of innovative teaching methods
may be adopted so that the delivered lessons shall develop student’s theoretical and applied
mathematical skills.
2. State the need for Mathematics with Engineering Studies and Provide real-life examples.
3. Support and guide the students for self–study.
4. You will also be responsible for assigning homework, grading assignments and quizzes, and
documenting students progress.
5. Encourage the students for group learning to improve their creative and analytical skills.
6. Show short related video lectures in the following ways:
 As an introduction to new topics(pre-lecture activity).
 As are vision of topics (post-lecture activity).
 As additional examples (post-lecture activity).
 As an additional material of challenging topics (pre-and post-lecture activity).
 As a model solution of some exercises (post-lecture activity).
Course outcome (Course Skill Set)
At the end of the course the student will be able to:
CO1 Knowing the random variable both discrete and continuous and their
probability distribution, Mass density function and solving the problems
on various engineering problems.
CO2 Apply the concept of correlation and regression lines for solving the
problems and numerical techniques to solve engineering problems and fit
a least squares curve to the given data.
CO3 Knowing the concept of Change of Basis, Range and Kernel of linear
transformation to solve the examples arising in Electronics and communication
Engineering.
CO4
Apply the operations like union and intersection on discrete structures

Page 1 of
 DEPARTMENT OF MATHEMATICS, FACULTY OF ENGG. &TECH., SHARNBASVA UNIVERSITY,

such as sets, relations and functions

CO5 Understand the model using advanced concept of graph for real world
applications.

Bloom’s level of the course outcomes:

Bloom’s Level
CO# Remember Understand Apply Analyze Evaluate Create

√ √ √
(L1) (L2) (L3) (L4) (L5) (L6)

√ √ √
CO1

√ √ √
CO2

√ √ √
CO3

√ √ √
CO4
CO5
Course Articulation Matrix / Course mapping :

PO10

PO11

PO12

PSO1

PSO2

PSO3
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
CO#

CO1 3 2 2 1 1 1
CO2 3 2 2 1 1 1
CO3 3 2 2 1 1 1
CO4 3 2 2 1 1 1
CO5 3 2 2 1 1 1
Note: 1-Low mapped, 2-Medium mapped, 3-High mapped
MODULE-1: Probability Distribution
Probability Distribution: Random variables (discrete and continuous) probability
mass/density functions. Binomial distribution, Poisson distribution. Exponential and
Normal distributions. Problems.

Self Study: Definition of probability, addition and multiplication rule, Bay’s theorem.

(RBT Levels: L1, L2 and L3) 8 Hours

MODULE-2: Statistical Methods
Basic Statistics: Measures of central tendency, measures of dispersion, range quartile
deviation, mean deviation, standard deviation, coefficient of variation, Skewness and
Kurtosis, problems.
Statistical Methods: Correlation-karl Pearson’s co-efficient of correlation problems.
Regression analysis lines of regression, Rank correlation (without proof)-problems.

form𝑦 = 𝑎𝑥 + 𝑏, 𝑦 = 𝑎𝑥2 + 𝑏𝑥 + 𝑐 & 𝑦 = 𝑎𝑒𝑏𝑥.

Curve Fitting: Curve fitting by the method of least square. Fitting of the curves of the

Self-study: Center and circle of curvature, evolutes and involutes.

(RBT Levels: L1, L2 and L3) 8 Hours
MODULE-3: Advanced Linear Algebra -2
Change of Basis, Range and Kernel of linear transformation, Rank and Nullity of a matrix, Non-
singular Linear Transformation, Eigen value and Eigen vector of Linear Transformation.

Page 2 of
 DEPARTMENT OF MATHEMATICS, FACULTY OF ENGG. &TECH., SHARNBASVA UNIVERSITY,

Self Study : Vector space basis

(RBT Levels: L1, L2 and L3 ) 8 Hours

MODULE-4: Relations, Functions and Logic
Functions: Cartesian Products and Relations, Functions – into, many one One-to-One, Onto,
Bijective Functions. The Pigeon-hole Principle, Function Composition and Inverse
functions.
Relations: Definition and different types of relations
Introduction to logic: Basic Connectives and Truth Tables, Logic Equivalence – The Laws
of Logic, Logical Implication – Rules of Inference.
Self Study : Properties of set theory.

(RBT Levels: L1, L2 and L3 ) 8 Hours

MODULE-5: Graph Theory-1
Graph Theory: introduction to graph theory, definitions of finite and null graphs, loops,
multigraphs, pseudo graph, simple graph, degree of a vertex, isolated vertices,
connectedness and complete graph, minimum and maximum degree, regular graphs,
subgraphs, walk, trial, paths, Euler and Hamilton graphs.
Self Study : Set theoretical operations and basic number theory concepts

(RBT Levels: L1, L2 and L3 ) 8 Hours

Question Paper Pattern:
• The SEE question paper will be set for 100 marks and the marks scored will be
proportionately reduced to 50.
• The question paper will have ten full questions carrying equal marks.
• Each full question carries 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each
module.
• Each full question will have sub questions covering all the topics under a module.
• The students will have to answer five full questions, selecting one full question from each
module.
CIE + Assignments: 15+35=50 Marks
There will be a 3 CIE’s, the average of best of 2 CIE’s will be considered and there will
be a 35 marks for Assignments
Suggested Learning Resources:

Books (Title of the Book/Name of the author/Name of the publisher/Edition and Year)Text
Books
1. B.S.Grewal:“Higher EngineeringMathematics”,Khannapublishers, 44th Ed.,2021.
2. E. Kreyszig: “AdvancedEngineeringMathematics”, John Wiley&Sons, 10thEd., 2018.

Reference Books

1. V.Ramana:“HigherEngineeringMathematics”McGraw-HillEducation,11th Ed.,2017
2. SrimantaPal&SubodhC.Bhunia:“EngineeringMathematics”OxfordUniversityPress,3rdE
d., 2016.

Page 3 of
DEPARTMENT OF MATHEMATICS, FACULTY OF ENGG. &TECH., SHARNBASVA UNIVERSITY,

3. N.PBali and Manish Goyal: “A textbook of Engineering Mathematics” Laxmi

Publications,10th Ed.,2022.
4. C.RayWylie,LouisC.Barrett:“AdvancedEngineeringMathematics”McGraw–HillBookCo.,
Newyork, 6thEd., 2017.
5. GuptaC.B,SingS.RandMukeshKumar:“EngineeringMathematicforSemesterIandII”,Mc-
Graw Hill Education(India)Pvt.Ltd 2015.
6. H.K.DassandEr.RajnishVerma:“HigherEngineeringMathematics”S.ChandPublication,3r
dEd.,2014.

7. JamesStewart:“Calculus”CengagePublications,7thEd.,2019.
8. DavidCLay:“LinearAlgebraandits Applications”,Pearson Publishers,4th Ed.,2018.
9. Gareth Williams: “Linear Algebra with applications”, Jones Bartlett Publishers Inc.,
6thEd., 2017.

Page 4 of
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

Logic Design & Computer Organization

Course Code 22AD32 CIE Marks 50
Number Lecture Hour/Week L T P TOTAL SEE Marks 50
3 1 0 4
Number of Lecture Hours 48 Exam Hours 03
Credits-04

Course Learning Objectives: This course will enable students to

● Describe, Illustrate and Analyze Combinational Logic circuits, Simplification of Algebraic
Equations using Karnaugh Maps and Quine McClusky Techniques.
● Describe and Design multiplexers, Binary comparators, and Master-Slave Flip-Flops, registers
and counters.
● Understand the working of computer systems and its basic principles.
● Understand instruction level architecture and instruction execution.
● Understand the current state of art in memory system design.

MODULE TEACHING RBT

TOPICS
NO. HOURS LEVEL
The Basic Gates:
Basic Logic gates, Positive and Negative logic; Combinational Logic
1 Circuits: Sum-of-Products Method, Truth Table to Karnaugh Map,
8 L1, L2,
Pairs, Quads, and Octets, Karnaugh Simplifications, Don’t-care L3
Conditions, Product-of-sums Method, Product-of-sums simplifications,
Simplification by Quine McClusky Method, Hazards and Hazard
covers.

Data-Processing Circuits, Flip- Flops, Registers, Counters:

Multiplexers, Demultiplexers, 1-of-16 Decoder, BCD to Decimal 10 L1, L2,
Decoders, Seven Segment Decoders, Encoders, Exclusive-OR Gates, L3
2 Parity Generators and Checkers, Magnitude Comparator.
Flip- Flops: RS Flip-Flops, Gated Flip-Flops, Edge-triggered RS FLIP-
FLOP, Edge-triggered D FLIP-FLOPs, Edge-triggered JK FLIP-FLOPs,
JK Master-Slave FLIP-FLOP.
Registers: Types of Registers, Universal Shift Register, Applications of
Shift Registers.
Counters: Asynchronous Counters, Synchronous Counters, Decade
Counters, Counter Design as a Synthesis problem

Functional blocks of a computer:

Functional units, Basic operational concepts, Bus Structure, Software,
3 and Performance. Signed number representation, character 10 L1, L2,
representation. Memory location and address, Instruction and L3
sequencing, Basic IO operations, Addressing Modes, Additional
Instructions: Shift and Rotate Instructions.
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

Basic Processing Unit, Input/Output Organization:

Single Bus Organization, Multiple Bus Organization, Hardwired and
micro-programmed design approaches.
4 Input/Output Organization: Accessing I/O devices, Interrupts, DMA, 10 L1, L2,
Buses. L3

The Memory System:

Semiconductor RAM memories (SDRAM, ADRAM), Cache Memories,
Performance Consideration.
5 L1, L2, L3
Arithmetic: Addition and Subtraction of Signed Numbers, Design of 10
Fast Adders, Multiplication of Positive Numbers, Signed Operand
Multiplication, Fast Multiplication.

COURSE OUTCOMES: At the end of the course the student will be able to:

CO1 Acquire knowledge of Combinational Logic, Simplification Techniques using Karnaugh Maps, Quine
McClusky technique.
CO2 Working of Flip-Flops, registers and counters
CO3 Identify the Basic structure of the Computer and its Performance measures.
CO4 Demonstrate the functioning of different sub-systems, such as processor, Input/Output and memory.

CO5 Able to Understand the concepts of Memory Organization, Arithmetic Operations.

Mapping of course outcomes with program outcomes

22AD32 PO PO PO PS0 PSO PSO

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9
10 11 12 1 2 3
CO1 3 1 2 1 - - - - 1 - - 3 3 - -
CO2 3 1 3 1 1 - - - 2 3 - 1 3 - -
CO3 3 2 3 2 3 - - - 1 3 - 2 3 - -
CO4 3 2 3 2 3 - - - - 3 - - 3 - -
CO5 3 1 3 2 3 - - - - 3 - 2 3 - -
Avg.
3.0 2.6 2.8 - 2.2 - - - - - - 2.0 3.0 - -
Mapping

QUESTION PAPER PATTERN:

 The question paper will have ten questions.
 Each full question consisting of 20 marks.
 There will be 2 full questions (with a maximum of four sub questions) from each module.
 The students will have to answer 5 full questions, selecting one full question from each module.
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

 TEXT BOOKS:
1. Carl Hamacher, Z. Vranesic & S. Zaky, “Computer Organization”,5th Edition, Tata McGraw
HillPublishing Company Ltd. New Delhi, 2002.
2. Donald P Leach, Albert Paul Malvino & Goutham Saha: Digital Principles and Applications,
8th Edition, Tata Mcgraw Hill, 2015.

 REFERENCE BOOKS:
1. Morris Mano, “Computer System Architecture”, PHI, 19862.William Stallings Computer
Organization & Architecture, 7th Edition, PHI 2006.
2. R D Sudhakar Samuel: IIustrative approach to Logic Design, Sanguine-Pearson, 2010.
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

Data Structures using C

Course Code 22AD33 CIE Marks 50
Number Lecture Hour/Week L T P TOTAL SEE Marks 50
3 0 0 3
Number of Lecture Hours 40 Exam Hours 03
Credits-03

Course Objectives: This course will enable students to

 Understanding the fundamentals of data structures, including pointers, arrays, strings, linked lists,
stacks, queues, trees, and graphs.
 Understand dynamic memory allocation and deallocation in C using functions
 Study and implement graphs and tree traversal techniques.
 Learn and implement common searching algorithms (e.g., linear search, binary search) and sorting
algorithms (e.g., bubble sort, selection sort, merge sort, quick sort) using various data structures.
 Implement hash tables and use them for efficient data retrieval.

MODULE TEACHING RBT

TOPICS
NO. HOURS LEVELS
Introduction: Data Structures, Classifications (Primitive & Non-
Primitive), Data structure Operations,
Arrays: Representation of single dimensional array, Array Operations:
Traversing, Inserting, Deleting, Searching, and Sorting.
Multidimensional Arrays: Representation of two-dimensional array. L1, L2,
1 Pointers: Declaration and Initialization of pointers, Dynamic memory 8
L3
allocation functions, Dangling Pointers.
Strings: Storing strings, String handling functions and Pattern
Matching algorithms: Brute force pattern matching algorithm.
Structures and Unions: Declaration of structures, Unions,
Polynomials and Sparse Matrices.

Stacks: Stack Operations, Array Representation of Stacks, Stacks

using Dynamic Arrays, Stack Applications, Conversion and
evaluation of expressions: Infix, Prefix, Postfix. L1, L2,
2 8
Recursion: Definioton and types, Computing recursive functions: L3
Factorial, Fibonacci Sequence, Tower of Hanoi.
Queues: Queue operations, Circular Queue, Dequeue.

Linked List: Definition and types, Representation of linked lists,

Linked list operations, Header node,
Circular List: Definition and representation, operations on circular L1, L2,
3 list. 8
L3
Doubly Linked List: Definition and representation, operations on
doubly linked list.
Polynomial representation and evaluation, Polynomial addition.
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

Tree: Terminology, Representation of tree.

Binary Tree: Properties of Binary tree, Types of Binary tree,
Representation of Binary trees, Binary Tree Traversals: In-order, Post- L1, L2,
4 8
order, Pre-order. L3
Threaded Binary Tree; Binary Search Trees: Definition,
Operations; Expression Tree.

Graphs: Terminology, Representation of Graph, Elementary Graph

operations, Traversal methods: Breadth First Search and Depth First L1, L2,
5 Search. 8
L3
Sorting: Sorting Techniques: Insertion Sort, Radix sort.
Hashing: Hash Table organizations, Hash Functions.

COURSE OUTCOMES: At the end of the course the student will be able to:

CO1 Apply Dynamic memory allocation functions for managing memory efficiently.

CO2 Utilize stack and queue operations for solving real world problems.

CO3 Apply searching and sorting algorithms for various applications.

CO4 Design and implement tree and graphs traversal techniques for various applications.

CO5 Explain the concept of hashing, implement hash tables, and apply hashing techniques for
efficient data retrieval.

Mapping of course outcomes with program outcomes

PO PO PO PS0 PSO PSO

22AD32 PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9
10 11 12 1 2 3
CO1 3 2 3 - 2 - - - 2 2 - 2 3 - -

CO2 3 3 3 - 2 - - - 3 3 - 2 3 - -

CO3 3 3 3 - 2 - - - 3 3 - 2 3 - -

CO4 3 2 2 - 2 - - - 3 3 - 2 3 - -

CO5 3 3 3 - 3 - - - 2 3 - 2 3 - -

Avg. 3.0 2.6 2.8 - 2.2 - - - 2.6 2.8 - 2.0 3.0 - -

Mapping
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

QUESTION PAPER PATTERN:

 The question paper will have ten questions.

 Each full question consisting of 20 marks.
 There will be 2 full questions (with a maximum of four sub questions) from each module.
 The students will have to answer 5 full questions, selecting one full question from each
module.

TEXT BOOKS:

1. Ellis Horowitz and Sartaj Sahni, Fundamentals of Data Structures in C, 2nd

Ed, Universities Press, 2014.
2. Seymour Lipschutz, Data Structures Schaum's Outlines, Revised 1st Ed,
McGraw Hill, 2014.

REFERENCE BOOKS:

1. Gilberg & Forouzan, Data Structures: A Pseudo-code approach with C, 2nd Ed,
Cengage Learning,2014.
2. Reema Thareja, Data Structures using C, 3rd Edition, Oxford press, 2012.
3. Jean-Paul Tremblay & Paul G. Sorenson, An Introduction to Data Structures
with Applications, 2nd Edition, McGraw Hill, 2013
4. A M Tenenbaum, Data Structures using C, PHI, 1989
5. Robert Kruse, Data Structures and Program Design in C, 2nd Edition, PHI, 1996.
6. Ashok N. Kamthane, Introduction to Data Structures in C, Pearson, 2010.
7. Venkatesh N.Baitipuli, Introduction to Data Structures using C, University
Science Press, 1st Edition, 2009
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

Fundamentals of Operating System

Course Code 22AD34 CIE Marks 50
Number Lecture Hour/Week L T P TOTAL SEE Marks 50
3 0 0 3
Number of Lecture Hours 40 Exam Hours 03
Credits-03

Course Objectives: This course will enable students to

 Demonstrate the need for OS and different types of OS.
 Apply suitable techniques for management of different resources
 Use processor, memory, storage and file system commands
 Analyze deadlock identification and prevention mechanisms, segmentation and paging techniques
 Study of paging techniques

MODULE TEACHING RBT

TOPICS
NO. HOURS LEVELS
Introduction to operating systems:
What operating systems do, Computer System organization, Computer
System architecture, Operating System structure, Operating System
operations, Process management, Memory management, Storage
L1, L2,
1 management, Protection and Security, Distributed system, Special- 8
purpose systems, Computing environments. L3
System structures: Operating System Services, User Operating
System interface, System calls, Types of system calls, System
programs, Operating system design and implementation,
Operating System
structure, Virtual machines, Operating System generation, System boot.

Process Management: Process concept, Process scheduling,

Operations on processes, Inter process communication.
L1, L2,
2 Multi-threaded Programming: Overview, Multithreading models, 8
Thread Libraries, Threading issues. L3
Process Scheduling: Basic concepts, Scheduling Criteria, Scheduling
Algorithms, Thread scheduling, Multiple-processor scheduling.

Process Synchronization: The critical section problem, Peterson’s

solution, Synchronization hardware, Semaphores, Classical problems
L1, L2,
3 of synchronization. 8
Deadlocks: System model, Deadlock characterization, Methods for L3
handling deadlocks, Deadlock prevention, Deadlock avoidance,
Deadlock detection, Recovery from deadlock.

Memory Management: Background, Swapping, Contiguous memory

L1, L2,
4 allocation, Paging, Structure of page table, Segmentation. 8
Virtual Memory Management: Background, Demand paging, L3
Copy-on-write, Page replacement, Allocation of frames.
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

File System: File concept, Access methods, Directory structure, File

system mounting, File sharing.
Implementing File system: File system structure, File system
L1, L2,
5 implementation, Directory implementation, Allocation methods. 8
Secondary Storage Structures: Overview of Mass storage structures, L3
Disk structure, Disk attachment, Disk scheduling.
Protection: Goals of protection, Principles of protection, Domain of
protection, Access matrix, Access control, Revocation of access rights.

COURSE OUTCOMES: At the end of the course the student will be able to:

CO1 Identify the structure of an operating system and its scheduling mechanism.

CO2 Demonstrate the allocation of resources for a process using scheduling algorithm.

CO3 Identify root causes of deadlock and provide the solution for deadlock elimination

CO4 Explore about the Page replacement techniques.

CO5 Analyse disk scheduling algorithms.

Mapping of course outcomes with program outcomes

22AD33 PO PO PO PSO PSO PSO

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

CO2 3 3 3 - 2 - - - 2 2 - 2 - 2 -

CO3 3 2 3 - 2 - - - - 2 - 2 - 2 -

CO4 3 2 2 - 2 - - - - 3 - 2 - 3 -

CO5 3 3 3 - 3 - - - - 3 - 2 - 3 -

Avg. 3.0 2.4 2.8 - 2.2 - - - 0.8 2.2 - 2.0 - 2.4 -

Mapping

QUESTION PAPER PATTERN:

 The question paper will have ten questions.

 Each full question consisting of 20 marks.
 There will be 2 full questions (with a maximum of four sub questions) from each module.
 The students will have to answer 5 full questions, selecting one full question from each
module.
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

TEXT BOOKS:

1. Operating System Concepts, by Abraham Silberschatz, Peter Baer Galvin, Greg Gagne,
9th Edition, Wiley India, 2012.

REFERENCE BOOKS:

1. Operating Systems, A Concept-Based Approach, by DM Dhamdhere, 3rd Edition, Tata

Mcgraw-Hill, 2012.
2. Modern Operating Systems, by Andrew S. Tanenbaum and Herbert Bos, 4th Edition,
Pearson, 2014.
3. Ann McHoes Ida M Fylnn, Understanding Operating System, Cengage Learning, 6th Edition
4. D.M Dhamdhere, Operating Systems: A Concept Based Approach 3rd Ed, McGraw-
Hill, 2013.
5. P.C.P. Bhatt, An Introduction to Operating Systems: Concepts and Practice 4th Edition,
PHI(EEE), 2014.
6. William Stallings Operating Systems: Internals and Design Principles, 6th Edition,
Pearson.
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

Java Programming
Course Code 22AD35 CIE Marks 50
Number Lecture Hour/Week L T P TOTAL SEE Marks 50
3 0 0 3
Number of Lecture Hours 40 Exam Hours 03
Credits-03

Course Objectives: This course will enable students to

 Learn the principles of object-oriented programming, including classes, objects, inheritance,
polymorphism, encapsulation, and abstraction.
 Gain a solid understanding of the basic syntax, data types, and control structures in Java, such as
variables, data types, operators, selective and iterative statements.
 Learn how to handle exceptions and errors using try-catch blocks, and understand the concept of
checked and unchecked exceptions.
 Grasp the fundamentals of multithreading and concurrency in Java, which allows for the execution of
multiple tasks simultaneously.
 Organize related classes and interfaces into a hierarchical structure, promoting better code organization
and maintainability.

MODULE TEACHING RBT

TOPICS
NO. HOURS LEVEL
Principles of Object Oriented Programming: Procedure-Oriented Approach,
Object-Oriented Programming(OOP) paradigm, Elements of OOP, Benefits of
OOP, OOP Languages, Procedure vs Object- Oriented paradigm, Applications of
OOP.
Introduction to Java L1, L2,
1 8
L3
History of Java, Bytecode, Features of Java, Java Applications, Differences
between C , C++ and Java, , Building and Running Java Program, Java Tokens,
Data Types, Variables, Operators, Type Conversion and Casting, Arrays, Access
Specifiers. Control Statements: Java Selection Statements, Iterative
Statements, Jump Statements.

Methods, Constructors, Inheritance

Classes and Objects: Class fundamentals, Object creation.
Methods: Method Definition, Method accessing, Method that takes parameters. L1, L2,
2 Constructors: Constructor Definition, Parameterized Constructors;Using this 8
L3
keyword, Instance variable hiding; Java static keyword.
Inheritance: Inheritance basics, Types of Inheritance, Simple
and Multi-
level Inheritance, Using super keyword, the call of Constructors.

Polymorphism, Packages, Interfaces

Polymorphism: Types, Method overloading, Constructor
overloading Method overriding, Dynamic Method Dispatch; L1, L2,
3 Using abstract class and final keyword.
8
L3
Packages : Defining Package, Access Protection, Importing Packages;
Interfaces : Defining and Implementing Interfaces, Nested Interfaces.
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

Exception Handling, Multithreading

Exception Handling: Exception Handling Fundamentals, Exception Types,
L1, L2,
4 Handling Exceptions using try and catch, Multiple catch clauses, Nested try 8
statements, throw, throws, finally. L3
Multithreading: Thread Creation, Creating Multiple Threads, Thread Priorities,
Synchronization,Interthread Communication: Producer Consumer Problem.

Applets, Java Input/Output

Java Input/Output: Stream classes, Byte Streams: InputStream, OutputStream,
FileInputStream, FileOutputStream, PrintStream, DataInputStream,
DataOutputStream; Character Streams: Reader, Writer, FileReader, FileWriter, L1, L2,
5 8
PrintWriter. L3
Applets: Applet basics, Applet Skeleton, Simple Applet Display Methods,
Repaint method, Simple Banner Applet, HTML Applet Tag, Passing Parameters
to Applet, getDocumentBase and getCodeBase methods, AppletContext Interface.

COURSE OUTCOMES: At the end of the course the student will be able to:

CO1 Apply object-oriented concepts such as classes, objects, inheritance, polymorphism, encapsulation, and
abstraction.
CO2 Implement interfaces by providing concrete implementations for the methods declared in the interface.

CO3 Create and manage threads in Java and understand the importance of synchronization in multithreaded
programs.
CO4 Write code that gracefully handles exceptions, preventing program crashes and providing meaningful
error messages.
CO5 Should be familiar with the lifecycle of an applet.

Mapping of course outcomes with program outcomes

22AD33 PO PO PO PSO PSO PSO

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9
10 11 12 1 2 3
CO1
3 2 3 - 2 - - - 2 2 1 2 - 2 -
CO2 3 3 3 1 2 - - - 2 3 2 2 - 1 -
CO3 3 2 2 2 2 - - - 2 - - 2 - 2 -
CO4 3 3 2 - 2 - - - 3 2 - 2 - 2 -
CO5 3 3 3 - 3 - - - 3 3 1 2 - 2 -
Avg.
3.0 2.6 2.6 0.6 2.2 - - - 2.4 2 0.8 2.0 - 1.8 -
Mapping

QUESTION PAPER PATTERN:

 The question paper will have ten questions.

 Each full question consisting of 20 marks.
 There will be 2 full questions (with a maximum of four sub questions) from each module.
 The students will have to answer 5 full questions, selecting one full question from each
module.
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

TEXT BOOKS:
1. Herbert Schildt, Java The Complete Reference, 7th Edition, Tata McGraw Hill

REFERENCE BOOKS:

1. Mahesh Bhave and Sunil Patekar, "Programming with Java", First Edition, Pearson
Education,2008, ISBN:9788131720806.
2. Rajkumar Buyya,S Thamarasi selvi, xingchen chu, Object oriented Programming with
java, Tata McGraw Hill education private limited.
3. E Balagurusamy, Programming with Java A primer, Tata McGraw Hill companies.
4. Anita Seth and B L Juneja, JAVA One step Ahead, Oxford University Press, 2017.
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

Data Structures using C Lab

Course Code 22ADL36 CIE Marks 50
Number Lecture Hour/Week L T P TOTAL SEE Marks 50
0 0 2 2
Number of Lecture Hours 30 Exam Hours 03
Credits-01

Course Objectives: This course will enable students to

 Understand the fundamental data structures like arrays, linked lists, stacks, queues, trees, and graphs.
 Understand various operations on Strings.
 Design binary search tree and tree traversals.
 Understand Hash Table functions.

Implement the following problem statements using C in Windows/Linux operating system.

1. Design, develop and implement a program in C for searching an item using Binary search.
2. Design, develop and implement a program in C for the following operations on Strings.
a) Read a main String (STR), a Pattern String (PAT) and a Replace String (REP)
b) Perform Pattern Matching Operation: Find and Replace all occurrences of PAT in STR with REP
if PAT exists in STR. Report suitable messages in case PAT does not exist in STR
Implement the program with user-defined functions for each of the above operations.
3. Implement a program in C for the following operations using structures.
a) Read Employee details.
b) Calculate the Salary of an employee.
c) Display the Employee details.
Calculate the NetSalary using the formula: NetSalary = Basic_Salary + HRA + DA – PF
where,
 HRA is 10% of Basic salary i.e., HRA=Basic_Salary*0.1;
 DA is 5% of Basic salary i.e., DA=Basic_Salary*0.05;
 PF is 12% of Basic salary i.e., PF=Basic_Salary*0.12;
4. Design, develop and implement a menu driven program in C for the following operations on STACK
of Integers. (Array Implementation of Stack with maximum size MAX)
a) Push an Element on to Stack.
b) Pop an Element from Stack.
c) Demonstrate Overflow and Underflow situations on Stack.
d) Display the status of Stack.
Implement the program with appropriate functions for each of the above operations.
5. Design, develop and implement a program in C for the following Stack Applications:
a) Convert Infix expression to Postfix expression.
b) Evaluate the Postfix expression.
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

6. Design, develop and implement a program in C for the following using recursive functions:
a) Function to find the factorial of N.
b) Function to find the Tower of Hanoi problem.

7. Design, develop and implement a menu driven Program in C for the following operations on
Circular QUEUE of Characters (Array Implementation of Queue with maximum size MAX)
a) Insert an Element on to Circular QUEUE.
b) Delete an Element from Circular QUEUE.
c) Demonstrate Overflow and Underflow situations on Circular QUEUE.
d) Display the status of Circular QUEUE.
Implement the program with appropriate functions for each of the above operations.
8. Design, develop and implement a menu driven program in C for the following operations on
Singly Linked List (SLL) of Student Data with the fields: USN, Name, Programme, Sem, PhNo.
a) Create a SLL of N Students Data by using front insertion.
b) Display the status of SLL and count the number of nodes in it
c) Perform Insertion / Deletion at End of SLL
d) Perform Insertion / Deletion at Front of SLL (Demonstration of stack)

9. Design, develop and implement a menu driven program in C for the following operations on
Binary Search Tree (BST) of integers.
a) Create a BST of N Integers: 6, 9, 5, 2, 8, 15, 24, 14, 7, 8, 5, 2
b) Traverse the BST in Inorder, Preorder and Post Order.
c) Search the BST for a given element (KEY) and report the appropriate message.

10. Design, develop and implement a menu driven program in C for the following
operations using Hash table for Employee record with the fields: Emp_Id, Ename.
a) Create a hash table.
b) Insert an item into the hash table.
c) Search an item using Emp_Id.
COURSE OUTCOMES: At the end of the course the student will be able to:

CO1 Implement data types such as stack, queue and linked list and apply them for the given problem.

CO2 Implement various operations on Strings.

CO3 Implement binary search tree and tree traversals.

CO4 Implement Hash Table.

 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

Assessment Details (both CIE and SEE):

The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%.
The minimum passing mark for the CIE is 40% of the maximum marks (20 marks). A student shall be
deemed to have satisfied the academic requirements and earned the credits allotted to each course. The
student has to secure not less than 35% (18 Marks out of 50) in the semester-end examination (SEE).
Continuous Internal Evaluation (CIE):
 CIE marks for the practical course is 50 Marks. The split-up of CIE marks for record/ journal and test
are in the ratio 60:40.
 Each experiment to be evaluated for conduction with observation sheet and record write-up. Rubrics
for the evaluation of the journal/write-up for hardware/software experiments designed by the faculty
who is handling the laboratory session and is made known to students at the beginning of the practical
session.
 Record should contain all the specified experiments in the syllabus and each experiment write-up will
be evaluated for 10 marks.
 Total marks scored by the students are scaled downed to 30 marks (60% of maximum marks).
 Weightage to be given for neatness and submission of record/write-up on time.
 In each test, test write-up, conduction of experiment, acceptable result, and procedural knowledge will
carry a weightage of 60% and the rest 40% for viva-voce.
Semester End Evaluation (SEE):
 SEE marks for the practical course is 50 Marks.
 SEE shall be conducted jointly by the two examiners, examiners are appointed by the University.
 All laboratory experiments are to be included for practical examination.
 Breakup of marks and the instructions printed on the cover page of the answer script to be strictly
adhered to by the examiners.
 Students can pick one question / experiment, from the questions lot prepared by the internal /external
examiners jointly.
 Evaluation of test write-up/ conduction procedure and result/viva will be conducted jointly by
examiners.
 General rubrics suggested for SEE are mentioned here, writeup-20%, Conduction procedure and
result in -60%, Viva-voce 20% of maximum marks. SEE for practical shall be evaluated for 100
marks and scored marks shall be scaled down to 50 marks (however, based on course type, rubrics
shall be decided by the examiners).
 Change of experiment is allowed only once and Marks allotted to the procedure part to be made zero.

Suggested Learning Resources:

● Ellis Horowitz and Sartaj Sahni, Fundamentals of Data Structures in C, 2nd Ed, Universities
Press, 2014.
● Seymour Lipschutz, Data Structures Schaum's Outlines, Revised 1st Ed, McGraw Hill, 2014.
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

Fundamentals of Operating System Lab

Course Code 22ADL37 CIE Marks 50
Number Lecture Hour/Week L T P TOTAL SEE Marks 50
0 0 2 2
Number of Lecture Hours 30 Exam Hours 03
Credits-01

Course Objectives: This course will enable students to

 To learn the fundamentals of process scheduling algorithms.
 To learn the mechanisms of OS to handle processes and threads and theircommunication.
 To ensure the consistency and integrity of data by synchronizing read and write operations on shared
resources.
 To prevent, detect, and handle deadlock situations effectively to ensure the reliability and availability
of a system.
 To apply various strategies for optimizing the access to disk storage devices.
 To apply various strategies for efficient memory utilization and page replacement in virtual memory
systems.

Implement the following problem statements using C in Linux operating system.

1. Write a C program to Simulate the following CPU scheduling algorithms
a) FCFS b) SJF c) Round Robin d) Priority
2. Write a C program to Simulate IPC techniques
a) Pipes b) Message Queues c) Shared Memory
3. Write a C Program to Simulate Classical Problems of Synchronization
a) Readers-Writers b) Producers-Consumers c) Dining Philosophers
4. Write a C Program to simulate Bankers Algorithm for Dead Lock Avoidance
5. Write a C Programs to Simulate all page replacement algorithms
a) FIFO b) LRU c) Optimal Etc...
6. Write a C program to Simulate Disk Scheduling Algorithms
a) FCFS b) SSTF
7. Build a simple client-server program to transfer files from client to server.
8. Build a multithreaded server to transfer files from server to client. Each thread will read one file and
send it back.
COURSE OUTCOMES: At the end of the course the student will be able to:
CO1 Compare the performance of various CPU scheduling algorithms.
CO2 Implement Deadlock avoidance and Detection algorithms.
CO3 Implement Semaphores.
CO4 Create processes and implement IPC.
CO5 Analyze the performance of the various Page Replacement Algorithms.
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

Assessment Details (both CIE and SEE):

The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%.
The minimum passing mark for the CIE is 40% of the maximum marks (20 marks). A student shall be
deemed to have satisfied the academic requirements and earned the credits allotted to each course. The
student has to secure not less than 35% (18 Marks out of 50) in the semester-end examination (SEE).
Continuous Internal Evaluation (CIE):
 CIE marks for the practical course is 50 Marks. The split-up of CIE marks for record/ journal and test
are in the ratio 60:40.
 Each experiment to be evaluated for conduction with observation sheet and record write-up. Rubrics
for the evaluation of the journal/write-up for hardware/software experiments designed by the faculty
who is handling the laboratory session and is made known to students at the beginning of the practical
session.
 Record should contain all the specified experiments in the syllabus and each experiment write-up will
be evaluated for 10 marks.
 Total marks scored by the students are scaled downed to 30 marks (60% of maximum marks).
 Weightage to be given for neatness and submission of record/write-up on time.
 In each test, test write-up, conduction of experiment, acceptable result, and procedural knowledge will
carry a weightage of 60% and the rest 40% for viva-voce.
Semester End Evaluation (SEE):
 SEE marks for the practical course is 50 Marks.
 SEE shall be conducted jointly by the two examiners, examiners are appointed by the University.
 All laboratory experiments are to be included for practical examination.
 Breakup of marks and the instructions printed on the cover page of the answer script to be strictly
adhered to by the examiners.
 Students can pick one question / experiment, from the questions lot prepared by the internal /external
examiners jointly.
 Evaluation of test write-up/ conduction procedure and result/viva will be conducted jointly by
examiners.
 General rubrics suggested for SEE are mentioned here, writeup-20%, Conduction procedure and
result in -60%, Viva-voce 20% of maximum marks. SEE for practical shall be evaluated for 100
marks and scored marks shall be scaled down to 50 marks (however, based on course type, rubrics
shall be decided by the examiners).
 Change of experiment is allowed only once and Marks allotted to the procedure part to be made zero.

Suggested Learning Resources:

 Operating System Concepts, by Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, 9th
Edition, Wiley India, 2012.
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

Java Programming Lab

Course Code 22ADL38 CIE Marks 50
Number Lecture Hour/Week L T P TOTAL SEE Marks 50
0 0 2 2
Number of Lecture Hours 30 Exam Hours 03
Credits-01

Course Objectives: This course will enable students to

 Learn basics of Java programs and its execution.
 Understand the principles of Object oriented programming.
 Understand the concept of exception handling mechanism.
 Grasp the fundamentals of multithreading and concurrency in Java, which allows for the execution of
multiple tasks simultaneously.
 Understand life cycle of the applets and its functionality.

Implement the following problem statements using Java in Windows/Linux operating system.
1. (a) Write a Java program to implement class mechanism and create object to access the members of
class.
(b) Write a Java program to implement shift operators.
2. (a) Write a Java program to illustrate Type Casting of the datatype and type conversion.
(b) Write a Java program to iterate over Arrays using for Each loop to compute
average of n natural numbers using Scanner class.
3. (a) Write a program in Java to demonstrate method overloading using iterative statements.
(b) Write a program in Java to demonstrate constructor overloading using this keyword.
4. (a) Write a program in Java that implements multi-level inheritance.
(b) Write a Java program to implement method overriding that shows use of super keyword.
5. (a) Write a Java program to illustrate Dynamic Method Dispatch using hierarchical inheritance.
(b) Write a Java program for abstract class to find areas of different shapes.
6. Write a Java program that implements interface using extends keyword.
7. (a) Write a Java program that illustrates Exception handling mechanisms.
(b) Write a Java program to illustrates break and continue statements.
8. Write a Java program that creates threads by extending Thread class.
a. First thread display “Good Morning “every 1 sec,
b. Second thread displays “Hello “every 2 seconds
c. Third display “Welcome” every 3 seconds.
9. Write a Java program for Producer and Consumer Problem using Threads.
10. (a) Develop an applet that displays a simple message.
(b) Write a Java program to create a Banner using Applet.
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

COURSE OUTCOMES: At the end of the course the student will be able to:
CO1 Implement simple JAVA programs and its execution.
CO2 Apply object-oriented concepts such as classes, objects, inheritance, polymorphism, encapsulation.
CO3 Develop code that gracefully handles exceptions, preventing program crashes and providing meaningful error
messages.
CO4 Create and manage threads in Java and understand the importance of synchronization in multithreaded
programs.
CO5 Develop the simple Java applications using Applets.

Assessment Details (both CIE and SEE):

The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%.
The minimum passing mark for the CIE is 40% of the maximum marks (20 marks). A student shall be deemed
to have satisfied the academic requirements and earned the credits allotted to each course. The student has to secure
not less than 35% (18 Marks out of 50) in the semester-end examination (SEE).
Continuous Internal Evaluation (CIE):
 CIE marks for the practical course is 50 Marks. The split-up of CIE marks for record/ journal and test
are in the ratio 60:40.
 Each experiment to be evaluated for conduction with observation sheet and record write-up. Rubrics
for the evaluation of the journal/write-up for hardware/software experiments designed by the faculty who is
handling the laboratory session and is made known to students at the beginning of the practical session.
 Record should contain all the specified experiments in the syllabus and each experiment write-up will be
evaluated for 10 marks.
 Total marks scored by the students are scaled downed to 30 marks (60% of maximum marks).
 Weightage to be given for neatness and submission of record/write-up on time.
 In each test, test write-up, conduction of experiment, acceptable result, and procedural knowledge will
carry a weightage of 60% and the rest 40% for viva-voce.
Semester End Evaluation (SEE):
 SEE marks for the practical course is 50 Marks.
 SEE shall be conducted jointly by the two examiners, examiners are appointed by the University.
 All laboratory experiments are to be included for practical examination.
 Breakup of marks and the instructions printed on the cover page of the answer script to be strictly adhered
to by the examiners.
 Students can pick one question / experiment, from the questions lot prepared by the internal /external
examiners jointly.
 Evaluation of test write-up/ conduction procedure and result/viva will be conducted jointly by examiners.
 General rubrics suggested for SEE are mentioned here, writeup-20%, Conduction procedure and result
in -60%, Viva-voce 20% of maximum marks. SEE for practical shall be evaluated for 100 marks and
scored marks shall be scaled down to 50 marks (however, based on course type, rubrics shall be
decided by the examiners).
 Change of experiment is allowed only once and Marks allotted to the procedure part to be made zero.
Suggested Learning Resources:
● Herbert Schildt, Java The Complete Reference, 7th Edition, Tata McGraw Hill
● E Balagurusamy, Programming with Java A primer, Tata McGraw Hill companies.
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

Soft Skills and Personality Development

Course Code 22HSM310A CIE Marks 50
Number Lecture Hour/Week L T P TOTAL SEE Marks 50
1 0 0 1
Number of Lecture Hours 20 Exam Hours 03
Credits-01

Course Learning Objectives: This course will enable students to

● Enhance learners’ soft skills by giving adequate exposure in the related subskills.
● To acquaint the learners with moral values and its necessity.
● Preparing the qualities that are important in the competitive era.

MODULE TEACHING RBT

TOPICS
NO. HOURS LEVEL
Introduction to Soft Skills and Hard Skills Personality
4 L1, L2,
Development: Knowing Yourself, Positive Thinking, Johari’s Window,
Communication Skills, Non-verbal Communication, Physical Fitness. L3
1
Emotional Intelligence: Meaning and Definition, Need for Emotional
Intelligence, Intelligence Quotient versus Emotional Intelligence
Quotient, Components of Emotional Intelligence, Competencies of
Emotional Intelligence, Skills to Develop Emotional Intelligence

Academic Skills Employment Communication: Introduction, Resume, 4 L1, L2,

Curriculum Vitae, Scannable Resume, Developing an Impressive L3
Resume, Formats of Resume, Job Application or Cover Letter
Professional Presentation: Nature of Oral Presentation, Planning a
2 Presentation, Preparing the Presentation, Delivering the Presentation Job
Interviews: Introduction, Importance of Resume, Definition of Interview,
Background Information, Types of Interviews, Preparatory Steps for Job
Interviews,
InterviewSkillTips,ChangesintheInterviewProcess,FAQDuringInterviews
Group Discussion: Introduction, Ambience/Seating Arrangement for
Group Discussion, Importance of Group Discussions, Difference
between Group Discussion, Panel Discussion and Debate, Types of
Group Discussions, topic based and Case based Group Discussion,
Individual Traits.

Communication Skills: Art of Listening-Art of Speaking-Art of 4 L1, L2,

Reading-Art of Writing-Art of Writing E-mails: Email etiquette. L3
3 Professional Skills Creativity at Workplace: Introduction, Current
Workplaces, Creativity, Motivation, Nurturing Hobbies at Work, The Six
Thinking Hat Method Ethical Values: Ethics and Society, Theories of
Ethics, Correlation between Values and Behavior, Nurturing Ethics,
Importance of Work Ethics, Problems in the Absence of Work Ethics.
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

Capacity Building: Learn, Unlearn and Relearn: Capacity Building, Elements 4 L1, L2,
of Capacity Building, Zones of Learning, Ideas for Learning, Strategies for L3
Capacity Building.
Corporate Skills: Working with others- Developing a proper body language-
4 behavioral etiquettes and mannerism- Time Management –Stress Management.

Leadership and Team Building: Leader and Leadership, Leadership 4 L1, L2,
Traits, Culture and Leadership, Leadership Styles and Trends, Team L3
Building, Types of Teams, Decision Making and Negotiation:
5 Introduction to Decision Making, Steps for Decision-Making, Decision-
Making Techniques, Negotiation Fundamentals, Negotiation Styles,
Major Negotiation Concepts
Job-hunting skills: Writing Resume/CV- Interview skills -Group
discussion -Mock interview Mock GD-Goal Setting-Career Planning.

COURSE OUTCOMES: At the end of the course the student will be able to:

CO1 Students will be aware of soft skills and the related sub-skills. They will focus a lot on Problem- solving and
decision making to achieve the goals.
CO2 Use academic skills/ presentation skills and apply Interview techniques etc.
CO3 Explain various communication skills, Professional skills
CO4 Explain strategies for capacity building understand corporate-skills. Manage stress.

CO5 Apply leadership and team Building skills and use job hunting skills.

 QUESTION PAPER PATTERN:

 The question paper will have fifty questions of MCQ type.
 Each question carries 2 marks.
 There will be 10 questions from each module.
 The students will have to answer all questions.

 TEXT BOOKS:
1. Soft Skills: an Integrated Approach to Maximize Personality, Gajendra S. Chauhan, Sangeeta Sharma,
Wiley India.
 REFERENCE BOOKS:
1. Personality Development and Soft Skills, Barun K. Mitra, Oxford Press
2. Business Communication, Shalini Kalia, Shailja Agrawal, Wiley India
3. Soft Skills- Enhancing Employability, M. S. Rao, I. K. International
4. Cornerstone: Developing Soft Skills, Sherfield, Pearson India

 E-Resources:
 Development by Vikas Divyakirti" || Drishti IAS || - YouTube
 https://onlinecourses.nptel.ac.in/noc19_hs32/preview
 (5967) How to Set Your Goal | Goal Setting in Your Life | Life Motivational Tips | Sonu Sharma - YouTube
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

Unix Shell Programming

Course Code 22AAD311A CIE Marks 50
Number Lecture Hour/Week L T P TOTAL SEE Marks 50
0 0 2 2
Number of Lecture Hours 30 Exam Hours 03
Credits-01

Course Objectives: This course will enable students to

 Study Unix basic commands.
 Study of vi editor.
 Understand the concepts of file handling commands.
 To gain an understanding of important aspects related to the Shell programming.

Implement the following commands and problem statements in Linux operating system.
Part A

1. Study of Unix basic commands [ cal, date, bc, passwd, who, uname, pwd, cd, mkdir, rmdir, ls]
2. Handling files [ cat, cp, rm, mv, more, wc, cmp, comm, diff, gzip & gunzip]
3. Study of file permissions [ ls-l, chmod, chown, chgrp]
4. Study of vi editor.
5. Study of filters [pr, head, tail, cut, paste, sort, uniq, tr, grep]
Part B
1. (a)Write a simple shell script to implement if..else, if and case statements.
(b) Write a simple shell script to implement for, while statements.
2. (a) Write a shell script to find the sum of n numbers.
(b) Write a shell program to swap two given numbers.
3. (a) Write a shell program to check whether the given year is leap year or not.
(b) Write a shell script to perform arithmetic operations.
4. (a) Write shell program that prompts the user to enter a string and then checks if the string is a
palindrome.
(b) Write a shell program to check whether a given number is even or odd.
5. (a) Write a shell program for finding the greatest among three numbers.
(b) Write a shell program that generates a random password of a specified length.

COURSE OUTCOMES: At the end of the course the student will be able to:

CO1 Become familiar with the Unix commands.

CO2 Good knowledge of simple UNIX filters.
CO3 Apply Changes in file system.
CO4 Able to write simple programs using Shell scripts.
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

Assessment Details (both CIE and SEE):

The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%. The
minimum passing mark for the CIE is 40% of the maximum marks (20 marks). A student shall be deemed to
have satisfied the academic requirements and earned the credits allotted to each course. The student has to
secure not less than 35% (18 Marks out of 50) in the semester-end examination (SEE).
Continuous Internal Evaluation (CIE):
 CIE marks for the practical course is 50 Marks. The split-up of CIE marks for record/ journal and test
are in the ratio 60:40.
 Each experiment to be evaluated for conduction with observation sheet and record write-up. Rubrics for
the evaluation of the journal/write-up for hardware/software experiments designed by the faculty who is
handling the laboratory session and is made known to students at the beginning of the practical session.
 Record should contain all the specified experiments in the syllabus and each experiment write-up will
be evaluated for 10 marks.
 Total marks scored by the students are scaled downed to 30 marks (60% of maximum marks).
 Weightage to be given for neatness and submission of record/write-up on time.
 In each test, test write-up, conduction of experiment, acceptable result, and procedural knowledge will
carry a weightage of 60% and the rest 40% for viva-voce.
Semester End Evaluation (SEE):
 SEE marks for the practical course is 50 Marks.
 SEE shall be conducted jointly by the two examiners, examiners are appointed by the University.
 All laboratory experiments are to be included for practical examination.
 Breakup of marks and the instructions printed on the cover page of the answer script to be strictly
adhered to by the examiners.
 Students can pick two questions / experiment (one from Part A and one from Part B), from the
questions lot prepared by the internal /external examiners jointly.
 Evaluation of test write-up/ conduction procedure and result/viva will be conducted jointly by examiners.
 General rubrics suggested for SEE are mentioned here, writeup-20%, Conduction procedure and result
in -60%, Viva-voce 20% of maximum marks. SEE for practical shall be evaluated for 100 marks and
scored marks shall be scaled down to 50 marks (however, based on course type, rubrics shall be
decided by the examiners).
 Weightage of marks for PART A is 50% and for PART B is 50%. General rubrics suggested to be
followed for part A and part B.
 Change of experiment is allowed only once and Marks allotted to the procedure part to be made zero.

Suggested Learning Resources:

● Unix Concepts & Applications 4rth Edition, Sumitabha Das, Tata McGraw Hill.
E-resources:
 https://www.tutorialspoint.com
 https://www.w3schools.com
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

Data Analytics with Excel

Course Code 22AAD311B CIE Marks 50
Number Lecture Hour/Week L T P TOTAL SEE Marks 50
0 0 2 2
Number of Lecture Hours 30 Exam Hours 03
Credits-01

Course Objectives: This course will enable students to

 Apply analysis techniques to datasets in Excel.
 Learn how to use Pivot Tables and Pivot Charts to streamline your workflow in Excel.
 Understand and identify the principles of data analysis.
 Become adept at using Excel functions and techniques for analysis.
 Build presentation ready dashboards in Excel.

Implement the following problem statements using Microsoft Excel

1. Getting Started with Excel: Creation of spread sheets, Insertion of rows and columns, Drag & Fill, use
of Aggregate functions.
2. Working with Data : Importing data, Data Entry & Manipulation, Sorting & Filtering.
3. Working with Data: Data Validation, Pivot Tables & Pivot Charts.
4. Data Analysis Process: Conditional Formatting, What-If Analysis, Data Tables, Charts &
Graphs.
5. Cleaning Data with Text Functions: use of UPPER and LOWER, TRIM function, Concatenate.
6. Cleaning Data Containing Date and Time Values: use of DATEVALUE function, DATEADD and
DATEDIF, TIMEVALUE functions.
7. Conditional Formatting: formatting, parsing, and highlighting data in spreadsheets during data analysis.
8. Working with Multiple Sheets: work with multiple sheets within a workbook is crucial for organizing
and managing data, perform complex calculations and create comprehensive reports.
9. Create worksheet with following fields: Empno, Ename, Basic Pay(BP), Travelling Allowance(TA),
Dearness Allowance(DA), House Rent Allowance(HRA), Income Tax(IT), Provident Fund(PF), Net
Pay(NP). Use appropriate formulas to calculate the above scenario. Analyse the data using appropriate
chart and report the data.
10. Generation of report & presentation using Autofilter & Macro.

COURSE OUTCOMES: At the end of the course the student will be able to:

CO1 Use advanced functions and productivity tools to assist in developing worksheets.
CO2 Manipulate data lists using Outline and PivotTables.
CO3 Use Consolidation to summarise and report results from multiple worksheets.
CO4 Apply Macros and Autofilter to solve the given real world scenario.
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

Assessment Details (both CIE and SEE):

The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%. The
minimum passing mark for the CIE is 40% of the maximum marks (20 marks). A student shall be deemed to
have satisfied the academic requirements and earned the credits allotted to each course. The student has to
secure not less than 35% (18 Marks out of 50) in the semester-end examination (SEE).
Continuous Internal Evaluation (CIE):
 CIE marks for the practical course is 50 Marks. The split-up of CIE marks for record/ journal and test
are in the ratio 60:40.
 Each experiment to be evaluated for conduction with observation sheet and record write-up. Rubrics for
the evaluation of the journal/write-up for hardware/software experiments designed by the faculty who is
handling the laboratory session and is made known to students at the beginning of the practical session.
 Record should contain all the specified experiments in the syllabus and each experiment write-up will
be evaluated for 10 marks.
 Total marks scored by the students are scaled downed to 30 marks (60% of maximum marks).
 Weightage to be given for neatness and submission of record/write-up on time.
 In each test, test write-up, conduction of experiment, acceptable result, and procedural knowledge will
carry a weightage of 60% and the rest 40% for viva-voce.
Semester End Evaluation (SEE):
 SEE marks for the practical course is 50 Marks.
 SEE shall be conducted jointly by the two examiners, examiners are appointed by the University.
 All laboratory experiments are to be included for practical examination.
 Breakup of marks and the instructions printed on the cover page of the answer script to be strictly
adhered to by the examiners.
 Students can pick one question / experiment, from the questions lot prepared by the internal /external
examiners jointly.
 Evaluation of test write-up/ conduction procedure and result/viva will be conducted jointly by examiners.
 General rubrics suggested for SEE are mentioned here, writeup-20%, Conduction procedure and result
in -60%, Viva-voce 20% of maximum marks. SEE for practical shall be evaluated for 100 marks and
scored marks shall be scaled down to 50 marks (however, based on course type, rubrics shall be
decided by the examiners).
 Change of experiment is allowed only once and Marks allotted to the procedure part to be made zero.

Suggested Learning Resources:

● Advanced Analytics with Excel 2019, Manisha Nigam
E-resources:
1. https://www.udemy.com/course/data-analytics-in-excel/
2. https://www.tutorialspoint.com/excel_data_analysis/excel_data_analysis_tutorial.pdf
3. https://www.youtube.com/live/9AOHwmmq5ug?feature=shared/
 SHARNBASVA UNIVERSITY,
ADDITIONAL MATHEMATICS - I
COMMON TO ALL BRANCHES
Course Code 22MATDIP31 CIE Marks 50
Contact Hours/Week 02 SEE Marks 00
Total Hours 25 Exam Hours 00
Semester III Credits 00
Course Learning Objectives:
This course will enable students to:
• Acquire basic concepts of complex trigonometry, vector algebra, differential and integral
calculus and vector differentiation.
• know the basic concepts of derivatives and representation of different types of polar
curves Evaluation of double and triple integrals.
• know the basic concepts of partial differential equations.
• To develop the knowledge of matrices and linear algebra in compressive manner.
• To understand the essential concept of linear algebra.
Course Outcomes(COs):
After completion of course, the student will able to
CO# Course Outcomes POs PSOs
CO1 Learn the representation of complex numbers in Argand 1, 2, 3
diagram and understanding the vector dot product and cross
product and use in finding the area, projection, etc. Also
understanding the gradient, divergence and curl operators.
CO2 Apply the knowledge of calculus to find the nth derivative and 1, 2, 3
solve the problems related to polar curves and its applications
in determining the bendness of a curve.
CO3 Learn the notion of partial differentiation to calculate rates of 1, 2, 3
change of multivariate functions and solve problems related to
composite functions and solve first order linear/nonlinear
differential equation analytically using standard methods.
CO4 Apply the concept of change of order of integration and 1, 2, 3
variables to evaluate multiple integrals and their usage in
computing the area and volumes.
CO5 Make use of matrix theory for solving system of linear 1, 2, 3
equations and compute Eigen values and Eigen vectors.
Bloom’s level of the course outcomes:
Bloom’s Level
CO# Remember Understand Apply Analyze Evaluate Create

√ √ √
(L1) (L2) (L3) (L4) (L5) (L6)

√ √ √
CO1

√ √ √
CO2

√ √ √
CO3

√ √ √
CO4
CO5
Course Articulation Matrix / Course mapping :

22MATDIP3
 SHARNBASVA UNIVERSITY,

PO10

PO11

PO12

PSO1

PSO2

PSO3
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
CO#
3 2 2 1 1 1
3 2 2 1 1 1
CO1

3 2 2 1 1 1
CO2

3 2 2 1 1 1
CO3

3 2 2 1 1 1
CO4
CO5
Note: 1-Low mapped, 2-Medium mapped, 3-High mapped

MODULE-1: COMPLEX TRIGONOMETRY

Complex Numbers: Definition and Properties . Modulus and Amplitude of complex number, Argand’s
diagram , De-Moivre’s theorem ( without proof )
Vector Analysis : Scalar and Vectors. Vector addition and subtraction. Multiplication of vectors ( Dot
and Cross products) Scalar and vector triple products- simple problems, Vector Differentiation : Gradient,
Divergence and Curl.

(RBT Levels: L1, L2 and L3 ) 5 Hours

Teaching – Learning Process Chalk and talk method / Power Point Presentation

MODULE-2: DIFFERENTIAL CALCULUS

Review of successive differentiation. Formulae of nth derivatives of standard functions- Leibnitz’s
theorem ( without proof ).
Polar Curves: Expression for Angle between radius vector and tangent, length of perpendicular from pole
to the tangent, angle between two polar curves, Pedal Equation of polar curves and problems. Taylor’ and
Maclaurin’s series expansions.

(RBT Levels: L1, L2 and L3 ) 5 Hours

Teaching – Learning Process Chalk and talk method / Power Point Presentation

MODULE-3: PARTIAL DIFFERENTIAL

Definitions of Partial Differentiation, Direct and Indirect partial derivatives, Symmetric functions,
Homogeneous function and Euler’s theorem on homogeneous function. Total Derivative of composite and
implicit function. Jacobians.

(RBT Levels: L1, L2 and L3 ) 5 Hours

Teaching – Learning Process Chalk and talk method / Power Point Presentation

MODULE-4: INTEGRAL CALCULUS

𝜋⁄ 𝜋
𝑆𝑖𝑛𝑛𝑥 𝑑𝑥 , ∫ 𝐶𝑜𝑠𝑛𝑥 𝑑𝑥 , 𝑎𝑛𝑑 Statement of Reduction formulae
⁄2
Reduction Formulae of ∫ 2
0 0
∫ 𝑠𝑖𝑛𝑚𝑥 𝑐𝑜𝑠𝑛𝑥 𝑑𝑥 and Problems.
𝜋⁄2
0
Double and Triple integral- simple problems.

(RBT Levels: L1, L2 and L3 ) 5 Hours

22MATDIP3
 SHARNBASVA UNIVERSITY,
Teaching – Learning Process Chalk and talk method / Power Point Presentation

MODULE-5: LINEAR ALGEBRA

Basic concepts of matrices- Rank of matrix by elementary row transformations- Echelon form.
Consistency of system of Linear equations. Solution of system linear equations by Gauss Elimination
method, Linear Transformation, Cayley- Hamilton theorem to compute inverse of matrix. Eigen values
and Eigen vector, Largest Eigen value and corresponding Eigen vector by Reyleigh’s Power method.
(RBT Levels: L1, L2 and L3 ) 5 Hours
Teaching – Learning Process Chalk and talk method / Power Point Presentation

CIE + Assignments: 15+35=50 Marks

There will be a 2 CIE’s, the best one among 2 CIE’s will be considered and there will be a 35 marks
for Assignments
Text Books:
1. B.S. Grewal : Higher Engineering Mathematics, Khanna Publishers, 43rd Ed., 2015.
2. E. Kreyszig : Advanced Engineering Mathematics, John Wiley & Sons, 10th Ed.(Reprint), 2016.
Reference books:
1. C.Ray Wylie, Louis C.Barrett : “Advanced Engineering Mathematics", 6th Edition,
2. McGraw-Hill Book Co., New York, 1995.
2. James Stewart : “Calculus –Early Transcendentals”, Cengage Learning India Private Ltd., 2017.
3. B.V.Ramana : "Higher Engineering Mathematics" 11th Edition, Tata McGraw-Hill, 2010.
4. Srimanta Pal & Subobh C Bhunia:“Engineering Mathematics”, Oxford University Press,3rd Reprint,2016.
5. Gupta C.B., Singh S.R. and Mukesh Kumar : “Engineering Mathematics for Semester I & II”,
Mc-Graw Hill Education (India) Pvt.Ltd., 2015.
Web links and Video Lectures:
1. http://nptel.ac.in/courses.php?disciplineID=111
2. http://www.class-central.com/subject/math
3. http://academicearth.org.

22MATDIP3
 DEPARTMENT OF MATHEMATICS, FACULTY OF ENGG. &TECH., SHARNBASVA UNIVERSITY,

Course Title: Mathematics for Computer science Engineering

Stream-IV
Course Code: 22MATS41 CIE Marks 50
Course Type : Theory SEE Marks 50
Total Marks 100
Teaching Hours/Week (L:T:P:S) 2:2:0:0 Exam Hours 03
Total Hours of Pedagogy 40 hours Theory Credits 03

Course objectives: The goal of the course Mathematics for Computer Science Engineering
Stream-IV(22MATS41)is to
 Understand the concept of Programming .
 Able to Binary tree concept in data structure.
 Understand the concept of joint probability distribution and stochastic processes rising in
science in computer Engineering.
 Understand the concept of errors and Hypothesis.
 Develop the knowledge of complex variable and discuss various properties of it.

Teaching-Learning Process
Pedagogy(General Instructions):
These are sample Strategies, which teachers can use to accelerate the attainment of the various
course outcomes.
1. In addition to the traditional lecture method, different types of innovative teaching methods
may be adopted so that the delivered lessons shall develop student’s theoretical and applied
mathematical skills.
2. State the need for Mathematics with Engineering Studies and Provide real-life examples.
3. Support and guide the students for self–study.
4. You will also be responsible for assigning homework, grading assignments and quizzes, and
documenting students progress.
5. Encourage the students for group learning to improve their creative and analytical skills.
6. Show short related video lectures in the following ways:
 As an introduction on new topics(pre-lecture activity).
 As a revision of topics(post-lecture activity).
 As additional examples(post-lecture activity).
 As an additional material of challenging topics (pre-and post-lecture activity).
 As a model solution of some exercises(post-lecture activity).

Course outcome (Course Skill Set)

At the end of the course the student will be able to:
CO1 Apply the knowledge of Modular Arithmetic to understand RSA Algorithm

CO2 Able to code the messages

CO3 Learn to solve the problems on Joint probability distribution fortwo discrete
random variables. Knowing the concept of stochastic processes, probability
vector, Probability matrix and studying the examples on Markov’s chains in
discrete time.

Page 1 of
 DEPARTMENT OF MATHEMATICS, FACULTY OF ENGG. &TECH., SHARNBASVA UNIVERSITY,

CO4 Able to Analyze the errors and Hypothesis

CO5 Able to solve complex Integration Problems

Bloom’s level of the course outcomes:

Bloom’s Level
CO# Remember Understand Apply Analyze Evaluate Create

√ √ √
(L1) (L2) (L3) (L4) (L5) (L6)

√ √ √
CO1

√ √ √
CO2

√ √ √
CO3

√ √ √
CO4
CO5
Course Articulation Matrix / Course mapping :

PO10

PO11

PO12

PSO1

PSO2

PSO3
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
CO#

CO1 3 2 2 1 1 1
CO2 3 2 2 1 1 1
CO3 3 2 2 1 1 1
CO4 3 2 2 1 1 1
CO5 3 2 2 1 1 1
Note: 1-Low mapped, 2-Medium mapped, 3-High mapped
MODULE-1: Fourier Series
Introduction of modular arithmetic and its applications in Computer Science and
Engineering. Introduction to Congruences, Linear Congruences, The Chinese Remainder
theorem, Solving Polynomials, Linear Diophantine Equation, System of Linear
Congruences, Euler’s Theorem, WilsonTheorem and Fermat’s little theorem. Applications
of Congruences-RSA algorithm.
Self-Study: Divisibility, GCD, Properties of Prime Numbers, Fundamental theorem of
Arithmetic.
(RBT Levels: L1, L2 and L3) (8 Hours)
MODULE-2 : Graph theory -2
Definitions, Properties of trees and Examples, Routed trees, Weighted Trees and Prefix
Codes.
Self-Study : Sorting technique
(RBT Levels: L1, L2 and L3) (8 Hours)
MODULE-3: Joint probability distribution and Stochastic processes
Joint probability distribution: Joint Probability distribution for two discrete random
variables, expectation, covariance, correlation coefficient.
Stochastic process: Stochastic processes, probability vector, stochastic matrices, fixed
points, regular stochastic matrices, Markov chains, higher transition probability-
simple problems.

Page 2 of
 DEPARTMENT OF MATHEMATICS, FACULTY OF ENGG. &TECH., SHARNBASVA UNIVERSITY,

Applications of Joint probability distribution:

(RBT Levels: L1, L2 and L3) (8 Hours)
MODULE- 4: Sampling theory and curve tracing
Sampling theory : Sampling, Sampling distributions, standard error, test of hypothesis for
means and proportions, Type I and Type II errors, Level of significance, confidence limits
for means, one tailed and two tailed tests, student’s t-distribution, Chi - square
distribution as a test of goodness of fit.
Tracing of curves: Cartesian form - Strophoid, Leminscate, Parametric form - Cycloid,
Astroid,
Polar form - Cardioid, Leminscate.
Self Study : Types of samplings, Cartesian equations and their geometrical
representation
Applications of Sampling theory and curve tracing:

(RBT Levels: L1, L2 and L3) (8 Hours)

MODULE- 5: Complex variable-2
Complex line Integrals: Cauchy’s Integration theorem, Cauchy integral formula, Laurent’s
Series, types of singularities. Residue, Poles, Cauchy’s Residue theorem (without proof )
and Problems.
Transformations: Bilinear transformations and problems.
Self Study : Initial value and boundary value problems

(RBT Levels: L1, L2 and L3 ) (8 Hours)

Question Paper Pattern:
• The SEE question paper will be set for 100 marks and the marks scored will be
proportionately reduced
to 50.
• The question paper will have ten full questions carrying equal marks.
• Each full question carries 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each
module.
• Each full question will have sub questions covering all the topics under a module.
• The students will have to answer five full questions, selecting one full question from each
module.
CIE + Assignments: 15+35=50 Marks
There will be a 3 CIE’s, the average of best of 2 CIE’s will be considered and there
will be a 35 marks for Assignments
SuggestedLearningResources:

Books (Title of the Book/Name of the author/Name of the publisher/Edition and Year)Text
Books
1. B.S.Grewal:“Higher EngineeringMathematics”,Khannapublishers, 44th Ed.,2021.
2. E. Kreyszig: “AdvancedEngineeringMathematics”, John Wiley&Sons, 10thEd., 2018.

ReferenceBooks

Page 3 of
DEPARTMENT OF MATHEMATICS, FACULTY OF ENGG. &TECH., SHARNBASVA UNIVERSITY,

1. V.Ramana:“HigherEngineeringMathematics”McGraw-HillEducation,11th Ed.,2017
2. SrimantaPal&SubodhC.Bhunia:“EngineeringMathematics”OxfordUniversityPress,3rdE
d., 2016.
3. N.PBali and Manish Goyal: “A textbook of Engineering Mathematics” Laxmi
Publications,10th Ed.,2022.
4. C.RayWylie,LouisC.Barrett:“AdvancedEngineeringMathematics”McGraw–HillBookCo.,
Newyork, 6thEd., 2017.
5. GuptaC.B,SingS.RandMukeshKumar:“EngineeringMathematicforSemesterIandII”,Mc-
Graw Hill Education(India)Pvt.Ltd 2015.
6. H.K.DassandEr.RajnishVerma:“HigherEngineeringMathematics”S.ChandPublication,3r
dEd.,2014.

7. JamesStewart:“Calculus”CengagePublications,7thEd.,2019.
8. DavidCLay:“LinearAlgebraandits Applications”,Pearson Publishers,4th Ed.,2018.
9. Gareth Williams: “Linear Algebra with applications”, Jones Bartlett Publishers Inc.,
6thEd., 2017.

Page 4 of
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

Design and Analysis of Algorithms

Course Code 22AD42 CIE Marks 50
Number Lecture Hour/Week L T P TOTAL SEE Marks 50
3 0 0 3
Number of Lecture Hours 40 Exam Hours 03
Credits-03

Course Objectives: This course will enable students to

 Learn techniques for analyzing the efficiency of algorithms, including time and space complexity
analysis.
 Explore various algorithm design paradigms, such as divide and conquer, dynamic programming, and
greedy algorithms and apply it solve the problems.
 Develop the ability to make informed decisions about space-time trade-offs based on specific problem
requirements and constraints.
 Explore techniques for bounding the solution space to eliminate subproblems that cannot lead to an
optimal solution.
 Explore various techniques for transforming complex problems into simpler or more manageable forms.

MODULE TEACHING RBT

TOPICS
NO. HOURS LEVEL
Introduction: Meaning and Properties of Algorithm, Fundamentals of
Algorithm, Analysis Framework, Asymptotic Notations: Big-Oh notation
(O), Omega notation (Ω), Theta notation (Ɵ) with examples,
Mathematical analysis of non-Recursive and recursive Algorithms with L1, L2,
1 8
Examples. L3
Brute Force Design Techniques: Selection Sort, Bubble Sort, Sequential
Search and Brute Force String Matching, Exhaustive Search, Advantages
and Disadvantages of Brute force design.

Divide and Conquer: General method, Recurrence equation for divide

and conquer using Master’s theorem, Merge sort, Quick sort, Binary
search, Strassen’s matrix multiplication, Advantages and Disadvantages L1, L2,
2 8
of divide and conquer. L3
Decrease and Conquer Approach: Introduction, Insertion Sort, Depth-
First Search and Breadth-First Search, Topological Sorting.

Space-Time Tradeoffs: Introduction, Sorting by Counting, Input

Enhancement in String Matching - Harspool’s Algorithm.
Dynamic Programming: Introduction, Transitive Closure - Warshall’s L1, L2,
3 8
Algorithm; All Pairs Shortest Paths - Floyd's Algorithm; Optimal Binary L3
Search Tress, Knapsack Problem, Bellman Ford Algorithm, Travelling
Sales Person Problem.
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

Transform and Conquer Approach: Introduction, Heaps and Heap Sort.

Greedy Method: Introduction, Coin Change Problem, Knapsack Problem,
Job Sequence with Deadlines, Minimum Cost Spanning Trees - Prim’s L1, L2,
4 8
Algorithm, Kruskal’s Algorithm with performance analysis; Single Source L3
Shortest Paths - Dijkstra's Algorithm; Optimal Tree Problem - Huffman
Trees and Codes.

Backtracking: General method, N-Queens Problem, Sum of Subset

Problem, Hamiltonian Circuit Problem. L1, L2,
5 Branch and Bound: Assignment Problem, Travelling Sales Person 8
L3
Problem, 0/1 Knapsack Problem. NP-Complete and NP-Hard Problems:
P and NP Problems, NP-Complete Problems and NP-Hard Classes.

COURSE OUTCOMES: At the end of the course the student will be able to:

CO1 Analyze the time and space complexity of algorithms using various notations and other
complexity analysis techniques.
CO2 Design, implement and analyse various sorting and searching algorithms.

CO3 Design and analyze algorithms using dynamic programming and greedy strategies for
optimization problems.
CO4 Evaluate and implement different branching strategies for selecting subproblems to explore,
considering their impact on algorithm efficiency.
CO5 Represent the solution space as a state space tree, where nodes correspond to different states or
decision points.

Mapping of course outcomes with program outcomes

22AD33 PO PO PO PSO PSO PSO

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9
10 11 12 1 2 3
CO1
3 2 3 - 2 - - - 3 2 - 2 3 2 -
CO2 3 3 3 - 2 - - - 2 2 - 2 3 2 -
CO3 3 3 3 - 2 - - - 2 2 - 2 3 2 -
CO4 3 2 2 - 2 - - - 2 2 - 2 3 2 -
CO5 3 3 3 - 3 - - - 2 2 - 2 3 2 -
Avg.
3.0 2.6 2.8 - 2.2 - - - 2.2 2.0 - 2.0 3.0 2.0 -
Mapping

QUESTION PAPER PATTERN:

 The question paper will have ten questions.

 Each full question consisting of 20 marks.
 There will be 2 full questions (with a maximum of four sub questions) from each module.
 The students will have to answer 5 full questions, selecting one full question from each
module.
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

TEXT BOOKS:

1. Introduction to the Design and Analysis of Algorithms, Anany Levitin:, 2nd

Edition, 2009. Pearson.
2. Computer Algorithms/C++, Ellis Horowitz, Satraj Sahni and Rajasekaran, 2nd
Edition, 2014, Universities Press

REFERENCE BOOKS:

1. Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronal L. Rivest,

Clifford Stein, 3rd Edition, PHI.
2. Design and Analysis of Algorithms, S. Sridhar, Oxford (Higher Education).
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

Introduction to Database Management System

Course Code 22AD43 CIE Marks 50
Number Lecture Hour/Week L T P TOTAL SEE Marks 50
3 0 0 3
Number of Lecture Hours 40 Exam Hours 03
Credits-03

Course Objectives: This course will enable students to

 Provide a strong foundation in database concepts, technology, and practice
 Practice SQL programming through a variety of database problems.
 Demonstrate the use of concurrency and transactions in database
 Design and build database applications for real world problems
 Learn techniques for generating reports from databases, including the use of SQL queries and
reporting tools.

MODULE TEACHING RBT

TOPICS
NO. HOURS LEVEL

Introduction to Databases: Introduction, Characteristics of database

approach, Advantages of using the DBMS approach, History of database
applications.
Overview of Database Languages and Architectures: Data Models,
Schemas, and Instances; Three schema architecture and data L1, L2,
1 independence, Database languages and interfaces, Database system 8
L3
environment, Classification database management systems.
Conceptual Data Modelling using Entities and Relationships: Entity
types, Entity sets, Attributes and Keys; Roles, and Structural constraints,
Weak entity types, ER diagrams, examples.
Textbook 1: Ch 1.1 to 1.8, 2.1 to 2.6, 3.1 to 3.10

Relational Model: Relational Model Concepts, Relational Model

Constraints and Relational Database Schemas, Update operations,
Transactions, and Dealing with Constraint Violations.
Relational Algebra: Unary and Binary Relational Operations, Additional L1, L2,
2 Relational Operations (aggregate, grouping, etc.) Examples of Queries in 8
L3
Relational Algebra.
Mapping Conceptual Design into a Logical Design: Relational
Database Design using ER-to-Relational Mapping.
Textbook 1: Ch 5.1 to 5.3, 6.1 to 6.5, 7.1,

SQL: SQL Data Definition and Data Types, Specifying Constraints in L1, L2,
3 SQL, Retrieval Queries in SQL, INSERT, DELETE, and UPDATE 8
L3
statements in SQL, Additional features of SQL.
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

Advances Queries: More complex SQL retrieval queries, Specifying

constraints as assertions and action triggers, Views in SQL, Schema
change statements in SQL.
Database Application Development: Accessing databases from
applications, An introduction to JDBC, JDBC classes and interfaces,
SQLJ, Stored procedures.
Internet Applications: The three-Tier application architecture, The
presentation layer, The Middle Tier.
Textbook 1: Ch 8.1, 8.2, 8.4, 8.6; Textbook 2: 6.1 to 6.5, 7.5 to 7.7

Normalization: Database Design Theory – Introduction to Normalization

using Functional and Multivalued Dependencies: Informal design
guidelines for relation schema, Functional Dependencies, Normal Forms
based on Primary Keys, Second and Third Normal Forms, Boyce-Codd
Normal Form, Multivalued Dependency and Fourth Normal Form, Join
Dependencies and Fifth Normal Form. L1, L2,
4 8
Normalization Algorithms: Inference Rules, Equivalence, and Minimal L3
Cover, Properties of Relational Decompositions, Algorithms for
Relational Database Schema Design, Nulls, Dangling tuples, and alternate
Relational Designs, Further discussion of Multivalued dependencies and
4NF, Other dependencies and Normal Forms.
Textbook 1: Ch 14.1 to 14.7, 15.1 to 15.6

Transaction Processing: Introduction to Transaction Processing,

Transaction and System Concepts, Desirable Properties of Transactions,
Characterizing Schedules based on Recoverability, Characterizing
Schedules based on Serializability, Transaction Support in SQL.
Concurrency Control in Databases: Two-phase Locking Techniques for
Concurrency Control, Concurrency Control based on Timestamp L1, L2,
5 Ordering, Multiversion Concurrency Control Techniques, Validation 8
L3
Concurrency Control Techniques, Granularity of Data Items and
Multiple Granularity Locking. Introduction to Database Recovery
Protocols: Recovery Concepts, Recovery Techniques based on
Deferred Update, Recovery Techniques based on Immediate Update,
Shadow Paging, Database Backup and Recovery from Catastrophic
Failures.
Textbook 1: Ch 17.1 to 17.6, 18.1 to 18.5, 19.1 to 19.7

COURSE OUTCOMES: At the end of the course the student will be able to:

CO1 Identify, analyze and define database objects, enforce integrity constraints on a database using
RDBMS.
CO2 Use Structured Query Language (SQL) for database manipulation.
CO3 Design and build simple database systems
CO4 Develop application to interact with databases.
CO5 Analyze the applicability of normalization level to a given problem in databases.
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

Mapping of course outcomes with program outcomes

22AD43 PO PO PO PSO PSO PSO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9
10 11 12 1 2 3
CO1
3 2 3 - 2 - - - - - - 2 3 - -
CO2 3 3 3 - 2 - - - - - - 2 3 - -
CO3 3 3 3 - 2 - - - - - - 2 3 - -
CO4 3 2 2 - 2 - - - - - - 2 3 - -
CO5 3 3 3 - 3 - - - - - - 2 3 - -
Avg.
3.0 2.6 2.8 - 2.2 - - - - - - 2.0 3.0 - -
Mapping

QUESTION PAPER PATTERN:

 The question paper will have ten questions.

 Each full Question consisting of 20 marks
 There will be 2 full questions (with a maximum of four sub questions) from each module.
 Each full question will have sub questions covering all the topics under a module.
 The students will have to answer 5 full questions, selecting one full question from each
module.

 TEXT BOOKS:

1. Fundamentals of Database Systems, Ramez Elmasri and Shamkant B. Navathe, 7th

Edition, 2017, Pearson.
2. Database Management Systems, Ramakrishnan, and Gehrke, 3rd Edition, 2014,
McGraw Hill

 REFERENCE BOOKS:

1. Silberschatz Korth and Sudharshan, Database System Concepts, 6th

Edition, Mc-GrawHill, 2013.
2. Coronel, Morris, and Rob, Database Principles Fundamentals of
Design, Implementation and Management, Cengage Learning 2012.
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

Problem Solving using Python

Course Code 22AD44 CIE Marks 50
Number Lecture Hour/Week L T P TOTAL SEE Marks 50
3 0 0 3
Number of Lecture Hours 40 Exam Hours 03
Credits-03

Course Objectives: This course will enable students to

 Learn the syntax and semantics of Python programming language.
 Illustrate the process of structuring the data using lists, tuples and dictionaries.
 Demonstrate the use of built-in functions to navigate the file system.
 Implement the Object-Oriented Programming concepts in Python.
 Appraise the need for working with various documents like Excel, PDF, Word and Others

MODULE TEACHING RBT

TOPICS
NO. HOURS LEVEL

Basics of Python Programming:

Features of Python, History of Python, The Future of Python,
Writingand Executing First Python, Literal Constants, Variables and
Identifiers, Data Types, Input Operation, Reserved Words, Indentation,
Operators and Expressions, Expressions in Python, Operations on
1 Strings, Other Data Types, Type Conversion. 8 L1, L2
Decision Control Statements:
Introduction, Selection statements, Iterative Statements, Nested Loops,
Jump statements, the else Statement used with Loops.

Functions and Modules:

Introduction, Function Definition, Function Call, Variable Scope and
Lifetime, the return statement, More on Defining Functions, Lambda
Functions or Anonymous Functions, Documentation Strings, Good
Programming Practices, Recursive Functions, Modules, Packages in
Python, Standard Library modules, Globals (), Locals (), Reload (),
2 Function Redefinition. 8 L1, L2,
L3
Python Strings Revisited:
Concatenating, Appending, and Multiplying Strings, Strings are
Immutable, String Formatting Operator, Built-in String Methods and
Functions, Slice Operation, Specifying Stride While Slicing Strings,
ord() and chr ( ) Functions , in and not in operators, Comparing Strings,
Iterating String, The String Module, Regular Expressions,
Metacharacters in Regular Expression.
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

File Handling:
Introduction, File Path, Types of Files, Opening and Closing Files,
Reading and Writing Files, File Positions, Renaming and Deleting
3 Files, Directory Methods.
8 L1, L2, L3
Data Structures:
Sequence, Lists, Functional Programming, Tuple, Sets, Dictionaries.

Classes and Objects:

Classes and Objects, Class Method and Self-Argument,
Constructor, Class Variables and Object Variables, Destructor,
Other Special Methods, Public and Private Data Members, Private
Methods, Built-in Functions to Check, Get, Set, and Delete Class
4 Attributes, Built-in Class Attributes, Garbage Collection, Class 8 L1, L2, L3
Methods, Static Methods.
Inheritance:
Introduction, Inheriting Classes in Python, Types of Inheritance,
Abstract Classes and Interfaces, Metaclass.
Polymorphism
Concept of Operator Overloading, Implementing Operator
Overloading, Overloading Miscellaneous Functions, Overriding the
Method.

Exception Handling:
Introduction to Errors and Exceptions, Handling Exceptions,
Multiple Except Blocks, Multiple Exceptions in a Single Block,
Except Block Without Exception, the else Clause, Raising
Exceptions, Instantiating Exceptions, Handling Exceptions in
Invoked Functions, Built-in and User-defined Exceptions, the
5 finally Block, Assertions in Python. 8 L1, L2, L3
NumPy:
Introduction to NumPy, Creating arrays, Indexing Arrays, Array
Transposition, Universal Array Function, Array Processing, Array
Input, and Output. Python Lists VS Numpy Arrays, Numpy –
ndarray, Data type Object (dtype) in NumPy Python
Pandas and Data Visualization:
Introduction, Series and Data Frames in pandas and Data
Visualization, perform a multitude of data operations in Python's
popular panda’s library including grouping, pivoting, joining,
Resolve common issues in broken or incomplete data sets
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

COURSE OUTCOMES: At the end of the course the student will be able to:

CO1 Demonstrate proficiency in handling of loops and creation of functions.

CO2 Identify the methods to create and manipulate lists, tuples and dictionaries
CO3 Discover the commonly used operations involving regular expressions and filesystem.
CO4 Interpret the concepts of Object-Oriented Programming as used in Python
CO5 Determine the need for scraping websites and working with CSV, JSON and otherfile formats.

Mapping of course outcomes with program outcomes

22AD44 PO PO PO PSO PSO PSO

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9
10 11 12 1 2 3
CO1
3 2 3 - 2 - - - 2 2 - 2 3 - -
CO2 3 3 3 - 2 - - - 2 2 - 2 3 - -
CO3 3 3 3 - 2 - - - 2 2 - 2 3 - -
CO4 3 2 2 - 2 - - - 2 2 - 2 3 - -
CO5 3 3 3 - 3 - - - 2 2 - 2 3 - -
Avg.
3.0 2.6 2.8 - 2.2 - - - 2.0 2.0 - 2.0 3.0 - -
Mapping

QUESTION PAPER PATTERN:

 The question paper will have ten questions.
 Each full Question consisting of 20 marks
 There will be 2 full questions (with a maximum of four sub questions) from each module.
 Each full question will have sub questions covering all the topics under a module.
 The students will have to answer 5 full questions, selecting one full question from each
module

 TEXT BOOKS:

1. Reema Thareja, Python Programming: Using Problem Solving Approach,

Oxford Uuniversity press 2nd edition.
2. Al Sweigart,“Automate the Boring Stuff with Python”,1stEdition, No Starch Press,
2015. (Available under CC-BY-NC-SA license athttps://automatetheboringstuff.com/)
(Chapters 1 to 18)
3. Allen B. Downey, “Think Python: How to Think Like a Computer Scientist”, 2nd
Edition, Green Tea Press, 2015. (Available under CC-BY-NC license
athttp://greenteapress.com/thinkpython2/thinkpython2.pdf) chapters 13, 15, 16, 17,
18) (Download pdf/html files from the above links)
4. B.S. Grewal: Higher Engineering Mathematics, Khanna Publishers, 43rd Ed., 2015.
5. E. Kreyszig: Advanced Engineering Mathematics, John Wiley & Sons,10th
Ed., 2015.
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

 REFERENCE BOOKS:
1. N.P.Bali and Manish Goyal: A Text Book of Engineering Mathematics,
Laxmi Publishers , 7th Ed., 2010.
2. B.V.Ramana: "Higher Engineering Mathematics" Tata McGraw-Hill, 2006.
3. H. K. Dass and Er. Rajnish Verma: "Higher Engineering Mathematics", S.
Chand publishing, 1st edition, 2011.
4. Gowrishankar S, Veena A, “Introduction to Python Programming”, 1st Edition, CRC
Press/Taylor & Francis, 2018. ISBN-13: 978-0815394372
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

Principles of Artificial Intelligence

Course Code 22AD45 CIE Marks 50
Number Lecture Hour/Week L T P TOTAL SEE Marks 50
3 0 0 3
Number of Lecture Hours 40 Exam Hours 03
Credits-03

Course Objectives: This course will enable students to

 Gain a historical perspective of AI and its foundations.
 Become familiar with basic principles of AI toward problem solving.
 Get to know approaches of inference, perception, Uncertain Knowledge and Reasoning.
 Explore methods for representing knowledge in AI systems.
 Define and understand the concept and architecture of expert systems.

MODULE TOPICS TEACHING RBT

NO. HOURS LEVELS
Artificial Intelligence Fundamentals: Introduction, history of
Artificial Intelligence, Intelligent Systems: Category of Intelligent
System. The foundation of Artificial Intelligence, Sub-Areas of
1 Artificial Intelligence, Applications of Artificial Intelligence. 8 L1, L2
Intelligent Agents: Agents and Environments, rationality, the nature of
Environments, properties of Environments, structure of Agents, types of
Agents.

Problem Solving by Searching: Problem Solving Agents: Definition

of problems, characteristics, examples: Real world problems. Searching
for solutions. L1, L2,
2 Uninformed Search Strategies: Breadth First Search, Depth First 8
L3
Search, Iterative Deepening Depth First Search, Bidirectional Search.
Informed Search Strategies: Greedy Best First Search, A* Algorithm,
Hill Climbing, Constraint satisfaction.

Logical agents: Knowledge based Agents, the Wumpus world, Logic,

Propositional Logic, Propositional theorem proving:
First order logic: Syntax and semantics of FOL, Knowledge L1, L2,
3 Engineering in FOL: Knowledge Engineering process, 8
L3
Inference in first order logic: propositional vs. first order inference,
Unification, simple forward chaining algorithm, Backward chaining
algorithm.

Knowledge Representation: Introduction, approaches to Knowledge

Representation, issues in Knowledge Representation, Knowledge L1, L2,
4 8
Representation using Semantic Network, extended semantic network for L3
Knowledge Representation, Knowledge Representation using Frames.
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

Expert Systems: Introduction, phases in building expert systems, L1, L2,

5 architecture, expert systems vs traditional system, rule based expert 8
L3
systems, black board system, truth maintenance system, applications.

COURSE OUTCOMES: At the end of the course the student will be able to:

CO1 Apply knowledge of agent architecture, searching and reasoning techniques for different applications.
CO2 Analyse Searching and Inferencing Techniques.
CO3 Develop knowledge base sentences using propositional logic and first order logic.
CO4 Demonstrating agents, searching and inferencing.
CO5 Illustrate the application of probability in uncertain reasoning.

Mapping of course outcomes with program outcomes

22AD45 PO PO PO PS0 PSO PSO

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9
10 11 12 1 2 3
CO1 - - - - - - 2 3 - -
3 2 3 - 2
CO2 - - - - - - 2 3 - -
3 3 3 - 2
CO3 - - - - - - 2 3 - -
3 3 3 - 2
CO4 - - - - - - 2 3 - -
3 2 2 - 2
CO5 - - - - - - 2 3 - -
3 3 3 - 3
Avg. - - - - - - 2.0 3.0 - -
3.0 2.6 2.8 - 2.2
Mapping

 QUESTION PAPER PATTERN:

 The question paper will have ten questions.

 Each full Question consisting of 20 marks
 There will be 2 full questions (with a maximum of four sub questions) from each module.
 Each full question will have sub questions covering all the topics under a module.
 The students will have to answer 5 full questions, selecting one full question from each
module.

 TEXT BOOKS:

1. Stuart J. Russell and Peter Norvig , Artificial Intelligence Modern Approach, 4th edition,
Pearson,2022
2. Elaine Rich, Kevin Knight, Artificial Intelligence, 3rd edition,Tata McGraw Hill,2013
3. Saroj Kaushik, “Artificial Intelligence” Cengage Publication, 2nd Edition, 2023.
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

 REFERENCE BOOKS:
1. George F Lugar, Artificial Intelligence Structure and strategies for complex, Pearson
Education, 5th edition, 2011.
2. Nils J.Nilsson, “Principles of Artificial Intelligence”, Elsevier, 1980.
3. Krishan Mehrotra, Chilkuri K. Mohan, Sanjay Ranka, “Artificial Neural Networks”,
Penram International Publishing, 1997.
4. Nils J. Nilsson, “Principles of Artificial Intelligence”, Narosa Publishing House.
5. Eugene Charnaik, Drew McDermott, “Introduction to Artificial Intelligence”,Pearson
Education Asia ,2008
6. Dan W. Patterson, “Artificial Intelligence and Expert Systems”, Prentice Hall of
India.
7. G. Luger, “Artificial Intelligence: Structures and Strategies for complex problem
Solving”, Pearson Education, Fourth Edition-2002.
8. D W Rolston, "Artificial Intelligence and Expert Systems”, Mc Graw Hill.

 JOURNALS/MAGAZINES:
1. https://opensky.ucar.edu/islandora/object/articles:21155
2. https://cs.cit.ie/contentfiles/PDFs/MScFlyers/MScAI_FT.pdf
3.https://www.enterrasolutions.com/news/trends-predictions-2017-digital-transformation-2
4.https://www.wsj.com/articles/readers-beware-ai-has-learned-to-create-fake-news-stories
11571018640.

 SWAYAM/NPTEL/MOOCs:
1. https://medium.com/javarevisited/10-best-udemy-and-coursera-courses-to-learn-
artificial-intelligence-in-2020-ec77ad13bdc1
2. https://javarevisited.blogspot.com/2020/08/top-10-coursera-courses-and-certification-
for-artificial-intelligenceand-machine-learning.html#axzz6jQ05pXOG.
3. https://www.kdnuggets.com/2019/11/10-free-must-read-books-ai.html
4. https://www.udacity.com/course/knowledge-based-ai-cognitive-systems--ud409
5. https://nptel.ac.in/courses/106/105/106105077/
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

Design and Analysis of Algorithms Lab

Course Code 22ADL46 CIE Marks 50
Number Lecture Hour/Week L T P TOTAL SEE Marks 50
0 0 2 2
Number of Lecture Hours 30 Exam Hours 03
Credits-01

Course Objectives: This course will enable students to

 Understand the various sorting algorithms.
 Explore various algorithm design paradigms, such as divide and conquer, dynamicprogramming, and
greedy algorithms and apply it solve the problems.
 Explore techniques for bounding the solution space to eliminate subproblems that cannotlead to an
optimal solution.
 Find the most efficient way to connect all vertices in a graph while minimizing the total

Implement the following problem statements using C / Java in Windows/Linux operatingsystem.

1. Design a program to search a key element of n integers using binary search algorithm
andcompute time complexity
2. Design a program to Sort a given set of n integer elements using Quick Sort method
andcompute its time complexity.
3. Design a program to sort set of n integer elements using Merge Sort method and compute itstime
complexity.
4. Implement the 0/1 Knapsack problem using (a) Dynamic Programming method (b) Greedymethod.
5. Design a program to print all the node reachable from a given starting node in a given digraphusing
DFS method.
6. Write a program to find the shortest paths from source vertex to other vertices using Dijkstra's
algorithm.

7. Write a program to find a Minimum Cost Spanning Tree of a given connected undirectedgraph
using (a) Kruskal's algorithm (b) Prim’s algorithm.
8. Write a program to
a. Implement All-Pairs Shortest Paths problem using Floyd's algorithm.
b. Implement transitive closure using Warshall’s Algorithm.
9. Implement a program to find a sum of subset problem.
10. Implement Travelling Salesman problem using Dynamic programming.

COURSE OUTCOMES: At the end of the course the student will be able to:

CO1 Design and implement sorting and searching algorithms.

CO2 Design and implement shortest path algorithms
CO3 Design and implement algorithms using dynamic programming and greedy strategies for optimization
problems.
CO4 Design and implement algorithms to find minimum spanning tree for the graph.
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

Assessment Details (both CIE and SEE):

The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%. The
minimum passing mark for the CIE is 40% of the maximum marks (20 marks). A student shall be deemed to
have satisfied the academic requirements and earned the credits allotted to each course. The student has to
secure not less than 35% (18 Marks out of 50) in the semester-end examination (SEE).

Continuous Internal Evaluation (CIE):

 CIE marks for the practical course is 50 Marks. The split-up of CIE marks for record/ journal and test
are in the ratio 60:40.
 Each experiment to be evaluated for conduction with observation sheet and record write-up. Rubrics for
the evaluation of the journal/write-up for hardware/software experiments designed by the faculty who is
handling the laboratory session and is made known to students at the beginning of the practical session.
 Record should contain all the specified experiments in the syllabus and each experiment write-up will
be evaluated for 10 marks.
 Total marks scored by the students are scaled downed to 30 marks (60% of maximum marks).
 Weightage to be given for neatness and submission of record/write-up on time.
 In each test, test write-up, conduction of experiment, acceptable result, and procedural knowledge will
carry a weightage of 60% and the rest 40% for viva-voce.
Semester End Evaluation (SEE):
 SEE marks for the practical course is 50 Marks.
 SEE shall be conducted jointly by the two examiners, examiners are appointed by the University.
 All laboratory experiments are to be included for practical examination.
 Breakup of marks and the instructions printed on the cover page of the answer script to be strictly
adhered to by the examiners.
 Students can pick one question / experiment, from the questions lot prepared by the internal /external
examiners jointly.
 Evaluation of test write-up/ conduction procedure and result/viva will be conducted jointly by examiners.
 General rubrics suggested for SEE are mentioned here, writeup-20%, Conduction procedure and result
in -60%, Viva-voce 20% of maximum marks. SEE for practical shall be evaluated for 100 marks and
scored marks shall be scaled down to 50 marks (however, based on course type, rubrics shall be
decided by the examiners).
 Change of experiment is allowed only once and Marks allotted to the procedure part to be made zero.
Suggested Learning Resources:
● Introduction to the Design and Analysis of Algorithms, Anany Levitin:, 2nd Edition, 2009. Pearson.
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

Introduction to Database Management System Lab

Course Code 22ADL47 CIE Marks 50
Number Lecture Hour/Week L T P TOTAL SEE Marks 50
0 0 2 2
Number of Lecture Hours 30 Exam Hours 03
Credits-01

Course Objectives: This course will enable students to

 Provide a strong foundation in database concepts, technology, and practice
 Practice SQL programming through a variety of database problems.
 Provide skills in retrieving and manipulating data stored in databases using SQL queries.
 Design and build database applications for real world problems
 Learn techniques for generating reports from databases, including the use of SQL queries and reporting
tools.

Implement the following problem statements using SQL in Windows system.

LIBRARY DATABASE
1. Demonstrating creation of tables, applying the view concepts on the tables.

Consider the following schema for a Library Database:

 BOOK(Book_id, Title, Publisher_Name, Pub_Year)

 BOOK_AUTHORS(Book_id, Author_Name)
 PUBLISHER(Name, Address, Phone)
 BOOK_COPIES(Book_id, Programme_id, No-of_Copies)
 BOOK_LENDING(Book_id, Programme_id, Card_No, Date_Out, Due_Date)
 LIBRARY_PROGRAMME(Programme_id, Programme_Name,
Address) Write SQL queries to:

1. Retrieve details of all books in the library – id, title, name of publisher, authors, number of copies in
each Programme, etc.
2. Get the particulars of borrowers who have borrowed more than 3 books, but from Jan 2022 to Jun 2022.
3. Delete a book in BOOK table. Update the contents of other tables to reflect this data
manipulation operation.
4. Partition the BOOK table based on year of publication. Demonstrate its working with a simple
query. Create a view of all books and its number of copies that are currently available in the library.
ORDER DATABASE:
2. Discuss the various concepts on constraints and update operations.

Consider the following schema for Order Database:

 SALESMAN(Salesman_id, Name, City, Commission)

 CUSTOMER (Customer_id, Cust_Name, City, Grade, Salesman_id)
 ORDERS (Ord_No, Purchase_Amt, Ord_Date, Customer_id, Salesman_id)
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

Write SQL queries to:

1. Count the customers with grades above Bangalore’s average.
2. Find the name and numbers of all salesman who had more than one customer.
3. List all the salesman and indicate those who have and do not have customers in their cities (Use
UNION operation.)
4. Create a view that finds the salesman who has the customer with the highest order of a day.
Demonstrate the DELETE operation by removing salesman with id 1000. All his orders must also be
deleted.
MOVIE DATABASE

3. Demonstrate the concepts of JOIN operations.

Consider the schema for Movie Database:

 ACTOR (Act_id, Act_Name, Act_Gender)

 DIRECTOR (Dir_id, Dir_Name, Dir_Phone)
 MOVIES (Mov_id, Mov_Title, Mov_Year, Mov_Lang, Dir_id)
 MOVIE_CAST (Act_id, Mov_id, Role)
 RATING (Mov_id, Rev_Stars)

Write SQL queries to:

1. List the titles of all movies directed by ‘Hitchcock’.
2. Find the movie names where one or more actors acted in two or more movies.
3. List all actors who acted in a movie before 2000 and in a movie after 2015 (use JOIN operation).
4. Find the title of movies and number of stars for each movie that has at least one rating and find
the highest number of stars that movie received. Sort the result by movie title.
5. Update rating of all movies directed by ‘Steven Spielberg’ to 5.

COLLEGE DATABASE

4. Introduce concepts of PLSQL and usage on the table.

Consider the schema for College Database:

 STUDENT (USN, SName, Address, Phone, Gender)

 SEMSEC (SSID, Sem, Sec)
 CLASS (USN, SSID)
 COURSE (Subcode, Title, Sem, Credits)
 IAMARKS (USN, Subcode, SSID, Test1, Test2, Test3, FinalIA)

Write SQL queries to:

1. List all the student details studying in fourth semester ‘C’ section.
2. Compute the total number of male and female students in each semester and in each section.
3. Create a view of Test1 marks of student USN ‘1BI15CS101’ in all Courses.
4. Calculate the Final IA (average of best two test marks) and update the corresponding table for
all students.
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

5. Categorize students based on the following criterion:

If FinalIA = 17 to 20 then CAT = ‘Outstanding’
If FinalIA = 12 to 16 then CAT =
‘Average’ If FinalIA< 12 then CAT =
‘Weak’
Give these details only for 8th semester A, B, and C section students.

COMPANY DATABASE

5. Demonstrate the core concepts on table like nested and correlated nested queries and also EXISTS
and NOT-EXISTS keywords.

Consider the schema for Company Database:

 EMPLOYEE(SSN, Name, Address, Sex, Salary, SuperSSN, DNo)

 DEPARTMENT(DNo, DName, MgrSSN, MgrStartDate)
 DLOCATION(DNo,DLoc)
 PROJECT(PNo, PName, PLocation, DNo)
 WORKS_ON(SSN, PNo, Hours)

Write SQL queries to:

1. Make a list of all project numbers for projects that involve an employee whose last name is ‘Scott’, either
as a worker or as a manager of the department that controls the project.
2. Show the resulting salaries if every employee working on the ‘IoT’ project is given a 10 percent raise.
3. Find the sum of the salaries of all employees of the ‘Accounts’ department, as well as the maximum
salary, the minimum salary, and the average salary in this department.
4. Retrieve the name of each employee who works on all the projects controlled by department number 5
(use NOT EXISTS operator).
5. For each department that has more than five employees, retrieve the department number and the number
of
its employees who are making more than Rs. 6,00,000.

COURSE OUTCOMES: At the end of the course the student will be able to:

CO1 Demonstrate the Basics Concepts and SQL Queries of Database Management System.
CO2 Apply the Conceptual Design Model and Database Hierarchical Structure to construct the real- world
requirement.
CO3 Analyze the various constraints to populate the database through SQL Queries.
CO4 Implement different working concepts of DBMS using SQL Queries.
CO5 Present the result of database creation and querying process, document it.

Assessment Details (both CIE and SEE):

The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%. The
minimum passing mark for the CIE is 40% of the maximum marks (20 marks). A student shall be deemed to
have satisfied the academic requirements and earned the credits allotted to each course. The student has to
secure not less than 35% (18 Marks out of 50) in the semester-end examination (SEE).
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

Continuous Internal Evaluation (CIE):

 CIE marks for the practical course is 50 Marks. The split-up of CIE marks for record/ journal and test
are in the ratio 60:40.
 Each experiment to be evaluated for conduction with observation sheet and record write-up. Rubrics for
the evaluation of the journal/write-up for hardware/software experiments designed by the faculty who is
handling the laboratory session and is made known to students at the beginning of the practical session.
 Record should contain all the specified experiments in the syllabus and each experiment write-up will
be evaluated for 10 marks.
 Total marks scored by the students are scaled downed to 30 marks (60% of maximum marks).
 Weightage to be given for neatness and submission of record/write-up on time.
 In each test, test write-up, conduction of experiment, acceptable result, and procedural knowledge will
carry a weightage of 60% and the rest 40% for viva-voce.
Semester End Evaluation (SEE):
 SEE marks for the practical course is 50 Marks.
 SEE shall be conducted jointly by the two examiners, examiners are appointed by the University.
 All laboratory experiments are to be included for practical examination.
 Breakup of marks and the instructions printed on the cover page of the answer script to be strictly
adhered to by the examiners.
 Students can pick one question / experiment, from the questions lot prepared by the internal /external
examiners jointly.
 Evaluation of test write-up/ conduction procedure and result/viva will be conducted jointly by examiners.
 General rubrics suggested for SEE are mentioned here, writeup-20%, Conduction procedure and result
in -60%, Viva-voce 20% of maximum marks. SEE for practical shall be evaluated for 100 marks and
scored marks shall be scaled down to 50 marks (however, based on course type, rubrics shall be
decided by the examiners).
 Change of experiment is allowed only once and Marks allotted to the procedure part to be made zero.

Suggested Learning Resources:

● Fundamentals of Database Systems, Ramez Elmasri and Shamkant B. Navathe, 7th Edition,
2017, Pearson.
● Database management systems, Ramakrishnan, and Gehrke, 3rd Edition, 2014, McGraw Hill.
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

Python Programming
Lab
Course Code 22ADL48 CIE Marks 50
Number Lecture Hour/Week L T P TOTAL SEE Marks 50
0 0 2 2
Number of Lecture Hours 30 Exam Hours 03
Credits-01

Course Objectives: This course will enable students to

 To be able to introduce core programming basics and program design with functions using Python
programming language.
 To understand a range of Object-Oriented Programming, as well as in-depth data and information
processing techniques.
 To understand the high-performance programs designed to strengthen the practical expertise.
 Implement Object Oriented Programming concepts in Python.

Implement the following problem statements using Python in Windows/Linux operating system.
1. (a) Write a program to display data of different types using variables and literals.
(b) Write a program to implement shift operators.
(c) Write a program to create, concatenate and print a string and access a sub-
string from a given string.
(d) Write a program to find the area of circle.
2. (a) Write a program to find whether the given number is even or odd.
(b) Write a program to convert the characters from uppercase to lowercase and vice versa.
(c) Write a program to find the sum and average of first n numbers.
(d) Write a program to implement switch statement.
3. (a) Write a program to swap two numbers using functions.
(b) Write a program to print the Fibonacci series using recursion.
(c) Write a program to demonstrate slice operations on string objects.
(d) Write a program that uses a regular expression to pluralize a word.
4. (a) Write a program to print the first 10 characters of the file.
(b) Write a program that reads data from a file and calculates the percentage of vowels
and consonants in the file.
(c) Write a program that generates a Quiz and uses two files [Questions.txt and Answer.txt]
The program opens Questions.txt file and reads a question and displays the questions with
options on the screen. The program then opens Answer.txt file and displays the correct
answers.
(d) Write a program to display all contents of the current directory.
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

5. (a) Write a program to create lists with different types of elements.

(b) Write a program to sort the list elements using bubble sort technique.
(c) Write a program to create a dictionary with cricket players names and scores in a
match. Also we are retrieving runs by entering the players name.
(d) Write a program to convert the elements of two lists into key-value pairs of a dictionary.
6. (a) Write a program to calculate the gross salary and net salary of an employee.
(b) Write a program that generates a set of prime numbers and another set of odd
numbers. Demonstrate the result of union, intersection, difference and symmetric
difference operations on these sets.
(c) Write a program to insert a new element into a tuple of elements at a specified position.
(d) Write a program to modify or replace an existing element of a tuple with a new element.
7. (a) Write a program with class Employee that keeps a track of the number of employees in
an organization and also stores their name, designation and salary details.
(b) Write a program that has classes such Student, Course and Department. Enroll a
student in a course of particular department.
8. (a) Write a program that overloads the + operator to add two objects of class matrix.
(b) Write a program to create abstract class and sub classes which implements the
abstract method of the abstract class.
9. (a) Write a program to handle exceptions.
(b) Write a program that validates name and age as entered by the user to determine
whether the person can cast vote or not.
10. Write a program using modules and python Standard Libraries (pandas, Numpy, Matplotlib, Scipy).

COURSE OUTCOMES: At the end of the course the student will be able to:

CO1 Examine Python syntax and semantics and be fluent in the use of Python flow control and functions.
CO2 Demonstrate proficiency in handling Strings and File Systems.
CO3 Create, run and manipulate Python Programs using core data structures like Lists, Dictionaries and
use Regular Expressions.
CO4 Interpret the concepts of Object-Oriented Programming as used in Python.

Assessment Details (both CIE and SEE):

The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%.
The minimum passing mark for the CIE is 40% of the maximum marks (20 marks). A student shall be deemed
to have satisfied the academic requirements and earned the credits allotted to each course. The student has to secure
not less than 35% (18 Marks out of 50) in the semester-end examination (SEE).
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

Continuous Internal Evaluation (CIE):

 CIE marks for the practical course is 50 Marks. The split-up of CIE marks for record/ journal and test
are in the ratio 60:40.
 Each experiment to be evaluated for conduction with observation sheet and record write-up. Rubrics
for the evaluation of the journal/write-up for hardware/software experiments designed by the faculty who is
handling the laboratory session and is made known to students at the beginning of the practical session.
 Record should contain all the specified experiments in the syllabus and each experiment write-up will be
evaluated for 10 marks.
 Total marks scored by the students are scaled downed to 30 marks (60% of maximum marks).
 Weightage to be given for neatness and submission of record/write-up on time.
 In each test, test write-up, conduction of experiment, acceptable result, and procedural knowledge will
carry a weightage of 60% and the rest 40% for viva-voce.
Semester End Evaluation (SEE):
 SEE marks for the practical course is 50 Marks.
 SEE shall be conducted jointly by the two examiners, examiners are appointed by the University.
 All laboratory experiments are to be included for practical examination.
 Breakup of marks and the instructions printed on the cover page of the answer script to be strictly adhered
to by the examiners.
 Students can pick one question / experiment, from the questions lot prepared by the internal /external
examiners jointly.
 Evaluation of test write-up/ conduction procedure and result/viva will be conducted jointly by examiners.
 General rubrics suggested for SEE are mentioned here, writeup-20%, Conduction procedure and result
in -60%, Viva-voce 20% of maximum marks. SEE for practical shall be evaluated for 100 marks and
scored marks shall be scaled down to 50 marks (however, based on course type, rubrics shall be
decided by the examiners).
 Change of experiment is allowed only once and Marks allotted to the procedure part to be made zero.

Suggested Learning Resources:

● Reema Thareja, Python Programming: Using Problem Solving Approach, oxford university press 2nd
edition.

● Allen B. Downey, “Think Python: How to Think Like a Computer Scientist”, 2nd Edition, Green Tea
Pre 2015. (Available under CC-BY-NC license athttp://greenteapress.com/thinkpython2/thinkpython2.pdf)
chapters 13, 15, 16, 17,18) (Download pdf/html files from the above links)
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

Universal Human Values

Course Code 22UHV410 CIE Marks 50
Number Lecture Hour/Week L T P TOTAL SEE Marks 50
3 0 0 3
Number of Lecture Hours 40 Exam Hours 02
Credits-03

Course Objectives: This course will enable students to

 To help the students appreciate the essential complementarity between 'VALUES' and 'SKILLS' to
ensure sustained happiness and prosperity which are the core aspirations of all human beings.
 To facilitate the development of a Holistic perspective among students towards life and profession
as well as towards happiness and prosperity based on a correct understanding of the Human reality
and the rest of existence. Such a holistic perspective forms the basis of Universal Human Values
and movement towards value-based living in a natural way.
 To highlight plausible implications of such a Holistic understanding in terms of ethical human
conduct, trustful and mutually fulfilling human behaviour and mutually enriching interaction with
Nature.
 This course is intended to provide a much-needed orientational input in value education to the
young enquiring minds.

MODULE TEACHING RBT

TOPICS
NO. HOURS LEVELS

Introduction to Value Education: Understanding Value

Education, Self-exploration as the Process for Value Education,
1 Continuous Happiness and Prosperity – the Basic Human Aspirations, 08 L1, L2
Right Understanding, Relationship and Physical Facility,
Happiness and Prosperity – Current Scenario, Method to Fulfill the
Basic Human Aspirations.

Harmony in the Human Being Understanding Human being as

2 the Co-existence of the Self and the Body, Distinguishing between
the Needs of the Self and the Body, The Body as an Instrument of 08 L1, L2
the Self, Understanding Harmony in the Self, Harmony of the Self
with the Body, Programme to ensure self-regulation and Health.

Harmony in the Family and Society: Harmony in the Family – the

Basic Unit of Human Interaction, Values in Human-to-Human
3 Relationship, 'Trust' – the Foundational Value in Relationship, L1, L2, L3
08
'Respect' – as the Right Evaluation, Understanding Harmony in the
Society, Vision for the Universal Human Order.
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme
Harmony in the Nature/Existence: Understanding Harmony in the
Nature, Interconnectedness, self-regulation and Mutual Fulfillment
4 among the Four Orders of Nature, Realizing Existence as Co- 08 L1, L2, L3
existence at All Levels, The Holistic Perception of Harmony in
Existence.

Implications of the Holistic Understanding – A Look at

Professional Ethics:

Natural Acceptance of Human Values, Definitiveness of (Ethical) 08 L1, L2, L3

5 Human Conduct, A Basis for Humanistic Education, Humanistic
Constitution and Universal Human Order, Competence in
Professional Ethics, Holistic Technologies, Production Systems and
Management Models-Typical Case Studies, Strategies for Transition
towards Value-based Life and Profession.

COURSE OUTCOMES: At the end of the course the student will be able to:

CO1 To become more aware of themselves, and their surroundings (family, society, nature);
CO2 To become more responsible in life, and in handling problems with sustainable solutions, while
keeping human relationships and human nature in mind.
CO3 To have better critical ability.
CO4 To become sensitive to their commitment towards what they have understood (human values,
human relationship and human society).
CO5 To apply what they have learnt to their own self in different day-to-day settings in real life, at
least a beginning would be made in this direction.

 Text Book and Teachers Manual:

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

 Reference Books:
1. Jeevan Vidya: EkParichaya, A Nagaraj, Jeevan Vidya Prakashan, Amarkantak, 1999.
2. Human Values, A.N. Tripathi, New Age Intl. Publishers, New Delhi, 2004.
3. The Story of Stuff (Book).
4. The Story of My Experiments with Truth - by Mohandas Karamchand Gandhi
5. Small is Beautiful - E. F Schumacher.
6. Economy of Permanence - J C Kumarappa
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

JavaScript
Course Code 22AAD411A CIE Marks 50
Number Lecture Hour/Week L T P TOTAL SEE Marks 50
0 0 2 2
Number of Lecture Hours 30 Exam Hours 03
Credits-01

Course Objectives: This course will enable students to

 Understand the role of JavaScript in enhancing the interactivity and responsiveness of web pages.
 Understand scope, including global and local scope, and how it impacts variable accessibility.
 Learn to handle user interactions and events on web pages using event handlers.
 Understand the basics of working with objects in JavaScript.

Implement the following problem statements using Java Script in Windows/Linux operating system.
1. Write a program to create JavaScript to perform Arithmetic operations.
2. Write a program to create JavaScript to check if a number is Positive, Negative, or Zero.
3. Write a program to create JavaScript to Calculate the Area of a rectangle.
4. Write a program to handle exceptions in JavaScript code.
5. Write a program to create JavaScript to Swap two variables.
6. Write a program to create JavaScript object representing a student and include methods for calculating
GPA or displaying student details.
7. Write a Java Script to calculate Gross salary of an employee using classes and objects.
8. Write a program to demonstrate Event handling using HTML and JavaScript.
9. Write a program to demonstrate Matrix addition using JavaScript.
10. Write a program to create JavaScript to perform String operations.

COURSE OUTCOMES: At the end of the course the student will be able to:

CO1 Demonstrate an understanding of variables, functions, and control structures.

CO2 Implement event handling mechanisms in JavaScript code.
CO3 Implement error handling mechanisms to gracefully manage and handle exceptions in JavaScript
code.
CO4 Demonstrate string operations in JavaScript.

Assessment Details (both CIE and SEE):

The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%. The
minimum passing mark for the CIE is 40% of the maximum marks (20 marks). A student shall be deemed to
have satisfied the academic requirements and earned the credits allotted to each course. The student has to
secure not less than 35% (18 Marks out of 50) in the semester-end examination (SEE).
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

Continuous Internal Evaluation (CIE):

 CIE marks for the practical course is 50 Marks. The split-up of CIE marks for record/ journal and test
are in the ratio 60:40.
 Each experiment to be evaluated for conduction with observation sheet and record write-up. Rubrics for
the evaluation of the journal/write-up for hardware/software experiments designed by the faculty who is
handling the laboratory session and is made known to students at the beginning of the practical session.
 Record should contain all the specified experiments in the syllabus and each experiment write-up will
be evaluated for 10 marks.
 Total marks scored by the students are scaled downed to 30 marks (60% of maximum marks).
 Weightage to be given for neatness and submission of record/write-up on time.
 In each test, test write-up, conduction of experiment, acceptable result, and procedural knowledge will
carry a weightage of 60% and the rest 40% for viva-voce.
Semester End Evaluation (SEE):
 SEE marks for the practical course is 50 Marks.
 SEE shall be conducted jointly by the two examiners, examiners are appointed by the University.
 All laboratory experiments are to be included for practical examination.
 Breakup of marks and the instructions printed on the cover page of the answer script to be strictly
adhered to by the examiners.
 Students can pick one question / experiment, from the questions lot prepared by the internal /external
examiners jointly.
 Evaluation of test write-up/ conduction procedure and result/viva will be conducted jointly by examiners.
 General rubrics suggested for SEE are mentioned here, writeup-20%, Conduction procedure and result
in -60%, Viva-voce 20% of maximum marks. SEE for practical shall be evaluated for 100 marks and
scored marks shall be scaled down to 50 marks (however, based on course type, rubrics shall be
decided by the examiners).
 Change of experiment is allowed only once and Marks allotted to the procedure part to be made zero.

Suggested Learning Resources:

1. https://www.netacad.com/courses/programming/javascript-essentials-1
2. https://www.coursera.org/learn/javascript/lecture/EYX66/introduction-to-javascript
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

MongoDB
Course Code 22AAD411B CIE Marks 50
Number Lecture Hour/Week L T P TOTAL SEE Marks 50
0 0 2 2
Number of Lecture Hours 30 Exam Hours 03
Credits-01

Course Objectives: This course will enable students to

 Understand the basics of MongoDB, its architecture, and how it differs from traditional relational
databases.
 Scale horizontally by sharding data across multiple servers.
 Learn how to create and use indexes to optimize query performance in MongoDB.
 Understand the concepts of horizontal scaling and sharding to handle large datasets and increased
workloads.

Implement the following queries in Windows/Linux operating system.

1. Basic CRUD Operations:
 Create a new database and collection.
 Insert documents into the collection.
 Query documents using find.
 Update documents using update.
 Delete documents using remove.
2. Create and apply indexes on fields to improve query performance.
3. Use the aggregation framework to perform complex data transformations.
4. Design a schema for a specific application scenario.
5. Set up a text index and perform text searches using the $text operator.
6. Store and retrieve large files (e.g., images, videos) using GridFS.
7. Set up user accounts with different roles and permissions.
8. Set up a replica set and observe how data is replicated across nodes.
9. Set up a sharded cluster to horizontally scale your database.
10. Perform backups of your MongoDB database.

COURSE OUTCOMES: At the end of the course the student will be able to:

CO1 Gain a solid understanding of the principles and characteristics of NoSQL databases, with a focus on
MongoDB.
CO2 Query MongoDB using various operators and optimize query performance through the use of indexes.
CO3 Apply MongoDB's Aggregation Framework to perform complex data transformations and analysis.
CO4 Set up and manage MongoDB replica sets to ensure high availability and fault tolerance.
 SHARNBASVA UNIVERSITY, KALABURAGI
Outcome Based Education (OBE) and Choice Based Credit System
(CBCS) B.Tech. in Artificial Intelligence & Data Science (AI&DS) 2022-
Scheme

Assessment Details (both CIE and SEE):

The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%. The
minimum passing mark for the CIE is 40% of the maximum marks (20 marks). A student shall be deemed to
have satisfied the academic requirements and earned the credits allotted to each course. The student has to
secure not less than 35% (18 Marks out of 50) in the semester-end examination (SEE).

Continuous Internal Evaluation (CIE):

 CIE marks for the practical course is 50 Marks. The split-up of CIE marks for record/ journal and test
are in the ratio 60:40.
 Each experiment to be evaluated for conduction with observation sheet and record write-up. Rubrics for
the evaluation of the journal/write-up for hardware/software experiments designed by the faculty who is
handling the laboratory session and is made known to students at the beginning of the practical session.
 Record should contain all the specified experiments in the syllabus and each experiment write-up will
be evaluated for 10 marks.
 Total marks scored by the students are scaled downed to 30 marks (60% of maximum marks).
 Weightage to be given for neatness and submission of record/write-up on time.
 In each test, test write-up, conduction of experiment, acceptable result, and procedural knowledge will
carry a weightage of 60% and the rest 40% for viva-voce.
Semester End Evaluation (SEE):
 SEE marks for the practical course is 50 Marks.
 SEE shall be conducted jointly by the two examiners, examiners are appointed by the University.
 All laboratory experiments are to be included for practical examination.
 Breakup of marks and the instructions printed on the cover page of the answer script to be strictly
adhered to by the examiners.
 Students can pick one question / experiment, from the questions lot prepared by the internal /external
examiners jointly.
 Evaluation of test write-up/ conduction procedure and result/viva will be conducted jointly by examiners.
 General rubrics suggested for SEE are mentioned here, writeup-20%, Conduction procedure and result
in -60%, Viva-voce 20% of maximum marks. SEE for practical shall be evaluated for 100 marks and
scored marks shall be scaled down to 50 marks (however, based on course type, rubrics shall be
decided by the examiners).
 Change of experiment is allowed only once and Marks allotted to the procedure part to be made zero.
Textbooks:
1. Python Data Persistence With Sql And Nosql Database, Malhar Lathkar, Bpb Publications.
2. MongoDB: A Comprehensive Guide to NoSQL Databases, by Badal Tripathy.

Suggested e-Learning Resources:

1. https://www.youtube.com/watch?v=ExcRbA7fy_A&list=PL4cUxeGkcC9h77dJ-QJlwGlZlTd4ecZOA.
 SHARNBASVA UNIVERSITY,
ADDITIONAL MATHEMATICS – II
COMMON TO ALL BRANCHES
Course Code 22MATDIP41 CIE Marks 50
Contact Hours/Week 02 SEE Marks 00
Total Hours 25 Exam Hours 00
Semester IV Credits 00
Course Learning Objectives:
This course will enable students to:
• Solve first order differential equations. .
• Solve second and higher order differential equations.
• Understand and solve the partial differential equation.
• To acquire the knowledge of elementary probability theory.
• Know the basic concepts of evaluation of double and triple integrals.
Course Outcomes(COs):
After completion of course, the student will able to
CO# Course Outcomes POs PSOs
CO1 Apply the knowledge of differential equation of first order to 1, 2, 3
solve examples based on Newton’s law of cooling.
CO2 Solve second and higher order differential equations occurring in 1, 2, 3
of electrical circuits , damped/un-damped vibrations.
Explain the applications of Power series and obtain series
solution of ordinary differential equations.
CO3 Construct a variety of partial differential equations and solution 1, 2, 3

Apply the concept of change of order of integration 1, 2, 3

by exact Methods / method of separation of variables.

and variables to evaluate multiple integrals and their

CO4

usage in computing the area and volumes.

CO5 Apply the knowledge of Probability to solve the simple real life 1, 2, 3
problems
Bloom’s level of the course outcomes:
Bloom’s Level
CO# Remember Understand Apply Analyze Evaluate Create

√ √ √
(L1) (L2) (L3) (L4) (L5) (L6)

√ √ √
CO1

√ √ √
CO2

√ √ √
CO3

√ √ √
CO4
CO5
Course Articulation Matrix / Course mapping :
PO10

PO11

PO12

PSO1

PSO2

PSO3
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9

CO#

CO1 3 2 2 1 1 1
CO2 3 2 2 1 1 1
CO3 3 2 2 1 1 1

22MATDIP4
 CO4 3 2 2 1 1 1
SHARNBASVA UNIVERSITY,
CO5 3 2 2 1 1 1
Note: 1-Low mapped, 2-Medium mapped, 3-High mapped

MODULE-1: DIFFERENTIAL EQUATIONS - 1

Differential Equation-1: Solution of first order and first degree differential equations: Variable separable,
Homogeneous, Exact and Reducible to exact differential equation, Linear differential equation.
Applications of first order first degree differential equations: Newton’s law of cooling.

(RBT Levels: L1, L2 and L3 ) 5 Hours

Teaching – Learning Process Chalk and talk method / Power Point Presentation

MODULE-2: DIFFERENTIAL EQUATIONS - 2

Differential Equations-2: Solution of second & higher order Ordinary linear differential equation with
constant co-efficients. Method of variation of parameters. Solution of homogeneous LDE by Power series
solution Method.

(RBT Levels: L1, L2 and L3 ) 5 Hours

Teaching – Learning Process Chalk and talk method / Power Point Presentation

MODULE-3: PARTIAL DIFFERENTIAL EQUATIONS (PDE’s)

Partial Differential Equations(PDE’s): Formation of PDE by eliminating arbitrary constant & functions,
Solution of Non-homogeneous PDE by direct integration, solution of homogeneous PDE with respect to
one independent variable only. Derivation of one dimensional wave equation and heat equation and
Various possible solution of wave & heat equations by methods of separation of variables.

(RBT Levels: L1, L2 and L3 ) 5 Hours

Teaching – Learning Process Chalk and talk method / Power Point Presentation

MODULE-4: IMPROPER INTEGRALS

Improper Integrals: Beta and gamma functions and its properties and examples.
Evaluation of double integral over a specific region, changing the order of integration , changing into
polar form.

(RBT Levels: L1, L2 and L3 ) 5 Hours

Teaching – Learning Process Chalk and talk method / Power Point Presentation

MODULE-5: PROBABILITY
Probability: Introduction , Sample space and Events. Axioms of Probability, Addition & Multiplication
theorems. Conditional probability- illustrative examples. Baye’s theorem- examples.

(RBT Levels: L1, L2 and L3 ) 5 Hours

Teaching – Learning Process Chalk and talk method / Power Point Presentation

CIE + Assignments: 15+35=50 Marks

22MATDIP4
 SHARNBASVA UNIVERSITY,
There will be a 2 CIE’s, the best one among 2 CIE’s will be considered and there will be a 35 marks
for Assignments
Text Books:
1. B.S. Grewal : Higher Engineering Mathematics, Khanna Publishers, 43rd Ed., 2015.
2. E. Kreyszig : Advanced Engineering Mathematics, John Wiley & Sons, 10th Ed.(Reprint), 2016.
Reference books:
1. C.Ray Wylie, Louis C.Barrett : “Advanced Engineering Mathematics", 6th Edition,
2. McGraw-Hill Book Co., New York, 1995.
2. James Stewart : “Calculus –Early Transcendentals”, Cengage Learning India Private Ltd., 2017.
3. B.V.Ramana : "Higher Engineering Mathematics" 11th Edition, Tata McGraw-Hill, 2010.
4. Srimanta Pal & Subobh C Bhunia:“Engineering Mathematics”, Oxford University Press,3rd Reprint,2016.
5. Gupta C.B., Singh S.R. and Mukesh Kumar : “Engineering Mathematics for Semester I & II”,
Mc-Graw Hill Education (India) Pvt.Ltd., 2015.
Web links and Video Lectures:
1. http://nptel.ac.in/courses.php?disciplineID=111
2. http://www.class-central.com/subject/math
3. http://academicearth.org.

22MATDIP4