(Established under the Presidency University Act, 2013 of the Karnataka Act 41 of 2013)

[2024-25 EVEN SEMESTER]

COURSE PLAN [Revision 03–July 2023]

SCHOOL: PSCS DATE OF ISSUE: 09.01.2025

NAME OF THE PROGRAM : B.Tech. Computer Science and Engineering (CSE)

P.R.C. APPROVAL REF. : PU/AC24.7/SOCSE04/CSE2023-2027

SEMESTER/YEAR : IV SEMESTER / II YEAR

COURSE TITLE & CODE : OPERATING SYSTEMS & CSE3351

COURSE CREDIT STRUCTURE : 3-0-0-3

CONTACT HOURS : 45 Hours

COURSE IC : Dr. S.Shanthi, Dr. Debasmita Mishra, Ms. Naiwrita Borah

COURSE INSTRUCTOR(S) : Dr. S.Shanthi, Dr. Debasmita Mishra, Ms. Naiwrita Borah

COURSEURL: https://presidencyuniversity.linways.com/

PROGRAM OUTCOMES :

PO 1: Engineering knowledge: Apply the knowledge of mathematics, science, engineering fundamentals, and
an engineering specialization to the solution of complex engineering problems.

PO 2: Problem analysis: Identify, formulate, review research literature, and analyze complex engineering
problems reaching substantiated conclusions using first principles of mathematics, natural sciences, and
engineering sciences.

PO3: 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.

PO4: 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.

PO 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.
 PO6: The engineer and society: Apply reasoning in formed by the contextual knowledge to assess societal,
health, safety, legal and cultural issues and the consequent responsibilities relevant to the professional
engineering practice.

PO 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.

PO 8: Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of the
engineering practice.

PO9: Individual and team work: Function effectively as an individual, and as a member or leader in diverse
teams, and in multi-disciplinary settings.

PO 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.
PO11: 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 multi-disciplinary environments.

PO 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.

PROGRAM SPECIFIC OUTCOMES (PSO):

At the end of the B. Tech. Program in Computer Science and Engineering the students shall:

PSO 01: [Problem Analysis]: Identify, formulate, research literature, and analyze complex engineering problems
related to Software Engineering principles and practices, Programming and Computing technologies reaching
substantiated conclusions using first principles of mathematics, natural sciences, and engineering sciences.
PSO 02: [Design/development of Solutions]: Design solutions for complex engineering problems related to
Software Engineering principles and practices, Programming and Computing technologies 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.

PSO 03: [Modern Tool usage]: Create, select, and apply appropriate techniques, resources, and modern
engineering and IT tools including prediction and modeling to complex engineering activities related to Data
Science principles and practices, Programming and Computing technologies with an understanding of the
limitations.

COURSE PREREQUISITES: CSE2009-Computer Organization and Architecture

COURSE DESCRIPTION:

This course introduces the concepts of operating system design and implementation. It covers the classical
operating systems internal algorithms such as process scheduling, synchronization, deadlocks and memory
management. The course also enhances the problem solving and systems programming ability.
Topics include: Core concepts of operating systems, such as processes and threads, scheduling,
synchronization, deadlocks, memory management, file systems.
 COURSE OBJECTIVES:
The objective of the course is to familiarize the learners with the concepts of Operating System and
attain Skill Development through Participative Learning techniques.

COURSE OUTCOMES: On successful completion of the course the students shall be able to

TABLE 1: COURSE OUTCOMES

CO CO Expected BLOOMS
Number LEVEL
CO1 Describe the fundamental concepts of operating Systems Understand
CO2 Demonstrate various CPU scheduling algorithms. Apply
CO3 Apply synchronization tools to a given problem. Apply
CO4 Examine various memory management techniques. Apply

MAPPING OF C.O. WITH P.O. [Mark H/M/L Against each of the C.O. depending on the degree of
contribution of the C.O.to the P.O.]

[H-HIGH , M- MODERATE, L-LOW]

TABLE 2a: CO PO Mapping ARTICULATION MATRIX

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

CO1 M - - - - - - - - L - L

CO2 H H L - L L - - - - - L

CO3 H M L - L L - - - - - L

CO4 H M L - L - - - - L - M

MAPPING OF C.O. WITH PSO: [Mark H/M/L Against each of the C.O. depending on the degree of
contribution of the C.O.to the PSO.]

TABLE 2b: CO PSO Mapping ARTICULATION MATRIX

CO. No. PSO-1 PSO-2 PSO-3
CO1 L L L
CO2 H M L
CO3 H M H
CO4 H M L

COURSE CONTENT (SYLLABUS):

Module1: Introduction [9 Sessions] [Understand]

Overview and Introduction to OS, Operating System Operations, Operating System Services, User and OS interface,
System Calls and its types, System Programs and types, Operating System Structure, loaders, linkers, Overview of
OS design and implementation.
Module 2: Process Management [14 Sessions] [Apply]
Process Concept, Operations on Processes, Inter Process Communication, Introduction to threads - Multithreading
Models, Threading Issues, Process Scheduling– Basic concepts, Scheduling Criteria, Scheduling Algorithms: FCFS,
SJF, RR, Priority, Practice Problems on Scheduling.

Module 3: Process Synchronization and Deadlocks [11 Sessions] [Apply]

The Critical-Section Problem- Peterson’s Solution, Synchronization hardware, Semaphores, Classic Problems of
Synchronization with Semaphore Solution- Dining Philosopher’s Problem / Readers and Writers Problems, .
Introduction to Deadlocks, Necessary conditions for deadlock, Resource allocation Graph, Methods for handling
deadlock: Deadlock Prevention and Implementation, Deadlock Avoidance and Implementation, Deadlock detection
& Recovery from Deadlock.

Module 4: Memory Management and File Systems [11 Sessions] [Apply]

Introduction to Memory Management, Basic hardware-Base and Limit Registers, Address Binding, Logical vs
Physical Address Space, Memory Management Unit(MMU), Dynamic loading and linking, Swapping, Contiguous
and Non-Contiguous Memory Allocation, Segmentation, Paging - Structure of the Page Table – Virtual Memory and
Demand Paging – Page Faults and Page Replacement Algorithms, Copy-on-write, Allocation of Frames – Thrashing.

File concept, Access Methods, Directory and Disk structure

DELIVERY PROCEDURE (PEDAGOGY):

TABLE 3: SPECIAL DELIVERY METHOD/ PEDAGOGY PLANNED WITH TOPICS

** At end of
Pedagogy title/ short
S. Lecture semester please
Subtopic as per lesson Plan explanation of adopted
No Number update whether
pedagogy
activity was done
Scheduling Algorithms: Problem Based Learning
1 L14 FCFS and practice problems

Deadlock Avoidance and Collaborative

L29 & Implementation –Banker’s Learning
2 Algorithm
L30

L43 & File concept, Access Methods Flipped Class Room

3
L44
TEXT BOOKS:

T1: Silberschatz A, Galvin P B and Gagne G, “Operating System Concepts”, 10th edition Wiley, 2018.

REFERENCE Book(s):
R1. William Stallings, “Operating systems”, Prentice Hall, 7th Edition, Pearson,2013.
 R2. Andrew S Tanenbaum and Albert S Woodhull, “Operating Systems Design and Implementation”, 3rd Edition,
Pearson,2015.

ONLINE RESOURCES:
1. (PDF) Operating System Fundamentals (researchgate.net)

2. Operating System Full Course | Operating System Tutorials for Beginners - YouTube
3. Introduction to Operating System Free Course by Great Learning (mygreatlearning.com)
4. Operating System Fundamentals | Free Online Course | Alison

SPECIFIC GUIDELINES TO STUDENTS:

1. Students are required to maintain minimum 75% of attendance

2. Technology enabled learning through NPTEL and online course may help in clear understanding the topics.
3. Follow the instructions of course instructor in both class and lab.
4. Avoid being absent in labs as it will affect the understanding of the experiments.
5. On time submission of assignments.

COURSE SCHEDULE:
TABLE 4: COURSE BROAD SCHEDULE

Sl. No. ACTIVITY PLANNED PLANNED TOTAL NUMBER OF

STARTING DATE CONCLUDING DATE PERIODS
01 Over View of the course 20/01/2025 20/01/2025 --
02 Module : 01 20/01/2025 07/02/2025 09
02 Module: 02 10/02/2025 07/03/2025 11
03 Assignment/any other -- -- --
activity/Guest Lecture/
Field Visit
04 Mid Term Examination 17/03/2025 21/03/2025 03
05 Module: 3 10/03/2025 04/04/2025 11
06 Module: 4 07/04/2025 09/05/2025 11
07 End Term Examination 26/05/2025 06/06/2025 --

TABLE 5 : DETAILED SCHEDULE OF INSTRUCTION

LOL HOL Teaching /

Topics& Learning Objectives Pedagogies
Sessio (Lower (Higher
Lesson Course Reference (Ch
S.No n No. Order Order
Title LO: Student shall be able to Outcome No., Pg:x-y)
Learnin Learnin
g) g)
 Program Integration, Details of LOL 1, -- CO1 Chalk & Talk T1(Ch1,Pg:3-5)
the course and LOL 2
Learning Objectives- Overview
and Introduction to Operating
System
1 L1 LO1: Describe the course details
and evaluation pattern
LO2:Define OS
LO3:Defend the use of OS

Operating System Operations LOL 1, -- CO1 Chalk & Talk T1(Ch1,Pg:21-

LO1: Differentiate LOL 2 P26)
2 L2 Multiprogramming, multitasking.
LO2: Interpret the Dual mode,
Multimode and timer.
Operating System Services LOL 2 -- CO1 Chalk & Talk T1(Ch1,Pg: 55-
LO1: Explain the various 57)
3 L3 functions of operating system
services.
User and OS interface LOL 1, -- CO1 Chalk & Talk T1(Ch1,Pg:58-
MODU LO1: Define the Interface. LOL 2 61)
4 L4 LE-1: LO2: Differentiate the different
Introdu types of interfaces like Command
ction line interpreter, GUI etc.
System Calls and its types LOL 1, -- CO1 Chalk & Talk T1(Ch1,Pg:62-
LO1: Define System Call LOL 2 73)
5 L5 LO2: Explain the different types of
System Calls.
System Programs and its types LOL 1 -- CO1 Chalk & Talk T1(Ch1,Pg:75-
6 L6 LO1: Define system programs and 77)
types
Operating System Structure, LOL 1, -- CO1 Chalk & Talk T1(Ch2,Pg:81-
loaders, linkers LOL 2 92)
LO1:Outline the need for
separating the features T1(Ch2,Pg:75-
7 L7 LO2:Describe different structures 77)
of OS
LO3: Define Loader
LO4: Define Linker
Overview of OS design and LOL 1, -- CO1 Chalk & Talk T1(Ch2,Pg:79-
implementation LOL 2 81)
8 L8 LO1:List the design policies of OS
LO2: Explain the OS
implementation
Continuous Assessment -1
9 L9

Process Concept, Operations on LOL 2, -- CO2 Chalk & Talk T1(Ch3,

Processes LOL 2
Pg:106-116)
LO1:Compare between program T1(Ch3,Pg:116
Module
10 L10 and process -213)
2:
LO2: Explain process states, PCB
Process
and context switching
Manag LO1:Explain process operation
ement LO2: Describe IPC
Inter Process Communication LOL 2, -- CO2 Chalk & Talk T1(Ch3,Pg:123-
11 L11 LO1: Compare different models of LOL 2 131 )
IPC
 LO2:Summarize issues related to
IPC
Introduction to threads - LOL 1, -- CO2 Chalk & Talk T1(Ch4,Pg:160-
Multithreading Models , Threading LOL 2 193 )
Issues LOL 3
12 L12 LO1:Define threads in OS
LO2:Compare different threading
models
LO3:Determine threading issues
Process Scheduling– Basic LOL 2, -- CO2 Chalk & Talk T1(Ch5,Pg:200-
concepts, Scheduling Criteria LOL 2 205 )
13 L13 LO1: Explain scheduling
concepts and types of schedulers
LO2: Describe scheduling criteria
Scheduling Algorithms: FCFS LOL 2, -- CO2 Problem Based T1(Ch5,Pg:205-
and practice problems LOL 3 Learning 217 )
14 L14 LO1: Explain FCFS
LO2:Apply algorithm to solve
problems
Scheduling Algorithms: LOL 2, -- CO2 Chalk & Talk T1(Ch5,Pg:205-
SJF/SRTF and practice problems LOL 3 217)
15 L15 LO1: Explain SJF/SRTF
LO2: Apply algorithm to solve
problems
Scheduling Algorithms: LOL 2, -- CO2 Chalk & Talk T1(Ch5,Pg:205-
SJF/SRTF and practice problems LOL 3 217)
16 L16 LO1: Explain SJF/SRTF
LO2: Apply algorithm to solve
problems
Scheduling Algorithms: Round LOL 2, -- CO2 Chalk & Talk T1(Ch5,Pg:205-
Robin, practice problems LOL 3 217)
LO1: Explain Round Robin and
17 L17 Priority scheduling
LO2: Apply algorithms to solve
problems
Scheduling Algorithms: Round LOL 2, -- CO2 Chalk & Talk T1(Ch5,Pg:205-
Robin, practice problems LOL 3 217)
LO1: Explain Round Robin
18 L18 scheduling
LO2: Apply algorithms to solve
problems
Scheduling Algorithms: Priority LOL 2, -- CO2 Chalk & Talk T1(Ch5,Pg:205-
scheduling, practice problems LOL 3 217)
19 L19 LO1: Explain Priority scheduling
LO2: Apply algorithms to solve
problems
Scheduling Algorithms: Priority LOL 2, -- CO2 Chalk & Talk T1(Ch5,Pg:205-
scheduling, practice problems, LOL 3 217)
Continuous Assessment – 2
20 L20 (Assignment -1 discussion)
LO1: Explain Priority scheduling
LO2: Apply algorithms to solve
problems
L21 MID TERM
21

L22 MID TERM

22
 L23 MID TERM
23

Course integration, The Critical- LOL 1, -- CO3 Chalk & Talk T1(Ch6,Pg:257-
Section Problem LOL 2 262)
24 L24 LO1: Define critical section.
LO2: Determine solutions to
critical section.
LOL 2 -- CO3 Chalk & Talk T1(Ch6,Pg:262-
Peterson’s Solution 265)
25 L25 LO1: Explain Peterson solution.

Synchronization hardware LOL 2 -- CO3 Chalk & Talk T1(Ch6,Pg:262-

26 L26 LO1: Identify the hardware support 270 )
for synchronization.
Semaphores LOL 2, -- CO3 Chalk & Talk T1(Ch6,Pg:272-
LO1: Explain semaphore. LOL 3 276 )
27 L27 LO2: Apply semaphore to solve
problems.
, Classic Problems of LOL 2 -- CO3 Chalk & Talk T1(Ch7,Pg:289-
Synchronization with Semaphore 295)
Solution- Dining Philosopher’s
28 L28 Problem.
LO1: Explain Dining
Philosopher’s problem,
Readers and Writers Problems LOL 3 -- CO3 Collaborative T1(Ch7,Pg:276-
LO1: Apply semaphore to solve Learning 282)
29 L29 Dining Philosopher’s problem

Introduction to Deadlocks, LOL 2, -- CO3 Collaborative T1(Ch8,Pg:318-

Module 3: Necessary conditions for deadlock 326)
LOL 3 Learning
Process Resource allocation Graph
Synchroni LO1:Explain RAG
zation and LO2:Apply RAG in deadlock
30 L30 Deadlocks handling
LO1: Explain deadlocks.
LO2: Determine the necessary
conditions for deadlock.

Methods for handling deadlock: LOL 1, -- CO3 Chalk & Talk T1(Ch8,Pg:326-
LOL 1 327)
Deadlock Prevention and
Implementation
31 L31 LO1: List methods to prevent
Deadlock.
LO2: List methods to avoid
deadlock.
Deadlock Avoidance and LOL 2, -- CO3 Chalk & Talk T1(Ch8,Pg:327-
LOL 1, 337)
Implementation
LOL 2,
LO1: Describe safe state. LOL 3
LO2: Define Banker’s algorithm
32 L32
for deadlock avoidance.
LO3: Explain Banker’s algorithm.
LO4: Apply banker’s algorithm to
avoid deadlocks.
Deadlock detection & Recovery LOL 2, -- CO3 Chalk & Talk T1(Ch8,Pg:337-
LOL 1 341)
33 L33 from Deadlock
LO1: Explain deadlock detection.
 LO2: List deadlock recovery
mechanisms.

Continuous Assessment - 3
34 L34

Course Integration : Introduction LOL 1, -- CO4 Chalk & Talk T1(Ch9,Pg:349-

to Memory Management, Basic LOL 2 356)
hardware-Base and Limit
Registers, Address Binding,
L35
35 Logical vs Physical Address Space
LO1: Define basics of memory
management
LO2: Explain Address Binding,
Logical vs Physical Address Space
Memory Management LOL 2, -- CO4 Chalk & Talk T1(Ch9,Pg:376-
Unit(MMU), Dynamic loading and LOL 2 379)
linking, Swapping, Contiguous
and Non-Contiguous Memory
Allocation
LO1:Explain MMU
36 L36 LO2: Compare Dynamic loading
and linking
LO1:Explain Swapping,
LO2: Explain Contiguous and
Non-Contiguous Memory
Allocation
Segmentation LOL 2, -- CO4 Chalk & Talk T1(Ch9,Pg:349-
37 L37 LO1: Explain segmentation. LOL 1 356)
LO2: List its importance.
Module 4: Paging, Structure of the Page LOL 2, -- CO4 Chalk & Talk T1(Ch9,Pg:360-
Memory Table LOL 1 371)
Managem LO1: Explain paging.
ent and LO2: Define concepts of page
38 L38 File table.
Systems LO1: Describe the structure page
tables.
LO2: Explain the working of page
tables.
Virtual Memory and Demand LOL 2, -- CO4 Chalk & Talk T1(Ch10,Pg:389
Paging LOL 2 -400)
LO1: Explain Virtual Memory and
39 L39 Demand Paging
LO2: Explain Pure Demand
Paging, Locality of Reference
Page Faults and Page Replacement LOL 1, -- CO4 Chalk & Talk T1(Ch10,Pg:401
Algorithms, Copy-on-write LOL 2 -413)
LO1: Define Page Fault
40 L40 LO2:Explain FIFO page
replacement algorithm
LO3: Summarize advantages and
disadvantages
Page Faults and Page Replacement LOL 1, -- CO4 Chalk & Talk T1(Ch10,Pg:401
Algorithms, Copy-on-write LOL 2 -413)
LO1:Explain LRU and Optimal
page replacement algorithms
41 L41 LO2: Summarize advantages and
disadvantages
Continuous Assessment 4 –
(Assignment 2 discussion)
 Allocation of Frames & Thrashing LOL 1, -- CO4 Chalk & Talk T1(Ch10,Pg:413
LO1: Explain allocation of frames LOL 2 -419)
42 L42 LO1: Define thrashing T1(Ch10,Pg:419
LO2: Explain the working-set -424)
model
File concept, Access Methods LOL 2, -- CO4 Flipped Class T1(Ch13,Pg:529
Directory and Disk structure LOL 2 Room -541)
LO1: Explain file concepts T1(Ch13,Pg:541
43 L43 LO2: Describe file operations and -550)
access methods
LO1:Explain Directory
LO2:Explain disk structures
File concept, Access Methods LOL 2, -- CO4 Flipped Class T1(Ch13,Pg:52
Directory and Disk structure LOL 2 Room 9-541)
LO1: Explain file concepts T1(Ch13,Pg:54
LO2: Describe file operations and 1-550)
44 L44 access methods
LO1:Explain Directory
LO2:Explain disk structures

Revision and Conclusion of the Course

CO1, CO2, CO3, CO4
45 L45

Topics relevant to “SKILL DEVELOPMENT”: Understanding System Calls, Process scheduling

algorithms, Process synchronization, Deadlock handling and Memory management.

ASSESSMENT SCHEDULE:

TABLE 6 ASSESSMENT SCHEDULE

Sl. Assessment type Contents Course Duration marks Weighta Venue, DATE
no outcome In Hours ge &TIME
Number
Continuous Assessment- Module 1 CO1 30 mins 10 5% 10/02/25 to
1 1 14/02/25
Continuous Module 1, CO1, CO2 1 week 15 7.5% 10/03/25
Assessment-2 Module 2 to14/03/25
2

Mid-Term Module 1, CO1, CO2 1 hour 50 25% 17/3/25 to

3 Module2 21/3/25
Continuous Module 3 CO3 30 mins 10 5% 05/4/25 to
Assessment-3 12/04/25
4

Continuous Module 3, CO3,CO4 1 week 15 7.5% 02/05/25 to

5 Assessment-4 Module 4 9/05/25
End Term All CO1, CO2, 3 hours 100 50% --
6 Modules CO3, CO4

COURSE CLEARANCE CRITERIA:

 “AS PER ACADEMIC REGULATIONS OF THE UNIVERSITY”

MAKEUP EXAM POLICY:

“AS PER ACADEMIC REGULATIONS OF THE UNIVERSITY”

CONTACT TIMINGS FOR ANY DISCUSSIONS:

Students are encouraged to come for any discussions on this course during your Library Hrs
SAMPLE THOUGHT PROVOKING QUESTIONS:

TABLE 7: SAMPLE THOUGHT PROVOKING QUESTIONS

SL QUESTION MARKS COURSE BLOOM’S
NO OUTCOME LEVEL
NO.

1. Can you run your executable code [.exe file] on a 2 CO1 Remember
system which does not have an OS? Elaborate your
answer.

2. During a process switch [context switching], the 2 CO2 Understand

operating system executes instructions that choose
the next process to execute. These instructions are
typically at a fixed location in memory.
Interpret?

3. Imagine a Railway Ticketing Counter. 10 CO2 Apply

● Initially there are 3 counters.
● There is a security guard who keeps a check on
the people so that no one breaks the line.
● Each counter has2 people waiting inline.
● The people waiting in line came in as per the
alphabetical order.
● A new 4th counter is being opened. And there are
two new persons G and H about to join the line
security guard, now you who can be processed get
to the counter at the new aremarked1, 2,3and4).
People waiting in line ( A, B, C and so on. Here t,
followed by B and then C etc.
Answer
4. Consider the following page reference string: 8 CO4 Apply
1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6.
How many page faults would occur for the
following replacement algorithms, assuming one,
two, three, four, five, six, or seven frames? Note:
Remember all frames are initially empty, so your
first unique pages will all cost one fault each.
• LRU replacement
• FIFO replacement
• Optimal replacement

5. A restaurant would like to serve four dinner parties, 8 CO3 Apply

P1 through P4. The restaurant has a total of 8 plates
and 12 bowls. Assume that each group of diners will
stop eating and wait for the waiter to bring a
requested item (plate or bowl) to the table when it is
required. Assume that the diners don't mind waiting.
The maximum request and current allocation tables
are shown as follows:

Max Plates Bo Current Plates Bowls

wls

p1 7 7 p1 2 3

p2 6 10 p2 3 5

p3 1 2 p3 0 1

p4 2 4 p4 1 2

a) Determine the Need Matrix for plates and bowls.

b) Tell the restaurant be able to feed all four parties
successfully?
Clearly explain your answer – specifically, why not
or why/how there is a safe serving order.
TARGET SET FOR COURSE OUTCOME ATTAINMENT:

TABLE 8: TARGET SET FOR ATTAINMENT OF EACH CO and ATTAINMENT ANALYSIS AFTER
RESULTS

Sl.no C.O. Course Outcomes Threshold Target set Actual C.O. Remarks on
No. Set for the for Attainment attainment
CO attainment in In &Measures
percentage Percentage to enhance
the
attainment

* *
01 CO1 Describe the fundamental 55 70
concepts of operating Systems
02 CO2 Demonstrate various CPU 50 65
scheduling algorithms.
03 CO3 Apply synchronization tools to a 50 60
given problem.
04 CO4 Examine various memory 50 60
management techniques.

* LAST TWO COLUMNS ARE TO BE FILLED AFTER END TERM EXAM WITH ACTUAL
ATTAINMENT VALUES

Signature of the course Instructor In-Charge (s)

APPROVAL:
This course has been duly verified Approved by the D.A.C.

Signature of the Chairperson D.A.C.

Course Plan Verified by:

Master IC Name, Signature & Date:

Name and signature of the Instructor In-Charge (s) AFTER completing entries in Table number 3 and 8 at end of
semester:
Name and signature of the DAC Chairperson AFTER completing entries in Table number 3 and 8 at end of semester:

BLOOM'S TAXONOMYSAMPLE VERBS

Learning Outcomes Verbs at Each Bloom Taxonomy Level to be used for writing the course Outcomes.