School of Engineering & Information

Technology

Study & Evaluation Scheme

of
B. Tech Computer Science and Engineering
(AIML)

Applicable w.e.f. Academic Session: 2025 -2026

As per the guidelines of UGC on Curriculum and Credit Framework for UG

programmes and National Education Policy-2020

SANSKRIT UNIVERSITY, MATHURA

 Study & Evaluation Scheme
Faculty Name and College Name Dr S Vairachilai & SOEIT
Department Computer Science & Engineering
B.Tech (CSE) in Artificial Intelligence &
Program
Machine Learning
Duration Four Years full time (Eight Semesters)
Medium English
Minimum Required Attendance 75%
Credits
Maximum Credits 168
Minimum Credits Required for UG Certificate 40
Minimum Credits Required for UG Diploma 80
Minimum Credits Required for 3-year UG
120
Degree
Minimum Credits Required for 4-year UG
168
Degree (Honours)
Minimum Credits Required for 4-year UG 168 including 12 credits from a research
Degree (Honours with Research) project/dissertation

Assessment:
Evaluation Internal External Total
Theory 20 80 100
Internal
Class Test-1 Class Test-2 Class Test-3 Assignment(s) Attendance & Total
Best two out of three Participation
10 10 10 10 10 40
Duration of Examination External Internal
3 Hours 1.5 Hours
To qualify for the course a student is required to secure a minimum of 45% marks in aggregate
including the semester end examination and teachers’ continuous evaluation. (i.e., both internal and
external). A candidate who secures less than 45% marks in a course shall be deemed to have failed
that course. The student should have at least 45% marks in aggregate to clear the semester.
 SANSKRITI UNIVERSITY
Enroll. No
Mathura, Uttar Pradesh

Term – I Examinations February-2025

Course Code: XXX YYY Course Name: Machine Learning
Name of School: School of Engineering and Information Technology
Programme: B Tech Semester: IV
Time: 60 Minutes Max. Marks:20

PART – A (6 questions X 1 marks = 6 Marks)

Answer ALL the Questions

1. Very Short Answers/Multiple Choice Questions Marks Module BT CO

No Level
Which of the following are categorical data types?
a. (i) Gender (ii) Eye color (iii) Temperature (iv) Height [1] 1 K1 1
Which evaluation metrics are used for classification models? (i)
Accuracy (ii) F1-score (iii) R-squared (iv) Mean Squared Error
(MSE)
A well-defined learning problem consists of which three
c components? [1] 2 K1 2
(i) Task (T) (ii) Experience (E) (iii) Algorithm (A) (iv) Performance
Measure (P)

d Which of the following metrics can be applied in linear regression to [1] 2 K2 2

compare the model? (i)RMSE (ii)MSE (iii)Precision
(iv)Recall

e Complete homogeneous sample has an entropy value ------------ [1] 1 K2 1

a)1 b)100 c)50 d)0

f How many dependent variables are used in multiple regression? [1] 1 K3 1

PART – B (3 questions X 2 marks = 6 Marks)

(Short Answer Type Questions)

2. Suppose that we have N independent variables (X1,X2… Xn) and [2] 2 K1 2

dependent variable is Y. Now imagine that you are applying linear
regression by fitting the best fit line using least square error on this
data. You found that correlation coefficient for one of its variable
(Say X1) with Y is 1.00.

Which of the following is true for X1?

a. Relation between the X1 and Y is weak
b. Relation between the X1 and Y is strong
c. Relation between the X1 and Y is very strong
d. Relation between the X1 and Y is very weak

If the slope of the regression line is calculated to be 2.5 and

3. the intercept 16 then the value of Y when X is 4 is ________ [2] 2 K2 2
What kind of data is shown in the diagram?
4. [2] 1 K2 1
 a) Linearly Separable Data
b) Non-Linearly Separable Data
c) Not a data
d) Linearly Separable Data & Non-Linearly Separable Data

PART – C (2 questions X 4 marks = 8 Marks)

Answer any Two out of Three Questions

Find linear regression equation for the following given data
5. X Y [4] 2 K2 1
2 3
4 7
6 5
8 10

Use the estimated regression equation calculate in (from the

6. question 5), If x=23, find the value for y. [4] 1 K2 1
The given data set represents the speed of a car based on Road
7. type, Obstruction, Speed. Study this data set and create a [4] 1 K2 2
Decision Tree that classifies the speed of a car
(Dependent/Parent variable) as either slow or fast, depending
on the following Predictor/Independent/Children variables.
BT – Bloom’s Taxonomy
K1 – Remember, K2-Understand, K3-Apply, K4-Analyse, K5-Evaluate
CO – Course Outcome

IMPORTANT NOTES:

1 The purpose of examination should be an assessment of the Course Outcomes (COs) that
will ultimately lead to the attainment of Programme Specific Outcomes (PSOs). A question
paper must assess the following aspects of learning: Remembering, Understanding,
Applying, Analyzing, Evaluating and Creating (Reference: Bloom’s Taxonomy).
2 Case Study is essential in every question paper (wherever it is being taught as a part of
pedagogy) for evaluating higher-order learning. Not all the courses might have case teaching
method used as pedagogy.
3 There shall be continuous evaluation of the student and there will be a provision of
forthright progress report.
 Programme Structure of B.Tech CSE (AIML)
Introduction: The B.Tech in Computer Science and Engineering with a specialization in
Artificial Intelligence and Machine Learning (AIML) is a four-year undergraduate program
designed to equip students with strong foundational knowledge in computer science, along with
specialized skills in AI and ML. This program focuses on building intelligent systems using
advanced algorithms, data analysis, deep learning, natural language processing, computer
vision, and related technologies. It combines core computer science principles with practical
applications of AI/ML in real-world domains such as healthcare, finance, robotics, autonomous
systems, and smart devices. Graduates of this program are prepared for roles such as AI/ML
engineers, data scientists, research analysts, and software developers, and they are also well-
equipped to pursue higher studies or careers in cutting-edge technology industries.

B. Tech CSE (AIML)

Four-Year (8-Semester) Programme
Basic Structure
Minimum Credit
S. No. Type of Course Requirement
3-year UG 4-Year UG
1 Major Core Course (CC) 60 80
3 Minor Course 24 32
4 Multi-Disciplinary Course (MDC) 09 09
5 Ability Enhancement Courses (AEC) 08 08
6 Skill Enhancement Courses (SEC) 09 09
7 Value Added Courses (VAC) common for all UG 06 - 08 06 - 08
8 Summer Internship 02 - 04 02 - 04
9 Research Project / Dissertation - 12*
Total Credits 120 160

Note:*Honours students not undertaking research shall have to do 3 courses for 12 credits in lieu of
a research project/Dissertation.
 Distribution of Courses
Credits Total
No. of
Semester Course Type Credit Hours of Accumulated
Course
Semester Credits
CC 3 3x4 Hrs.=12
AEC 1 1x2 Hrs.=2
I VAC 1 1x2 Hrs.=2 20+2=22
SEC 1 1x2 Hrs.=2 Engineering
Minor Stream 1 1x4 Hrs.=4 Certificate
CC 3 3x4 Hrs.=12 (40+2)
AEC 1 1x2 Hrs.=2
II 20
VAC 1 1x2 Hrs.=2
Minor Stream 1 1x4 Hrs.=4
CC 3 3x4 Hrs.=12
AEC 1 1x2 Hrs.=2
III 20
VAC 1 1x2 Hrs.=2
Minor Stream 1 1x4 Hrs.=4 Engineering
CC 2 2x4 Hrs.=8 Diploma
AEC 1 1x2 Hrs.=2 (80+2)
IV SEC 1 1x3 Hrs.=3 20
MDC 1 1x3 Hrs.=3
Minor Stream 1 1x4 Hrs.=4
CC 2 2x4 Hrs.=8
VAC 1 1x2 Hrs.=2
SEC 1 1x3 Hrs.=3
V MDC 1 1x3 Hrs.=3 20+4
B.Sc.
Internship
Assessment
1 1x4 Hrs.=4 Engineering
Minor Stream 1 1x4 Hrs.=4 Degree
CC 3 3x4 Hrs.=12 (122+6)
SEC 1 1x3 Hrs.=3
VI 22
MDC 1 1x3 Hrs.=3
Minor Stream 1 1x4 Hrs.=4
CC 3 3x4 Hrs.=12
CC in Lieu of
VII 1 1x4 Hrs.=4 20
Research
B.Tech/B.E.
Minor Stream 1 1x4 Hrs.=4
Honours
CC 2 2x4 Hrs.=8
(162+6)
CC in Lieu of
VIII 2 2x4 Hrs.=8 20
Research
Minor Stream 1 1x4 Hrs.=4
CC 3 3x4 Hrs.=12
Research Project
VII 1 1x4 Hrs.=4 20 B.Tech/B.E.
/ Dissertation
Honours
Minor Stream 1 1x4 Hrs.=4
with
CC 2 2x4 Hrs.=8
Research
Research Project
VIII 1 1x8 Hrs.=8 20 (162+6)
/ Dissertation
Minor Stream 1 1x4 Hrs.=4
TOTAL CREDITS 162+6
CC-Core Course, AEC-Ability Enhancement Course, VAC-Value Added Course, SEC-Skill
Enhancement Course, MDC-Multi Disciplinary Course.

Course Details
Major (Core Courses) – 80 Credits
Course Type Cred
S.No. Course Title
Code L-T-P its
1. BIM 106 Programming with C for Problem Solving 3-0-0 3
2. BIM 154 Programming with C for Problem Solving Lab 0-0-2 1
3. BIM 104 Engineering Chemistry 3-0-0 3
4. BIM 152 Engineering Chemistry Lab 0-0-2 1
5. BIM 101 Engineering Mathematics - I 3-1-0 4
6. Object Oriented Programming with C++ 3-0-0 3
7. Object Oriented Programming with C++ Lab 0-0-2 1
8. BIM 102 Engineering Mathematics – II 3-1-0 4
9. PHY 101 Engineering Physics 3-0-0 3
10. PHY 151 Engineering Physics Lab 0-0-2 1
11. BIM 202 Object Oriented Programming using Java 3-0-0 3
12. BIM 252 Object Oriented Programming using Java Lab 0-0-2 1
13. CSE 203 Data Structures and Algorithms 3-0-0 3
14. CSE 253 Data Structures and Algorithms Lab 0-0-2 1
15. BIM 208 Probability and Statistics 3-1-0 4
16. BIM 206 Python Programming 2-0-0 2
17. BIM 254 Python Programming Lab 0-0-4 2
18. CSE 208 Database Management Systems 3-0-0 3
19. CSE 254 Database Management Systems Lab 0-0-2 1
20. BIM 307 Machine Learning 3-0-0 3
21. BIM 355 Machine Learning Lab 0-0-2 1
22. BIM 203 Operating Systems and Applications 3-0-0 3
23. BIM 251 Operating Systems and Applications Lab 0-0-2 1
24. BIM 207 Introduction to Artificial Intelligence 2-0-0 2
25. Data and Visual Analytics 2-0-0 2
26. BIM 401 Deep Learning 3-0-0 3
27. BIM 451 Deep Learning Lab 0-0-2 1
28. BIM 304 Natural Language Processing 3-0-0 3
29. BIM 352 Natural Language Processing Lab 0-0-2 1
30. Image and Video Processing 3-0-0 3
31. Image and Video Processing Lab 0-0-2 1
32. BIM 402 Recommender System 3-0-0 3
33. BIM 452 Recommender System Lab 0-0-2 1
34. BIM 406 Chatbot Development 3-0-0 3
35. BIM 454 Chatbot Development Lab 0-0-2 1
36. BIM 408 Computer Vision 3-0-0 3
37. BIM 456 Computer Vision Lab 0-0-2 1
38. BIM 405 R Programming 2-0-0 2
39. BIM 455 R Programming Lab 0-0-4 2
Core Course (In Lieu of Research)
1. BIM 412 Human Computer Interaction 3-1-0 4
2. Programming for Data Analytics 3-0-2 4
3. Social Media Analytics 3-0-2 4
4. Reinforcement Learning 3-0-2 4
5. AI System Design & Deployment 3-0-2 4
6. Big Data Analytics 3-0-2 4
7. Edge AI and IoT Integration 3-0-2 4
8. Ethics in AI 3-0-2 4
9. Intellectual Property Rights 3-0-2 4
 Minor Stream (Courses)
Minor- 32 credits [8 Courses from any one of the Minor Courses]
Course Type
Course Title Credits
Code LTP
Electronics and Computer Engineering (ECE)
1. Basic Electronics Engineering
3-0-0 3
2. Basic Electronics Engineering Lab
0-0-2 1
3. Fundamental of Electrical Engineering
3-0-0 3
4. Fundamental of Electrical Engineering
0-0-2 1
CSE 3-1-0 4
5.
205 Computer Organization & Architecture
CSE 3-1-0 4
6.
204 Theory of Automata and Formal Language
BIM 3-0-0 3
7.
205 Computer Networks and Applications
BIM 0-0-2 1
8.
253 Computer Networks and Applications Lab
BIM 3-0-0 3
9.
303 Introduction to Web Technology
BIM 0-0-2 1
10.
351 Introduction to Web Technology Lab
CSE 3-1-0 4
11.
301 Software Engineering
CSE 3-0-2 4
12.
403 Cryptography and Network Security
13. Mobile Computing
3-0-2 4
BIM Digital electronics and Logics Design 3-0-2 4
14. 110
15. Digital Image Processing
3-0-2 4
CSE 3-0-2 4
16. 312 Internet of Things
17. Wireless Sensor Technology
3-0-2 4
18. Minor / Research Project 0-0-8 4

Cyber Security (Cyb)

1. Information Theory for Cyber Security
3-1-0 4
2. Cyber Security Essentials
3-0-0 3
3. Cyber Security Essentials Lab
0-0-2 2
4. Data Encryption
3-1-0 4
5. Steganography and Digital Watermarking
3-1-0 4
6. Security Assessment and Risk Analysis
3-1-0 4
7. Database Security and Access Control
3-1-0 4
8. Ethical Hacking
3-0-0 3
9. Ethical Hacking Lab
0-0-2 2
10. Artificial Intelligence and Cyber Ethics
3-1-0 4
11. Cloud Security and Privacy 3-1-0 4
12. Minor / Research Project 0-0-8 4

Mechanical Engineering (ME)

MEE 3-0-2 4
1.
101 Basic Mechanical Engineering
2. Engineering Mechanics
3-0-2 4
BIM 3-0-2 4
3.
153 Engineering Graphics
MEE 3-0-2 4
4.
205 Engineering Thermodynamics
BIM 3-0-2 4
5.
156 Workshop Technology
6. Advance Manufacturing Processes
3-0-2 4
7. Machine tools and Design
3-0-2 4
MEE 3-0-2 4
8.
306 CAD/CAM/CIM
RER 3-0-2 4
9.
101 Renewal Energy Resources
MEE 3-0-2 4
10.
403 Refrigeration and Air conditioning
11. Industrial Automation
3-0-2 4
MEE 3-0-2 4
12.
401 Mechatronics
13. Minor / Research Project 0-0-8 4

Artificial Intelligence and Machine Learning

1. Fundamentals of AI and ML 3-0-2 4
2. Algorithm for Intelligent Systems 3-0-2 4
3. Data Visualization 3-0-2 4
BIM Machine Learning 3-0-2 4
4.
307
BIM Machine Learning Lab
5.
355
6. CSE 071 Artificial Neural Networks 3-0-2 4
7. Cognitive Analytics 3-1-0 4
BIM Computer Vision 3-0-2 4
8.
408
BIM Computer Vision Lab
9.
456
BIM Deep Learning 3-0-2 4
10.
401
BIM Deep Learning Lab
11.
451
12. CSE 340 Natural Language Processing 3-0-2 4
 BIM Natural Language Processing Lab
13.
352
BIM 3-0-2 4
14. Chatbot Development
406
BIM
15. Chatbot Development lab
454
16. Minor / Research Project 0-0-8 4

Blockchain Technology (BT)

1. Blockchain and Distributed Ledger Technology
3-0-2 4
2. Cryptography and Information Security
3-0-2 4
3. Design and Development of Blockchain Applications
3-0-2 4
4. Public Key Infrastructure and Trust Management
3-0-2 4
5. Blockchain Ecosystem
3-1-0 4
6. Bitcoin Mining
3-0-2 4
7. Smart Contract Essentials
3-0-2 4
8. Vulnerability Discovery and Exploit Development
3-0-2 4
9. Blockchain Architecture Design and Use Cases
3-1-0 4
10. Cryptocurrency Technologies
3-1-0 4
11. Minor / Research Project 0-0-8 4

Multi-Disciplinary Course (MDC)

09 credits [3 Courses from any Basket]
Sr. Natural & Physical Mathematics, Commerce and Humanities &
No Sciences Statistics and Management Social Science
Computer Application
Principles and
Elements Of
Fundamentals of Programme Solving and Practices of
Geomorphology
1. Chemistry Programming Using C Management
(CSE 205) Computer
Physical
Bio-organic and Organization and Organization
Geography
2. Medicinal Chem Architecture Behaviour
Chemical Dynamics and Human Resource
Climatology
3. Co-ordination Chemistry (CSE 206) Operating Systems Development
Quantum Mechanics and (CSE 208) Database Production
Oceanography
4. Analytical Techniques Management Systems Management
Inorganic Materials of (CSE 321) JAVA Geography Of
5. Industrial Importance Programming Sales Management India
Differential Calculus & History Of
6. Mathematical Physics Integral Calculus Financial Accounting Ancient India
Thermal Physics and Matrices and Differential History Of
7. semi-Conductor Devices Equations & Geometry Business Finance Medieval India
Electromagnetic Theory Differential Equation & Marketing Theory History Of
8. and Modern Optics Basic Mechanics and Practices Modern India
Post-
Classical and statistical Graph Theory & Discrete Managerial Independence
9. Mechanics Mathematics Economics History Of India
 Solid State and Nuclear Numerical Analysis &
Historiography
10. Physics Operations Research Income Tax
Introduction To
Flowering Plants English
identification and Literature and
11. Aesthetic Characteristics Literary Forms
Economic Botany, Hindi Bhasha
Ethnomedicine and and Sahitya Ka
12. Phytochemistry Itihas
Plant physiology, Introduction To
Metabolism and Sanskrit
13. Biochemistry Literature
Introduction To
English
Molecular Biology & Literature and
14. Bio-informatics Literary Forms
15. Ecology and Environment Hindi Literature
Diversity of non-
chordates, parasitology Political Theory
16. and Economic Zoology
Diversity of chordates and Western
17. Comparative Anatomy Politicalthought
Evolutionary and Indian Political
18. developmental Biology Thought
Ecology, Ethology, Comparative
Environmental Science Government
19. and wild-Life And Politics
Molecular Biology & Indian
Bio-instrumentation and Government
20. Bio-techniques And Politics
Introduction To
21. Pharmacology Psychology
Development
22. Pharmacognosy Psychology
Social
23. Medicinal Chemistry Psychology
Pharmaceutical Psycho-
24. Microbiology Pathology
Psychology Of
Pharmaceutical Individual
25. Biotechnology Differences
Micro-
26. Economics
Macro-
27. Economics
28. Indian Economy
Development
And
Environmental
29. Economics
International
30. Economics
 Childhood And
31. Growing Up
Contemporary
Indian
32. Education
Learning And
33. Teaching
Language
Across
34. Curriculum
Creative and
Inclusive
35. School
Ability Enhancement Courses (AEC)
08 Credits [Select any 4 Courses]
1. CCS 101 / BIM 210 Communication Skill 2-0-0 2
2. Business Communication 2-0-0 2
Content Writing and 2-0-0 2
3.
Editing
Communication Tools in 2-0-0 2
4.
Digital Era
Communication for 1-1-0 2
5.
Technical Professionals
Technical Writing & 1-0-2 2
6.
Documentation
Ethics & Professional 1-1-0 2
7.
Practices in IT
8. Public Speaking & Debate 1-0-2 2
Media and Communication 1-1-0 2
9.
Studies
Digital Media & Content 1-0-2 2
10.
Creation
Skill Enhancement Courses (SEC)
09 credits [ Select any 3+1 Courses)
1. BIM 153 Workshop Practice Lab 0-0-4 2
Employability Skills 3-0-0 3
2. BIM 310 Programme I
Employability Skills 3-0-0 3
3. BIM 403 Programme II
Entrepreneurship 2-1-0 3
4. Development & Startup
Management
Employability 3-0-0 3
5. BIM 404
Enhancement Programme
6. CAC 300 Campus to Corporate 2-0-2 3
Full-Stack Web 2-0-2 3
7.
Development
 Resume Building & 2-0-2 3
8.
Interview Preparation
Digital Marketing & 1-1-2 3
9.
Personal Branding
10. Competitive Coding Practice 1-0-2 3

Value Added Courses (VAC)

09 credits (3 Courses)
Sr.
No VAC Category Courses
1. VAC 1
2. 1-0-2 3
IKS- kautilya Arthashastra
3. 3-0-0 3
IKS- Vedic Mathematics
4. VAC 2
5. 3-0-0 3
EVS 101 Environmental Science
6. 2-0-2 3
Water Resource Management
Management of 2-0-0 2
7. Environmental Hazards
8. VAC 3
9. 2-0-2 3
Introduction to Data Science
10. 3-0-0 3
Introduction to Big Data
Introduction to Block Chain 3-0-0 3
11. Technology
Introduction to Business 2-0-2 3
12. Analytics
13. 2-0-2 3
Data Analytics using R
14. 2-0-2 3
Data Analytics using Python
Introduction to Cloud 3-0-0 3
15.
CSE 336 Computing
Introduction to Cyber 3-0-0 3
16. Security
Big Data and Cloud 3-0-0 3
17. Computing
18. VAC 4
19. 3-0-0 3
Yoga Education
20. 3-0-0 3
Sports and Fitness
21. 3-0-0 3
Health and Hygiene
Physical and Psychological 3-0-0 3
22. Well-being
23. 3-0-0 3
Stress Management
Summer Internship
04 credits [ 1 Courses ]
1. Summer Internship 0-0-8 4

Research Project / Dissertation

12 credits [2 Courses ]
Research Project / 0-0-8 4
1.
Dissertation – Phase 1
Research Project / 0-0-16 8
2.
Dissertation - Phase 2

Curriculum and Credit Framework for Undergraduate Programmes

● Undergraduate degree programmes of either 3 or 4-year duration, with multiple entry and
exit points and re-entry options, with appropriate certifications such as:
● A UG certificate after completing 1 year (2 semesters) of study in the chosen fields of study,
● A UG diploma after 2 years (4 semesters) of study,

● A bachelor’s degree after a 3-year (6 semesters) programme of study,

● A 4-year bachelor’s degree (honours) after eight semesters programme of study. If the
student completes a rigorous research project in their major area(s) of study in the 4th year
of a bachelor’s degree (honours with research).
● The 4-year bachelor’s degree programme is considered a preferred option since it would
provide the opportunity to experience the full range of holistic and multidisciplinary
education in addition to a focus on the chosen major and minors as per the choices of the
student.
● Inclusion of credit-based courses and projects in the areas of community engagement and
service, environmental education, and value-based education.
● Environment education to include areas such as climate change, pollution, waste
management, sanitation, conservation of biological diversity, management of biological
resources and biodiversity, forest and wildlife conservation, and sustainable development
and living.
● Value-based education to include the development of humanistic, ethical, Constitutional,
and universal human values of truth, righteous conduct, peace, love, nonviolence, scientific
temp

Semester:
A semester comprises 90 working days and an academic year is divided into two semesters. A
summer term is for eight weeks during summer vacation. Internship/apprenticeship/work-based
vocational education and training can be carried out during the summer term, especially by
students who wish to exit after two semesters or four semesters of study. Regular courses may
also be offered during the summer on a fast-track mode to enable students to do additional courses
or complete backlogs in coursework. The HEIs can decide on the courses to be offered in the
summer term depending on the availability of faculty and the number of students.

Major and Minor Disciplines:

Major discipline is the discipline or subject of main focus and the degree will be awarded in that
discipline. Students should secure the prescribed number of credits (about 50% of total credits)
 through core courses in the major discipline.

Minor discipline helps a student to gain a broader understanding beyond the major discipline.
For example, if a student pursuing an Economics major obtains a minimum of 12 credits from a
bunch of courses in Statistics, then the student will be awarded B.A. degree in Economics with a
Minor in Statistics.

Awarding UG Certificate, UG Diploma, and Degrees:

UG Certificate: Students who opt to exit after completion of the first year and have secured 40
credits will be awarded a UG certificate if, in addition, they complete one vocational course
of 4 credits during the summer vacation of the first year. These students are allowed to re-
enter the degree programme within three years and complete the degree programme within the
stipulated maximum period of seven years.

UG Diploma: Students who opt to exit after completion of the second year and have secured 80
credits will be awarded the UG diploma if, in addition, they complete one vocational course of 4
credits during the summer vacation of the second year. These students are allowed to re-enter
within a period of three years and complete the degree programme within the maximum period
of seven years.

3-year UG Degree: Students who wish to undergo a 3-year UG programme will be awarded UG
Degree in the Major discipline after successful completion of three years, securing 120 credits and
satisfying the minimum credit requirement as given in table 2 (Section 5).

4-year UG Degree (Honours): A four-year UG Honours degree in the major discipline will be
awarded to those who complete a four-year degree programme with 160 credits and have satisfied
the credit requirements.

4-year UG Degree (Honours with Research): Students who secure 75% marks and above in the
first six semesters and wish to undertake research at the undergraduate level can choose a research
stream in the fourth year. They should do a research project or dissertation under the guidance of a
faculty member of the University/College. The research project/dissertation will be in the major
discipline. The students who secure 160 credits, including 12 credits from a research
project/dissertation, are awarded UG Degree (Honours with Research).

UG Degree Programmes with Single Major: A student has to secure a minimum of 50% credits
from the major discipline for the 3-year/4-year UG degree to be awarded a single major. For
example, in a 3-year UG programme, if the total number of credits to be earned is 120, a student of
Physics with a minimum of 60 credits will be awarded a B.Sc. in Physics with a single major.
Similarly, in a 4-year UG programme, if the total number of credits to be earned is 160, a student of
Physics with a minimum of 80 credits will be awarded a B.Sc. (Hons./Hon. With Research) in
Physics in a 4-year UG programme with single major.

UG Degree Programmes with Double Major: A student has to secure a minimum of 40% credits
from the second major discipline for the 3-year/4-year UG degree to be awarded a double major.
For example, in a 3-year UG programme, if the total number of credits to be earned is 120, a student
of Physics with a minimum of 48 credits will be awarded a B.Sc. in Physics with a double major.
Similarly, in a 4-year UG programme, if the total number of credits to be earned is 160, a student of
Physics with a minimum of 64 credits will be awarded a B.Sc. (Hons./Hon. With Research) in
Physics in a 4-year UG programme with double major.
Interdisciplinary UG Programmes: The credits for core courses shall be distributed among the
constituent disciplines/subjects so as to get core competence in the interdisciplinary programme.

Multidisciplinary UG Programmes: In the case of students pursuing a multidisciplinary

programme of study, the credits to core courses will be distributed among the broad disciplines such
as Life sciences, Physical Sciences, Mathematical and Computer Sciences, Data Analysis, Social
Sciences, Humanities, etc.

B.Tech CSE (AIML): Four-Year (8-Semester) Programme

Basic Structure
Minimum Credit
S. No. Type of Course Requirement
3-year UG 4-Year UG
1 Major (Core) 60 80
3 Minor Stream 24 32
4 Multi-Disciplinary Course (MDC) 09 09
5 Ability Enhancement Courses (AEC) 08 08
6 Skill Enhancement Courses (SEC) 09 09
7 Value Added Courses (VAC) common for all UG 06 - 08 06 - 08
8 Summer Internship 02 - 04 02 - 04
9 Research Project / Dissertation - 12
Total Credits 120 160

Study Scheme of B. Tech CSE (AIML)

Semester I
Semeste No. of
Course Type Credit Hours Total Credits
r Course
CC (Core Course) 3 3x4 Hrs.=12
AEC (Ability Enhancement Course) 1 1x2 Hrs.=2
I VAC (Value Added Course) 1 1x2 Hrs.=2 20+2=22
SEC (Skill Enhancement Courses) 1 1x2 Hrs.=2
Minor Stream 1 1x4 Hrs.=4

Course Hours/Week
S. No. Category Course Name Credit
Code L T P
Programming with C for Problem
BIM 106 3 0 0 3
Core Solving
1
Course-1 Programming with C for Problem
BIM 154 0 0 2 1
Solving Lab

BIM 104 Engineering Chemistry 3 0 0 3

Core
2
Course-2
BIM 152 Engineering Chemistry Lab 0 0 2 1

Core
3 BIM 101 Engineering Mathematics - I 3 1 0 4
Course-3
One course from already been selected
as Minor Specialization in First
Minor
4 MNC-1 Semester Minor Course-1/Minor 4 0 2 4
Stream-1
Course-2/Minor Course-3/Minor
Course-4/ Minor Course-5
 Ability
CCS 101/
5 Enhancemen Communication Skill 2 0 0 2
BIM 210
t Course-1
Value
6 Added IKS- Vedic Mathematics 2 0 0 2
Course-1
Skill
7 Enhancemen BIM 153 Workshop Practice Lab 0 0 4 2
t Courses
Total 22

Semester II

No. of
Semester Course Type Credit Hours Total Credits
Course
CC (Core Course) 3 3x4 Hrs.=12
AEC (Ability Enhancement Course) 1 1x2 Hrs.=2
II 20
VAC (Value Added Course) 1 1x2 Hrs.=2
Minor Stream 1 1x4 Hrs.=4

Course Hours/Week Credit

S. No. Category Course Name
Code L T P
Object Oriented Programming with
3 0 0 3
Core C++
1
Course-4 Object Oriented Programming with
0 0 2 1
C++ Lab
Core
2 BIM 102 Engineering Mathematics – II 3 1 0 4
Course-5
PHY 101 Engineering Physics 3 0 0 3
Core
3
Course-6
PHY 151 Engineering Physics Lab 0 0 2 1
One course from already been selected
as Minor Specialization in First
MNC-2 Semester Minor Course-1/Minor 4 0 2 4
Minor
4 Course-2/Minor Course-3/Minor
Stream-1
Course-4/ Minor Course-5

Ability
5 Enhancemen Business Communication 2 0 0 2
t Course-2
Value
6 Added Environmental Science 2 0 0 2
Course-2
Total 20

Semester III

Semester Course Type No. of Course Credit Hours Total Credits

CC (Core Course) 3 3x4 Hrs.=12
AEC (Ability Enhancement Course) 1 1x2 Hrs.=2
III 20
VAC (Value Added Course) 1 1x2 Hrs.=2
Minor Stream 1 1x4 Hrs.=4

Course Hours/Week Credit

S. No. Category Course Name
Code L T P
Core Object Oriented Programming using
1 BIM 202 3 0 0 3
Course-7 Java
 Object Oriented Programming using
BIM 252 0 0 2 1
Java Lab
2 CSE 203 Data Structure and Algorithms 3 0 0 3
Core
Course-8
CSE 253 Data Structure and Algorithms Lab 0 0 2 1
Core
3 BIM 208 Probability and Statistics 3 1 0 4
Course-9
One course from already been selected
as Minor Specialization in First
Minor
4 MNC-3 Semester Minor Course-1/Minor 3 1 0 4
Stream-3
Course-2/Minor Course-3/Minor
Course-4/ Minor Course-5
Ability
5 Enhancemen Content Writing and Editing 2 0 0 2
t Course-3
Value
Introduction to Data Science /
6 Added 2 0 0 2
Introduction to Cloud Computing
Course-3
Total 20

Semester IV
Semester Course Type No. of Course Credit Hours Total Credits
CC (Core Course) 2 2x4 Hrs.=8
AEC (Ability Enhancement Course) 1 1x2 Hrs.=2
IV SEC (Skill Enhancement Courses) 1 1x3 Hrs.=3 20
MDC (Multi-Disciplinary Course) 1 1x3 Hrs.=3
Minor Stream 1 1x4 Hrs.=4

Course Hours/Week Credit

S. No. Category Course Name
Code L T P
1 Core Course- BIM 206 Python Programming 2 0 0 2
2 10 BIM 254 Python Programming Lab 0 0 4 2

Core Course CSE 208 Database Management System 3 0 0 3

11 CSE 254 Database Management System Lab 0 0 2 1
One course from already been selected
as Minor Specialization in First
Minor
3 MNC-4 Semester Minor Course-1/Minor 3 1 0 4
Stream-4
Course-2/Minor Course-3/Minor
Course-4/ Minor Course-5
Ability
4 Enhancement Communication Tools in Digital Era 2 0 0 2
Course-4
Skill
5 Enhancement Employability Skills Programme I 3 0 0 3
Course-1
Multi-
Principles and Practices of
6 Disciplinary 3 0 0 3
Management
Course-1
Total 20

**Students will go for 4 weeks internship after this Semester

Semester V
Semester Course Type No. of Course Credit Hours Total Credits
CC (Core Course) 2 2x4 Hrs.=8
V VAC (Value Added Course) 1 1x2 Hrs.=2 20+4 =24
SEC (Skill Enhancement Courses) 1 1x3 Hrs.=3
 MDC 1 1x3 Hrs.=3
Minor Stream 1 1x4 Hrs.=4
Internship Assessment 1 1x4 Hrs.=4

Course Hours/Week Credit

S. No. Category Course Name
Code L T P
BIM 307 Machine Learning 3 0 0 3
1 Core Course-12
BIM 355 Machine Learning Lab 0 0 2 1
BIM 203 Operating System and Applications 3 0 0 3
2 Core Course-13 Operating System and Applications
BIM 251 0 0 2 1
Lab
One course from already been
selected as Minor Specialization in
MNC-5 First Semester Minor Course-1/Minor 3 0 2 4
3 Minor Stream-5 Course-2/Minor Course-3/Minor
Course-4/ Minor Course-5

Value Added Yoga

4 Yoga Education 2 0 0 2
Course-4 Education
Skill
5 Enhancement Employability Skills Programme II 3 0 0 3
Course-2
Multi-
6 Disciplinary Organization Behaviour 3 0 0 3
Course-2
Internship Assessment 0 0 8 4
Total 24

1 MOOC 1 MOOC Program I (Optional) 0 0 0 2

Semester VI

Semester Course Type No. of Course Credit Hours Total Credits

CC (Core Course) 3 3x4 Hrs.=12
SEC (Skill Enhancement Courses) 1 1x3 Hrs.=3
VI 22
MDC 1 1x3 Hrs.=3
Minor Stream 1 1x4 Hrs.=4

Course Hours/Week Credit

S. No. Category Course Name
Code L T P
BIM 207 Introduction to Artificial Intelligence 2 0 0 2
1 Core Course-14
Data and Visual Analytics 2 0 0 2
BIM 401 Deep Learning 3 0 0 3
2 Core Course-15
BIM 451 Deep Learning Lab 0 0 2 1
BIM 304 Natural Language Processing 3 0 0 3
3 Core Course-16
BIM 352 Natural Language Processing Lab 0 0 2 1
One course from already been
selected as Minor Specialization in
Minor Stream- MNC-6 First Semester Minor Course-1/Minor 3 0 2 4
4 Course-2/Minor Course-3/Minor
6
Course-4/ Minor Course-5

Skill
Entrepreneurship Development &
5 Enhancement 3 0 0 3
Startup Management
Course-3
 Multi-
6 Disciplinary Human Resource Development 3 0 0 3
Course-3
Total 22

1 MOOC 2 MOOC Program 2 (Optional) 0 0 0 2

Semester VII
Semeste
Course Type No. of Course Credit Hours Total Credits
r
CC (Core Course) 3 3x4 Hrs.=12
VII CC in Lieu of Research 1 1x4 Hrs.=4 20
Minor Stream 1 1x4 Hrs.=4

Course Hours/Week Credit

S. No. Category Course Name
Code L T P
Image and Video Processing 3 0 0 3
1 Core Course-17
Image and Video Processing 0 0 2 1
BIM 402 Recommender System 3 0 0 3
2 Core Course-18
BIM 452 Recommender System Lab 0 0 2 1
BIM 406 Chatbot Development 3 0 0 3
3 Core Course-19
BIM 454 Chatbot Development Lab 0 0 2 1
One course from already been
selected as Minor Specialization in
Minor Stream-
4 MNC-7 First Semester Minor Course-1/Minor 3 1 0 4
7
Course-2/Minor Course-3/Minor
Course-4/ Minor Course-5
Research
Research Project / Dissertation –
Project / 0 0 8 4
Phase 1
5 Dissertation
Core Course 1
in Lieu of BIM 412 Human Computer Interaction 3 1 0 4
Research
Total 20

1 MOOC 3 MOOC Program 3 (Optional) 0 0 0 2

Semester VIII
Semester Course Type No. of Course Credit Hours Total Credits
CC (Core Course) 2 2x4 Hrs.=8
VIII CC in Lieu of Research 2 2x4 Hrs.=8 20
Minor Stream 1 1x4 Hrs.=4

Course Hours/Week Credit

S. No. Category Course Name
Code L T P
BIM 408 Computer Vision 3 0 0 3
1 Core Course-20
BIM 456 Computer Vision Lab 0 0 2 1
BIM 405 R Programming 3 0 0 3
2 Core Course-21
BIM 455 R Programming Lab 0 0 2 1
 One course from already been
selected as Minor Specialization in
3 Minor Stream-8 MNC-8 First Semester Minor Course-1/Minor 3 1 0 4
Course-2/Minor Course-3/Minor
Course-4/ Minor Course-5
Core Course 2 in
5 Programming for Data Analytics 4
Lieu of Research
Core Course 3 in
6 Social Media Analytics 4
Lieu of Research
Total 20

1 MOOC 4 MOOC Program 4 (Optional) 0 0 0 2

 Study & Evaluation Scheme
B.Tech in CSE (AIML) (Honours with Research)

(Honours with Research): Semester VII

No. of
Semester Course Type Credit Hours Total Credits
Course
VII CC (Core Course) 3 3x4 Hrs.=12
Research Project /
1 1x4 Hrs.=4
Dissertation 20
Minor Stream 1 1x4 Hrs.=4

Course Hours/Week Credit

S. No. Category Course Name
Code L T P
Core Course- BIM 409 Time Series Analysis 3 0 0 3
1
17 Time Series Analysis Lab 0 0 2 1

Core Course- BIM 402 Recommender System 3 0 0 3

2
18 BIM 452 Recommender System Lab 0 0 2 1

Core Course- BIM 406 Chatbot Development 3 0 0 3

3
19 BIM 454 Chatbot Development Lab 0 0 2 1
One course from already been selected
as Minor Specialization in First
Minor
4 MNC-7 Semester Minor Course-1/Minor 3 1 0 4
Stream-7
Course-2/Minor Course-3/Minor
Course-4/ Minor Course-5
Research
Research Project / Dissertation –
5 Project / 0 0 8 4
Phase 1
Dissertation
Total 20

(Honours with Research): Semester VIII

Semester Course Type No. of Course Credit Hours Total Credits
CC 2 2x4 Hrs.=8
Research Project / Dissertation 1 1x4 Hrs.=4
VIII 20
Minor Stream 1 1x8 Hrs.=8

Course Hours/Week Credit

S. No. Category Course Name
Code L T P
BIM 408 Computer Vision 3 0 0 3
Core Course-
1
20
BIM 456 Computer Vision Lab 0 0 2 1

BIM 405 R Programming 3 0 0 3

Core Course-
2
21
BIM 455 R Programming Lab 0 0 2 1
One course from already been selected
as Minor Specialization in First
Minor
3 MNC-8 Semester Minor Course-1/Minor 3 1 0 4
Stream-8
Course-2/Minor Course-3/Minor
Course-4/ Minor Course-5
Research
Research Project / Dissertation –
4 Project / 0 0 16 8
Phase 2
Dissertation
Total 20
COURSE CODE COURSE TITLE L T P C
BIM 106 Programming with C for Problem Solving 3 0 0 3
Course Outcome
Remembering the fundamental syntax, structure, and components of the C
CO1:
programming language including data types, operators, and control statements.
Understanding the use of functions, arrays, strings, pointers, and memory management for
CO2:
effective problem-solving in C.
Applying decision-making, looping constructs, and modular programming techniques
CO3:
using arrays, functions, and file handling in real-world programming scenarios.
Analysing complex problems through pointer manipulation, structured data types, file
CO4:
operations, and recursion to design efficient C programs.
COURSE CONTENTS Theory
UNIT-I [9 Hours]
Introduction to Programming and C: Introduction to computers and computer based problem
solving, Algorithm and Flowchart, Top down design and stepwise refinement, Programming
environment –Assemblers, Compilers, Interpreters. Introduction to C,Structure of a C program,
preprocessor directives , Compiling and executing C programs.
UNIT-II [9 Hours]
Data Types, Decision Control and Looping Statements: Data Types, Input/Output Statements
in C, Constants, Variables, Scope of Variables, Operators, Expressions. Type conversion, Type
casting, Decision control- if, if-then-else, nested if, nested else. Looping statements- while, Do-
While, for, switch, break, continue and goto statements. Type modifiers and storage class
specifiers for data types.
UNIT-III [9 Hours]
Functions and Arrays
Functions: Introduction to functions, function definition, function declaration, function call,
return statement, passing parameters to functions: Call by Value , Call by reference, recursive
functions.
Arrays: Declaration of arrays, accessing the elements of an array, storing values in arrays,
Operations on arrays, Passing arrays to functions, two dimensional arrays, operations on two-
dimensional arrays, multidimensional arrays, applications of arrays.
UNIT-IV [9 Hours]
Strings and Pointers:
Strings: Introduction, string taxonomy, operations on strings, Miscellaneous string and character
functions, arrays of strings.
Pointers: The & and * operator, pointer expression, initializing pointers ,malloc vs calloc, array
of pointers, pointers to pointers, pointers to functions, function returning pointers.

UNIT-V [9 Hours]
Files, Structures, Unions and Enumerated data types File Handling Files: Introduction to
files, using files in C, reading and writing data files, Detecting end of file .The file pointer, file
accessing functions, fopen, fclose, putc, getc, fprintf.
Structure, Union, and Enumerated Data Type: Introduction, structures and functions, Unions,
unions inside structures, Enumerated data type.

Text Books
1. The C Complete Reference by Herbert Schildt - 4th edition ,McGraw Hill Education , July 2017.
2. "C Programming: The Complete Guide for Beginners to Master C Programming Step by Step" by
Byron Francis, published by Independently published in 2021.
Reference Books

1. Programming in ANSI C by Balaguruswamy, 3rd Edition, 2005, Tata McGraw Hill.

2. Let us C by Yashwant Kanetkar, 6th Edition, PBP Publication

3. The C programming Language by Richie and Kenninghan, 2004, BPB Publication
COURSE CODE COURSE TITLE L T P C
BIM 154 Programming with C for Problem Solving Lab 0 0 2 1
Course Outcome
Remembering fundamental C programming concepts and applying them to perform
CO1:
basic operations on variables, arrays, and control structures.
Understanding user input/output, conditional logic, and iterative structures to develop
CO2:
structured solutions like result calculators and number analysis.
Applying recursion, pointers, and structures in solving problems involving numerical
CO3:
operations, data storage, and file handling.
Analysing complex problems involving matrix operations and string manipulations,
CO4:
and implementing efficient solutions using modular programming and logical
reasoning.
List of Experiments:
Practical
1.Write a Program to calculate and display the volume of a CUBE having its height (h=10cm),
width (w=12cm) and depth (d=8cm).
2.Write a program to take input of name, roll no and marks obtained by a student in 4 subjects of
100 marks each and display the name, roll no with percentage score secured.
3.Write a program to print whether a given number is even or odd.
4. Write a program to print positive integers from 1 to 10.
5. Write a program to insert 5 elements into an array and print the elements of the
array.
6.Write a program to demonstrate the functions and its types.
7. Write a program to calculate factorial of a number using recursion.
8. Write a program to find the biggest among three numbers using pointer.
9. Write a C program to create, declare and initialize structure.
10.Write a program to create a file called emp.rec and store information about a
person, in terms of his name, age and salary.
11.Write a C program to add two matrices A and B of size 3x3 and store the result in
matrix C.
12. Check whether the given string is a palindrome or not.
Text Books
1. The C Complete Reference by Herbert Schildt - 4th edition ,McGraw Hill Education , July 2017.
2. "C Programming: The Complete Guide for Beginners to Master C Programming Step by Step" by
Byron Francis, published by Independently published in 2021.
3. The C programming Language by Richie and Kenninghan, 2004, BPB Publication.
Reference Books

1. Programming in ANSI C by Balaguruswamy, 3rd Edition, 2005, Tata McGraw Hill.

2. Let us C by Yashwant Kanetkar, 6th Edition, PBP Publication

COURSE CODE COURSE TITLE L T P C
BIM 104 Engineering Chemistry 3 0 0 3
Course Outcome: After compiling the course, the student will be able to
Remembering fundamental concepts such as molecular orbital theory, spectroscopy,
CO1:
thermodynamic functions, phase rule, and stereochemistry.
Understanding the principles of spectroscopy, photochemistry, chemical equilibrium, and
CO2:
alloy formation including structural and chemical behavior.
Applying thermodynamic, electrochemical, and phase rule concepts to real-world
CO3:
processes like corrosion control, desalination, and metallurgy.
Analysing stereochemical structures, molecular interactions, isomerism, and
CO4:
mechanisms involved in chemical reactions and drug synthesis.

COURSE CONTENTS Theory

UNIT-I [9 Hours]
Atomic and Molecular Structure Quantum mechanics: Basics and significance-Schrodinger
equation, Particle in one dimensional box, Molecular orbital theory, Molecular orbital diagrams
of homonuclear and heteronuclear diatomic molecules. Energy level diagrams of diatomic pi-
molecular orbitals of butadiene and benzene and aromaticity. Crystal field theory and the energy
level diagrams for transition metal ions and their magnetic properties. Band structure of solids and
the role of doping on band structures.

UNIT-II [9 Hours]
Spectroscopic Techniques and Photochemistry: Principles of spectroscopy, Electromagnetic
spectrum, Electronic spectroscopy, Vibrational spectroscopy, Nuclear magnetic resonance
spectroscopy, Principle, Instrumentation (Block diagram only) and applications, Photochemistry,
Laws of photochemistry, Photo processes, Internal conversion, Intersystem crossing,
Phosphorescence, Fluorescence and its applications.

UNIT-III [9 Hours]
Use of Free Energy in Chemical Equilibria Thermodynamic functions: Energy, entropy and
free energy. Free energy and emf. Cell potentials, Nernst equation and applications. Corrosion,
Types, Control measures, Use of free energy considerations in metallurgy through Ellingham
diagrams, Water Chemistry, Hardness, Types, Estimation of hardness by EDTA method,
Desalination of brackish water, RO process.

UNIT-IV [9 Hours]
Phase Rule and Alloys Phase rule: Introduction, definition of terms with examples, One
Component System, water system, Reduced phase rule, Two Component Systems, classification,
lead-silver system, zinc-magnesium system.
Alloys: Introduction- Definition, Properties of alloys, Significance of alloying, Functions and
effect of alloying elements, Ferrous alloys, Nichrome and Stainless steel, heat treatment of steel;
Non-ferrous alloys, brass and bronze.
UNIT-V [9 Hours]
Representations of 3 dimensional structures, structural isomers and stereoisomers, configurations
and symmetry and chirality, enantiomers, diastereomers, optical activity, absolute configurations
and conformational analysis. Isomerism in transition metal compounds. Introduction to reactions
involving substitution, addition, elimination, oxidation, reduction, cyclization and ring openings-
Synthesis of paracetamol.

Text Books
1. K. P. C. Volhardt and N.E. Schore, ”Organic Chemistry: Structure and Function”,W.H.Freeman
Publisher,NHBS,2018.
2. P. W. Atkins, Julio de Paula,,” Physical Chemistry”, Oxford University press, Oxford, 2018.
3. Dr. Sayeeda Sultana,” Engineering Chemistry’’, R.K.Publishers, Coimbatore, 2016.
Reference Books

1. Engineering Chemistry by Jain and Jain, 16th Edition, Dhanpat Rai Publishing Company,
New Delhi,2017.

2. C. N. Banwell, ”Fundamentals of molecular spectroscopy”,5th Edition McGraw-Hill

Education India Pvt Limited,India,2013.
COURSE CODE COURSE TITLE L T P C
BIM 152 Engineering Chemistry Lab 0 0 2 1
Course Outcome
Remembering and applying titration methods such as EDTA and argentometric to
CO1:
assess water quality parameters.
Understanding the concepts of acid-base strength and analyzing them using pH and
CO2:
conductivity meters.
Applying potentiometric and complexometric titrations to estimate metal ion
CO3:
concentrations in chemical samples
Investigating molecular weight through viscometry and analyzing adsorption
CO4:
characteristics using activated charcoal.
COURSE CONTENTS
UNIT-I [9 Hours]
Atomic and Molecular Structure:
Quantum mechanics: Basics and significance-Schrodinger equation, Particle in one dimensional
box, Molecular orbital theory, Molecular orbital diagrams of homonuclear and heteronuclear
diatomic molecules. Energy level diagrams of diatomic pi-molecular orbitals of butadiene and
benzene and aromaticity. Crystal field theory and the energy level diagrams for transition metal
ions and their magnetic properties. Band structure of solids and the role of doping on band
structures.
UNIT-II [9 Hours]
Spectroscopic Techniques and Photochemistry:
Principles of spectroscopy, Electromagnetic spectrum, electronic spectroscopy, Vibrational
spectroscopy, Nuclear magnetic resonance spectroscopy, Principle, Instrumentation (Block
diagram only) and applications, Photochemistry, Laws of photochemistry, Photo processes,
Internal conversion, Intersystem crossing, Phosphorescence, Fluorescence and its applications.
UNIT-III [9 Hours]
Use of Free Energy in Chemical Equlibria Thermodynamic functions: energy, entropy and
free energy. Free energy and emf. Cell potentials, Nernst equation and applications. Corrosion,
Types, Control measures, Use of free energy considerations in metallurgy through Ellingham
diagrams, Water Chemistry, Hardness, Types, Estimation of hardness by EDTA method,
Desalination of brackish water, RO process.
UNIT-IV [9 Hours]
Phase Rule and Alloys:
Phase rule: Introduction, definition of terms with examples, One Component System, water
system, Reduced phase rule, Two Component Systems, classification, lead-silver system, zinc-
magnesium system.
Alloys: Introduction- Definition, Properties of alloys, Significance of alloying, Functions and
effect of alloying elements, Ferrous alloys, Nichrome and Stainless steel, heat treatment of steel;
Non-ferrous alloys, brass and bronze.
UNIT-V [9 Hours]
Representations of 3 dimensional structures, structural isomers and stereoisomers, configurations
and symmetry and chirality, enantiomers, diastereomers, optical activity, absolute configurations
and conformational analysis. Isomerism in transition metal compounds. Introduction to reactions
involving substitution, addition, elimination, oxidation, reduction, cyclization and ring openings-
Synthesis of paracetamol.
Text Books
1. K. P. C. Volhardt and N.E. Schore,” Organic Chemistry: Structure and
Function”,W.H.Freeman Publisher,NHBS,2018.
2. P. W. Atkins, Julio de Paula,,” Physical Chemistry”, Oxford University press, Oxford, 2018.
3. Dr. Sayeeda Sultana,” Engineering Chemistry’’, R.K.Publishers, Coimbatore, 2016.
Reference Books

1. Engineering Chemistry by Jain and Jain, 16th Edition, Dhanpat Rai Publishing Company,
New Delhi,2017.
2. C. N. Banwell,” Fundamentals of molecular spectroscopy”,5th Edition McGraw-Hill Education
India Pvt Limited,India,2013.
COURSE CODE COURSE TITLE L T P C
BIM 101 Engineering Mathematics - I 3 1 0 4
Course Outcome: At the end of this course, students will be able to:
Remembering the fundamental concepts of matrices, including types, operations, and
CO1:
properties for solving linear systems.
Understanding limits, continuity, and series expansions to explore the behavior of functions.
CO2:
Applying differentiation and integration techniques to solve problems involving rates,
CO3:
areas, and volumes.
Analyzing, evaluating, and creating geometric representations using coordinate
CO4:
systems and conic sections in 2D and 3D spaces.
COURSE CONTENTS
UNIT-I [8 Hours]

Matrices: Types of Matrices, Operations of addition, Scalar Multiplication and Multiplication of

Matrices, Determinant of a Square Matrix, Minors and Cofactors, Transpose, adjoint and inverse
of a matrix, Applications of Matrices to solve a system of linear equations, Rank of the matrix and
its application.
UNIT-II [7 Hours]

Limits and Expansion of Functions: Limit of a function, Indeterminate Forms, L' Hospital's
Rule, Evaluation of Limits, Continuity, differentiability, Taylor's Series, and Maclaurin's Series.
UNIT-III [10 Hours]

Differentiation: Introduction to Derivative, Rules of Differentiation, Differentiation of algebraic,

trigonometric, exponential and logarithmic functions and inverse function, Derivative of
Composite functions (Chain Rule) Differentiation by Substitution, Higher Order differentiation,
Maxima and Minima of Simple Functions. Introduction to Partial Differentiation, Euler Theorem.
UNIT-IV [10 Hours]

Integration: Introduction to Integration, Rules of Integration, Indefinite Integrals, Integration by

Substitution, Definite Integration, Properties of Definite Integral, evaluation of double and triple
integrals and its applications to find the areas and volumes.

UNIT-V [10 Hours]

Coordinate Geometry: Coordinate systems: Cartesian, Polar, cylindrical, and spherical, 2Dand
3D coordinate systems Straight line: Equation, Slope of a line, Various forms of equations of a
line: parallel to axes, point-slope form, slope-intercept form, two-point form, intercepts form and
normal form. General equation of a line, angle between two lines Circle: Equation of Circle,
Equation of Tangent, Conic Sections: Focus, Eccentricity, Directrix, Axis of a conic
section, Parabola, Ellipse, Hyperbola: Definitions, equations, and shape of the curve only.
Text Books
1. H. K. Dass, Higher Engineering Mathematics. S. Chand, 2011.

Available:https://books.google.co.in/books/about/Higher_Engineering_Mathematics.html?id=d5
8rDAAAQBAJ&redir_esc=y
2. Mathematics for BCA by G. C. Sharma & Madhu Jain, Oscar Publication.
Reference Books
1. Mathematics Vol-2 by R. D. Sharma, Dhalpat Raj & Sons
Semester 2
COURSE CODE COURSE TITLE L T P C

OBJECT ORIENTED PROGRAMMING WITH

CSE 209 3 0 0 3
C++
Course Outcome

CO1: Understanding the relative merits of object-oriented programming language.

Describing how to produce object-oriented software using C++.

CO2:

Applying how to apply the major object-oriented concepts to implement object- oriented
CO3:
programs, encapsulation, inheritance and polymorphism.

Evaluating advanced features of C++ specifically stream I/O, templates and operator
CO4:
overloading.
COURSE CONTENTS
UNIT-I [12 SESSIONS]

Introduction: The meaning of Object Orientation, object identity, Encapsulation, information

hiding, polymorphism, Procedural language v/s OOP language, Review of C, Object oriented
language features, Characteristics of Object-Oriented Languages, Applications of Object-Oriented
Programming.
UNIT-II [12 SESSIONS]

Basic Structural Modeling: Classes, relationships, common mechanisms and diagrams. Class&
Object Diagrams: Terms, concepts, modeling techniques for Class & Object Diagrams. Classes
and Objects: Abstract data types, Object & classes, attributes, methods, C++ class declaration,
State identity and behavior of an object, Constructors and destructors, instantiation of objects,
Default parameter value, Copy Constructor, Static Class Data, Constant and Classes, C++ garbage
collection, dynamic memory allocation, function name overloading, Overriding, New and delete
operator.
UNIT-III [12 SESSIONS]

Inheritance and Polymorphism: Inheritance, Types of Inheritance, Class hierarchy, derivation,

public, private & protected, Aggregation, composition vs classification hierarchies,
Polymorphism, Type of Polymorphism, Compile time and runtime, Method polymorphism,
Polymorphism by parameter, Operator overloading, Parametric polymorphism, Generic function,
Inheritance methods Adjustment of inheritance, passing arguments to methods, Implementing
inheritance, associations encapsulation. Object oriented programming style: reusability,
Comparison between Structures and Classes.
UNIT-IV [12 SESSIONS]

Files and Exception Handling: Persistent objects, Streams and files, Namespaces, Exception
handling, Input Class Streams, ostream, istream Library: Overview of Standard Template Library,
Containers, Introduction, Pure Virtual Function, Virtual Function in Derived Classes, friend
classes and function.
UNIT-V [12 SESSIONS]

Java Concepts: History, Features, Object Oriented concept of Java, Classes and Objects,
Inheritance, Packages, Interface, abstract method and classes.
Text Books
1. A.K. Sharma, “Object Oriented Programming using C++”, 1st Edition, Pearson, 2014
2. S. B. Lippman & J. Lajoie, “C++ Primer”, 5th Edition, Addison Wesley, 2012
3. R. Lafore, “Object Oriented Programming using C++”, 3rd Edition, Galgotia Publications Pvt Ltd,
1999
Reference Books
1. Benjamin, Cummings. E. Balaguruswamy, “Objected Oriented Programming with C++”, 8th
Edition, McGraw Hill Education, 2020
2. Booch “Object Oriented Design & Applications”, 3rd Edition, Addison Wesley, 2007
COURSE CODE COURSE TITLE L T P C

OBJECT ORIENTED PROGRAMMING WITH

CSE 251 0 0 2 1
C++ LAB
Course Outcome

Understanding and implement various control structures in C++ such as if statements, switch
CO1:
case statements, and loops.

CO2: Describing proficiency in using structures, unions, and functions in C++ programs.

Analyzing the concept of recursion and different function call mechanisms including call by
CO3:
reference and call by value.

CO4: Evaluating storage specifiers and their applications in C++ programming.

COURSE CONTENTS
Ep.No List of Experiments
1.
Write C++ programs to implement various control structures.
a) If statement
b) Switch case statement and do while loop
c) For loop
d) While loop
2. Write C++ programs to understand structure & unions.
a) Structure
b) Union
3. Write C++ programs to implement functions & recursion
4. Write C++ programs to understand different function call mechanism. ( Call by
reference & Call by Value)
5. Write C++ programs to understand storage specifiers.
6. Write C++ programs for constructors & destructors.
7. Write C++ programs to implement inheritance and function overriding.
a) Multiple Inheritance, Access Specifiers.
b) Hierarchical Inheritance, Function Overriding /Virtual Function
8.
Write C++ programs to overload unary & binary operators as member function &non-
member function
Text Books
 1. A.K. Sharma, “Object Oriented Programming using C++
2. S. B. Lippman & J. Lajoie, “C++ Primer”, Addison Wesley.
3. R. Lafore, “Object Oriented Programming using C++”, Galgotia
Reference Books
1. C++ How to Program" by Paul Deitel and Harvey Deitel
2. Programming: Principles and Practice Using C++" by Bjarne Stroustrup
COURSE CODE COURSE TITLE L T P C
BIM 102 Engineering Mathematics – II 3 1 0 4
Course Outcome: At the end of this course students will be able to:
Remembering fundamental concepts and formulas related to ordinary differential
CO1:
equations, Laplace transforms, vector calculus, and complex analysis.
Understanding the geometric and physical interpretations of vector calculus and
CO2:
complex variables, and their relevance in engineering contexts.
Applying mathematical techniques such as Laplace transforms and differential
CO3:
equations to solve real-world engineering problems.
Analyzing mathematical models using tools like contour integration, residue calculus,
CO4:
and coordinate geometry to evaluate complex engineering systems.
COURSE CONTENTS Theory
UNIT-I [12 Hours]

Ordinary Differential Equations: Introduction- order and Degree of DE, generation of ODE,
solution of first-order Linear differential equations, Solution of Linear equations with constant
coefficients: CF (complementary function) and PI (Particular integral), Homogeneous equation of
Euler type, Cauchy’s and Legendre’s DE, Variation of parameters, Simultaneous first order with
constant co-efficient, Applications of Differential Equations in Engineering and sciences.
UNIT-II [12 Hours]

Vector Calculus: Introduction to vectors, Vector Functions, derivative and integral of vector
functions, Gradient divergence, curl, Solenoidal, Irrotational fields, Vector identities Directional
derivatives, Line integrals, Surface integrals, Volume Integrals, Green’s theorem Gauss
divergence theorem, verification, Stoke’s theorems Verification.
UNIT-III [12 Hours]

Laplace Transforms: Introduction, basic properties of LT, Laplace Transforms of standard

functions, shifting theorem Transforms of Derivatives and Integrals, Initial value and Final value
theorems and verification of simple problems, periodic functions, Inverse Laplace transforms
using partial fractions, shifting theorem, Convolution theorem, Applications of Laplace
transforms for solving linear ordinary differential equations up to second order with constant
coefficient.
UNIT-IV [12 Hours]

Analytic Functions : Definition of Analytic Function, Cauchy Riemann equations, Properties

of analytic function, Determination of analytic function using - Necessary and sufficient
conditions for analyticity in Cartesian and polar coordinates, Milne-Thomson’s method,
Conformal mappings: magnification, rotation, inversion, reflection, bilinear transformation,
Cauchy’s integral theorem applications.
UNIT-V [12 Hours]

Coordinate Geometry: Cauchy’s integral formulae and its extension with consequences, Taylor’s
expansions with simple problems, Laurent’s expansions with simple problems- Singularities,
Types of Poles and Residues, Cauchy’s residue theorem, Contour integration: Unit circle, Contour
integration: semicircular
Text Books
1. H. K. Dass, Higher Engineering Mathematics. S. Chand, (Latest Edition)

Available:https://books.google.co.in/books/about/Higher_Engineering_Mathematics.html?id=d5
8rDAAAQBAJ&redir_esc=y
2. Erwin kreyszig, Advanced Engineering Mathematics,John Wiley & Sons,(Latest Edition)
3. B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, (Latest Edition)
4. C B Gupta and S R Singh and Mukesh Kumar, Engineering Mathematics for first year, Tata
McGraw-Hill,1st edition, (Latest Edition)
Reference Books

1. N.P. Bali and Manish Goyal, A text book of Engineering Mathematics, Laxmi
Publications, (Latest Edition).

2. Dr.M.K.Venkatraman, Engineering Mathematics volume-1, The National Publishing

company,(Latest Edition)
COURSE CODE COURSE TITLE L T P C
PHY 101 Engineering Physics 3 0 0 3
Course Outcome
Remembering fundamental principles of mechanics, elasticity, and properties of
CO1:
matter relevant to engineering applications.
Understanding the concepts of wave motion, optical devices, and fiber optics for interpreting
CO2:
modern communication systems.
Applying thermal and electrical properties of materials in solving problems related to
CO3:
conductivity, insulation, and heat transfer.
Analyzing, evaluating, and creating quantum physics-based models to explain
CO4:
phenomena like tunneling, energy quantization, and material behavior at the atomic
scale.
COURSE CONTENTS
UNIT-I Theory [9 Hours]
Mechanics and Properties of Matter: Transformation of scalars and vectors under Rotation
transformation; Forces in Nature; Newton’s laws and its completeness in describing particle
motion; Form invariance of Newton’s Second Law; Solving Newton’s equations of motion in
polar coordinates; Problems including constraints and friction; Extension to cylindrical and
spherical coordinates Elasticity – Stress-strain diagram and its uses – twisting couple - torsion
pendulum: theory and experiment.
UNIT-II [9 Hours]

Waves and Fiber Optics: Oscillatory motion, forced and damped oscillations Harmonic
oscillator; Damped harmonic motion, over-damped, critically damped and lightly-damped
oscillators; Forced oscillations and resonance. Lasers population of energy levels, Einstein’s A
and B coefficients derivation, resonant cavity, optical amplification (qualitative), Solid state, Gas
laser, Semiconductor lasers: homojunction and heterojunction, Fiber optics: principle, numerical
aperture and acceptance angle, types of optical fibres (material, refractive index, mode),
Application in Communication.
UNIT-III [9 Hours]
Electrical Properties and Materials: Classical free electron theory-Expression for Electrical
conductivity-thermal conductivity-expression, Wiedmann Franz law, success and failure,
electrons in metals, Particle in three-dimensional box- degenerate state, Fermi Dirac Statistics,
Density of Energy states, Electron in periodic potential, Bloch Theorem, Metals and Insulators,
Energy bands in solids, Effective mass of electron, Concept of holes.

UNIT-IV [9 Hours]
Thermal Physics :Transfer of heat energy, thermal expansion of solids and liquids, expansion
joints, bimetallic strips, thermal conduction, convection and radiation, heat conductions in solids,
thermal conductivity, Forbe’s and Lee’s disc method: theory and experiment, conduction through
compound media (series and parallel), thermal insulation, applications: heat exchangers,
refrigerators, ovens and solar water heaters.
UNIT-V [9 Hours]
Quantum Physics : Black body radiation, Planck’s theory (derivation), Compton effect: theory
and experimental verification, wave particle duality, electron diffraction, concept of wave function
and its physical significance, Schrödinger’s wave equation, time independent and time dependent
equations, particle in a one-dimensional rigid box, tunnelling (qualitative), scanning tunnelling
microscope.
Text Books
1. Rajendran.V,” Engineering Physics”, Tata McGraw-Hill, 2010
2. Bhattacharya, D.K. & Poonam, T. “Engineering Physics”, Oxford University Press,2015.
3. Gaur, R.K. & Gupta, S.L. “Engineering Physics”. Dhanpat Rai Publishers, 2012
Reference Books

1. Pandey, B.K. & Chaturvedi, S. “Engineering Physics”. Cengage Learning India, 2021

2. Brij Lal and N.Subramaniam,,” Properties of Matter ,S. Chand & Co. New Delhi. New
Edition , 2015.
COURSE CODE COURSE TITLE L T P C
PHY 151 Engineering Physics Lab 0 0 2 1
Course Outcome: Upon completion of this course, the students will be able to:
Remembering tools, materials, and basic operations used in plumbing, carpentry,
CO1:
welding, fitting, machining, electrical, and electronics practices.
Understanding the working principles of household systems like electrical wiring, plumbing
CO2:
layouts, carpentry joints, and basic electronic circuits.
Applying workshop skills to perform plumbing connections, wood joints, welding,
CO3:
basic machining, household wiring, and assembling electronic components.
Analyzing circuit behaviour, logic gate operations, and mechanical assemblies to
CO4:
identify faults, improve design, or enhance functionality in practical setups.
Practical

List of Experiments:

1(a) Determination of wavelength, and particle size using Laser

(b) Determination of acceptance angle in an optical fiber.

2. Determination of Young’s modulus by non-uniform bending method

3. Determination of thermal conductivity of a bad conductor – Lee’s Disc method

4. RC coupled Oscillator

5. Ultrasonic Interferometer-Determination of Velocity of Ultrasonic waves and compressibility

of the given liquid

6. Determination of band gap of a semiconductor

7. LC circuit and LCR circuit

8. Measurement of speed of light on a table top using modulation

9. Experiments on electromagnetic induction and electromagnetic breaking.

Semester 3
COURSE CODE COURSE TITLE L T P C
BIM 202 Object Oriented Programming using Java 3 0 0 3
Course Outcome
Remembering the basic concepts of database systems and recognize the components
CO1:
of E-R models and diagrams."
Understanding the use of Oracle data types, SQL functions, constraints, and logical operators
CO2:
to build and manage relational databases efficiently.
Applying concepts of distributed databases and client-server architecture to design
CO3:
scalable and accessible database systems.
Analyzing the core principles of transaction management, including ACID properties,
CO4:
concurrency control, and recovery techniques, to ensure data consistency and integrity.
COURSE CONTENTS
UNIT-I [9 hours]
Introduction:
History and Overview of Java, Object Oriented Programming, Control statements- if and for loop.
Using Blocks of codes, Lexical issues - White space, identifiers, Literals, comments, separators,
Java Key words, Data types - Integers, Floating point, characters, Boolean, A closer look at
Literals, Variables, Type conversion and casting. Automatic type promotion in Expressions
Arrays. Operators - Arithmetic operators, Bit wise operators, Relational Operators, Boolean
Logical operators, Assignment Operator, Operator Precedence. Control Statements – Selection
Statements - if, Switch, Iteration Statements - While, Do-while, for Nested loops, Jump statements.

UNIT-II [9 hours]
Classes:
Class Fundamentals, Declaring objects, Assigning object reference variables. Methods -
constructors, “this” keyword, finalize() method A stack class, Over loading methods. Using
objects as parameters, Argument passing, Returning objects. Recursion, Access control,
Introducing final, understanding static. Introducing Nested and Inner classes. Using command line
arguments. Inheritance – Basics, Using super, method overriding, and Dynamic method Dispatch,
Using abstract classes and final with Inheritance.

UNIT-III [9 hours]

Packages:
Definition. Access protection importing packages. Interfaces: Definition and implementation.
Exception Handling – Fundamentals, types, Using try and catch and Multiple catch clauses,
Nested try Statements, throw, throws, finally. Java’s built-in exception, using Exceptions.
UNIT-IV [9 hours]
Multithreaded Programming:
Java thread model – main thread, creating single and multiple thread. Is alive() and join(). Thread
– Priorities, Synchronization, Inter thread communication, suspending, resuming and stopping
threads, using multi-threading. I / O basics – Reading control input, writing control output,
Reading and Writing files. Applet Fundamentals – AWT package, AWT Event handling concepts,
the transient and volatile modifiers. Using instance of using assert.
UNIT-V [9 hours]
JAVA Database Connectivity (JDBC)
Database connectivity – JDBC architecture and Drivers. JDBC API - loading a driver, connecting
to a database, creating and executing JDBC statements, handling SQL exceptions. Accessing result
sets: types and methods. An example - JDBC application to query a database.
Text Books
1. "Java: The Complete Reference" by Herbert Schildt, McGraw-Hill Education, December 18,
2020.
2. "Effective Java" by Joshua Bloch,Addison-Wesley Professional,December 27, 2017.
Reference Books
1. "Java How to Program" by Paul Deitel and Harvey Deitel,Pearson,April 16, 2021.
COURSE CODE COURSE TITLE L T P C
BIM 252 Object Oriented Programming using Java Lab 0 0 2 1
Course Outcome
Remembering and applying fundamental programming constructs in Java to perform
CO1:
basic operations like string manipulation, number processing, and arithmetic
computations.
Understanding array operations and data structures by implementing insertion, sorting, and
CO2:
utilizing Java’s built-in collections such as TreeSet and Stack.
Applying Java's standard libraries such as the Math class and file I/O classes to
CO3:
perform mathematical calculations and file handling tasks including copying,
counting, and filtering files.
Analysing interactions between Java programs and the operating system to
CO4:
implement system-level functionalities like memory management and application
execution.

Practicals
List of Experiments:

1 Write a program to check whether two strings are equal or not.

2. Write a program to display reverse string.
3. Write a program to find the sum of digits of a given number.
4. Write a program to display a multiplication table.
5. Write a program to display all prime numbers between 1 to 1t000.
6. Write a program to insert element in existing array.
7. Write a program to sort existing array.
8. Write a program to create object for Tree Set and Stack and use all methods.
9. Write a program to check all math class functions.
10.,Write a program to execute any Windows 95 application (Like notepad, calculator etc)
11. Write a program to find out total memory, free memory and free memory after executing
garbage Collector (gc).
Part B

1. Write a program to copy a file to another file using Java to package classes. Get the file
names at run time and if the target file is existed then ask confirmation to overwrite and take
necessary actions.

2. Write a program to get file name at runtime and display number f lines and words in that file.

3. Write a program to list files in the current working directory depending upon a given pattern.
4. Create a text field that allows only numeric value and in specified length.

5. Create a Frame with 2 labels, at runtime display x and y command-ordinate of mouse pointer
in the labels.
COURSE CODE COURSE TITLE L T P C
CSE 203 Data Structures and Algorithms 3 0 0 3
Course Outcome: After Completing the course, the students will be able to
Analyzing the performance of algorithms through asymptotic analysis including best,
CO1:
average, and worst-case scenarios to choose the most suitable algorithm for a given
problem.
Understanding algorithmic strategies such as sorting, searching, divide and conquer, greedy,
CO2:
and dynamic programming to comprehend how they contribute to efficient problem-solving.
Applying linear data structures like arrays, stacks, queues, and linked lists in real-
CO3:
world scenarios such as memory management, scheduling, and expression evaluation.
Analyzing operations on trees and graphs by implementing traversal techniques and
CO4:
optimization strategies for solving complex computational problems like shortest
paths and minimum spanning trees.
COURSE CONTENTS
UNIT-I [9 Hours]
Fundamentals of Algorithms
Algorithm definitions, Asymptotic notations, O-notation, Omega notation and theta notation.
Time complexity and space complexity, Average and worst-case analysis.
UNIT-II [9 Hours]
Types of algorithms
Sorting and searching algorithms, Divide and conquer algorithms, Greedy algorithms, Dynamic
programming, Graph Algorithms, String matching, The class P and NP problems
UNIT-III [9 Hours]
Linear Data Structures:
Arrays and its operations. Stacks: LIFO structure, create, POP, PUSH, delete stack. Queues: FIFO
structure Priority Queues, Circular Queues, operations on Queues. Linked Lists: Nodes, Linked
List operations: Create List, Insert Node (empty list, beginning, Middle, end), Delete node (First,
general case), Search list, Retrieve Node, add node, Remove node, Print List.
UNIT-IV [9 Hours]
Trees:
Introduction to Trees, Binary Trees : Travesals (breadth-first, depth-first), Expression Trees: Infix,
Prefix, Postfix Traversals. Search Trees, Binary Search Trees, B Trees, AVL trees. Heaps:
Structure, Basic algorithms – Reheap Up, Reheap Down, Build heap, Insert, Delete.
UNIT-V [9 Hours]
Graphs
Terminology, Operations: Add vertex, delete vertex, Add Edge, Delete Edge, Find vertex,
Traverse Graph: Depth-First, Breadth-First. Graph Storage Structures :Adjacency Matrix,
Adjacency List.
Text Books
 1. Data Structures and Algorithms in C" by Michael T. Goodrich, Roberto Tamassia, and David M.
Mount (Publication Date: 2018).
2. "Data Structures and Algorithms Made Easy: Data Structures and Algorithmic Puzzles" by
Narasimha Karumanchi (Publication Date: 2017).
Reference Books

1. "Data Structures and Algorithms: A First Course" by T. R. Padmanabhan (Publication

Date: 2018).

2. "C Programming for the Absolute Beginner, Second Edition" by Michael Vine (Publication
Date: 2018).
COURSE CODE COURSE TITLE L T P C
CSE 253 Data Structures and Algorithms Lab 0 0 2 1
Course Outcome
Remembering: Recall and recognize basic operating system concepts including CPU
CO1:
scheduling, memory management, disk scheduling, file handling, and process
synchronization.
Understanding: Interpret system-level behavior by observing how different algorithms and
CO2:
OS components interact through simulation and experimentation.
Applying: Implement process scheduling, memory allocation, file operations, and disk
CO3:
scheduling algorithms using programming languages and system calls.
Analyzing: Examine and evaluate the performance of OS mechanisms like paging,
CO4:
synchronization, and deadlock recovery through simulation and result comparison.
COURSE CONTENTS
Practicals

List of Experiments:

1. Write a program in C to calculate the time and space complexity of a given algorithm. The
program should take input as the size of the input data and measure the execution time and
space used by the algorithm for different input sizes.
2. Write a program in the programming language in C to compare the performance of different
sorting algorithms. The program should implement at least three sorting algorithms (e.g.,
bubble sort, insertion sort) and measure their execution time for different input sizes.
3. Write a program in C to implement a divide-and-conquer algorithm for finding the maximum
element in an array. Your program should include the following-
 Implement a recursive function that takes an array of integers, starting index, and ending
index as input and returns the maximum element in the array.
 Divide the array into smaller subarrays and recursively find the maximum element in each
subarray.
 Combine the results from the subarrays to find the maximum element in the original array.
 Test your program with different arrays and analyze its performance.
 Display the input array and the maximum element found.
4. Write a program in C to implement and perform various operations on a stack. The program
should allow the user to create a stack, push elements onto the stack, pop elements from the stack,
and display the contents of the stack.
5. Write a program in C to implement and perform various operations on a singly linked list. The
program should allow the user to create a linked list, insert nodes at different positions, delete
nodes, search for a specific value, retrieve nodes, add nodes, remove nodes, and print the contents
of the linked list.
6.Write a program in C to implement the operations of a Binary Search Tree (BST). Your program
should include the following functionalities:
 Create a structure to represent a node in a BST, containing an integer key and left and right
child pointers.
  Implement a function to create a new node and initialize its key and child pointers.
 Implement functions to perform the following operations:
 Insert a node with a given key into the BST.
 Delete a node with a given key from the BST.
 Search for a node with a given key in the BST.
 Traverse the BST using both breadth-first and depth-first traversal techniques.
 Display the BST in different traversal orders, such as in-order, pre-order, and post-order.
7. Write a program in C to implement various operations on a graph. Your program should include
the following functionalities:
 Create a structure to represent a graph, containing variables for the number of vertices and
edges, and data structures to store the graph using either an adjacency matrix or an
adjacency list.
 Implement functions to perform the following operations:
 Add a vertex to the graph.
 Delete a vertex from the graph.
 Add an edge between two vertices.
 Delete an edge between two vertices.
 Find a vertex in the graph.
 Traverse the graph using both depth-first and breadth-first traversal techniques.
8. Perform the following on arrays-
a) Count the frequency of each element of an array.
b) Count the total number of duplicate elements in an array.
c)Insert a New value in the array (sorted list).

9. Write C programs for the following-

a. Finding Factorial – Iterative Approach and Recursive Approach
b. Printing Fibonacci Series – Iterative Approach and recursive approach
10. Write a C Program to Reverse a Stack using Recursion.
11. Write a C Program to Implement Two Stacks using a Single Array and Check for Overflow
and Underflow.
12. Write a C Program to Check String is Palindrome using Stack.
13. Write a C Program to Identify whether the String is Palindrome or not using Stack.
14. Write a C Program to Implement Queues using Stacks.
15. Write a program to implement AVL tree.
PART-B
1. Sort a given set of elements using the Quick sort method and determine the time
required to sort the elements. Repeat the experiment for different values of n.
2. Implement a merge sort algorithm to sort a given set of elements and determine the time
required to sort the elements. Repeat the experiment for different values of n.
3. Implement Knapsack problem with its complexity and efficiency.
4. Demonstrate-
 Breadth First Search (BFS) algorithm.
 Depth First Search algorithm
COURSE CODE COURSE TITLE L T P C
BIM 208 Probability and Statistics 3 1 0 4
Course Outcome
Remembering and recalling fundamental concepts of probability and statistics,
CO1:
including key terminologies, laws, and foundational theories.
Understanding statistical measures and probability distributions to interpret data
CO2:
characteristics, graphical representations, and their implications.
Applying probability theory and statistical techniques to solve real-world problems
CO3:
involving uncertainty, randomness, and data interpretation.
Analyzing relationships between variables using correlation and regression models,
CO4:
and evaluating data behavior using measures of dispersion and probability
distributions.
COURSE CONTENTS
UNIT-I [9 Hours]

Introduction to Probability and Statistics

Probability: History, Terminology of probability, Formula for Probability, priori probability,
limitations of classical probability, statistical or empirical probability, theory of sets, elements of
sets, operations on sets, algebra of sets, axiomatic approach to probability, theorems on
probabilities of events, law of probability theory, Introduction to conditional probability and
expectations, examples for conditional probability and expectation, properties of conditional
random variables, Bayes theorem and Independence, application of Bayes Theorem,
Statistics: History, Types of statistics, types of data, variables, types of variables based on
measurement, based on observation, the difference between cross-sectional and time series data,
sample, population, parameter, estimation, estimator, sampling distribution and standard error,
application of statistics in different areas.
UNIT-II [8 Hours]

Random Variables and Expectations:

Random variables- discrete, continuous, and mixed random variables, statistical properties of
random variables, Expectation of random variables, expectation of random variables in terms of
variance and covariance, jointly distributed random variables, moment generating function,
characteristic function, limit theorems related to random variables. Markov inequality,
Chebyshev’s inequality. Probability function, probability density function, and probability mass
function.
UNIT-III [10 Hours]

Summarizing Data Using Statistical Measures:

Measures of central tendency - Mean: Arithmetic mean, geometric mean, and harmonic mean with
its mathematical properties, the mathematical relationship among these different means, median
for raw data–odd number and even number, grouped data, a mode for raw data grouped data,
properties mean, median and mode and relationship among mean, median and mode.
Measures of dispersion – range, mean deviation, quartile deviation, standard deviation, variance,
covariance and its properties, coefficient of variation, skewness, kurtosis.
Graphical representation of data: Uni-dimensional, bi-dimensional, and multidimensional.
UNIT-IV [8 Hours]

Correlation and Regression:

Correlation analysis, simple and multiple correlations, coefficient of correlation, properties of the
correlation coefficient, the significance of single correlation coefficient, the significance of
multiple correlation coefficient, linear model, assumptions of the linear model, estimation of
parameters using OLS, regression analysis, properties of regression coefficients, the significance
of regression coefficient, multiple linear regression analysis, assumptions, the significance of
estimated parameters.
UNIT-V [10 Hours]

Probability Distribution:
Introduction to Probability Distribution, Discrete Probability Distribution: Bernoulli Distribution.
Binomial Distribution. Poisson Distribution, Hypergeometric Distribution, Continuous Probability
Distribution: Normal Distribution, Exponential Distribution, Gamma Distribution
Text Books
1. Fundamentals of mathematical statistics – SC Gupta and VK Kapoor, Sultan Chand & Sons
Publication, NewDelhi.
2. Introduction to probability Models, Ninth Edition – Sheldon M. Ross, Elsevier Publication,
Academic Press, UK.
Reference Books

1. Introduction to probability Models, Ninth Edition – Sheldon M. Ross, Elsevier Publication,

Academic Press, UK.

2. Introduction to Probability and Statistics for Engineers and Scientists, Third Edition -
Sheldon M. Ross, Elsevier Publication, Academic Press, UK.
3. An introduction to Probability and Statistical Inference – George Roussas, Academic Press.
Semester 4
COURSE CODE COURSE TITLE L T P C
BIM 206 Python Programming 2 0 0 2
Course Outcome
Remembering and recalling fundamental Python programming concepts, including
CO1:
core syntax, data types, type conversion, and string operations.
Understanding the flow of control in Python by interpreting conditional statements, loops, and
CO2:
basic data structures such as lists, tuples, and dictionaries.
Applying modular programming principles by creating user-defined functions,
CO3:
modules, and packages to develop structured and maintainable Python programs.
Analyzing object-oriented programming constructs, inheritance hierarchies, and
CO4:
exception handling mechanisms to design robust, reusable, and error-tolerant Python
solutions.

COURSE CONTENTS
UNIT-I [6 hours]
An Introduction to Python:History and development of Python, Why Python? Grasping
Python’s core philosophy – Installation - Python Interpreter – Interpreter and its environment.
Working at the command line or in the IDE, Installing Anaconda on Windows, Linux and MAC,
Syntax and Indentation.
Online IDE: Introduction to Google colab note book, Setting up a new Colab notebook.
Basic Python: Print statement, Comments, Variables, Assignments, Numbers and Operators.
Data types: Numeric, Dictionary, Boolean, Set, Sequence and type.
Type Conversion: Implicit and explicit conversion (casting). Creating and using String
UNIT-II [6 hours]
Flow Control in Python:
Python Statement: If Statement, If else statement, elif statement, short hand if, else statement,
While Statement, Definite Loops vs Indefinite Loops, Nested Loops, Abnormal Loop
Termination, While/else and for/else, for statement, Range statement.
Conditional expression: AND, OR, NOT.
Python Conditions: Nested Conditions using all conditional statements, Break and continue using
all conditional statements statement, Python pass.
Data structures: List, tuple, string, set and dictionary.
UNIT-III [6 hours]
Functions module and package:
Introduction to module: Creating a module, Importing a module, Advantage of modules.
Introduction to functions: Calling a function, Types of function, Arguments and Parameters,
*args and **kwargs, Lambda function and map, Array in Python.
Scope of Function: Global and local variable or Scope.
Insights of Function: Return function, Iterator function, Generator function, Difference between
Iterator and generator, First class function, Python recursion(memorization).
Package: Introduction to package creating package, Date, Time, Math, Json, Regex, Pip.
UNIT-IV [6 hours]
Python OOP:
Introduction to Object oriented programming: Concept of OOP, Advantage of OPP, Class and
Object.
Python Classes and Objects: Creating classes and objects, Class constructors and destructors,
Instance variables and methods, Class variables and methods.
Inheritance: Creating a subclass, Overriding methods, Accessing parent class methods and
attributes, Polymorphism.
Encapsulation: Access modifiers, Properties and getters/setters, Private and protected members.
UNIT-V [6 hours]
File Handling:
Introduction to File Handling: Types of files, Opening and closing files, Reading from a file,
Writing to a file, File modes.
Reading and Writing Text Files: Reading a file line by line, Writing to a file line by line,
Appending to a file, Using 'with' statement, simple input output function, output formatting.
Reading and Writing Binary Files: Opening binary files, Reading binary files, Writing to binary
files, Pickling and unpickling objects.
Text Books
1. Timothy A. Budd, Exploring Python, Tata McGraw-Hill Edition - 2011.
2. Guido Van Rossum, Fred. L. Drake, Introduction to Python, Network Theory Limited -March
2011.
Reference Books
1. Lutz Mark, Programming Python Paperback - 2011, Fourth Edition - 2011.
COURSE CODE COURSE TITLE L T P C
BIM 254 Python Programming Lab 0 0 4 2
Course Outcome
Remembering the basic programming constructs in Python by performing arithmetic
CO1:
operations, string manipulations, and debugging code using an IDE.
Understanding fundamental Python data types such as strings, integers, floats, booleans, lists,
CO2:
and dictionaries through practical examples like building a Student Grade Tracker.
Applying control structures including conditional statements and loops to solve real-
CO3:
world problems like number classification, factorial computation, and Fibonacci
generation.
Analyzing object-oriented programming features in Python by creating and
CO4:
manipulating objects, instance variables, and class structures.
Practical’s
UNIT-I List of Experiments
1) Installing Python: Install Python on your computer and test that it is working correctly by
opening the Python interpreter and executing some basic commands.
a) Using an IDE: Install and use an integrated development environment (IDE) such as
PyCharm or Visual Studio Code. Create a new Python project, write some code, and execute it.
b) Basic Python Operations: Write a Python program to print "Hello World!" on the screen.
Write a program to perform basic arithmetic operations such as addition, subtraction,
multiplication, and division.

2) Data Types: Crete a Student Grade Tracker system using python that uses various data types
such as strings, integers, floats, booleans, lists, and dictionaries to implement these functionalities.

3) Write a program that prompts the user to enter a number, and then prints "Positive" if the number
is greater than zero, "Negative" if the number is less than zero, and "Zero" if the number is equal
to zero.

4) Write a program that prompts the user to enter a password. If the password is "password123",
the program should print "Access granted". Otherwise, the program should print "Access denied".

5) Write a program that prompts the user to enter a number, and then prints the factorial of that
number using a while loop.

6) a) Write a program that prints the first 10 numbers of the Fibonacci sequence using a for loop.
b) Write a program that prompts the user to enter a string, and then prints each character of the
string on a separate line using a for loop.
c) Write a program that prints the first 10 even numbers using a while loop.

7) Write a program that prompts the user to enter two numbers, and then prints the larger number
using a conditional expression.
8) Write a program that prompts the user to enter a number, and then prints "Positive" if the number
is greater than zero, "Negative" if the number is less than zero, and "Zero" if the number is equal
to zero, using a conditional expression.

9) Creating and using classes and objects:

a) Create a class for a car with instance variables for make, model, and year
b) Create an object for a car and set its make, model, and year
c) Print the car's details using its instance variables

10) i) File Handling Objective Tasks:

a) Create a new text file and write some text to it.
b) Open the file in read mode and display its contents.
c) Open the file in append mode and add some more text to it.
d) Open the file in write mode and overwrite its contents with new text.
ii) Reading and Writing Text Files Objective:
a) Read a text file line by line and display each line.
b) Write text to a new text file line by line.
c) Append text to an existing text file.
d) Use the 'with' statement to open a file and read its contents.
e) Use the 'with' statement to open a file and write text to it.

Text Books
1. Timothy A. Budd, Exploring Python, Tata McGraw-Hill Edition - 2011.
2. Guido Van Rossum, Fred. L. Drake, Introduction to Python, Network Theory Limited -March
2011.
Reference Books
1. Lutz Mark, Programming Python Paperback - 2011, Fourth Edition - 2011.
COURSE CODE COURSE TITLE L T P C
CSE 208 Database Management Systems 3 0 0 3
Course Outcome: After Completing the course, the students will be able to
Remembering and recalling fundamental database concepts such as data models,
CO1:
database architecture, SQL syntax, and relational algebra operations.
Understanding the principles of relational databases by interpreting E-R diagrams, relational
CO2:
models, and normalization techniques.
Applying SQL queries, relational operations, and database programming constructs to
CO3:
build and manage database systems efficiently.
Evaluating the quality of database designs and transaction management strategies by
CO4:
analyzing normalization, concurrency issues, and recovery mechanisms.
COURSE CONTENTS
UNIT-I [9 hours]
Introduction Purpose of Database System
Introduction Purpose of Database System -– Views of data – Data Models – Database Languages
–– Database System Architecture – Database users and Administrator – Entity– Relationship
model (E-R model) – E-R Diagrams.

UNIT-II [9 hours ]
Relational Model-I
Introduction to relational databases- The Relational Model – The catalog- Types– Keys -
Relational Algebra – Domain Relational Calculus – Tuple Relational Calculus - Fundamental
operations – Additional Operations- SQL fundamentals. Oracle data types, Data Constraints,
Column level & table Level Constraints, working with Tables. Defining different constraints on
the table, Defining Integrity Constraints in the ALTER TABLE Command, Select Command,
Logical Operator, Range Searching, Pattern Matching, Oracle Function, Grouping data from
Tables in SQL and Manipulation Data in SQL.

UNIT-III [9 hours]
Relational Model-II
Joining Multiple Tables (Equi Joins), Joining a Table to itself (self Joins), Sub queries Union,
intersect and Minus Clause, Creating view, Renaming the Column of a view, Granting
Permissions, - Updating, Selection, Destroying view Creating Indexes, Creating and managing
User Integrity – Triggers - Security – Advanced SQL features –Embedded SQL– Dynamic SQL-
Missing Information– Views – Introduction to Distributed Databases and Client/Server Databases.

UNIT-IV [9 hours]
Transactions
Transaction Concepts - Transaction Recovery – ACID Properties – System Recovery – Media
Recovery – Two Phase Commit - Save Points – SQL Facilities for recovery –Concurrency – Need
for Concurrency – Locking Protocols – Two Phase Locking – Intent Locking – Deadlock-
Serializability – Recovery Isolation Levels – SQL Facilities for Concurrency.
UNIT-V [9 hours]
Database Design
Functional Dependencies – Non-loss Decomposition – Functional Dependencies – First, Second,
Third Normal Forms, Dependency Preservation – Boyce/Codd Normal Form-Multi-valued
Dependencies and Fourth Normal Form – Join Dependencies and Fifth Normal Form.

Text Books
3. "Database Management Systems" by Raghu Ramakrishnan and Johannes Gehrke (2019) - This is
a widely used textbook that covers the fundamentals of database management systems, including
relational data models, SQL, transaction management, and database design.
4. "Database Systems: Introduction to Databases and Data Warehouses" by Nenad Jukic, Susan
Vrbsky, and Svetlozar Nestorov (2017) - This textbook provides an Introduction to database
management systems and data warehouses, covering topics such as database design, SQL,
transaction management, and data warehousing.
5. "Database Systems: Design, Implementation, and Management" by Carlos Coronel, Steven Morris,
and Peter Rob (2016) - This textbook covers the principles and practical aspects of database
systems, including database design, implementation, and management, with a focus on real-world
examples and applications.
6. "Modern Database Management" by Jeffrey A. Hoffer, V. Ramesh, and Heikki Topi (2019) - This
textbook covers the fundamentals of database management systems, including database design,
implementation, and administration, with a focus on practical applications and real-world
examples.
Reference Books

2. Database Design for Mere Mortals: A Hands-On Guide to Relational Database Design" by
Michael J. Hernandez (2018) - This book covers the principles and techniques of database
design, including normalization, relationships, keys, and indexes, with practical examples
and exercises for designing efficient and effective relational databases.

3. "Foundations of Modern Database Management" by Jeffrey A. Hoffer, V. Ramesh, and

Heikki Topi (2018) - This textbook provides a comprehensive introduction to database
management systems, covering topics such as data modeling, SQL, transaction
management, and database design, with a focus on modern database technologies.
4. "Big Data: A Revolution That Will Transform How We Live, Work, and Think" by Viktor Mayer-
Schönberger and Kenneth Cukier (2018) - This book provides an overview of big data and its
impact on various aspects of society, including business, government, and technology, with
insights into the challenges and opportunities of managing large and complex databases.
COURSE CODE COURSE TITLE L T P C
CSE 254 Database Management Systems Lab 0 0 2 1
Course Outcome
Remembering and recalling fundamental SQL operations such as user creation,
CO1:
privilege assignment, and schema management using DDL and DML commands.
Understanding relational database concepts by working with views, aggregate functions, and
CO2:
join operations to comprehend data relationships and structure.
Applying PL/SQL constructs to develop procedures and functions that solve practical
CO3:
problems like prime number generation, salary computation, and data summarization.
Analyzing and enforcing business logic through PL/SQL triggers by identifying data
CO4:
operation patterns and integrating complex constraints and rules.
List of Practicals
UNIT-I [9 SESSIONS]

1.Perform following actions using SQL statements

• Create a new user with name “shiva” and password “kumar@1”
• Assign the following privileges
• Create and drop tables
• Create and drop users
• Allow to assign above privileges to new users
• List all tables in the database
• List all users in the database
• Logout from current user and log in as “shiva”
2.Create the following tables and insert minimum 10 rows in to each table Department table with
following columns with appropriate data types
• DeptId
• DeptName
• DeptLoc
Employee table with following columns with appropriate data types
• EmpId
• EmpName
• DOB
• DOJ
• Job
• Salary
Product table with following columns with appropriate data types
• ProdId
• ProdName
• Price
Sales table with following columns with appropriate data types
• SalesId
• Date
• Quantity
3.Update above tables with following features using SQL statements
• Make DeptId in Department table as Primary Key
• Make EmpId in Employee table as Primary Key
• Add DeptId column to the Employee table and make it foreign key from Department table
and update the values
• Add EmpId and ProdId to the Sales table and make them foreign key from Employee and
Product table and update the values
• Update all columns in all tables with appropriate constraint such as not null, check and so
on
4.Perform the following SQL statements
Create a view “EmpDeptView” from Employee and Department table which contains following
columns-
• EmpName
• DOB
• Salary
• DeptId
• DeptName
• Loc
I. Retrieve all employees whose salary between 25,000 to 30,000
II. Retrieve all employees who is working in Accounts department (If it is not there add this
row to Department table)
III. Retrieve all employees who is working other than Accounts department
IV. Retrieve all employee who is working in Sales department and Bangalore location
V. Retrieve all employees who completed minimum 5 years
VI. Retrieve all employees who completed minimum 5 years and salary less than 30,000

5.Perform the following SQL statements

I. Retrieve all employees whose salary more than 30,000
II. Retrieve employee details who is getting maximum salary
III. Retrieve employee details who is getting minimum salary
IV. Retrieve employee details who is getting 3rd maximum salary
V. Retrieve employee details who is getting 5th minimum salary
VI. Retrieve total number of employees in each department in Bangalore location
VII. Retrieve total number of employees in each location
VIII. Retrieve total number of employees in each location in Accounts department
IX. Retrieve total number of employees who complete more than 10 years in each department
6.Write a PL/SQL Procedure to find prime number from 1 to n, n is a user input or parameter
7.Write a PL/SQL Functions to return number of days an employee working using EmpId
8.Write a PL/SQL Procedure to find sum of salaries of all employee working in a particular
location
9.Write a PL/SQL Function to return sum of sales by ProdId
10.Write a PL/SQL Function to return sum of sales by EmpId
11.Write a PL/SQL Procedure to generate Employee Report department wise as follows-
• DeptName
• EmpName
• JobLocation
• Salary
• Cumulative_Salary
12.Write a PL/SQL Trigger to insert row into OldEmployee table when a employee deleted from
the Employee table (Create OldEmployee table)
13.Write a PL/SQL Trigger not to delete more than 2 employees at a time
14.Write a PL/SQL Trigger not to update employee salary if it cross 67000
15.Write a PL/SQL Package with following procedures and functions
a. Procedures
I. Print Total Quantity Sales Summary Report (SalesId, Date, Quantity and Total Quantity)
II. Print Total Quantity Sales Summary Report by Date wise
b. Functions
I. Return employee name who made maximum sales till date
II. Return product name soled maximum quantity till date
Reference Books

1. "Database Design for Mere Mortals: A Hands-On Guide to Relational Database Design" by
Michael J. Hernandez (2018) - This book covers the principles and techniques of database
design, including normalization, relationships, keys, and indexes, with practical examples and
exercises for designing efficient and effective relational databases.
2. "Foundations of Modern Database Management" by Jeffrey A. Hoffer, V. Ramesh, and Heikki
Topi (2018) - This textbook provides a comprehensive introduction to database management
systems, covering topics such as data modeling, SQL, transaction management, and database
design, with a focus on modern database technologies.
3. "Big Data: A Revolution That Will Transform How We Live, Work, and Think" by Viktor Mayer-
Schönberger and Kenneth Cukier (2018) - This book provides an overview of big data and its impact
on various aspects of society, including business, government, and technology, with insights into the
challenges and opportunities of managing large and complex databases.
Semester 5
COURSE CODE COURSE TITLE L T P C
BIM 307 Machine Learning 3 0 0 3
Course Outcome
Remembering core Python programming concepts and data handling using libraries
CO1:
like NumPy, pandas, and Scikit-learn in the context of data science and machine
learning.
Understanding various machine learning models including linear regression, logistic
CO2:
regression, decision trees, and SVMs, along with their assumptions and applications.
Applying appropriate machine learning algorithms and techniques for classification,
CO3:
regression, and clustering tasks using Python-based libraries.
Analyzing the impact of data preprocessing and model selection on predictive
CO4:
performance through evaluation techniques and interpretation of results.
COURSE CONTENTS
UNIT-I [8 hours]
Introduction to Python: Introduction, IDE, Ecosystem for Data Science, SciPy, NumPy, pandas,
Scikit‐learn, Loading a Sample Dataset, Creating a Simulated Dataset, Loading a CSV, Excel,
JSON File, Querying Databases, data frame, operations on Data frames.
UNIT-II [9 hours]
Linear Regression: Introduction, fitting a Line, Handling Interactive Effects, fitting a Nonlinear
Relationship, Reducing Variance with Regularization, Reducing Features with Lasso Regression,
estimation of parameters, testing the significance of parameters.
UNIT-III [10 hours]
Trees, Ensemble models and K-Nearest Neighbours: Introduction, training a Decision Tree
Classifier and regressor, training a Random Forest Classifier, Training a Random Forest
Regressor, K-Nearest Neighbour Classifier.
UNIT-IV [9 SESSIONS]
Logistic Regression, SVM and Neural Network: Training a Binary and Multiclass Classifier,
training a Linear Classifier, SVM, Designing a Neural Network, Reducing Overfitting with
Weight Regularization and Early Stopping, Tuning and visualizing Neural Networks.
UNIT-V [10 hours]
Unsupervised Machine Learning: Introduction, clustering – K-Means and Hierarchical
clustering, factor analysis, deciding the number of factors, principle component analysis, deciding
the number of principle components.
Text Books
1. Machine Learning with Python Cookbook - Chris Albon, O’Reilly Media, Inc.
2. Python for Probability, Statistics, and Machine Learning, First Edition - José Unpingco, Springer.
Reference Books

1. Python for Data Analysis - Wes McKinney, O’Reilly Media, Inc.

2. Python for Dummies - Stef Maruch and Aahz Maruch, John Wiley & Sons, Inc.
3. Python for Data Science for Dummies - Luca Massaron and John Paul Mueller, John Wiley &
Sons, Inc.
COURSE CODE COURSE TITLE L T P C
BIM 355 Machine Learning Lab 0 0 2 1
Course Outcome
Remembering the fundamental concepts of regression techniques, including linear and
CO1:
logistic regression, and their use in solving real-world problems.
Understanding the principles of decision tree and random forest algorithms and their
CO2:
application in data classification tasks.
Applying classification algorithms such as SVM and KNN to solve machine learning
CO3:
problems and assess their effectiveness.
Analyzing the role of Principal Component Analysis (PCA) in dimensionality
CO4:
reduction and its impact on model accuracy and performance.
Practical’s
List of Experiments:
1. Explore and implement Regression algorithm in a given business scenario and comment
on its efficiency and performance.
2. Implement Logistic Regression algorithm in a given business environment and comment
on its efficiency and performance.
3. Implement Decision Tree Classification algorithm in a given business environment and
comment on its efficiency and performance.
4. Explore and implement SVM algorithm in a given business scenario and comment on its
efficiency and performance.
5. Explore and implement Random Forest algorithm in a given business scenario and
comment on its efficiency and performance.
6. Explore and implement PCA algorithm in a given business scenario and comment on its
efficiency and performance.
7. Explore and implement Naive Bayes algorithm in a given business scenario and comment
on its efficiency and performance.
8. Explore and implement KNN algorithm in a given business scenario and comment on its
efficiency and performance.
9. Explore and implement Clustering algorithm in a given business scenario and comment on
its efficiency and performance.
COURSE CODE COURSE TITLE L T P C
BIM 203 Operating Systems and Applications 3 0 0 3
Course Outcome
Remembering fundamental operating system concepts by simulating various process
CO1:
scheduling algorithms like FCFS, Round Robin, and Priority Scheduling.
Understanding memory management by implementing allocation strategies such as
CO2:
First-Fit, Best-Fit, and Worst-Fit to manage memory for processes.
Applying system-level programming techniques to perform file operations like
CO3:
creation, reading, writing, and deletion using system calls or file APIs.
Analyzing disk management strategies by implementing and simulating disk
CO4:
scheduling algorithms including FCFS, SSTF, SCAN, and C-SCAN.
COURSE CONTENTS
UNIT-I [6 Hours]
Introduction to Operating Systems :
Computer System Organization, Computer System architecture, Operating System generations,
Operating System structure, Operating System Types, Operating System design and
implementation,
Operating System Operations:
Process management, Memory management, Storage management, Protection and security,
Special-purpose systems,
Operating System Services:
Process scheduling, Memory allocation, Interrupt handling, Device driver management, File
system operations, Network protocol handling, Error handling, Power management, User interface,
System calls, System programs, Computing environments, System boot. Case Study on Windows/
Linux
UNIT-II [6 Hours]

Management:
Process concept, Process scheduling- Scheduling criteria, Scheduling algorithms, Multiple-
Processor scheduling, Operations on processes, Inter-process communication, Thread scheduling-
Multi-Threaded Programming Overview, Multithreading models, Thread Libraries, Threading
issues, Case Study on Windows/ Linux.
UNIT-III [6 Hours]
Process Synchronization and Deadlocks:
Process Synchronization, The Critical section problem, Peterson’s solution, Synchronization
hardware, Semaphores, Classical problems of synchronization, Monitors, Deadlocks System
model, Deadlock characterization, Methods for handling deadlocks, Deadlock prevention,
Deadlock avoidance, Deadlock detection and recovery from deadlock- Case Study on Windows/
Linux.

UNIT-IV [6 Hours]
Memory Management and File System:
Memory Management Background, Strategies, Swapping, Contiguous memory allocation,
Paging, Structure of page table, Segmentation, Virtual Memory Management Background,
Demand paging, Copy-on-write, Page replacement, Allocation of frames, Thrashing. Case Study
on Windows/ Linux. File System: File concept, Access methods, Directory structure, File system
mounting, File sharing, Protection. Implementing File System: File system structure, File system
implementation, Directory implementation, Allocation methods, Free space management- Case
Study on Windows/ Linux.

UNIT-V [6 Hours]
Input-Output Systems:
Introduction to I/O Systems: Overview of I/O devices and their characteristics, the role of I/O
systems in the overall system architecture. I/O Operations and I/O Control: Study of I/O
operations, including reading from and writing to I/O devices.
I/O Scheduling: Study of popular I/O scheduling algorithms, such as FCFS (First-Come-First-
Served), SSTF (Shortest Seek Time First), SCAN, C-SCAN, etc.Buffering and Caching:
Introduction to the concepts of buffering and caching in I/O systems.
Device Management: Study of device management techniques, including device allocation,
device reservation, and dealing with device conflicts.
Error Handling and Recovery: Overview of error handling and recovery mechanisms in I/O
systems.
I/O Virtualization: Introduction to I/O virtualization techniques and their significance in
virtualized environments. Understanding how virtualization allows multiple virtual machines to
share physical I/O devices efficiently.

Text Books
1. "Operating System Concepts" by Abraham Silberschatz, Greg Gagne, and Peter B. Galvin -
Tenth edition published in 2018
2. "Operating Systems: Principles and Practice" by Thomas Anderson and Michael Dahlin - Second
edition published in 2014.
3. "Windows Internals, Part 2: Covering Windows Server 2016 and Windows 10" by Mark E.
Russinovich, David A. Solomon, and Alex Ionescu - Seventh edition published in 2017.
Reference Books

1. "Modern Operating Systems" by Andrew S. Tanenbaum and Herbert Bos - Fourth edition
published in 2014.

2. "Operating Systems: Three Easy Pieces" by Remzi H. Arpaci-Dusseau and Andrea C.

Arpaci-Dusseau - First edition published in 2015.
COURSE CODE COURSE TITLE L T P C
BIM 251 Operating Systems and Applications Lab 0 0 2 1
Course Outcome
Remembering basic UNIX commands and fundamental operating system concepts
CO1:
used in system-level programming.
Understanding the working of process scheduling, memory management, and disk scheduling
CO2:
algorithms in operating systems.
Applying file handling and memory allocation techniques through programs using
CO3:
system calls and APIs.
Analyzing synchronization problems, deadlock situations, and paging techniques to
CO4:
evaluate system performance and reliability.
COURSE CONTENTS
Practicals

List of Experiments:

1. Implement a program that simulates different process scheduling algorithms (e.g., First-
Come, First-Served, Round Robin, Priority Scheduling) using a set of processes with arrival
times and burst times.
2. Develop a program that simulates memory allocation strategies (e.g., First-Fit, Best-Fit,
Worst-Fit) by allocating and deallocating memory blocks for a set of processes with varying
memory requirements.
3. Write a program that performs common file system operations like creating a file, reading
from a file, writing to a file, and deleting a file using system calls or file system APIs.
4. Implement a program that simulates different disk scheduling algorithms (e.g., FCFS, SSTF,
SCAN, C-SCAN) to demonstrate how disk I/O requests are scheduled and serviced.
5. Create a simple shell or command-line interface program that can execute basic commands
such as listing files, changing directories, creating files/folders, and executing other programs.
6. Develop a program that demonstrates synchronization mechanisms like semaphores or
mutexes to solve the classical synchronization problems like the producer-consumer problem
or the dining philosophers problem.
7. Write a program that detects and recovers from deadlock situations using resource allocation
graphs or deadlock detection algorithms like Banker's algorithm.
8. Create a program that visually demonstrates how different CPU scheduling algorithms work
by simulating the movement of processes in a CPU scheduling queue and the execution on
the CPU.
9. Execute 25 basic commands of UNIX.
10. Develop a simple paging system that includes a page table and a mechanism for translating
virtual addresses to physical addresses. Implement page fault handling and page replacement
algorithms such as FIFO or LRU.
Semester 6
COURSE CODE COURSE TITLE L T P C
BIM 207 Introduction to Artificial Intelligence 2 0 0 2
Course Outcome
Remembering fundamental concepts and the historical development of Artificial
CO1:
Intelligence, including basic terminology, types of agents, and elements of
intelligence.
Understanding the philosophical foundations, computational models, and ethical
CO2:
concerns associated with machine thinking and modern AI systems.
Applying the basic AI principles and techniques to model intelligent behavior in
CO3:
simple agent-based or rule-based systems.
Analyzing Critically examine the societal, industrial, and ethical implications of
CO4:
intelligent systems, evaluating both their potential benefits and limitations.
COURSE CONTENTS
UNIT-I [10 hours]

Introduction to Artificial Intelligence (AI):

What is Artificial Intelligence (AI)? Brief history of AI. Intelligence and artificial intelligence.
Elements of Intelligence – Reasoning, Learning, Problem Solving, Perception, Linguistic
Intelligence. Coming together of cognition, philosophy, math, linguistics, control theory and
computer science. Introduction to agent-Agent performance –Example of Agents- Agent Faculties
UNIT-II [10 hours]
Philosophy of AI:
Can machine think?: ‘Turning and testing-The Chinese room. Computation and representation-
Applications eras of AI-Computationalism-Ethics of AI-Impacts of AI, Limitations and
possibilities of AI, Concerns about AI, AI and the future.

UNIT-III [10 hours]

Intelligent System:
What is intelligence? Structure of intelligent system-Biological brain -Basic neural model-
Intelligent Agents- Rationality- Agent Environment- Agent architectures-the concept of
rationality-The structure of agent-The impact of AI in human labor-AI and the social equality.
Text Books
1. Artificial Intelligence A Modern Approach, Stuart J. Russell and Peter Norvig, Second Edition,
Pearson Education, Inc., Upper Saddle River; New Jersey 07458.
2. Artificial Intelligence: The Basics by Kevin Warwick, Professor of Cybernetics Kevin, first
published 2012 by Routledge.
3. Artificial intelligence A systems approach - by M. Tim Jones, INFINITY SCIENCE PRESS LLC,
2008.
Reference Books

1. “Artificial Intelligence: Foundations of Computational Agents”, by D. Poole, Cambridge

University Press, 2010.

2. “Artificial Intelligence and Intelligent Systems”, by Padhy N.P, 4th impression, Oxford
University Press, 2007.
3. “Super Intelligence Paths, Dangers and Strategies”, by Nick Bostrom, Oxford University Press.
COURSE CODE COURSE TITLE L T P C

Data and Visual Analytics 2 0 0 2

Course Outcome
Remembering core Python programming concepts and data handling using libraries like
CO1:
NumPy, pandas, and Scikit-learn in the context of data science and machine learning.
Understanding various machine learning models including linear regression, logistic regression,
CO2:
decision trees, and SVMs, along with their assumptions and applications.
Applying appropriate machine learning algorithms and techniques for classification,
CO3:
regression, and clustering tasks using Python-based libraries.
Analyzing the impact of data preprocessing and model selection on predictive performance
CO4:
through evaluation techniques and interpretation of results.
COURSE CONTENTS
UNIT-I [8 hours]
Data Definitions and Analysis Techniques: Elements, Variables, and Data categorization
Levels of Measurement Data management and indexing Introduction to Statistical Concepts:
Sampling Distributions, Resampling, Statistical Inference and Descriptive Statistics, Measures of central
tendency, Measures of location of dispersions
UNIT-II [9 hours]
Advance Data analysis techniques: Statistical hypothesis generation and testing, Chi-Square
test, t-Test, Analysis of variance, Correlation analysis, Maximum likelihood test, Regression
Modelling, Multivariate Analysis, Bayesian Modelling, Inference and Bayesian Network, Regression
analysis
UNIT-III [10 hours]
Data Wrangling: Intro to Data Wrangling, Gathering Data, Assessing Data, Cleaning Data. Design of
Visualizations, Univariate Exploration of Data,
Bivariate Exploration of Data, Multivariate Exploration of Data, Explanatory Visualizations.
UNIT-IV [9 SESSIONS]
Data Ecosystem: Overview of the Data Analyst Ecosystem, Types of Data, Understanding
Different Types of File Formats, Sources of Data, Overview of Data Repositories, NoSQL, Data
Marts, Data Lakes, ETL, and Data Pipelines, Foundations of Big Data, Big Data processing tools such as
Hadoop, Hadoop Distributed File System (HDFS), Hive, and Spark
UNIT-V [10 hours]
Data Visualization tools: Python visualization libraries (matplotlib, pandas, seaborn, ggplot,
plotly), Introduction to PowerBI tools, Examples of inspiring (industry) projects- Exercise: create
your own visualization of a complex dataset.
Text Books
1.Joel Grus, Data Science from Scratch, Shroff Publisher Publisher /O’Reilly Publisher Media
2.Annalyn Ng, Kenneth Soo, Numsense! Data Science for the Layman, Shroff Publisher Publisher
Reference Books
1. Jure Leskovek, Anand Rajaraman and Jeffrey Ullman. Mining of Massive Datasets. v2.1,

Cambridge

University Press.
COURSE CODE COURSE TITLE L T P C
BIM 401 Deep Learning 3 0 0 3
Course Outcome
Remembering the basic concepts and structure of deep neural networks and their
CO1:
components through design thinking approaches.
Understanding the techniques of generating, morphing, and searching images using deep
CO2:
learning methods.
Applying pre-trained deep learning models to solve real-world problems across
CO3:
domains.
Analyzing different deep-net architectures for handling tasks involving sequential
CO4:
inputs and outputs.
COURSE CONTENTS
UNIT-I [9 hours]
RNN and LSTM:
A brief overview on modelling sequences, RNN intuition, Training RNNs with back propagation,
Echo state networks, Hessian free optimization, Long short-term memory, Vanishing Gradient
problem, LSTM variations, Evaluating, Improving, tuning of RNN and applications of RNN.

UNIT-II [9 hours]
Self-Organizing Maps:
Overview on Self-Organizing maps, SOMs intuition, work flow of SOMs, Reading an Advanced
SOM, K-means clustering comparison, Evaluating and Improving of SOMs and applications of
SOMs.
UNIT-III [9 hours]
Auto Encoders:
Overview on Auto-Encoders, note on Biases, training an auto encoder, over complete hidden
layers, sparse auto encoders, De-noising auto-encoders, contractive auto-encoders, stacked auto-
encoders, Deep auto encoders, Building an Auto-encoder, Tuning and optimizing and applications
of auto encoders.
UNIT-IV [9 hours]
Boltzmann Machines:
Overview of Boltzmann Machines, Boltzmann machine Intuition, Energy-Based Models (EBM),
Restricted Boltzmann Machine, Contrastive Divergence, Deep belief networks, Deep Boltzmann
machines, Building, Evaluation and applications of Boltzmann Machines.
UNIT-V [9 hours]
General Adversarial Networks (GANs):
Overview of GANs, Intuition behind GANs, Working of GANs, Understanding the architecture
of GANs, Image creation with GANs, Evaluating, tuning the GANs and applications of GANs.
Text Books
 1. Deep Learning – by Ian Goodfellow, Yoshua Bengio and Aaron Courville, MIT press.
Reference Books
1. Neural Networks and Learning Machine – by Simon Haykin, Third Edition, Pearson Education.
COURSE CODE COURSE TITLE L T P C
BIM 451 Deep Learning Lab 0 0 2 1
Course Outcome
Remembering the fundamental concepts of TensorFlow operations and neural network
CO1:
structures for basic implementation tasks.
Understanding the design, optimization, and validation of machine learning models including
CO2:
regression and classification using advanced techniques.
Applying reinforcement learning algorithms like Q-learning and Monte Carlo
CO3:
simulations to solve decision-making and prediction problems.
Analyzing the performance of machine learning models with metrics such as grid
CO4:
search, cross-validation, and evaluating deployment outcomes through APIs and cloud
services.
COURSE CONTENTS
List of Experiments
1. Predict the stock of the company using RNN and LSTM networks.
2. Text classification using LSTM.
3. Create SOM for Text Clustering based on the Retail Transactions.
4. Classify the Hand-written digits using SOM networks.
5. Build an Image Re-constructor using Auto-encoders.
6. Build a recommendation engine using Boltzmann machines for the entertainment sector.
COURSE CODE COURSE TITLE L T P C
BIM 304 Natural Language Processing 3 0 0 3
Course Outcome
CO1: Remembering the foundational concepts, terminologies, and components of natural
language processing, including tokenization, lexical analysis, syntactic parsing, and
semantic analysis to build a strong understanding of text processing principles.
CO2: Understanding the process and importance of syntactic and semantic analysis in text
interpretation, corpus development, and statistical modeling, by explaining parsing
techniques, corpus structures, and NLP challenges in real-world contexts.
CO3: Applying natural language generation techniques, sentiment analysis, and statistical
models such as TF-IDF, n-gram, and word embeddings to solve practical language
processing tasks, including classification and structured data transformation.
CO4: Analyzing linguistic structures, semantic relationships, and statistical models (e.g.,
generative vs discriminative, classification models) to evaluate the effectiveness and
limitations of NLP algorithms and techniques.
COURSE CONTENTS
UNIT-I [6 hours]
Introduction to Natural Language Processing:
Introduction to text pre-processing, terminologies related with text processing, challenges of text
pre-processing, tokenization, sentence segmentation, introduction to lexical analysis, finite state
morphonology, finite state morphology, morphology vs lexical analysis, paradigm based lexical
analysis.
UNIT-II [6 hours]
Syntactic Parsing and Semantic Analysis:
Introduction to syntactic parsing, The Cocke–Kasami–Younger Algorithm, parsing as deduction,
Implementing Deductive Parsing, LR Parsing, Constraint-based Grammars, Issues in Parsing, Basic
Concepts and Issues in Natural Language Semantics, Theories and Approaches to Semantic
Representation, Relational Issues in Lexical Semantics, Fine-Grained Lexical-Semantic Analysis.

UNIT-III [6 hours]
Context- Natural Language Generation:
Introduction to natural language generation, simple Examples of Generated Texts, The Components
of a Generator: Components and level of representation, Approaches to Text Planning: The
Linguistic Component: Surface Realization Components, Relationship to Linguistic Theory, Chunk
Size, Assembling vs. Navigating, Systemic Grammars, Functional Unification Grammars.
UNIT-IV [6 hours]
Corpus Creation:
Introduction and definition of corpus in natural language processing, corpus size, Balance,
Representativeness, and Sampling, Data Capture and Copyright, Corpus Markup and Annotation,
Multilingual Corpora, Multimodal Corpora, Corpus Annotation Types, Morphosyntactic
Annotation, Treebanks: Syntactic, Semantic, and Discourse Annotation, The Process of Building
Treebanks, application of Treebanks.
UNIT-V [6 hours]
Statistical Techniques in Natural Language Processing :
Introduction to statistics and its importance in natural language processing, general linear model,
binary linear classification, one versus all method for multi-category classification, maximum
likelihood estimation in parameter estimation in linear classification techniques, concepts of
generative and discriminative models, introduction to sequence prediction model and its application
in natural language processing
Text Books
1. Hand Book of Natural Language Processing, Second Edition – NITIN INDURKHYA
FRED J. DAMERAU, CRC Press.
2. Natural Language Processing with Python – Steven Bird, Ewan Klein, Edward Loper
Reference Books
1. Mining Text Data - Charu C. Aggarwal, Cheng Xiang Zhai, Springer.

2. Text Mining Classification, Clustering, and Applications - Ashok N. Srivastava, Mehran

Sahami, CRC Press.
COURSE CODE COURSE TITLE L T P C
BIM 352 Natural Language Processing Lab 0 0 2 1
Course Outcome
Remembering the fundamental Natural Language Processing steps such as tokenization,
CO1:
normalization, and similarity measures like Jaccard’s and Smith-Waterman distance for
textual data preprocessing.
Understanding sentiment analysis techniques on real-world datasets like Twitter reviews and
CO2:
visualizing patterns through word clouds and frequency plots.
Applying NLP techniques to develop text-based models such as predictive text generators,
CO3:
chatbots, and language identifiers for practical applications.
Analyzing the effectiveness of advanced NLP methods like back-off mechanisms,
CO4:
Maximum Likelihood Estimation (MLE), and interpolation to improve language
modelling and prediction.
COURSE CONTENTS Practical’s
Lab Experiments

1. Autocomplete feature using NLP techniques.

2. Predictive text generator.
3. Language Identifier.
4. Sentiment analysis of a product with twitter data.
5. Classification of groups in incident management system.
6. Language translation form one to another.
7. Speech Analysis.
8. Develop a small conversational chatbot.
9. Text matching among different documents.
10.Sentiment analysis of Positive, negative and Neutral for Movie reviews.
Sr. Practical
No.
Exercise – 1
1. Tokenize the sentence into words for the further analysis (using Python Function)
2. Normalize the sentence to eliminate the unwanted punctuation, converting into lower case
1 or upper case of the entire document, expanding abbreviation, numbers into words and
canonicalization.
3. Apply similarity measures using Jaccard's Coefficient or Tanimoto coefficient
4. Apply similarity measures using the Smith Waterman distance

Exercise – 2
a. For the given data what is the maximum number of words used. Get the output for the
frequently occurred word in the given data?
2 b. Visualize the given text data with appropriate visual techniques?
c. Get the word cloud for the given data and interpret where the management need to give
highest attention to get the better income?
 Exercise – 3
3 a. Develop a back-off mechanism for Maximum Likelihood Estimate (MLE)
b. Apply interpolation on data to get mix and match
Exercise – 4
a. Perform the sentiment analysis, classifying comments using a Bayesian analysis.
b. Using ggplot2, plot the words which occurs more than 50 times.
4 c. Come out with word cloud and interpret the same.
Semester 7
Course code L T P C

Course title Image and Video Processing 3 0 0 3

Course outcome: will be able to work with images and videos in several ways. These methods can be used as
pre-processing steps for complex models.
1. Understand images and videos representation in a detailed manner.
2. Apply ML techniques for image processing in different scenarios.
3. Apply various object detection and image segmentation algorithms
4. Apply various image restoration techniques and algorithm
Course Contents / Syllabus
MODULE-I 8 Hours
Image representation and analysis, Introduction to computer Vision, Numerical representation of images,
Image augmentation, enhancement, processing, color transforms, geometric transforms, feature
recognition and extraction.
MODULE-II 8 Hours
Image Segmentation Object detection, breaking image into parts, finding contours and edges of various
objects in image, Background subtraction for video.
MODULE-III 8 Hours
Object Motion and tracking Tracking a single point over time, motion models to define object movement
over time, analyze videos as sequences of individual image frames, methods to track a set of features over
time, matching features from image frame to other, tracking a moving car using optical flow
MODULE-IV 8 Hours
Robotic localization Bayesian statistics to locate a robot in space, sensor measurements to safely navigate
an environment, Gaussian uncertainty, histogram filter for robot localization in python.

MODULE-V 8 Hours
Image Restoration Degradation model, noise models, estimation of degradation function by modeling,
restoration.
Text books:
1. Audio Video Systems, Bali & Bali, Khanna Book Publishing 2020.
2. Handbook of Image and Video Processing by Alan C. Bovik, Academic Press, 2000.
3. Python 3 Image Processing, Ashwin Pajankar, BPB Publication, 2019.
4. https://www.coursera.org/learn/image-processing
Course code L T P C

Course title Image and Video Processing Lab 0 0 2 1

Experiment List:
1. Various forms of image representation
2. Apply various image segmentation algorithms
3. Apply object motion and tracking
4. Apply object localization
5. Apply image restoration
COURSE CODE COURSE TITLE L T P C
BIM 402 Recommender System 3 0 0 3
Course Outcome
Remembering the fundamental concepts of recommender systems, including collaborative
CO1:
filtering, content-based filtering, knowledge-based, and hybrid approaches.
Understanding various data mining techniques used in recommender systems and how they
CO2:
support recommendation logic and performance.
Applying content-based recommender techniques to real-world scenarios by building
CO3:
recommendation engines based on user preferences and item attributes.
Analyzing the differences between content-based and neighborhood-based recommender
CO4:
systems, evaluating their advantages, limitations, and use cases.
COURSE CONTENTS
UNIT-I [9 Hours]

Introduction to Recommender System :

Introduction to recommender system, understanding recommender system, kinds of recommender
systems: collaborative filtering recommender system, content-based recommender system,
knowledge based recommender system, hybrid system, application and evaluation techniques,
recommender and human computer interaction, recommender system as multi-disciplinary field,
emerging topics and challenges in recommender system.
UNIT-II [9 Hours]

Data Mining Techniques in Recommender System:

Introduction to Data mining techniques, data pre-processing, data mining techniques used in
recommender system: similarity measures, sampling, Dimensionality reduction techniques,
denoising, k – means clustering, support vector machine, ensemble methods, rule based
classifiers, ANN, Bayesian Classifiers, association rule mining.
UNIT-III [9 Hours]
Content Based Recommender System:
Introduction to content-based Recommender System, High Level Architecture of Content-based
Systems, advantages and drawbacks of Content-based Filtering, item representation, methods for
learning user profiles, trends and future research: Role of user generated content in the
Recommendation Process, beyond Over-specializion: Serendipity.

UNIT-IV [9 Hours]
Neighbourhood based Recommender System:
Introduction to neighbourhood based recommender system, definition, overview of
recommendation approaches, advantages of neighborhood based recommender system,
neighborhood-based recommendation: user-based Rating Prediction, user- based classification,
regression vs classification, item-based recommendation, comparison of user-based and item-
based recommendation, components of Neighbourhood Methods: Rating normalization, similarity
weight computation, neighbourhood selection.
UNIT-V [9 Hours]
Context-Aware and Social Tagging Recommender Systems:
Introduction to context aware recommender systems, definition of context, modelling contextual
information in recommender system, obtaining contextual information, paradigms for
Incorporating Context in Recommender Systems : contextual pre filtering, post filtering and
modelling, case Study of Combining Multiple Pre-Filters: Algorithms and experimental results,
additional issues related to context aware recommender systems, Introduction to Social tagging
recommender systems: Folksonomy , the Traditional Recommender Systems Paradigm, multi-
Mode recommendations, real World Social Tagging Recommender Systems, tag acquisition.
Text Books

1. Recommender Systems An Introduction - DIETMAR JANNACH, MARKUS

ZANKER, ALEXANDER FELFERNIG, GERHARD FRIEDRICH, Cambridge
University Press.
Reference Books

1. Recommender Systems Handbook, Francesco Ricci, LiorRokach, BrachaShapira, Paul B.

Kantor, Springer Science + Business Media, LLC.

2. Building a Recommendation System with R - Suresh K. Gorakala, Michele Usuelli,

PACKT Publishing.
3. Recommender Systems for the Social Web – Jose J. Pazos Arias, Ana Fernandez Vilas, Rebeca P.
D ı́ az Redondo, Springer Science + Business Media, LLC.
COURSE CODE COURSE TITLE L T P C
BIM 452 Recommender System Lab 0 0 2 1
Course Outcome
Remembering the foundational concepts of collaborative filtering and similarity
CO1:
measures such as Pearson correlation, mean-centering, and adjusted cosine similarity.
Understanding the process of clustering users based on their preferences and describe how
CO2:
average ratings within clusters can be used for recommendation.
Apply probabilistic and rule-based techniques such as Naive Bayes and association
CO3:
pattern mining to create personalized recommendation models.
Analyzing hybrid recommendation strategies by combining collaborative, content-
CO4:
based, and event-based methods for different datasets like MovieLens and market
baskets.
COURSE CONTENTS

Practical’s

List of Experiments:
1. Download a MovieLens dataset and perform User-based collaborative filtering with
Pearson correlation and mean-centering.
2. Download a MovieLens dataset and perform Item-based collaborative filtering with
adjusted cosine similarity.
3. Consider an algorithm that performs clustering of users based on their ratings matrix and
reports the average ratings within a cluster as the predicted items ratings for every user
within a cluster.
4. Design a Bayes model that uses the item’s other ratings as a condition.
5. Implement the naive Bayes model for collaborative filtering.
6. Implement a rule-based classifier with the use of association pattern mining.
7. Perform Apriori Rule on market basket dataset.
8. Design an event based reommendation engine on event attendees dataset.
9. Build a Hybrid recommendation engine on Movie lens dataset.
10. Design a LightFM recommendation engine on a market basket dataset.
11. Build a popularity based recommendation engine on Music Dataset.
12. Build a content based recommendation engine on amazon reviews dataset.
COURSE CODE COURSE TITLE L T P C
BIM 406 Chatbot Development 3 0 0 3
Course Outcome
Remembering the foundational concepts of Natural Language Processing (NLP),
CO1:
including classical and deep learning approaches.
Understanding the principles of language modelling, including bigrams, CBOW, hierarchical
CO2:
softmax, and word2vec.
Applying deep learning architectures such as RNN, LSTM, and seq2seq to process
CO3:
natural language data.
Analyzing various NLP components like POS tagging, NER, sentiment analysis, and
CO4:
attention mechanisms for chatbot design.
COURSE CONTENTS
UNIT-I [9 hours]
Deep NLP Intuition :
Overview of NLP with Deep learning intuition, Types of NLP, Classical vs Deep learning models,
Building End-to-End Deep learning models, Bag of words, Seq-2-Seq Architecture & training,
beam search decoding, Attention Mechanisms.

UNIT-II [9 hours]
Language Modelling:
Bigrams and language models, Neural bigram model, Improving the efficiency, word embedding,
CBOW, Hierarchical softmax, word2Vec using tensorflow and Theano.

UNIT-III [9 hours]

Data Preprocessing:
POS tagging, RNN using Theano and Tensorflow, Hidden markov model(HMM), Named entity
recognition(NER), word embedding, word analogies, TF-IDF and t-SNE concepts, comparing
POS and NER, NER with Theano and Tensorflow.
UNIT-IV [9 hours]
Building Chatbot 1: Building the seq-2-seq model, training the model, understand the skip-gram
method in word2vec, Understand and implement GloVe using gradient descent and alternating
least squares, Using RNN for names entity recognition, implementing recursive neural networks
for the sentiment analysis.
UNIT-V [9 hours]
Building Chatbot 2: Encoding lexical semantics, sequence modeling & LSTM memory
networks, Augmenting the LSTM tagger with character level features, Dynamic programming,
BiLSTM-CRF for named entity recognition, loss function for discriminative tagging, Testing,
Improving and testing the seq2seq model. Chat bot implementation using tensorflow and
pytorch.
Text Books
 1. “Deep Learning with Application”, by Navin Kumar Manaswi.

2. “Deep Learning for NLP”, by Palash Goyal and Sumit Pandey.

Reference Books

1. “Building Chatbots with Python using Advance NLP Techniques”, by Sumit Raj.

2. “Speech and Language Processing”, by Dan Jurafsky and James H. Martin.

COURSE CODE COURSE TITLE L T P C
BIM 454 Chatbot Development Lab 0 0 2 1
Course Outcome
Remembering Recall fundamental concepts of Natural Language Processing (NLP),
CO1:
including classical models, language modeling techniques, and deep learning
applications.
Understanding Explain the differences between classical NLP models and deep learning-
CO2:
based approaches, and describe key techniques like attention mechanisms and embeddings.
Applying Implement sequence-to-sequence models, Bag of Words, CBOW, POS
CO3:
taggers, and NER systems using frameworks such as TensorFlow and Theano.
Analyzing Analyze the impact of optimization techniques such as subsampling,
CO4:
negative sampling, and hierarchical softmax on model efficiency and accuracy.
COURSE CONTENTS
UNIT-I Practical’s

List of Experiments:

1. Lab Experiment: Introduction to NLP with Deep Learning

a. Understanding the basics of Natural Language Processing (NLP) and its challenges
b. Comparing classical NLP models with deep learning-based models
c. Building an end-to-end deep learning model for a simple NLP task
2. Lab Experiment: Bag of Words and Sequence-to-Sequence Model
a. Implementing Bag of Words representation for text data
b. Building a basic sequence-to-sequence model for language translation
c. Training the model and evaluating its performance
3. Lab Experiment: Attention Mechanisms
a. Understanding the concept of attention mechanisms in NLP
b. Implementing attention mechanisms in sequence-to-sequence models
c. Comparing the results with and without attention
4. Lab Experiment: Neural Bigram Model
a. Implementing a neural bigram model for language modeling
b. Training the model and evaluating its performance on a text corpus
5. Lab Experiment: Improving Efficiency of Language Models
a. Implementing techniques like subsampling and negative sampling to improve efficiency
b. Analyzing the impact of these techniques on training time and performance
6. Lab Experiment: Word Embeddings with CBOW
a. Implementing Continuous Bag of Words (CBOW) model for word embeddings
b. Training word embeddings using TensorFlow and Theano
7. Lab Experiment: Hierarchical Softmax
a. Understanding hierarchical softmax for efficient word prediction
b. Implementing hierarchical softmax for word embeddings
8. Lab Experiment: POS Tagging with RNN
a. Implementing a POS tagger using RNN with Theano and TensorFlow
b. Training the POS tagger and evaluating its accuracy
9. Lab Experiment: Named Entity Recognition (NER) with HMM
a. Implementing a Hidden Markov Model (HMM) for Named Entity Recognition
. Training the model on labeled data and evaluating its performance
10. Lab Experiment: Word Analogies with Word Embeddings
a. Using word embeddings to perform word analogies (e.g., "king - man + woman = queen")
b. Evaluating the quality of word embeddings using analogy tasks
Semester 8
COURSE CODE COURSE TITLE L T P C
BIM 408 Computer Vision 3 0 0 3
Course Outcome
Remembering Define key concepts in image classification, segmentation, captioning,
CO1:
and object detection, including algorithms like KNN, SVM, and techniques like
clustering and OCR.
Understanding Explain the architecture and working of Convolutional Neural Networks
CO2:
(CNN), ResNet, and Single Shot Detection (SSD) and describe their applications in real-world
scenarios.
Applying Develop image classification and captioning systems using CNN, RNN, and
CO3:
multimodal metric spaces, and apply ResNet and transfer learning for various visual
recognition tasks.
Analyzing Analyze challenges in image processing tasks such as the problem of scale
CO4:
in SSD, geometry-based image retrieval, and attention mechanisms in image
captioning.
COURSE CONTENTS
UNIT-I [9 hours]
Convolution Neural Networks:
Overview of CNN, Intuition behind CNN, convolution operation, Depth, Stride, Padding, ReLU
layer, Pooling, Flattening, Full Connection, Softmax and cross-entropy, Building a CNN,
Evaluating, Improving and Tuning the CNN, plotting loss & accuracy charts, loading & saving
the model, displaying model visually and applications of CNN.

UNIT-II [9 hours]
Classification and Segmentation:
K-means clustering, Hierarchical clustering, spectral clustering, content based image retrieval,
visual words, indexing images, searching the database for images, ranking results using geometry,
building demos and web applications, KNN, Bayes classifier, SVM, optical character recognition.

UNIT-III [9 hours]
ResNet and Transfer Learning:
Introduction to ResNet, ResNet architecture, Building ResNet, Conv Block Details, Identify Block
details, First few layers, Completing the network, Apply ResNet, Different sized images using the
same network, summary of ResNet and its applications.
UNIT-IV [9 hours]
Image Captioning:
Understanding NLP for image captioning, expressing words in vector form, converting words to
vectors, training and embedding, linking image and text, using RNN and CNN features to generate
captions, image ranking, dense captioning, using multimodal metric space, using attention network
for captioning, implementing attention based image captioning and its applications.
UNIT-V [9 hours]
Single Shot Detection(SSD):
Introduction to SSD, object localization, Data Preparation, Data Annotation, object detection,
problem of scale, problem of shape, SSD in TensorFlow, modifying SSD to work on video,
intersection over union and non-max suppression, summary of SSD and its applications.
Text Books
3. Introduction to computer vision techniques and algorithms by Boguslaw cyganek and J.
Paul Siebert.

4. Programming computer vision with python by Jan Erik Solem.

Reference Books

1. Mastering opencv with practical Computer Vision projects by Daniel Lelis Baggio.

2. Programming Computer Vision with Python: Tools and algorithms for analysing images
by Jan Erik Solem.
3. Learning SQL, ALAN Beaulieu, O’REILLY.
COURSE CODE COURSE TITLE L T P C
BIM 456 Computer Vision Lab 0 0 2 1
Course Outcome
Remembering Recall the fundamental concepts of Computer Vision and Deep
CO1:
Learning, including CNN architecture, convolution operations, activation functions,
and their use in image processing tasks.
Understanding the foundational concepts of Convolutional Neural Networks (CNN),
CO2:
including convolution operations and activation functions, to implement basic image
classification models.
Applying and evaluating various image classification algorithms like KNN, Naive
CO3:
Bayes, and SVM, and analyzing the impact of hyperparameter tuning on classification
performance.
Analyzing and implementing clustering techniques such as K-means, hierarchical
CO4:
clustering, and spectral clustering for image segmentation, and evaluating their
effectiveness through visual inspection.
COURSE CONTENTS
UNIT-I Practical’s

List of Experiments:
1. Lab Experiment: Introduction to CNN
a. Implementing basic convolutional operations
b. Understanding activation functions (ReLU)
c. Building a simple CNN architecture and training it on image data
d. Evaluating the CNN's performance and plotting loss & accuracy charts
2. Lab Experiment: Image Classification with CNN
a. Implementing popular image classification algorithms like KNN, Bayes classifier, and SVM
b. Comparing the performance of different classifiers on image datasets
c. Evaluating the impact of hyperparameters on classification accuracy
3. Lab Experiment: Image Segmentation using Clustering Techniques
a. Implementing K-means clustering for image segmentation
b. Exploring hierarchical and spectral clustering for image segmentation
c. Visualizing and evaluating the segmentation results
4. Lab Experiment: Building and Applying ResNet
a. Implementing ResNet architecture from scratch
b. Training ResNet on a standard image dataset
c. Fine-tuning ResNet using transfer learning on a different image dataset
5. Lab Experiment: Image Captioning with RNN and CNN
a. Understanding NLP concepts for image captioning
b. Implementing RNN and CNN features for generating captions
c. Training the model and evaluating the quality of generated captions
6. Lab Experiment: Multimodal Metric Space for Image Captioning
a. Implementing multimodal metric space for image and text representations
b. Evaluating the similarity between images and their generated captions
7. Lab Experiment: Attention-based Image Captioning
a. Understanding the attention mechanism for image captioning
b. Implementing an attention-based model for generating captions
c. Comparing the performance with the previous image captioning model
8. Lab Experiment: Single Shot Detection (SSD) Basics
a. Understanding the SSD architecture for object detection
b. Implementing SSD in TensorFlow for detecting objects in images
c. Evaluating the detection accuracy and visualization of results
9. Lab Experiment: Data Preparation and Annotation for SSD
a. Preparing image datasets for object detection
b. Annotating images with bounding boxes for training SSD
c. Handling different object scales and shapes in the dataset
10. Lab Experiment: Modifying SSD for Video Object Detection
a. Adapting SSD to work on video streams for real-time object detection
b. Evaluating the performance on video datasets
11. Lab Experiment: Intersection over Union and Non-Max Suppression
a. Implementing Intersection over Union (IoU) for evaluating object detection accuracy
b. Applying Non-Max Suppression to eliminate duplicate detections
12. Lab Experiment: Tuning and Improving SSD
a. Fine-tuning hyperparameters to improve the accuracy of SSD
b. Evaluating the impact of different network architectures on SSD performance
13. Lab Experiment: Implementing Web Applications for Image Retrieval
a. Building demos and web applications for content-based image retrieval
b. Indexing and searching images in the database using visual words
14. Lab Experiment: Real-world Applications of CNN and SSD
a. Applying CNN and SSD to real-world image and video datasets
b. Exploring various applications, such as face detection, traffic monitoring, etc.
15. Lab Experiment: Comprehensive Image Processing Project
a. Students work on a project that integrates concepts from all modules to develop an advanced
image processing system. This project could involve aspects of image classification,
segmentation, captioning, and object detection using CNN, ResNet, and SSD.
COURSE CODE COURSE TITLE L T P C
BIM 405 R Programming 2 0 0 2
Course Outcome
Remembering how to import/export various data formats and understanding the basic
CO1:
setup and features of the R environment.
Understanding the unique characteristics of R programming, especially through
CO2:
control statements and apply functions.
Applying I/O operations, string manipulations, and data handling techniques to work
CO3:
with real-world datasets in R.
Analyzing data through summary statistics, parametric/non-parametric tests, and
CO4:
visualization techniques to extract meaningful insights using R.
COURSE CONTENTS
UNIT-I [9 Hours]
Introduction:
History and development of R Statistical computing programming language, installing R and R
studio, getting started with R, creating new working directory, changing existing working
directory, understanding the different data types, installing the available packages, calling the
installed packages, arithmetic operations, variable definition in R, simple functions, vector
definition and logical expressions, matrix calculation and manipulation using matrix data types,
workspace management, help function in R environment.

UNIT-II [9 Hours]

Data Structures and Control Statements:

Introduction to different data types, vectors, atomic vectors, types and tests, coercion, lists, list
indexing, function applying on the lists, adding and deleting the elements of lists, attributes, name
and factors, matrices and arrays, matrix indexing, filtering on matrix, generating a covariance
matrix, applying function to row and column of the matrix, data frame – creating, coercion,
combining data frames, special types in data frames, operations in data frame, applying functions:
lapply( ) and sapply( ) on data frames, control statements, loops, looping over non vector sets,
arithmetic and Boolean operators and values, branching with if, looping with for, if-else control
structure, looping with while, vector based programming.
UNIT-III [9 Hours]
MODULE 3 [9 Hours]
I/O operations and String Manipulations
Introduction to I/O functions in R, accessing I/O devices, using of scan( ), readline ( ) function,
comparison and usage of scan and readline function, reading different format files into R: text file,
CSV file, Statistical package files, xls and xlsx files, reading data frame files, converting from one
format to another using in built function, writing different file format in to the local machine
directory, getting file directory information, accessing the internet : overview of TCP/IP, sockets
in R, basics of string manipulations – grep ( ), nchar ( ), paste( ), sprintf( ), substr( ), regexpr( ),
strsplit( ), testing of file name with given suffix.
UNIT-IV [9 Hours]
MODULE 4
R for Summary Statistics and Parametric Tests
Descriptive statistics – summary statistics for vectors, making contingency tables, creating
contingency tables from vectors, converting objects in to tables, complex flat tables, making ‘Flat’
contingency tables, testing tables and flat table objects, cross tables, testing cross tabulation,
recreating original data from contingency tables, switching class, mean (arithmetic, geometric and
harmonic), median, mode for raw and grouped data, measure of dispersion – range, standard
deviation, variance, coefficient of variation, testing of hypothesis – small sample test, large sample
test – for comparing mean, proportion, variance (dependent and independent samples), correlation
and regression – significance of correlation and regression coefficients

UNIT-V [9 Hours]
R for Graphs, Nonparametric Tests and ANOVA:
Introduction to graphs, Box-Whisker Plot, Scatter plots, pairs plots, line chart, Pie Chart,
Cleveland Dot Charts, Bar Charts, Customization of charts, non-parametric test: The Wilcoxon U-
Test (Mann-Whitney): One and Two-Sample U-Test, Tests for association: Chi Square Tests,
Monte Carlo simulation, Yates Correction for 2X2 Tables, single category goodness of fit tests,
Analysis of Variance for one-way variation and two variation – with and without interaction.

Text Books
1. Beginning R: The statistical Programming Language – Dr. Mark Gardener, John Wiley & Sons,
Inc
2. The art of R programming – Norman Matloff, no starch Press, San Francisco.
Reference Books

1. Introduction to Scientific Programming and Simulation using R – Owen Jones, Robert

Maillardet and Andrew Robinson, CRC Press

2. Advanced R – Hadley Wickham, CRC Press.

3. The R Book - Michael J. Crawley, Wiley & Sons, Inc.
COURSE CODE COURSE TITLE L T P C
BIM455 R Programming Lab 0 0 4 2
Course Outcome
Remembering the basic syntax, functions, and environment setup in R, including
CO1:
installation, working directories, and package handling.
Understanding the concepts of data input, handling missing values, and performing arithmetic
CO2:
operations in R.
Applying R programming skills to perform calculations, manipulate data frames, create
CO3:
datasets, and generate basic plots.
Analyzing data structures and outputs by assessing data frames, identifying missing values,
CO4:
and interpreting computation results.
COURSE CONTENTS
UNIT-I [9 Hours]
List of Practicals
1. Install and configure R, set working directory.
2. Install Packages and calling installed packages
3. R studio environment and functionalities of R studio
4. Implement basic R operations (data input, missing values, importing data into R using different
formats : xlsx, CSV, Text files)
5. Use R as a calculator
6. Explore various functionalities of data frames.
7. Create data set using data frames, list and tables.
8. Calculate the remainder after dividing 31079 into 170166719
9. Calculate the interest earned after 5 years on an investment of $2000,
10. Assuming an interest rate of 3% compounded annually.
11. Use R to calculate the area of a circle with radius 7 cm.
12. Do you think there is a difference between 48:14ˆ2and 48:(14ˆ2)?
13. Usingrep()and seq()as needed, create the vectors?
a. 0000011111222223333344444 and 1234512345123451234512345
14. Create the vector
a. ## [1]000111100011110001111000111100011
b. ## [34] 1 1
c. and convert it to a factor. Identify the levels of the result, and then
d. change the level labels to obtain the factor:
e. ## [1] Male Male Male Female Female Female Female Male Male
f. ## [10] Male Female Female Female Female Male Male Male Female
g. ## [19] Female Female Female Male Male Male Female Female Female
h. ## [28] Female Male Male Male Female Female Female Female
i. ## Levels: Male FemaleExplore various functionalities of plots
15. Use themore.colors vector, rep()and seq()to create the vector
a. "red" "yellow" "blue" "yellow" "blue" "green"
b. "blue" "green" "magenta" "green" "magenta" "cyan"