COURSE FILE

Academic Year: 2025-26

Subject: Operating System

Subject Code: BCS303
Semester: 3rd

Prepared by -
Mrs. Nainsi Gupta,
Assistant Professor
Department of CSE,
GCEM, Bangalore.

Document to be built one time for a given course-

 1. Faculty Code of Ethics and Professional Standards
2. Vision and Mission of the Institute
3. Vision and Mission of the Department
4. Program Educational Objectives
5. Program Outcomes
6. Program Specific Outcomes
7. Syllabus

Documents to be prepared for each academic year for a given course-

1. VTU Calendar of Events
2. College Calendar of Events
3. Department Calendar of Events
4. Class Time Table
5. Individual Time Table
6. Course Delivery Plan
7. List of Bright Students
8. List of Slow Learners
9. Students List
10. Lecture Notes/ppt
11. University Question Papers/Model Papers
12. Question Bank
13. Course Result
14. Course Attainment Calculation
15. Analysis on CO & PO attainment
16. Faculty Course Assessment Report (FCAR)
 Document to be built one time for a given course

1. Faculty Code of Ethics and Professional Standards

Standards of Conduct
To,
The HOD,
Department of CSE
GCEM, Bangalore

Towards the College, the Faculty shall:

a. Read and abide by the policies established by the college
b. Contribute to the college by participating in the committees and clubs at various levels.
They may include Program committees, student clubs, faculty projects etc.,
c. Avoid potential conflicts of interest
d. Not engage in outside professional activity that conflicts with their responsibilities and
duties in college.
e. Avoid misrepresentation of personal views as a statement of position of the College.
f. Strictly adhere to the dress code prescribed by the Institution. Women –
Saree/Chudidhar; Men – formal trousers, shirt and shoes.
g. Not be found to indulge in smoking, drinking, or other unacceptable behavior within the
campus or in its immediate proximity
h. English should be the language of teaching and communication in class and at all times
with the students.
i. Each faculty member is responsible for the material provided in class during his/her
presence in class.
j. Subsequently, after the class, the room shall be locked and key returned to the
department. Keys will only be handled by the Faculty and must not be given to students.
k. Faculty must use the infrastructure at their disposal, like video projectors, lap tops etc, as
an aid in their class room teaching.
l. Use of mobile phones is strictly prohibited in the class room and in the corridors of the
college. They must be switched off/ placed in silent mode during class.
m. Arrive at class on time and stay for the duration of time stipulated for the lecture in the
time table
ll. Towards Students, The Faculty Shall:
a. Treat all students with fairness and respect.
b. Encourage the free exchange of ideas between themselves and students.
c. Any extra time after the lecture may be used for feedback and subject discussion with the
students. Students will not be allowed to leave before the completion of the time
allotted.
d. Conscientiously strive to be fair and balanced in the evaluation of student work.
e. Should not exploit students for personal gain.
f. Should be fair and objective when providing references for students.
g. Should not disclose information about students to outside agencies.
h. Faculties are obliged to attend classes as scheduled and to maintain office hours
i. Faculty should help students and provide access to study material and information
j. Ragging in any form among students is strictly prohibited and such incidents must be
brought to the notice of the Management for suitable action.
III. Towards Colleagues, Faculty Shall:
a. Treat each other with fairness and respect, and conduct themselves with dignity and
restraint in all exchanges with colleagues.
b. Be fair and objective when presenting a professional judgment on their colleagues’ work
 c. Not use threatening or abusive behavior or language, verbal harassment or intimidation
of another member of the faculty, under any circumstance while on the college campus.
d. Not knowingly misrepresent the views/positions of colleagues to further their own
position or point of view.
IV. Towards their Disciplines, Faculty Shall:
a. Exhibit intellectual honesty and integrity in all scholarly endeavors.
b. Work toward improving the quality of instruction.
c. Participate in all training programs provided to them.
d. Update themselves regularly in the advancements in their academic fields
v. Course Plan and Delivery: Faculty Shall
a. Faculty shall discuss with their Principal/HOD and submit a semester wise Lesson Plan.
This will be followed-up and monitored on a regular basis by the respective
Principal/HOD.
b. The HODs/Principals shall make periodic surprise visits to classes to provide feedback on
the teaching methods and materials used. They will also check the diaries the faculty are
expected to maintain.

“I have read all the terms and conditions outlined in this document and agree to abide by them”

Name of the Faculty Signature of the Faculty

Mrs. Nainsi Gupta

2. Vision and Mission of the Institute

Vision of the Institution:
 To be the institution of choice with contemporary knowledge coupled with values
contributes to the society through excellence in technical education and research by
continuous innovation.
Mission of the Institution:
 Achieving Excellence in Teaching Learning Process Using State-Of-The-Art Resources.
 Develop industrial collaborations to promote research and innovation capabilities of
faculty and students.
 Inculcate entrepreneur skills with high integrity to serve the society.

QUALITY POLICY
Gopalan College of Engineering and Management aims at achieving academic excellence through
continuous improvement in all spheres of Technical and Management education. In pursuit of
excellence cutting-edge and contemporary skills are imparted to the utmost satisfaction of the
students and the concerned stakeholders.

3. Vision and Mission of the Department

Department Vision
To achieve excellent standards in learning by imparting quality education with extensive
research work in computer science and engineering to meet industrial and societal needs.
Department Mission
M1: To impart state-of-the-art education in computer science &engineering and enhance
the skills of students in diverse domains.
M2: To establish research facility and industry institute interaction for promoting
collaborative activities.
M3: To instil moral and ethical values and interpersonal skills to the students.
4. Programme Educational Objectives
PEO 1: The graduates of CSE will have the ability to demonstrate the engineering skills across
varied technological platforms.
PEO 2: The graduates of CSE will have the skills to promote technical research and work in the
direction towards industrial requirements.
PEO 3: Graduates will prove themselves to be ethically sound and socially responsible engineers.

5. Program Outcomes (POs)

1. Engineering knowledge: Apply the knowledge of mathematics, science, engineering
fundamentals, and an engineering specialization to the solution of complex engineering problems.
2. Problem analysis: Identify, formulate, research literature, and Analyze complex engineering
problems reaching substantiated conclusions using first principles of mathematics, natural
sciences, and engineering sciences.
3. Design/development of solutions: Design solutions for complex engineering problems and
design system components or processes that meet the specified needs with appropriate
consideration for the public health and safety, and the cultural, societal, and environmental
considerations.
4. Conduct investigations of complex problems: Use research-based knowledge and research
methods including design of experiments, analysis and interpretation of data, and synthesis of the
information to provide valid conclusions.
5. Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern
engineering and IT tools including prediction and modelling to complex engineering activities
with an understanding of the limitations.
6. The engineer and society: Apply reasoning informed by the contextual knowledge to assess
societal, health, safety, legal and cultural issues and the consequent responsibilities relevant to the
professional engineering practice.
7. Environment and sustainability: Understand the impact of the professional engineering
solutions in societal and environmental contexts, and demonstrate the knowledge of, and need for
sustainable development.
8. Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms
of the engineering practice.
9. Individual and team work: Function effectively as an individual, and as a member or leader in
diverse teams, and in multidisciplinary settings.
10. Communication: Communicate effectively on complex engineering activities with the
engineering community and with society at large, such as, being able to comprehend and write
effective reports and design documentation, make effective presentations, and give and receive
clear instructions.
11. Project management and finance: Demonstrate knowledge and understanding of the
engineering and management principles and apply these to one’s own work, as a member and
leader in a team, to manage projects and in multidisciplinary environments.
12. Life-long learning: Recognize the need for, and have the preparation and ability to engage in
independent and life-long learning in the broadest context of technological change.

6. Programme Specific Outcomes

PSO 1: Ability to apply the engineering knowledge acquired in a vast range of multi-disciplinary
domains.
PSO 2: Ability to represent themselves in the field of research and elevate themselves towards
industrial standards.
PSO 3: Ability to exhibit the technical capabilities for the betterment of humanity.

7. Syllabus
 OPERATING SYSTEMS Semester 3
Course Code BCS303 CIE Marks 50
Teaching Hours/Week (L:T:P: S) 3:0:2:0 SEE Marks 50
Total Hours of Pedagogy 40 hours Theory + 20 hours practicals Total Marks 100
Credits 04 Exam Hours 3
Examination nature (SEE) Theory

Course objectives:
● To Demonstrate the need for OS and different types of OS
● To discuss suitable techniques for management of different resources
● To demonstrate different APIs/Commands related to
processor, memory, storage and file system management.

Teaching-Learning Process (General Instructions)

Teachers can use the following strategies to accelerate the attainment of the various course outcomes.
1. Lecturer methods (L) need not to be only traditional lecture method, but alternative
effective teaching methods could be adopted to attain the outcomes.
2. Use of Video/Animation to explain functioning of various concepts.
3. Encourage collaborative (Group Learning) Learning in the class.
4. Adopt Problem Based Learning (PBL), which fosters students’ Analytical skills, develop
design thinking skills such as the ability to design, evaluate, generalize, and analyze
information rather than simply recall it.
5. Role play for process scheduling.
6. Demonstrate the installation of any one Linux OS on VMware/Virtual Box
MODULE-1 8 Hours
Introduction to operating systems, System structures: What operating systems do; Computer System
organization; Computer System architecture; Operating System structure; Operating System operations;
Process management; Memory management; Storage management; Protection and Security; Distributed
system; Special-purpose systems; Computing environments.

Operating System Services: User - Operating System interface; System calls; Types of system calls;
System programs; Operating system design and implementation; Operating System structure; Virtual
machines; Operating System debugging, Operating System generation; System boot.

Textbook 1: Chapter – 1 (1.1-1.12), 2 (2.2-2.11)

MODULE-2 8 Hours
Process Management: Process concept; Process scheduling; Operations on processes; Inter process
communication

Multi-threaded Programming: Overview; Multithreading models; Thread Libraries; Threading issues.

Process Scheduling: Basic concepts; Scheduling Criteria; Scheduling Algorithms; Thread

scheduling; Multiple-processor scheduling,

Textbook 1: Chapter – 3 (3.1-3.4), 4 (4.1-4.4), 5 (5.1 -5.5)

MODULE-3 8 Hours
Process Synchronization: Synchronization: The critical section problem; Peterson’s
solution; Synchronization hardware; Semaphores; Classical problems of synchronization;

Deadlocks: System model; Deadlock characterization; Methods for handling deadlocks; Deadlock
prevention; Deadlock avoidance; Deadlock detection and recovery from deadlock.

Textbook 1: Chapter – 6 (6.1-6.6), 7 (7.1 -7.7)

MODULE-4 8 Hours

Memory Management: Memory management strategies: Background; 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.

Textbook 1: Chapter -8 (8.1-8.6), 9 (9.1-9.6)

MODULE-5 8 Hours
Documents to be prepared for each academic year for a given course
1. VTU Calendar of events
 2. College calendar of events

GCEM - ACADEMIC CALENDAR OF

EVENTS (w.e.f. 15.09.2025)
Programs: B.E – Ist & IIIrd SEMESTER Academic Year: 2025-26 (ODD) Session: SEP. 2025 – JAN 2026
Day
Week No. of working
Month Activities/Events
No. Mon Tue Wed Thu Fri Sat days

1. Sep 1 2 3 4 5-H 6 5 05.09.25 – Id Milad

08.09.25 to 13.09.25 - - Student Induction Program – 1st Sem
11
2. Sep 8 9 10 12 13 6 10.09.2025 – Orientation Program - 1st year
13.09.25 – Last Working Day of Summer Semester – 3rd Sem
15.09.25 – Commencement of I and III Semester Classes
3. Sep 15 16 17 18 19 20 6 15.09.25 to 3.10.25 – Commencement of VTU Theory exams for
the students registered in summer semester

4. Sep 22 23 24 25 26 27 6
01.10.25– Ayudha Pooja/ Vijayadashami
Sep / Oct 4 02.10.25 – Gandhi Jayanthi
5. 29 30 1-H 2-H 3 4 04.10.25 to 08.10.25 – Practical/Viva Voce for the students
registered in Summer Semester exams
11
6. Oct 6 7-H 8 9 10 5 07.10.25 – Valmiki Jayanthi

18 18.10.25 -- Class Committee Meeting 1 18.10.2025 –

7. Oct 13 14 15 16 17
CCM-1
6 Display of Attendance Shortage List
20.10.25 - Naraka Chaturdashi
8. Oct 20 - H 21 22 - H 23 24 25 4 22.10.25 – Deepavali
23.10.25 - Last date for IAT – 1 QP submission
28 29 28.10.25 to 30.10.25–IAT-1 for the 3rd semester
27 30 31
9. Oct / Nov IAT-1 IAT-1
IAT-1 IAT-1
1-H 5 28.10.25 to 31.10.25–IAT-1 for the 1st semester
01.11.25 - Kannada Rajyotsava
08.11.25 - Kanakadas Jayanthi
10. Nov 3 4 5 6 7 8-H 5 07.11.25 - - Last date for IAT – 1 Marks submission
15
11. Nov 10 11 12 13 14
PTM-1
6 15.11.25 - Parent Teachers meeting 1

12. Nov 17 18 19 20 21 22 6 22.11.2025 – Display of Attendance Shortage List

26 27 28 29 28.11.25 - Last date for IAT – 2 QP submission

13. Nov 24 25 CCM-2 6 29.11.25 -- Class Committee Meeting 2
3 4 5 6 03.12.25 to 05.12 25 –IAT-2 for 3rd semester
14. Dec 1 2
IAT-2 IAT-2 IAT-2 IAT-2
6 03.12.25 to 06.12.25 – IAT2 for 1st Semester

15. Dec 8 9 10 11 12 13 6 13.12.25 - Last date for IAT – 2 Marks submission

20
16. Dec 15 16 17 18 19
PTM-2
6 20.12.25 - Parent Teachers meeting 2

17. Dec 22 23 24 25-H 26 27 5 25.12.25 – Christmas

01.01.26 - Last date for IAT – 3 QP submission

18. Dec/Jan 29 30 31 1 2 3 6
05.01.26 to 07.01 26 –IAT-3 for 3rd semester
5 6 7 8 10
19. Jan
IAT-3 IAT-3 IAT-3 IAT-3
9
LWD
6 05.01.26 to 08.01.26 – IAT3 for 1st Semester
10.01.26 - Last Working Day for 3rd Semester
13.01.26 - Last Working Day for 1st Semester
12.01.26 to 21.01.26 – Practical Exams - 3rd Semester
13
20. Jan 12
LWD
14-H 15 16 17 2 13.01.26 - Last date for IAT – 3 Marks submission
14.01.26 – Makar Sankranti
14.01.26 to 24.01.26 – Practical Exams - 1st Semester

3. Department calendar of events

CSE department Calendar of events for 6th Sem (2024-25 Even Sem)
4. Class timetable
5.
6. Individual timetable
 Gopalan College of Engineering and Management
(ISO 9001:2015 certified) Approved by AICTE, New Delhi.
Affiliated to VTU, Belagavi. Recognized by Govt. of Karnataka

Address: 181/1, 182/1, Sonnenahalli, Hoodi, [Link], Whitefield, Blr, Karnataka - 560 048
Phone No: (080) - 42229748 Email: gcem@[Link]
[Link]/gcem

Course Code Acronym Course Name Class Year/ Hall No Hours /

Sem-Sec Week
THEORY

BCS602 ML Machine Learning 3/6(A) 410 5

BCS615 AI Artificial Intelligence 3/6 406 4

21CSP82 PR Project Work 4/8 405 2

21INT82 INT Internship 4/8 405 2

21CS81 SEM Technical Seminar 4/8 405 2

LAB
3/6(B1, B2) Lab 4 4
BCS602 ML L Machine Learning Lab
Non-Core Responsibilities:
[Link] administration
[Link] IQAC (NIRF/NAAC/NBA/ Private Rankings, Audit, Feedback, Monthly Report etc.)
[Link] center head
4. Professional body activities(IEEE)

7. Course Delivery Plan

 6.1. Gaps Identified if any

Identified Gap Justification

The course focused heavily on algorithmic understanding but
lacked real-world case studies or interdisciplinary applications
Lac of real-world case studies
that could help students connect theoretical knowledge with
industry context.
6.2. Topics Beyond Syllabus based on Gap Analysis/ Proposed actions

Proposed Actions to fill the identified gaps:

To address the lack of real-world context in the course, case-based learning will be incorporated
through targeted programming assignments and enrollment in an Infosys Springboard
certification course related to applied machine learning or data science. The programming
assignments will be designed around real-world case scenarios such as loan approval prediction,
product demand forecasting, or healthcare analytics, encouraging students to apply algorithms in
practical settings. Additionally, the Infosys certification course will provide structured exposure to
industry problems and solutions, supplementing classroom learning with professional-level
insights.

Best practices identified as part of teaching this subject

1. Programming Assignments
2. Certification Courses
3. Additional lab programs
4. Remedial Classes

/WORKSHOP TO MEET
INDUSTRY /
PROFESSIONAL
REQUIREMENTS/
INDUSTRIAL VISIT
 6.3. Lesson Plan

Module Lecture Session Topics Teaching P A % of

No No. aids/Methods la ct Syllabus
Used nn ua Covered
ed l
1Expectation Setting of this subject D D
17-02-25 17-02-25

2 Introduction: Need of Machine 17-02-25 17-02-25

Learning, Machine Learning in
Relation to other Fields
3 Types of Machine Learning, 18-02-25 18-02-25
Challenges of Machine Learning
4 Machine Learning Process, 19-02-25 19-02-25
Machine Learning Applications
1 5 Understanding Data – 1: 20-02-25 20-02-25 20%
Smart Board,
Introduction
PPT
6 Big Data Analysis Framework, 21-02-25 21-02-25
Descriptive Statistics
7 Univariate 24-02-25 24-02-25
Data Analysis and Visualization
8 Univariate 25-02-25 25-02-25
Data Analysis and Visualization
9 Basic Learning Theory: Design of Smart Board, 27-02-25 27-02-25
Learning System, PPT
10 Introduction to Concept of Smart Board, 28-02-25 28-02-25
Learning PPT
2
11 Find-S and Candidate elimination Black Board 03-03-25 03-03-25
algorithms
12 Candidate elimination algorithm Black Board 04-03-25 04-03-25
examples
13 Modelling in Machine Learning Smart Board, 06-03-25 06-03-25
PPT 20%
14 Understanding Data – 2: Bivariate Smart Board, 11-03-25 11-03-25
Data and Multivariate Data, PPT
15 Multivariate Statistics, Essential Smart Board, 13-03-25 13-03-25
Mathematics for Multivariate PPT
Data
16 Feature Engineering and Smart Board, 14-03-25 14-03-25
Dimensionality Reduction PPT
Techniques
 17 Dimensionality Reduction Smart Board, 1-04-25 1-04-25
Techniques PPT
18 Similarity-based Learning: Smart Board, 03-04-25 03-04-25
Nearest-Neighbor Learning, PPT
Algorithm,
19 Weighted K-Nearest-Neighbor Smart Board, 04-04-25 04-04-25
algorithm PPT
20 Nearest Centroid Classifier, Smart Board, 04-04-25 04-04-25
Locally Weighted Regression PPT

21 Regression Analysis: Introduction Smart Board, 08-04-25 08-04-25

to Regression, Introduction to PPT
Linear Regression, 20%
3
22 Multiple Linear Regression, Smart Board, 11-04-25 11-04-25
Polynomial Regression, Logistic PPT
Regression.
23 Decision Tree Learning: Smart Board, 12-04-25 12-04-25
Introduction to Decision Tree PPT
24 Learning Model,
Decision Tree Induction Smart Board, 15-04-25 15-04-25
Algorithms introduction PPT
25 ID3, CART, C4.5 examples Smart Board, 19-04-25 19-04-25
PPT
26 ID3, CART, C4.5 examples Smart Board, 19-04-25 19-04-25
PPT
27 Bayesian Learning: Introduction Smart Board, 21-04-25 21-04-25
to Probability-based Learning, PPT
28 Fundamentals of Bayes Theorem, Smart Board, 28-04-25 28-04-25
Classification Using Bayes Model PPT

29 Naïve Bayes Algorithm for Smart Board, 02-05-25 02-05-25

Discrete Data PPT
30 Naïve Bayes Algorithm for Smart Board, 03-05-25 03-05-25
4 Continuous Attributes PPT
20%
31 Artificial Neural Networks: Smart Board, 06-05-25 06-05-25
Introduction, Biological Neurons, PPT
Artificial Neurons
32 Perceptron and Learning Smart Board, 08-05-25 08-05-25
Theory PPT
33 Types of Artificial Neural Smart Board, 09-05-25 09-05-25
Networks PPT
 34 Popular Applications of Artificial Smart Board, 10-05-25 10-05-25
Neural Networks PPT
35 Advantages and Disadvantages of Smart Board, 13-05-25 13-05-25
ANN, Challenges of ANN PPT
36 Clustering Algorithms: Smart Board, 15-05-25 15-05-25 20%
Introduction to Clustering PPT
37 Approaches
Proximity Measures Smart Board, 16-05-25 16-05-25
PPT
38 Hierarchical Smart Board, 17-05-25 17-05-25
Clustering Algorithms PPT
39 Partitional Clustering Algorithm, Smart Board, 19-05-25 19-05-25
Density-based Methods, Grid- PPT
based Approach
40 Reinforcement Learning: Smart Board, 20-05-25 20-05-25
Overview of Reinforcement PPT
5
41 Learning
Scope of Reinforcement Learning, Smart Board, 21-05-25 21-05-25
Reinforcement Learning as PPT
Machine Learning
42 Components of Reinforcement Smart Board, 21-05-25 21-05-25
Learning, Markov Decision PPT
Process,
43 Multi-Arm Bandit Problem and Smart Board, 22-05-25 22-05-25
Reinforcement Problem Types PPT
44 Model-based Learning, Model Smart Board, 23-05-25 23-05-25
Free Methods, Q-Learning PPT
SARSA Learning
6.4. CO-PO-PSO MAPPING
P P P P P P
P P P P P P P P P
Blooms Modules O O O S S S
Course Outcomes O O O O O O O O O
Level covered 1 1 1 O O O
1 2 3 4 5 6 7 8 9
0 1 2 1 2 3

C Describe the machine learning

O techniques, their types and data L2 1 3 3 3 3 - - - 3 3 - - 2 3 - -
1 analysis framework
Apply mathematical concepts
C for feature engineering and
O perform dimensionality L3 2 3 3 3 3 - - - 3 3 - - 2 3 - -
2 reduction to enhance model
performance.
Develop similarity-based
C
learning models and regression
O L3 3 3 3 3 3 - - - 3 3 - - 2 3 - -
models for solving classification
3
and prediction tasks.
Build probabilistic learning
C models and design neural
O network models using L3 4 3 3 3 3 - - - 3 3 - - 2 3 - -
4 perceptrons and multilayer
architectures
Utilize clustering algorithms to
C
identify patterns in data and
O L3 5 3 3 3 3 - - - 3 3 - - 2 3 - -
implement reinforcement
5
learning techniques

6.5. Assessment Plan for CIE

Internal Exam Assignment / Quiz

Tes Grand
t Test Test Total Programmin Certification Total Total
CO (A+B)
(T1 (T2) (T3) (A) g Assignment Course (B)
)
Max 50 50 50 150 15 10 25 50
Marks

CO1 34 - - 34 3 2 4 25

CO2 16 6 - 22 3 2 4 13

CO3 - 44 - 44 3 2 4 24

CO4 - - 30 30 3 2 4 22

CO5 - - 20 20 3 2 4 28
 6.6. Quality and Alignment Matrix (QAM)
Internal Assessment Test (IAT) - 1
BL Distribution CO Distribution
Question L1 L2 L3 L4 CO1 CO2 CO3 CO4 CO5
No.
1a/2a - 10 - - 10 - - - -
1b/2b 10 - - - 10 - - - -
3a,3b/4a,4b - 14 - - 14 - - - -
3c/4c - - 6 - - 6 - - -
5/6 - - 10 - - 10 - - -

Total 10 24 16 - 34 16 - - -
% 20 48 32 - 70 30 - - -

Internal Assessment Test (IAT) - 2

BL Distribution CO Distribution
Question L1 L2 L3 L4 CO1 CO2 CO3 CO4 CO5
No.
1a/2a - 10 - - - - 10 - -
1b/2b - - 10 - - - 10 - -
3a/4a - 6 - - - 6 - - -
3b/4b - - 14 - - - 14 - -
5/6 - - 10 - - - 10 - -
7 - - - - - - - - -
8 - - - - - - - - -
Total - 16 34 - - 6 44 - -
% - 32 68 - - 12 88 - -

Internal Assessment Test (IAT) - 3

BL Distribution CO Distribution
Question L1 L2 L3 L4 CO1 CO2 CO3 CO4 CO5
No.
1a/2a 8 8
1b/2b 12 12
3a/4a 10 10
3b/4b 10 10
5/6 10 10
7/8
9/10
Total 18 32 - - - - 30 20
% 36 64 - - - - 60 40
6.7. Internal question papers / Scheme and Solutions

7. List of Bright Students

Subject: Machine Learning Subject Code: BCS602 Branch & Semester :CSE / 6

Max. Marks : 100 Date: 10/02/2025

Serial No. USN Name
1. 1GD22CS018 K MANJUSHREE
2. 1GD22CS060 YESHASWINI M
3. 1GD22CS052 SURYA VARSHINI V
8. List of [Link] 1GD22CS002 ABHINANDH
5. 1GD22CS023 LAXMI PRIYA ROUT

Serial No. USN Name

1. 1GD22CS004 AKASH KUMAR SHARMA
2. 1GD22CS020 KARTHIK DONNEPUDI
3. 1GD22CS027 MOHAMMED AFTAB
4. 1GD22CS044 SANJAN GOWDA N J
5. 1GD22CS053 V HRITHIQ VARUN
6. 1GD22CS056 VINITH JOYAPPA
7. 1GD23CS400 A SURESH
8. 1GD23CS404 MANOJ KUMAR
9. Student 9. 1GD23CS405 PUNYA List

USN Name

1GD22CS001 Aarya Kumari 1GD22CS036 P Srinath

1GD22CS002 Abhishek Poovaiah M 1GD22CS037 Paschal D
1GD22CS003 Abinandh K V 1GD22CS038 Prathibha M
1GD22CS004 Akash Kumar Sharma 1GD22CS039 Raghav B K
1GD22CS005 Amrutha D R 1GD22CS040 Rahul S
1GD22CS006 Anusha S N 1GD22CS041 Rakshitha M
1GD22CS007 Anushree 1GD22CS042 Rakshitha V
1GD22CS008 Aravind Dakshan D 1GD22CS043 S Aditya
1GD22CS009 Archana N 1GD22CS044 Sanjan Gowda N J
1GD22CS010 Bhavana G 1GD22CS045 Sanjay S R
1GD22CS011 Bhuvaneshwari V 1GD22CS046 Sanket
1GD22CS012 Chaithra Y S 1GD22CS047 Shivakumar
1GD22CS013 Chanditha Dhananjaya 1GD22CS048 Shreesha Rai G
1GD22CS014 Chethan Kumar S L 1GD22CS049 Shreya Madhusudan Santubal
1GD22CS016 Deepika B O 1GD22CS050 Somashekhara G S
1GD22CS017 E K Rajagopalan 1GD22CS051 Sundar S
1GD22CS018 K Manjushree 1GD22CS052 Surya Varshini V
1GD22CS020 Karthik Donepudi 1GD22CS053 V Hrithviq Varun
1GD22CS021 Kishor K K 1GD22CS054 Vidhya Shree M
1GD22CS022 Lakshmi Inchara M 1GD22CS055 Vinay Diya
1GD22CS023 Laxmi Priya Rout 1GD22CS056 Vinith Joyappa N M
1GD22CS024 Lekhana C 1GD22CS057 Vishnu Sai Shetty
1GD22CS025 M A Momin Sidra Iaman 1GD22CS058 Vivek Prajapathi
1GD22CS026 Medha M 1GD22CS059 Yashwanth C H
1GD22CS027 Mohammed Aftab 1GD22CS060 Yeshaswini M
1GD22CS028 Mohammed Haseeb 1GD23CS400 A Suresh
1GD22CS029 Mohammed Imdad M 1GD23CS401 Anugopal
1GD22CS030 Nagesh Yadav C 1GD23CS402 Mayur U
1GD22CS031 Nandini M 1GD23CS403 Om Varun R
1GD22CS032 Navya D 1GD23CS404 Pulipakulamanoj Kumar
1GD22CS033 Nisarga A 1GD23CS405 Punya BB
1GD22CS034 Nithushree 1GD23CS406 Richard S
1GD22CS035 Nithya Varshini T S

10. Lecture Notes and PPT

 Module:1-5

11. Model question papers:

 Model question paper 1

12. Question Bank

MODULE – 1 (except 10 and 13 all are CO1)

1. Explain the need of Machine Learning with the help of Knowledge Pyramid -L2
2. Explain how machine learning can be related with other fields in detail-L2
3. Briefly explain the different types of Machine Learning with the help of example -L2
4. Explain the challenges in Machine Learning -L2
5. Explain the machine learning process with a neat diagram-L2
6. Discuss the applications of Machine Learning in various sectors – L2
7. What is data? Explain the different elements of data – L2
8. Explain the different types of data. Explain big data analytics and its types – L2
9. Explain the data management steps included in the big data processing -L2
10. Apply the Min-Max and Z-score normalization on the following dataset: CO2, L3
V = {88, 90, 92, 94}
11. Find the five-point summary of the list: L3
{13, 11, 2, 3, 4, 8, 9}
12. Explain univariate data analysis and visualization – L2
13. Find IQR and outliers for the following datasets: CO2, L3
i) {10, 15, 17, 18, 20, 22, 25, 30, 35, 70}
ii) {48, 52, 57, 61, 64, 72, 76, 77, 81, 85, 88}
14. Explain the following: L2
i) Central tendency
ii) Dispersion
iii) Quartiles and IQR
iv) Five-point summary and box plots
v) Shape
vi) Kurtosis

Module 2 (All are CO1)

1. Explain different steps for designing a learning system. -L2
2. Explain concept learning with an example. -L2
3. Explain Find-S algorithm with an example. -L2
4. Explain Candidate Elimination algorithm with an example. -L2
5. Explain modelling in Machine Learning. -L2
6. Solve problems using Find-S algorithm. -L3
7. Solve problems using Candidate Elimination algorithm. -L3
8. What are the different approaches used for selecting a machine learning model? -L2
9. Explain the following resampling methods: L2
i) K-fold Cross Validation algorithm
ii) Leave-One-Out Cross Validation
10. Explain the following parameters: L2
i) Accuracy
ii) Sensitivity
iii) Specificity
iv) Precision
v) ROC Curve
Module 3: (From 1 to 22 CO3, 23 to 30 it is CO1)
1. Explain the working of the k-Nearest Neighbor (k-NN) algorithm for classification and regression.
-L2
2. What are the advantages and disadvantages of k-NN algorithm? -L1
3. Explain the concept of lazy learning and instance-based learning with respect to k-NN. -L2
4. Discuss how distance metrics are used in k-NN. Why is Euclidean distance commonly used? L3
5. How is the value of ‘K’ selected in k-NN? What happens if K is too small or too large? L4
6. Differentiate between uniform weighting and distance-based weighting in weighted k-NN. -L2
7. What are the applications and limitations of weighted k-NN? -L2
8. Explain the Nearest Centroid Classifier. How is it different from k-NN? -l2
9. Describe the steps involved in classifying a test instance using the Nearest Centroid Classifier. -l3
10. What is Locally Weighted Regression (LWR)? Explain how it works using nearest neighbors. -L2
11. List the advantages and limitations of Locally Weighted Regression. -L1
13. Define regression analysis. What are its objectives and applications? -L2
14. Explain the difference between simple linear regression and multiple linear regression. -L2
15. What are the assumptions of linear regression? Briefly explain each. -L2
16. Write the mathematical form of a linear regression model and explain its components. -L2
17. Discuss the advantages and limitations of linear regression. -L1
18. What is multiple linear regression? When is it used? -L1
19. What are the assumptions of multiple linear regression? -L2
20. Explain the concept of multicollinearity. How does it affect regression models? -L3
21. Define polynomial regression. When is it preferred over linear regression? -L2
22. What are the advantages and limitations of polynomial regression? -L1
23. What is decision tree learning? Explain its structure with terms like root node, branches, and leaf
nodes. -L1
24. Describe the process of building a decision tree from training data. -L3
25. List and explain the advantages and disadvantages of decision trees. -L1
26. What is the difference between univariate and multivariate decision trees? -L1
27. Explain the ID3 algorithm. What splitting criterion does it use? -L2
28. How does the C4.5 algorithm differ from ID3? Mention its key features. -L2
29. Describe the CART algorithm. What is the GINI index? -L2
30. Compare the ID3, C4.5, and CART algorithms in terms of features, advantages, and limitations. -
L2

Module 4: (ALL ARE CO4)

1. Explain Bayes theorem and its components: Prior, Likelihood, Posterior. -L2
2. Differentiate between Maximum Likelihood (ML) and Maximum A Posteriori (MAP)
hypotheses with examples. -L2
3. Explain the Naïve Bayes algorithm with steps and an example. -L3
4. Discuss the concept of zero-probability error in Naïve Bayes. -L2
5. What is a Bayes Optimal Classifier? Explain with a scenario. -L3
6. Explain the Gibbs Algorithm and compare it with the Bayes Optimal Classifier. -L2
7. Describe the steps involved in the Gaussian Naïve Bayes algorithm. -L2
8. Analyze different types of Artificial Neural Networks with suitable diagrams. -L2
 9. Define activation function. Explain the types of activation functions used in ANN. -L2
10. Explain the Perceptron Learning Algorithm. -L2
11. List the advantages and disadvantages of Artificial Neural Networks. -L1
12. Mention the applications of Artificial Neural Networks. -L2

Module 5: (ALL ARE CO5)

1. Mention the types of hierarchical clustering algorithms and explain them with dendrograms.-L2
2. Explain the k-means clustering algorithm with steps and examples. -L3
3. Describe the grid-based clustering approach. What is CLIQUE? Mention its steps, advantages,
and limitations. -L2
4. List the characteristics, applications, and challenges of Reinforcement Learning. -L2
5. Explain the components of Reinforcement Learning with a diagram. -L2
6. Define and differentiate between immediate reward, total reward, and long-term reward in RL.
-L2
7. What is a policy in Reinforcement Learning? How is an optimal policy selected? -L2
8. Explain the Q-Learning algorithm. -L2
9. Explain the SARSA learning algorithm. -L2

ASSIGNMENT-1: PROGRAMMING ASSIGNMENT – I

Bloom’s Mapped
[Link] Problem Statement
Level CO
Predict employee attrition based on performance, satisfaction, and
1 L3 (Apply) CO3
demographics
2 Predict movie box office revenue from genre, cast, director, etc. L3 (Apply) CO3
3 Sentiment analysis of customer reviews L3 (Apply) CO3
4 Predict student opting for higher studies vs employment L3 (Apply) CO3
5 Forecast future sales using historical data and other features L4 (Analyze) CO3
6 Loan approval prediction based on financial/credit history L3 (Apply) CO4
7 Predict customer response to marketing campaigns L3 (Apply) CO3
8 Estimate house prices using property features L3 (Apply) CO3
9 Estimate delivery time for food orders L3 (Apply) CO3
10 Fraud detection using financial transaction patterns L4 (Analyze) CO4
11 Predict customer lifetime value using purchase history L4 (Analyze) CO3
12 Build chatbot for academic queries using NLP L6 (Create) CO4
13 Used car price prediction based on vehicle parameters L3 (Apply) CO3
14 Predict demand for products based on trends and seasonality L4 (Analyze) CO3
15 Wine quality prediction using chemical attributes L3 (Apply) CO3
16 Health condition prediction from medical/lifestyle data L4 (Analyze) CO4
17 Tuition fee prediction using location, ranking, etc. L3 (Apply) CO3
18 Language identification system using text features L3 (Apply) CO3
19 Retail product demand prediction for inventory control L3 (Apply) CO3
20 Predict building energy consumption using various features L3 (Apply) CO3
 Bloom’s Mapped
[Link] Problem Statement
Level CO
21 Predict hospital stay duration based on patient data L3 (Apply) CO3
22 Customer segmentation using demographics and behavior L3 (Apply) CO5
23 Crop yield prediction based on environmental data L3 (Apply) CO3
24 Insurance claim likelihood prediction L3 (Apply) CO4
25 Predict student exam performance using academic indicators L3 (Apply) CO3
26 Predict equipment failure using operational data L3 (Apply) CO4
27 Subscription churn prediction using usage metrics L3 (Apply) CO3
28 Flight delay prediction using time/weather/route data L3 (Apply) CO3
29 Student dropout risk prediction L3 (Apply) CO3
Analyze student feedback to evaluate satisfaction and improvement
30 L5 (Evaluate) CO1
areas
Evaluation:

1. Implementation: 10 Marks
2. Report: Soft Copy- 5 Marks

Guidelines:

All students must follow the below guidelines while implementing their Machine Learning–based
programming assignments or projects.

Team size should be minimum 1 student and maximum 2.

1. Problem Understanding

 Specify the type of ML task (e.g., Classification, Regression, Clustering).

2. Dataset Selection

 Choose an appropriate real-world dataset from reliable sources (e.g., Kaggle, UCI, [Link]).
 Mention the dataset source, number of records, and feature types (categorical, numerical, etc.).
 Identify the target variable and input features.

3. Model Implementation
 Use and compare at least three different ML algorithms for the problem selected as per your
choice.
o Example: Logistic Regression, Decision Tree, KNN, etc.
 Justify the choice of each algorithm.
 Train and evaluate each model using proper techniques.

4. Result Comparison and Analysis

 Compare all three models using selected metrics like Accuracy, Precision, Recall, F1-score,
ROC-AUC
 Include visualizations like:
 o Confusion Matrix
o ROC Curve
o Predicted vs Actual plots
 Highlight the best-performing model and explain why it performs better.

Report Submission Guidelines

Prepare a structured report (in PDF/DOCX format) containing:

1. Title of the project

2. Team member names and USNs
3. Problem statement
4. Dataset details
5. Data preprocessing steps
6. ML models used
7. Evaluation results
8. Conclusion and future work
9. References (if any external resources were used)

Assignment-2 (10 Marks)

Self-Learning Assignment: Infosys Certification Course

 Machine Learning Foundation Certification

[Link]
ed/overview
 Pre-requisite course: Explore Machine Learning using Python - 17hrs

[Link] Result

No. of Students No. of Students scored

Absent/ Pass %
Appeared Fail Pass S A B C D E F
NE
60 3 0 60 100 0 20 15 8 10 7 0

[Link] attainment calculation

 OVERALL CO ATTAINMENT (OA)

% of % of
Direct
student Attain students
Attainme CO Direct Indirect Indirect Overall CO Overall
s ment scored
nt level Attainme CO CO CO Attainment CO
CO scored level above
through nt (DA) = Attainme Attainme Attainme =0.8*DA+0.2*I Attainme
>=60 throug Class
SEE 0.5*SEE nt level nt (IDA) nt level DA nt level
% in h CIE Average in
+0.5*CIE
CIE SEE
CO1 81.54 3 54.84 2.00 68.19 3 87.04 3 71.96 3
54.84 2.00
CO2 76.92 3 65.88 3 91.67 3 71.04 3
54.84 2.00
CO3 86.15 3 70.49 3 72.69 3 70.93 3
54.84 2.00
CO4 84.62 3 69.73 3 79.63 3 71.71 3
54.84 2.00
CO5 90.77 3 72.80 3 92.59 3 76.76 3
54.84 2.00
Avg 84.00 3.00 69.42 3 84.72 3.00 72.48 3

CO-PO attainment: Overall

PO1
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2
PO/PSO 2
Target 3.00 3.00 3.00 3.00 3.00 3.00 2.00 3.00
CO1 2.16 2.16 2.16 2.16 2.16 2.16 1.44 2.16
CO2 2.13 2.13 2.13 2.13 2.13 2.13 1.42 2.13
CO3 2.13 2.13 2.13 2.13 2.13 2.13 1.42 2.13
CO4 2.15 2.15 2.15 2.15 2.15 2.15 1.43 2.15
CO5 2.30 2.30 2.30 2.30 2.30 2.30 1.54 2.30
PO
2.17 2.17 2.17 2.17 2.17 2.17 1.45 2.17
Attained

[Link] of CO-PO attainment

Overall CO Attainment
CO Target Observation
=0.8*DA+0.2*IDA
C602.1 71.96 60 Target Attained
C602.2 71.04 60 Target Attained
C602.3 70.93 60 Target Attained
C602.4 71.71 60 Target Attained
C602.5 76.76 60 Target Attained
[Link] Course Assessment Report (FCAR)
17.

Comments about the Course:

The course provided a strong foundation in machine learning concepts and their real-world
applications, aligning well with current industry needs. The balance between theoretical instruction
and practical implementation through labs and projects helped students gain hands-on experience. The
inclusion of diverse datasets and problem statements from various domains enhanced student interest
and engagement. However, the course could benefit from more structured support for students with
weaker programming or mathematical backgrounds. Incorporating peer learning, real-time case
discussions, and continuous assessments would further enrich the learning experience. Overall, the
course was well-structured, relevant, and positively received by students, with opportunities for minor
refinements to maximize learning outcomes.
Reflection
Reflect on how the course met or did not meet your goals and objectives. How effective were the changes made to the
course? Provide any other thoughts about how the course went and overall impressions. Document any circumstances
that might have influenced student performance or items that fall outside the scope of the current set of course
objectives. Also document your observations or other relevant concerns that have not been quantified in assignments and
course data.
The course successfully met its objectives by equipping students with a solid understanding of
machine learning techniques and their practical applications. Enhancements such as real-world
datasets, Bloom’s-based assessments, and project-based learning significantly improved engagement
and outcomes. Overall, the course was well-received, with active participation in labs and projects.
However, varied programming skills, limited access to computing resources, and foundational gaps in
math affected some students’ performance. Despite these challenges, the course remained effective and
aligned well with industry-relevant skills.
Out of 63 students, 60 students have cleared Machine Learning Foundation Certification and 20
teams have completed programming assignment.
Proposed Actions for Course Improvement
What changes should be made to the course for next time? Changes could include method of instruction, assignments,
organization of course, assessment of the course, etc. If you are proposing improvements, create and document a
timeline here.
To encourage continuous learning and application, topic-wise mini projects will be introduced after
each major concept, replacing the heavy reliance on a single final project. Responsible use of AI tools
like ChatGPT will be encouraged, with students required to explain the logic behind generated
solutions to ensure conceptual understanding. Selected lectures will be replaced with interactive case
study discussions to enhance contextual learning. Assessments will shift from memory-based quizzes
to application-oriented tasks involving real datasets and scenario-based analysis. Additionally, a
diagnostic quiz will be conducted early in the course to identify students needing support, followed by
remedial mentoring sessions. These improvements, scheduled across the semester, aim to enhance
student engagement, ensure equitable learning, and better align the course structure with practical and
industry-relevant outcomes.

Signature of the Faculty