SIDDHARTHA INSTITUTE OF TECHNOLOGY & SCIENCES

(UGC – AUTONOMOUS)
(Approved by AICTE, New Delhi & Affiliated to JNTUH, Hyderabad)
Accredited by *NBA, NAAC with ‘A+’ Grade *nirf Ranked and ISO Certified Institution
Narapally, Korremula Road, Ghatkesar, Medchal- Malkajgiri (Dist)-500 088
[Link]

Department of Computer Science &Engineering

COURSE FILE

Course : operating systems

Academic Year : 2024-2025
Year & Branch : II [Link] (aaaaiml) - I Semester
Regulations : SITS-R22

Name of the Faculty: [Link]

Designation : Assistant Professor
Department : CSE(aiml)
 SIDDHARTHA INSTITUTE OF TECHNOLOGY & SCIENCES
(UGC – AUTONOMOUS)
(Approved by AICTE, New Delhi & Affiliated to JNTUH, Hyderabad)
Accredited by *NBA, NAAC with ‘A+’ Grade *nirf Ranked and ISO Certified Institution
Narapally, Korremula Road, Ghatkesar, Medchal- Malkajgiri (Dist)-500 088
[Link]

COURSE FILE INDEX

S. No Details
1 Vision, Mission of the Institute and Department
2 POs, PSOs, and PEOs
3 Syllabus along with Course Outcomes
4 CO-PO/PSOs Mapping with Justification
5 Previous results and target for present semester
6 Previous Question Papers
7 Academic Calendar
8 Student Roll List
9 Individual and Class Time Table
10 Lesson Plan
Class Notes (Must Include the following in unit wise)
Lecture wise Notes ( Handwritten/Typed Format)
Blooms Taxonomy (Contain 5 levels questions)
11 Question Bank with BT Levels and COs (Unit wise 10 Short and 10 Long Questions with Answers)
10 Objective and 10 Multiple Choice questions with answers
MOOCS (5 Different NPTEL lecture links)
Student Seminars topics (if applicable)
12 Unit Wise Tutorials with Answers (if applicable)
Assignment Topics/Questions along with Blooms Taxonomy Levels and COs
13
(Unit wise Sample of student scripts and submitted student list should attach)
Class Test, Unit Test Question Papers along with Blooms Levels, COs, and List of weak
students and remedial action
14
(Unit Test marks, Unit wise Slow learner identification, Remedial action along with improvement
analysis)
MID-I and MID-II Exam Schedules and Question Papers and Award list
15
(Slow learner identification and remedial action)
Unit Wise Active Learning (activities)
16
Collaborative learning, Stump your partner, Muddiest point, Flipped classroom
17 CO Attainment from MID-I along with micro analysis
18 CO Attainment from MID-II along with micro analysis
19 Total CO Attainment (Semester End Results) and Analysis Report
20 Action for Curriculum Improvement
21 Task Table
 22 Certificate

Department of Electronics and Communication Engineering

INSTITUTE VISION AND MISSION

Institute Vision:

Institute Mission:
 Department of Computer science & Engineering

DEPARTMENT VISION AND MISSION

Department Vision

Department Mission
 PROGRAM EDUCATIONAL OBJECTIVES (PEO)

PEO 1:

PEO 2:
 PROGRAM OUTCOMES (PO)
PO 1: Engineering knowledge: Apply the knowledge of mathematics, science, engineering fundamentals, and
engineering specialization to the solution of complex engineering problems.
PO 2: Problem analysis: Identify, formulate, research literature, and analyze engineering problems to arrive at
substantiated conclusions using first principles of mathematics, natural, and engineering sciences.
PO 3: Design/development of solutions: Design solutions for complex engineering problems and design system
components, processes to meet the specifications with consideration for the public health and safety, and
the cultural, societal, and environmental considerations.
PO 4: Conduct investigations of complex problems: Use research-based knowledge 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 modeling to complex engineering activities with an understanding of the
limitations.
PO 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.
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.
PO 9: Individual and team work: Function effectively as an individual, and as a member or leader in teams, and in
multidisciplinary settings.
PO 10: Communication: Communicate effectively with the engineering community and with society at large. Be
able to comprehend and write effective reports documentation. Make effective presentations, and give and
receive clear instructions.
PO 11: Project management and finance: Demonstrate knowledge and understanding of engineering and
management principles and apply these to one’s own work, as a member and leader in a team. Manage
projects in multidisciplinary 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)

PSO 1:

PSO 2:
 CS305PC: OPERATING SYSTEMS
[Link]. II Year I Sem. L T P C

3 0 0 3

Prerequisites:

1. A course on “Computer Programming and Data Structures”.

2. A course on “Computer Organization and Architecture”.

Course Objectives:

● Introduce operating system concepts (i.e., processes, threads, scheduling,

synchronization, deadlocks, memory management, file and I/O subsystems
and protection)
● Introduce the issues to be considered in the design and development of operating
system
● Introduce basic Unix commands, system call interface for process
management, interprocess communication and I/O in Unix

Course Outcomes:
 Course Outcomes:

● Will be able to control access to a computer and the files that may be shared
● Demonstrate the knowledge of the components of computers and their
respective roles in computing.
● Ability to recognize and resolve user problems with standard operating
environments.
● Gain practical knowledge of how programming languages, operating
systems, and architectures interact and how to use each effectively.

UNIT - I

-
UNIT - I
Operating System - Introduction, Structures - Simple Batch,
Multiprogrammed, Time-shared, Personal Computer, Parallel, Distributed Systems,
Real-Time Systems, System components, Operating System services, System Calls
Process - Process concepts and scheduling, Operations on processes, Cooperating
Processes, Threads

UNIT - II
CPU Scheduling - Scheduling Criteria, Scheduling Algorithms, Multiple -
Processor Scheduling. System call interface for process management-fork, exit,
wait, waitpid, exec
Deadlocks - System Model, Deadlocks Characterization, Methods for Handling
Deadlocks, Deadlock Prevention, Deadlock Avoidance, Deadlock Detection, and
Recovery from Deadlock

UNIT - III
Process Management and Synchronization - The Critical Section
Problem, Synchronization Hardware, Semaphores, and Classical Problems of
Synchronization, Critical Regions, Monitors Interprocess Communication
Mechanisms: IPC between processes on a single computer system, IPC between
processes on different systems, using pipes, FIFOs, message queues, shared
memory.

UNIT - IV
Memory Management and Virtual Memory - Logical versus Physical
Address Space, Swapping, Contiguous Allocation, Paging, Segmentation,
Segmentation with Paging, Demand Paging, Page Replacement, Page Replacement
 Algorithms.

UNIT - V
File System Interface and Operations -Access methods, Directory Structure,
Protection, File System Structure, Allocation methods, Free-space Management.
Usage of open, create, read, write, close, lseek, stat, ioctl system calls.
TEXT BOOKS:
1. Operating System Principles- Abraham Silberchatz, Peter B. Galvin, Greg Gagne 7th Edition, John
Wiley.
2. Advanced programming in the UNIX environment, W.R. Stevens, Pearson education.

REFERENCE BOOKS:
1. Operating Systems- Internals and Design Principles, William Stallings, Fifth Edition–2005,
Pearson Education/PHI
2. Operating System A Design Approach- Crowley, TMH.
3. Modern Operating Systems, Andrew S. Tanenbaum 2nd edition, Pearson/PHI
4. UNIX programming environment, Kernighan and Pike, PHI/ Pearson Education
UNIX Internals -The New Frontiers, U. V

Department of CSE(aiml)

Course: OPERATING SYSTEMS (C223)

Class: II–ISEM -A&B&C- Section

Course Outcomes

After completing this course, the student will be able to:

C223.1 Describe operating system goals and functions(Knowledge)

C223.2 Get the knowledge of process, various CPU scheduling algorithms and
synchronization (Application)
C223.3 Explain memory management and several page replacement algorithms.
(Comprehension)
C223.4 Classify storage management and file system implementation(Analysis)
C223.5 Analyze the methods for handling deadlocks. (Analysis)
C223.6 Express the various system protection methods(Comprehension)

Mapping of course outcomes with program outcomes:

High -3 Medium -2 Low-1

PO/ PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO

PSO/ 1 2 3 4 5 6 7 8 9 0 1 2 1 2
CO
C223. 3 - 1 2 - - - - - - - - 2 -
1
C223. - 2 3 - 1 - - - - - - - - -
2
C223. 1 3 2 - - - - - - - - - - 1
3
C223. - 1 3 - 2 - - - - - - - - -
4
C223. - 2 3 1 - - - - - - - - - 2
5
C223. - - 3 1 2 - - - - - - - - -
6
C223 2 2 2.5 1.2 1.6 - - - - - - - 2 1.5
 CO-PO Mapping Justification

C223.1 Describe operating system goals and functions(Knowledge)

Justification
PO1 Get the knowledge about operating system and importance of OS and
functionalities of operating system
PO3 Get knowledge about operating system services and system programs
development
PO4 Design issues of operating system and implementation
PSO1 Apply the gained knowledge in developing the operating system design.
(Level 2)
C223.2 Get the knowledge of process, various CPU scheduling algorithms and
synchronization (Application)
Justification
PO2 Analyze the process synchronization problems
PO3 Develop the various CPU scheduling algorithms and its implementation
PO5 To implement scheduling algorithms we use different tools

C223.3 Explain memory management and several page replacement algorithms.

(Comprehension)
Justification
PO1 Gain the Knowledge of paging, structure of page table and contiguous
and noncontiguous
memory allocation methods
PO2
Understand the process management and virtual memory in operating
systems
PO3
Students get the knowledge of paging and Develop the different
page replacement algorithms
PSO2 Discover the importance of the memory management and virtual
memory.

C223.4 Classify storage management and file system implementation(Analysis)

Justification
PO2 Analyze the disk scheduling and various types of disk scheduling
algorithms and their
Problems
PO3 Develop different file system allocation methods and file system
implementation
PO5 To implement system calls for file operations
open(),write(),read().close(),seek().
PO12 Understand the file system management and mass storage structure
C223.5 Analyze the methods for handling deadlocks. (Analysis)

Justification
PO2 Understand the importance of deadlocks and recovery from deadlocks
PO3 Develop different techniques for deadlock avoidance and deadlock
protection
PO4 To solve the deadlock problems by using bankers algorithms
PSO2 Understand the deadlocks concept and their issues

C223.6 Express the various system protection methods(Comprehension)

Justification
PO3 Describe the system protection and its techniques
PO4 State the advantages of protection goals and principles
PO5 Know the importance of access matrix implementation
 PREVIOUS RESULT
R22 Regulation
RESULT-2024-25 BATCH
III [Link] (ECE) II Sem - DSP RESULT
Hall Ticket Hall Ticket Hall Ticket
INT EXT TOT G INT EXT TOT G INT EXT TOT G
Number Number Number
4tq1a6601 24tq1a66c6

4tq1a6602 24tq1a66c8
4tq1a6603
24tq1a66c9

4tq1a6604 24tq1a66d0

4tq1a6605 24tq1a66d1

4tq1a6606 24tq1a66d2

4tq1a6607 24tq1a66D3

4tq1a6608 24tq1a66D4

4tq1a6609 24tq1a66D5

4tq1a66010 24tq1a66D6

4tq1a6611 24tq1a66D7

4tq1a6612 24tq1a66D8

4tq1a6613 24tq1a66D9

4tq1a6614 24tq1a66E0

4tq1a6615 24tq1a66E1

4tq1a6616 24tq1a66E2

4tq1a66017 24tq1a66E3

4tq1a66018 24tq1a66E4
4tq1a66019 24tq1a66E5
4tq1a6620 24tq1a66E6

4tq1a6621 24tq1a66E7

4tq1a6622 24tq1a66E8

4tq1a6623 24tq1a66E9

4tq1a6624 24tq1a66G0

4tq1a6625 24tq1a66G1

4tq1a6626 24tq1a66G2

4tq1a6627 24tq1a66G3

4tq1a6628 24tq1a66G4

4tq1a6629 24tq1a66G5

4tq1a6630 24tq1a66G6

4tq1a6631 24tq1a66G7

4tq1a6632 24tq1a66G8

4tq1a6633 24tq1a66G9

4tq1a6634 24tq1a66H0
4tq1a6635 24tq1a66H1

4tq1a6636 24tq1a66H2

4tq1a6637 24tq1a66H3

4tq1a6638 24tq1a66H4

4tq1a6639 24tq1a66H5

4tq1a6640 24tq1a66H6

24tq1a42 24tq1a66

4tq1a6643 24tq1a66

4tq1a6644

4tq1a6645

4tq1a6646

4tq1a6647

4tq1a6648

4tq1a6649

4tq1a6650

4tq1a6651

4tq1a6652

4tq1a6653

4tq1a6654

4tq1a6655

4tq1a6656

4tq1a6657

4tq1a6658

4tq1a6659

4tq1a6660

4tq1a6661

4tq1a6662

4tq1a66063

4tq1a6664

4tq1a6665

4tq1a6666

4tq1a6667

4tq1a6668

4tq1a6669

4tq1a6670

4tq1a6671

4tq1a6672

4tq1a6673

4tq1a6674

4tq1a6676
4tq1a6677

4tq1a6678

4tq1a6679

4tq1a6680

4tq1a6681

4tq1a6682

4tq1a6684

4tq1a6685

4tq1a6686

4tq1a6687

4tq1a6188

4tq1a6689

4tq1a6690

4tq1a6691

4tq1a6692

4tq1a6693

4tq1a6694

4tq1a6695

4tq1a6696

4tq1a6697

4tq1a6698

4tq1a6699

4tq1a66a0

4tq1a66a1

4tq1a66a2

4tq1a66a3

4tq1a66a4

4tq1a66a5

4tq1a66a6

4tq1a66A7

q1a66a8

4tq1a66B0

4tq1a66B1

4tq1a66B2

4tq1a66B3

4tq1a66B4

4tq1a66B5

4tq1a66B6

4tq1a66B7

4tq1a66B8
4tq1a66B9

4tq1a66C0

4tq1a66C1

4tq1a66C2

4tq1a66C3

4tq1a66C4

4tq1a66Cs

4tq1a66A9

4tq1a66B0

4tq1a66B1

4tq1a66B2

4tq1a66B3

4tq1a66B4

4tq1a66B5

4tq1a66B6

4tq1a66B7

4tq1a66B8

4tq1a66B9

4tq1a66c0

4tq1a66C1

4tq1a66C2

4tq1a66C3

4tq1a66C4

4tq1a66C5
G9

INT: Internal EXT: External

Pass Percentage:
A & A+ Grade:
B & B+ Grade:
C Grade:
PREVIOUS YEAR CO-ATTAINMENT
III [Link] II SEM ACADEMIC YEAR: 2024-25
SUB: DIGITAL SIGNAL PROCESSING
5%PP
INT PPT EXT 35% INT 60%EXT TOTAL CES FINAL
T
CO
1
CO
2
CO
3
CO
4
 CO
5

TARGET FOR PRESENT SEMESTER

Subject: Operating Systems (OS)

Branch: CSE(aiml)

Academic Year: 2024-2025 Year & Semester: II Year I Sem

Faculty: [Link]

PASS PERCENTAGE:
A & A+ GRADE:
B&B+ GRADE:
C GRADE:

Signature of Faculty

PREVIOUS QUESTION PAPERS (JNTUH/SITS)

ACADEMIC CALENDAR
 STUDENT ROLL LIST

S. No. Roll Number Name of the Student

INDIVIDUAL TIME TABLE
 II CSE (AIML) I Sem - Section A&B

Period 1 2 3 5 6 7

12.30PM
9.30AM- 10.30AM- 11.30AM- - 01.10PM- 02.10PM- 03.10PM-
Timings
10.30AM 11.30AM 12.30PM 1.10PM 02.10PM 03.10PM 04.00PM

Mon

Tue L
Wed U
N
Thu C
Fri H

Sat

CLASS TIME TABLE

 OPERATING SYSTEMS (CS403PC)

COURSE PLANNER

Course Title OPERATING SYSTEMS

Course Code CS403PC
Programme B. Tech
Year & Semester II Year II Semester
 Regulation R22
Course Faculty T. RAMYA PRIYA , ASSISTANT PROFESSOR, CSE

LESSON PLAN
[Link] Unit TOPIC Number Teaching REFERENCE
of method/Aid
Sessions s
Planned
1. Overview-Introduction- 1 Black Board T2,
Operating system
objectives
2. User view, System view 1 Black Board T2
3. Operating system 1 Black Board T1, R1
definition
4. Computer System 1 Black Board T2
Organization
5. Types of system calls 1 Black Board T1, R1
1
6. Computer System 1 Black Board T2
Architecture
7. OS Structure, OS 1 Black Board T1
Operations
8. Process Management, 1 Black Board T1& R2
Memory Management
9. Storage Management, 1 Black Board
Protection and Security, T2
Computing Environments
10. Operating System Design 1 PPT T1, R1
and
Implementation
11. Operating System 1 Black Board T1
services,
User and OS Interface
12. System Calls, Types of 1 Black Board T1
System
Calls
13. System Programs, 1 Black Board
Operating T1
System Design and
Implementation
14. Process and CPU 1 Black Board T1 & R2
Scheduling –
Process concepts-The
Process
15. OS structure, OS 1 Black Board T1, R1
functionalities
16. Process State, Process 1 Black Board T1 & R2
Control
 Block
17. Threads, Process 1 Black Board T1 & R2
2 Scheduling-
Scheduling Queues,
Schedulers
18. Context Switch, 1 Black Board T1 & R1
Operations on Processes
19. System calls-fork(), 1 Black Board T1 & R2
exec(), wait(), exit()
20. Inter process 1 PPT T1
communication,
scheduling algorithms
21. Inter process 1 Black Board
communication- ordinary T1
pipes and named pipes
in Unix
22. Process Scheduling-Basic 1 Black Board T1
concepts, Scheduling
Criteria
23. Scheduling algorithms 3 Black Board T1
24. Multiple Processor 1 Black Board T1
Scheduling,
Real-Time Scheduling
25. Critical section problems 1 PPT T2
26. Thread scheduling, Linux 1 Black Board
scheduling and T1
Windows scheduling
27. Process Synchronization, 1 Black Board
T1
Background, The Critical
Section Problem
28. Peterson’s 1 Black Board
T1
solution,
Synchronization
Hardware
29. Semaphores 1 Black Board T1
30. Classic Problems of 1 PPT T1
Synchronization
31. Classic Problems of 1 Black Board T1
Synchronization
32. Monitors, Synchronization 1 Black Board T1
in
Linux and Windows.
33. Memory Management 1 Black Board T1
and Virtual Memory
34. Memory Management 1 Black Board
T2
Strategies-
 Background,
Swapping
35. Methods for handling Black Board T1
Deadlocks
36. Deadlock 1 Black Board
Characterization, T2
Methods for Handling
Deadlocks
37. Deadlock Prevention, 1 Black Board T2
Deadlock
3
Detection
38. Deadlock Avoidance and 1 Black Board T1
Recovery from Deadlock
39. Protection – System 1 Black Board
Protection, Goals of
T2
Protection, Principles of
Protection, Domain
of Protection
40. Page Replacement 1 Black Board T2
Algorithms
41. Page Replacement, Page 1 Black Board T1
Replacement Algorithms
42. Allocation of Frames, 1 Black Board T1
 Thrashing
43. Virtual memory in 1 Black Board T1
Windows, Storage
Management-File
System- Concept of a File
44. System calls for file 1 Black Board T1
operations
– open(), read (), write (),
close
(), seek (), unlink (),
Access methods
S45. File structure 1 Black Board T1
implementation
46. Directory and Disk 1 Black Board T1
Structure, File
System
Mounting
47. File Sharing, Protection. 1 Black Board T1
File
4
System Implementation –
File System Structure
48. Directory Implementation, 1 Black Board T1
Allocation methods.
49. File System 1 Black Board T1,WR2
Implementation, ,
Free-space Management.
50. Disk Scheduling 1 Black Board T1
algorithms
51. Efficiency, and 1 Black Board
Performance, Mass
T1
Storage Structure –
Overview of Mass Storage
Structure
52. Disk Structure, Black Board
T1
Disk Attachment, Disk
Scheduling
53. Disk Management, Swap 1 PPT T1& T2
space
Management
TEXT BOOKS:
T1. Operating System Concepts, Abraham Silberschatz, Peter B. Galvin, Greg Gagne,
9th Edition, Wiley, 2016 India Edition
T2. Operating Systems – Internals and Design Principles, W. Stallings, 7th Edition, Pearson.
REFERENCE BOOKS:
R1. Modern Operating Systems, Andrew S Tanenbaum, 3rd Edition, PHI
R2. Operating Systems: A concept-based Approach, 2nd Edition, D.M. Dhamd here, TMH.
R3. Principles of Operating Systems, B. L. Stuart, Cengage learning, India Edition. An
Introduction to Operating Systems, P.C.P. Bhatt, PHI.
R4. Principles of Operating systems, Naresh Chauhan, Oxford University Press.

WEB REFERENCE

[Link] Web Link

1 [Link]
2 [Link]
3 [Link]
4 [Link]
 LECTURE NOTES
(Five Units Handwritten / Soft Copy)
 DESCRIPTIVE QUESTION BANK
WITH BTL AND CO’S
(Unit wise 10 Short and 10 Long Questions with Answers)
QUESTION BANK (UNIT WISE)

SUBJECT NAME : Operating System

COURSE CODE

YEAR : II year

SEM : I semester

UNIT-I

PART-A

[Link]. Coverage Questions Marks

Bloom's
1 UNIT-I Quote the types of System calls [1M] L1

2 UNIT-I Frame any four process management system call.

[1M] L4

3 UNIT-I Summarize the draw backs of monolithic system [1M] L2

4 UNIT-I Relate the advantage and disadvantage of multi-processor

system? [1M] L3

5 UNIT-I Illustrate the differences between macro-kernel and micro-

[1M] L1
kernel

6 UNIT-I Uses of distributed System?

[1M] L3

7 UNIT-I Cite examples of microkernel [1M] L2

8 UNIT-I Define user mode and kernel mode [1M] L1

 PART-B

Bloom's
[Link]. Coverage Questions Marks
Level

1 UNIT-I Define operating system and list the basic services provided by [10M] L1
operating system.

2 UNIT-I Illustrate among the following types of OS by defining their [10M] L4

essential properties.

a) Time sharing system

b) Parallel system

c) Distributed system

d) Real time system

3 UNIT-I Explain the essential Components of Operating Systems [10M] L1

4 UNIT-I Explain batch system and Multi-programmed System in detail [10M] L1

5 UNIT-I Explain the terms: Real time System and Distributed System [10M] L1

6 UNIT-I Explain the Parallel System and Batch System [10M] L1

7 UNIT-I Explain essential features of following structure of Operating [10M] L1

System

a. Monolithic System

b. Layered systems

c. Micro kernels

8 UNIT-I Explain System calls and types of system calls [10M] L1

UNIT-II

PART-A
[Link]. Coverage Questions Marks Bloom's

1 UNIT-II Design short on message passing and shared memory [1M] L5

2 UNIT-II Explain the terms Timesharing and mutual exclusion [1M] L1

3 UNIT-II Relate user level and kernel level thread [1M] L4

4 UNIT-II Classify deadlock? Explain any three methods of dealing with

[1M] L2
deadlock

5 UNIT-II Define the states of Process Control Block [1M] L1

6 UNIT-II Write a Short Notes on scheduling Criteria [1M] L2

7 UNIT-II Explain various methods for recovery from deadlock. [1M] L1

PART-B

Bloom's
[Link]. Coverage Questions Marks
Level
1 UNIT-II Cite deadlock? Explain deadlock detection with multiple [10M] L2
resources of each type.

2 UNIT-II Explain bankers algorithm for multiple-resources to avoid [10M] L1

deadlock

3 UNIT-II Plan short notes on Deadlock modeling and [10M] L5

Bankers algorithm

4 UNIT-II Define process and Explain process states in details with [10M] L1
diagram

5 UNIT-II Discover Threads? In Detail [10M] L3

6 UNIT-II Explain the following process scheduling algorithm [10M] L1

a) Priority scheduling

b )Shortest job first scheduling

7 UNIT-II Draw Gantt charts illustrating execution of these processes for [10M] L3
SJF, non preemptive priority (smaller priority number implies a
higher priority) & round robin(quantum=1)

8 UNIT-II Rewrite the conditions for deadlock? Explain deadlock detection [10M] L5
and recovery in detail

9 UNIT-II Relate the following snapshot- [10M] L3

Allocated Max Available

A B C D A B C D A B C D

P0 0 0 1 2 0 0 1 2 1 5 2 0

P1 1 0 0 0 1 7 5 0

P2 1 3 5 4 2 3 5 6

P3 0 6 3 2 0 6 5 2

P4 0 0 1 4 0 6 5 6

Answer the following questions using banker’s algorithm

10 UNIT-II Explain deadlock prevention in detail [10M] L1

 UNIT-III

PART-A

[Link]. Coverage Questions Marks

Bloom's

1 UNIT-III Distill product-consumer problem with semaphore. [1M] L4

2 UNIT-III Define Synchronization Hardware? [1M] L1

3 UNIT-III Write a Short notes on Race condition and Critical Section

[1M] L6
Region

4 UNIT-III Use Monitors with example [1M] L3

5 UNIT-III Define methods for semaphores [1M] L1

6 UNIT-III Define Inter process Communication and Message passing [1M] L1

7 UNIT-III Define Pipes and FIFO with syntax [1M] L1

PART-B

Bloom's
[Link]. Coverage Questions Marks
Level

1 UNIT-III Distinguish between Inter process Communication with Single [10M] L4

Computer and Different processes on different systems

2 UNIT-III Explain Classical Problems for Synchronization? [10M] L1

3 UNIT-III Explain semaphore in detail [10M] L1

4 UNIT-III Justify monitor’s ? Explain solution for producer-consumer [10M] L3

problem using monitor. Explain monitors in detail.

5 UNIT-III Explain Peterson’s solution for achieving mutual exclusion [10M] L1

6 UNIT-III Explain use of message passing & semaphore for inter process [10M] L1
communication?

7 UNIT-III Discovering dinning philosopher problem? Explain its solution [10M] L3

with monitor.

8 UNIT-III Explain readers & writers problem? Give its solution with [10M] L1
semaphore.
 UNIT-IV

PART-A

[Link]. Coverage Questions Marks

Bloom's

1 UNIT-IV Distinguish beween internal and external memory

[1M] L4
Fragmentation?

2 UNIT-IV Justify memory management requirements [1M] L5

3 UNIT-IV Show multi-programming with fixed partition. [1M] L3

4 UNIT-IV Show multi-programming with dynamic partition. [1M] L3

5 UNIT-IV Explain the difference between logical and physical addresses? [1M] L1

6 UNIT-IV Conclude virtual memory? How it is implemented. [1M] L5

7 UNIT-IV Explain the following page replacement algorithm. Optimal

page replacement and Least recently used page replacement. [1M] L1

PART-B

Bloom's
[Link]. Coverage Questions Marks
Level

1 UNIT-IV Explain following allocation algorithm. First-fit,Best-fit, Worst- [10M] L1

fit

2 UNIT-IV Justify paging? Discuss basic paging technique in details. [10M] L5

3 UNIT-IV Justify segmentation? Explain the basic segmentation method. [10M] L5

4 UNIT-IV Describe demand paging? Explain it with address translation [10M] L1

mechanism used. What are its specific advantages? How a page
table is implemented?

5 UNIT-IV Write short note on: [10M] L6

Segmentation

Page table

Compaction

fragmentation
 6 UNIT-IV Explain following page replacement algorithm in detail. [10M] L1

i. LRU ii. FIFO iii. Optimal

7 UNIT-IV Develop the following page reference string. [10M] L6

1,2,3,4,5,3,4,1,6,7,8,7,8,9,7,8,9,5,4,5,4,2Howmanypagefaultswoul
doccurforthe

Following replacement algorithm assuming four and six frames

respectively?

a. Optimal page replacement

b. FIFO page replacement.

8 UNIT-IV Calculate page faults for (LRU, FIFO, OPT) for following [10M] L2
sequences where page frame is three.

0,1,2,1,4,2,3,7,2,1,3,5,1,2,5.

9 UNIT-IV Write short note on: [10M] L6

Optimal page replacement algorithm.

Swapping.

UNIT-V

PART-A

[Link]. Coverage Questions Marks

Bloom's

1 UNIT-V Reframe methods of free space management of Disk? [1M] L5

2 UNIT-V Compare file organization methods [1M] L2

3 UNIT-V Explain file system performance in detail. [1M] L1

4 UNIT-V Cite directory? Relate directory operation in details. [1M] L3

5 UNIT-V Relate difference between field and record? [1M] L4

6 UNIT-V Relate difference between file and database? [1M] L4

7 UNIT-V Relate path name & a working directory? [1M] L2

8 UNIT-V Develop file management system? [1M] L5

[Link]. Coverage Questions Marks

1 UNIT-V Explain Allocation Methods [10M] L1

2 UNIT-V Write Free Space management? Explain in detail [10M] L5

3 UNIT-V Formulate Open, Create, Read, Write and Close System call [10M] L4
with Syntax and example program

4 UNIT-V Formulate Lseek, Stat, ioctl System call with Syntax and [10M] L4
example program

5 UNIT-V Write a Short Notes on File System Management [10M] L5

6 UNIT-V Distill Note on Directory Structure [10M] L4

OBJECTIVE QUESTION BANK

(Unit wise 10 Fill in the blanks and
10 Multiple Choice Questions with Answers)
OBJECTIVE QUESTION BANK

UNIT – I:
Multiple Choice Questions
1.

2.

3.
4.

5.

6.

7.

8.

9.

10.

Answers:
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
Fill in the Blanks
1.
2.
3.
4.
5.
6
7.
8.
9.
10.

Answers:
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.

UNIT – II:
Multiple Choice Questions
1. [ ]

2.

3.

4.

5.

6.

7.

8.

9.

10.

Answers:
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
Fill in the Blanks
1.
2.
3.
4.
5.
6
7.
8.
9.
10.

Answers:
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
UNIT – III:
Multiple Choice Questions
1. [ ]

2.

3.

4.

5.

6.

7.

8.

9.

10.

Answers:
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
Fill in the Blanks
1.
2.
3.
4.
5.
6
7.
8.
9.
10.

Answers:
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.

UNIT – IV:
Multiple Choice Questions
1. [ ]

2.

3.

4.

5.

6.

7.

8.
9.

10.

Answers:
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
Fill in the Blanks
1.
2.
3.
4.
5.
6
7.
8.
9.
10.

Answers:
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
UNIT – V:
Multiple Choice Questions
1. [ ]

2.

3.

4.

5.

6.

7.

8.

9.

10.

Answers:
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
Fill in the Blanks
1.
2.
3.
4.
5.
6
7.
8.
9.
10.

Answers:
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.

MOOCS LECTURE LINKS

(Five Different NPTEL Course links or any Swayam Course Links)

Unit Number MOOCs Lecture Links

 1.
Unit - I
2.
1.
Unit – II
2.
1.
Unit – III
2.
1.
Unit – IV
2.
1.
Unit - V
2.

STUDENT SEMINAR TOPICS

(Minimum three topics from each Unit)
Unit Number Seminar Topics
1.
Unit - I 2.
3.
1.
Unit – II 2.
3.
1.
Unit – III 2.
3.
1.
Unit – IV 2.
3.
1.
Unit - V 2.
3.

UNIT WISE TUTORIALS

(If Applicable)
Unit Number Tutorials
1.
2.
3.
Unit - I
4.
5.
6.
1.
2.
3.
Unit – II
4.
5.
6.
1.
2.
3.
Unit – III
4.
5.
6.
Unit – IV 1.
2.
3.
4.
5.
 6.
1.
2.
3.
Unit - V
4.
5.
6.

ASSIGNMENT TOPICS/QUESTIONS ALONG WITH BLOOMS

LEVELS AND CO’s
(Unit wise Sample of student scripts and submitted student list
should attach)

ASSIGNMENT - I
Mark Bloom's
S. No. Coverage Questions
s Level
1 UNIT-I [1M]
2 UNIT-I [1M]
3 UNIT-II [1M]
4 UNIT-II [1M]
 5 UNIT-III [1M]

ASSIGNMENT - II
Mark Bloom's
S. No. Coverage Questions
s Level
1 UNIT-III [1M]
2 UNIT-IV [1M]
3 UNIT-IV [1M]
4 UNIT-V [1M]
5 UNIT-V [1M]

ASSIGNMENT – I & II Marks

Roll Assignment Assignment Roll Assignment Assignment

S. No. S. No.
Number – I Marks – II Marks Number – I Marks – II Marks
1 28
2 29
3 30
4
5
6
7
8
9
10
11
12
13
14
 15
16
17
18
19
20
21
22
23
24
25
26
27
Roll Assignment Assignment Roll Assignment Assignment
S. No. S. No.
Number – I Marks – II Marks Number – I Marks – II Marks
 CLASS TEST AND UNIT TEST QUESTION PAPERS
ALONG WITH BLOOMS LEVELS, COs, AND LIST OF
WEAK STUDENTS AND REMEDIAL ACTION

(Class Test Marks and Unit Test marks, Unit wise slow learner
identification, Remedial action along with improvement analysis)
 UNIT TEST MARKS

Unit Test-I Unit Test-II Unit Test-III Unit Test-IV Unit Test-V
S. No. Roll Number
Marks Marks Marks Marks Marks
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
 LIST OF WEAK STUDENTS AND REMEDIAL ACTION
A. Weak students as per SEE Result
B. Weak students as per Mid-term test result
C. Remedial action

Based on the analysis of internal assessments, end-semester examinations, student

feedback, and course outcomes (CO) attainment levels, the following remedial actions were
implemented during/after the course delivery:

1. Student-Centric Actions:
o Remedial Classes: Conducted extra sessions for students scoring below
average in internal assessments.
o Tutorial Hours: Allocated dedicated time slots for solving previous year
question papers and addressing conceptual doubts.
o Peer Mentoring: Encouraged high-performing students to support low
performers through peer-to-peer learning.
2. Content Delivery Improvement:
o Revised Teaching Methods: Adopted ICT tools (e.g., simulations, videos,
NPTEL content) for complex topics.
o Interactive Sessions: Included quizzes, group discussions, and hands-on
activities to enhance engagement.
3. Assessment Reforms:
o Continuous Evaluation: Added surprise tests and assignments to improve
consistency in learning.
 o Targeted Feedback: Provided individual feedback and counseling after each
assessment.
4. Outcome Enhancement:
o Mapping Gaps: Identified weakly attained Course Outcomes (COs) and
revised strategies accordingly.
o Resource Sharing: Shared additional reference materials and online
resources (e.g., SWAYAM/NPTEL links).
5. Faculty Collaboration:
o Inter-Departmental Review: Discussed performance trends in departmental
meetings to align teaching strategies.
o Faculty Feedback: Incorporated feedback from course coordinators and
mentors for continual improvement.
A. Weak students as per JNTUH/SITS Result
[Link] Roll Number backlogs

B. Weak students as per MID Result

[Link] Roll Number Backlogs
C. Remedial Action Taken

Schedule of Remedial Classes

Subject: DSP
Branch/Year: III [Link] (ECE) I SEM
Faculty: Dr. [Link]
Academic Year: 2025-26 Semester: I SEM
 TIME TABLE

No. of students
Date Day Period Remarks
attended

Performance of Weak students in Additional make-up Test

Roll No. Name Marks obtained

MID-I AND MID-II EXAM SCHEDULES AND

QUESTION PAPERS WITH AWARD LIST
 (Slow learner identification and remedial action)

MID- I QUESTION PAPER

MID-I AWARD LIST (Question wise Marks list)

MID- II QUESTION PAPER
MID-II AWARD LIST (Question wise Marks list)
UNIT WISE ACTIVE LEARNING METHODS (ALM)
(ALM Activities: Collaborative learning, Stump your partner,
Muddiest point, Flipped classroom and etc.)

ACTIVE LEARNING METHODS (ALM)

Unit Number ALM Activity Topic(s)

Unit – I

Unit – II

Unit – III

Unit – IV

Unit – V
CO ATTAINMENT FROM MID-I ALONG WITH MICRO
ANALYSIS
 CO ATTAINMENT FROM MID-II ALONG WITH MICRO
ANALYSIS

TOTAL CO ATTAINMENT (SEMESTER END RESULTS) AND

ANALYSIS REPORT
ACTION FOR CURRICULUM IMPROVEMENT
Name of the Faculty: [Link]
Name of the Course: OPERATING SYSTEMS

TASK TABLE
Task Task Description /
Task Name Target Date Completed Date HOD Sign
No Topic Covered
 DEPARTMENT OFELECTRONICS AND COMMUNICATION ENGINEERING

COURSE COMPLETION CERTIFICATE

I, [Link], faculty in the Dept. of CSE(AIML) have taught subject to students of II Year
[Link]. Isemester and AIML branch during Academic Year 2025.
I certified, that I have completed five units on 13-12-2025 or could not complete the
___________ portion of Unit No.5 due to reasons, i.e.,
________________________________.

Signature of the faculty with date Signature of HOD