17/08/2025, 23:04 about:blank

K L Deemed to be University
CSE-1 -- KLAZIZ
Course Handout
2025-2026, Odd Sem
Course Title :OPERATING SYSTEMS
Course Code :24CS2101A
L-T-P-S Structure : 4-1-2-0
Pre-requisite :
Credits :6
Course Coordinator :Sumalakshmi C H
Team of Instructors :
Teaching Associates :
Syllabus :CO1: Role, Purpose and Principles of Operating Systems: Basics: Operating System Functionalities (Universal operating system functions Example
concepts: a. Interfaces (process, user, device, etc), b. Persistence of data), Types of Operating Systems, general hardware and application-specificpurpose software
Operating system (Example concepts: Operating system as an abstract virtual machine via an API), specialized operating system functions (Example concepts:
Embedded systems, Server types suchas file, web, multimedia, boot loaders and boot security) Process Model: Processes, Process API code,Direct Execution.
Scheduling: CPU Scheduling, Multilevel Feedback, Lottery Scheduling, code,Multiprocessor Scheduling. CO2 Concurrency & Deadlocks: Concurrency and
Threads, Threads code,Thread API, Locks, Locked Data Structures, Condition Variables, Mutex, Common concurrency problems,emaphores, Monitors. Deadlock:
Prevention, Detection and Avoidance. CO3 Virtualization & MemoryManagement: Virtualization overview, Pros & Cons, Common Uses. Memory Virtualization:
AddressSpaces, Memory API, Address Translation, Segmentation, Free Space Management, Introduction to Paging,Translation Look Aside Buffer, Swapping,
Demand Paging, Thrashing, Page eplacement algorithms CO4:Advanced File system and Device Management: Persistence I/ O Devices, Device Management
Techniques,Hard Disk Drives, Redundant Disk Arrays (RAID), Files and Directories, File System Implementation,Distributed File Systems, Network File System
(NFS), InterProcess Communication, Data Integrity and Protection, Types of Allocating Devices, Dedicated Devices, Shared devices and Virtual devices. Real-time
and Embedded Systems, Fault Tolerance. CO5: Social, Ethical and Professional topics: Protection and Security: Goals of Protection, Principles of Protection,
Domain of Protection. The Security Problem,Program Threats, System and Network Threats.
Text Books :Silberschatz, Abraham, Galvin, Peter B., and Gagne, Greg. Operating System Concepts, 10thEdition, Wiley, 2018. Dhamdhere, D. M. Operating
Systems: A Concept-Based Approach, McGraw-HillEducation, 2009. Operating Systems: Three Easy Pieces Remzi H. Arpaci-Dusseau and Andrea
C.ArpaciDusseau,, May, (2014). Arpaci-Dusseau Books Operating system concepts essentials. Silberschatz,A., Galvin, P.B. and Gagne, G., John Wiley & Sons, Inc
Reference Books :The Design of the Unix Operating System Maurice J. Bach, 2013 PHI Publishing.Operating Systems: A Concept-based Approach D. M.
Dhamdhere 2E Tata McGraw-Hill Education.
Web Links :https://www.cse.iitb.ac.in/~mythili/os/ https://www.cse.iitd.ac.in/~sumantra/courses/os/os_pg.html https://cse.iitkgp.ac.in/~agupta/OS/
https://cse.iitkgp.ac.in/~bivasm/OS2016.html http://www.cse.iitd.ernet.in/os-ectures
MOOCS : :https://www.coursera.org/specializations/codio-introduction-operating-systems https://www.coursera.org/learn/os-power-user
https://www.coursera.org/learn/unix https://www.coursera.org/ learn/

COURSE OUTCOMES (COs):

Blooms
CO Taxonomy
Course Outcome (CO) PO/PSO
NO Level
(BTL)
CO1 Understanding the basic algorithms for the process and CPUScheduling, Operating Systems Basics PO4,PSO1,PO3 2
CO2 Apply Concurrency and different Lock Algorithms & SolveSynchronisation Problems PO3,PO4,PSO1 3
CO3 Understand memory, process virtualization, Paging and applyPage Replacement Algorithms. PO3,PO4,PSO1 3
Apply the knowledge of persistence concepts, Redundant diskarrays, File System Implementation,
CO4 PO3,PSO1,PO4 3
Inter-processCommunication and Distributed Systems. Apply DiskScheduling Algorithms.
CO5 Apply the knowledge of CPU Scheduling in Real TimeOperating Systems. PO3,PO4,PSO1 3
Analyse Unix System Calls. Use C Programming Language toimplement Operating System Concepts
CO6 PO2,PO3,PO4,PSO1 4
(Practicals)

COURSE OUTCOME INDICATORS (COIs)::

Outcome Highest
COI-1 COI-2 COI-3 COI-4
No. BTL
Btl-2
Btl-1 Understanding thebasic algorithms
Btl-3
List the forprocess and
CO1 2 Problem Solving onCPU
OperatingSystemFunctionalities,Types CPUscheduling,Operating
SchedulingAlgorithms
of OperatingSystems. SystemsBasics,Functionalities,Types
of OperatingSystems
Btl-3
Btl-2 Btl-2
Apply algorithms forprocess and
UnderstandsVirtualizationoverview, UnderstandsVirtualizationoverview,
CO2 3 CPUscheduling,Operating
paging,Segmentation andTranslation paging,Segmentation andTranslation
SystemsBasics,Functionalities,Types
LookAside Buffer. LookAside Buffer.
of OperatingSystems
Btl-2 Btl-3
understand about theLocked Apply the Problemsolving
CO3 3
DataStructures, ConditionVariables, techniqueson Commonconcurrency
Mutex,Semaphores,Monitors problem
Btl-2 Btl-3
Understands DeadLocks, Applies Problem solving methods
CO4 3 RedundantDisk Arrays on Memory managements, File
(RAID),Redundant DiskArrays System Implementation and
(RAID), Filesand Directories Distributed systems

about:blank 1/15
17/08/2025, 23:04 about:blank
Btl-2 Btl-3
CO5 3 Understands theprinciples of apply the principlesof Real
RealTime OperatingSystems TimeOperating Systems
Btl-4
Analyze the basicMs Dos Com
UnixCommands,schedulingalg
CO6 4
memorymanagement andalloca
Pagereplacement,algorithms,D
DiskScheduling

PROGRAM OUTCOMES & PROGRAM SPECIFIC OUTCOMES (POs/PSOs)

Po No. Program Outcome

Problem Analysis: Identify, formulate, review research literature, and analyse complex engineering problems reaching substantiated conclusions using first
PO2
principles of mathematics, natural sciences and engineering sciences.
Design/Development of Solutions: Design solutions for complex engineering problems and design system components or processes that meet the specified
PO3
needs with appropriate consideration for the public health and safety, and the cultural, societal, and environmental considerations
Conduct Investigations of Complex Problems:Use research-based knowledge and research methods including design of experiments, analysis and
PO4 interpretation of data, and synthesis of the information to provide valid conclusions for complex problems that cannot be solved by straightforward
application of knowledge, theories and techniques applicable to the engineering discipline.
PSO1 An ability to design and develop software projects as well as Analyze and test user requirements.

Lecture Course DELIVERY Plan:

Book No[CH No][Page Teaching-Learning
Sess.No. CO COI Topic EvaluationComponents
No] Methods

ALM,End Semester Exam,Home

COI- course handout, Introduction to UNIX OS, Operating T BOOK [2], CH 1,Page
1 CO1 Chalk,LTC,PPT,Talk Assignment,SEM-
2 system functionalities no3-23.
EXAM1,Tutorial

ALM,End Semester Exam,Home

COI- T BOOK [2], CH 1, Page
2 CO1 Types of Operating Systems Chalk,LTC,PPT,Talk Assignment,SEM-
2 no3-23.
EXAM1,Tutorial

ALM,End Semester Exam,Home

COI- T BOOK [2], CH 1, Page
3 CO1 Process, Process API, Direct Execution Chalk,LTC,PPT,Talk Assignment,SEM-
2 no3-23.
EXAM1,Tutorial

ALM,End Semester Exam,Home

COI- T BOOK [1], CH 7, Page
4 CO1 Specialised Operating System Functions Chalk,LTC,PPT,Talk Assignment,SEM-
2 no 25 – 57
EXAM1,Tutorial

ALM,End Semester Exam,Home

COI- T BOOK [1], CH 7, Page
5 CO1 CPU Scheduling (FCFS, SJF) Chalk,LTC,PPT,Talk Assignment,SEM-
2 no 25 – 5
EXAM1,Tutorial

ALM,End Semester Exam,Home

COI- Gate previous questions
6 CO1 CPU Scheduling - II ( ROUND ROBIN) Chalk,PPT Assignment,SEM-
2 and Internet Sources
EXAM1,Tutorial

ALM,End Semester Exam,Home

COI- CPU Scheduling - II (Priority Scheduling,Multi Gate previous questions
7 CO1 PPT,Talk Assignment,SEM-
2 Processor Scheduling) and Internet Sources
EXAM1,Tutorial

ALM,End Semester Exam,Home

COI- CPU Scheduling - III (Lottery Scheduling,Multi level Gate previous questions
8 CO1 PPT,Talk Assignment,SEM-
2 Feedback Scheduling) and Internet Sources
EXAM1,Tutorial

ALM,End Semester Exam,Home

COI- T BOOK [1],CH 26, Page
9 CO1 Concurrency and Threads code(CO-2) PPT,Talk Assignment,SEM-
2 no 263-290
EXAM1,Tutorial

ALM,End Semester Exam,Home

COI- T BOOK [1],CH 26,
10 CO2 Threads API PPT,Talk Assignment,SEM-
2 Pageno 263-290
EXAM1,Tutorial

T BOOK[1], CH 4.4–4.5,
p. 136–152; TBOOK ALM,End Semester Exam,Home
COI-
11 CO2 Common concurrency problems,Mutex [2],CH 5, p.200–207; Chalk,PPT,Talk Assignment,SEM-
2
TBOOK [3],Part II EXAM1,Tutorial
(CH26)

ALM,End Semester Exam,Home

COI- T BOOK [1],CH 29,
12 CO2 Locks & Locked Data Structures LTC,PPT,Talk Assignment,SEM-
2 Page-no 311- 324
EXAM1,Tutorial

ALM,End Semester Exam,Home

COI- T BOOK [1],CH 30,
13 CO2 Condition Variables Chalk,PPT,Talk Assignment,SEM-
2 Pageno 325- 340
EXAM1,Tutorial

about:blank 2/15
17/08/2025, 23:04 about:blank
Book No[CH No][Page Teaching-Learning
Sess.No. CO COI Topic EvaluationComponents
No] Methods

ALM,End Semester Exam,Home

COI- TBOOK [1], CH 31,
14 CO2 Semaphores and Monitors PPT,Talk Assignment,SEM-
2 Pageno 341- 358
EXAM1,Tutorial

ALM,ALM-CO2,End Semester
COI- T BOOK[1],CH 31, Exam,HA,MOOCs
15 CO2 Monitors implementation PPT
3 Pageno 341- 358 Certification,SEM-EXAM1,Skill
In-Sem Exam-I

ALM,End Semester Exam,Home

COI- TBOOK [2],CH 7, Page
16 CO2 Deadlocks:characterization,Prevention Chalk,LTC,PPT,Talk Assignment,SEM-
2 no283-293
EXAM1,Tutorial

COI- TBOOK [2],CH 7, Page Lab In Semester Exam,SEM-

17 CO2 Deadlock Deatection & Avoidance PPT,Talk
2 no294- 310 EXAM1

ALM,End Semester
COI- Gate Problems-
18 CO2 Dead lock relatedproblems solving PPT Exam,HA,MOOCs Review,SEM-
3 InternetResources
EXAM1

ALM,End Semester
COI- Textbook[2]CH13 &14
19 CO3 VIRTUAL MEMORY, MEMORY MANAGEMENT PPT,Talk Exam,LCE,MOOCs
2 PG NO 109-127
Certification,SEM-EXAM2

ALM,End Semester Exam,Home

COI- T BOOK [2],CH 15,
20 CO3 Address Spaces,Memory API Chalk,LTC,PPT,Talk Assignment,SEM-
3 Pageno 129 - 140
EXAM2,Tutorial

ALM,End Semester Exam,Home

COI- T BOOK [2],CH 16,
21 CO3 Address Translation, Segmentation Chalk,LTC,PPT,Talk Assignment,SEM-
3 Pageno 141 - 152
EXAM2,Tutorial

ALM,End Semester
COI- Gate
22 CO3 Introduction to Paging PPT Exam,HA,MOOCs Review,SEM-
3 PreviousQuestionPapers
EXAM2

ALM,End Semester Exam,Home

COI- Comparision between Segmentation and Paging,Page
23 CO3 InternetResources Chalk,LTC,PPT,Talk Assignment,SEM-
3 replacement Algorithms
EXAM2,Tutorial

ALM,End Semester Exam,Home

COI- TBOOK [1],CH 17,
24 CO3 Free Space Management Chalk,LTC,PPT,Talk Assignment,SEM-
2 Pageno 153-168
EXAM2,Tutorial

ALM,End Semester Exam,Home

COI- TBOOK [1],CH 18,
25 CO3 Translation LookAside Buffer, Swapping Chalk,LTC,PPT,Talk Assignment,SEM-
3 Pageno 185-198
EXAM2,Tutorial

ALM,End Semester Exam,Home

COI- TBOOK [1],CH 18,
26 CO3 Thrashing, Demand Paging Chalk,LTC,PPT,Talk Assignment,SEM-
3 Pageno 200-232
EXAM2,Tutorial

ALM,End Semester Exam,Home

COI- Persistence: I/ODevices, Hard DiskDrives, Device TBOOK [1],CH 37.5,
27 CO4 Chalk,LTC,PPT,Talk Assignment,SEM-
2 Management Techniques, Disk Scheduling algorithms Pageno 412- 418
EXAM2,Tutorial

COI- TBOOK [1], CH 38, Page ALM,End Semester Exam,Home

28 CO4 Redundant Disk Arrays (RAID) Chalk,LTC,PPT,Talk
2 no 421- 440 Assignment,Tutorial

ALM,End Semester Exam,Home

COI- Files and Directories, File system TBOOK [1], CH 39,Page
29 CO4 Chalk,LTC,PPT,Talk Assignment,SEM-
3 Implementation,Distributed File system,NFS no 441- 478
EXAM2,Tutorial

ALM,End Semester Exam,Home

COI- INTERNET
30 CO4 Data Integrity protection Chalk,LTC,PPT,Talk Assignment,SEM-
3 RESOURCES
EXAM2,Tutorial

ALM,End Semester Exam,Home

COI- TBOOK [1], CH 39, Page
31 CO4 Inter-Process Communication Chalk,LTC,PPT,Talk Assignment,SEM-
3 no 481- 497
EXAM2,Tutorial

ALM,End Semester Exam,Home

COI- Types of Allocating Devices, Dedicated Devices, TBOOK [1], CH 39, Page
32 CO4 Chalk,LTC,PPT,Talk Assignment,SEM-
3 Shared devices and Virtual devices no 441- 478
EXAM2,Tutorial

ALM,End Semester Exam,Home

COI- TBOOK [1], CH 39, Page
33 CO4 Real-time and Embedded Systems, Fault Tolerance Chalk,LTC,PPT,Talk Assignment,SEM-
3 no 441- 478
EXAM2,Tutorial

about:blank 3/15
17/08/2025, 23:04 about:blank
Book No[CH No][Page Teaching-Learning
Sess.No. CO COI Topic EvaluationComponents
No] Methods

ALM,End Semester Exam,Home

COI- Social Ethical and Professional Topics,Protection &
34 CO5 Internet Resources Chalk,LTC,PPT,Talk Assignment,SEM-
3 Security,Goals of Protection
EXAM2,Tutorial

COI- ALM,End Semester Exam,Home

35 CO5 Principles of Protection Internet Resources Chalk,LTC,PPT,Talk
3 Assignment,Tutorial

COI- ALM,End Semester Exam,Home

36 CO5 Domain of Protection Internet Resources Chalk,LTC,PPT,Talk
3 Assignment,Tutorial

COI- ALM,End Semester Exam,Home

37 CO5 The Security Problem Internet Resources Chalk,LTC,PPT,Talk
3 Assignment,Tutorial

COI- ALM,End Semester Exam,Home

38 CO5 Program Threats Internet Resources Chalk,LTC,PPT,Talk
3 Assignment,Tutorial

COI- ALM,End Semester Exam,Home

39 CO5 System and Network Threats Internet Resources Chalk,LTC,PPT,Talk
3 Assignment,Tutorial

Lecture Session wise Teaching – Learning Plan

SESSION NUMBER : 1

Session Outcome: 1 course handout, Introduction to UNIX OS, Operating system functionalities

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance 1 Talk
APPLICABLE ---
--- NOT
25 Course Handout 2 Talk
APPLICABLE ---
--- NOT
20 Introduction,OS Functionalities 2 Talk
APPLICABLE ---

SESSION NUMBER : 2

Session Outcome: 1 Types of Operating Systems

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance 1 Talk
APPLICABLE ---
--- NOT
25 Types of Operating Systems 2 Talk
APPLICABLE ---
--- NOT
20 Computer Architecture support to Operating Systems 2 Talk
APPLICABLE ---

SESSION NUMBER : 3

Session Outcome: 1 Process, Process API, Direct Execution

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
50 Process, Process API, Direct Execution 3 PPT Group Discussion

SESSION NUMBER : 4

Session Outcome: 1 Specialised Operating System Functions

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance 1 Talk
APPLICABLE ---
--- NOT
20 Operating System Functions 2 Talk
APPLICABLE ---
--- NOT
25 Specialised Operating System Functions 2 Talk
APPLICABLE ---

SESSION NUMBER : 5

Session Outcome: 1 CPU Scheduling (FCFS, SJF)

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
50 CPU Scheduling (FCFS, SJF) 3 PPT Group Discussion

SESSION NUMBER : 6

about:blank 4/15
17/08/2025, 23:04 about:blank
Session Outcome: 1 CPU Scheduling - II ( ROUND ROBIN)

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
50 CPU Scheduling - II ( ROUND ROBIN) 4 PPT Seminars

SESSION NUMBER : 7

Session Outcome: 1 CPU Scheduling - II (Priority Scheduling,Multi Processor Scheduling)

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
50 CPU Scheduling - II (Priority Scheduling,Multi Processor Scheduling) 4 PPT Seminars

SESSION NUMBER : 8

Session Outcome: 1 CPU Scheduling - III (Lottery Scheduling,Multi level Feedback Scheduling)

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
50 CPU Scheduling - III (Lottery Scheduling,Multi level Feedback Scheduling) 4 PPT Group Discussion

SESSION NUMBER : 9

Session Outcome: 1 VIRTUAL MEMORY, MEMORY MANAGEMENT & SWAPPING

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
50 VIRTUAL MEMORY, MEMORY MANAGEMENT & SWAPPING 4 PPT Seminars

SESSION NUMBER : 10

Session Outcome: 1 Address Spaces, Memory API

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
50 Address Spaces, Memory API 3 Talk Group Discussion

SESSION NUMBER : 11

Session Outcome: 1 Address Translation Segmentation

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
50 Address Translation Segmentation 4 Chalk Seminars

SESSION NUMBER : 12

Session Outcome: 1 Page Replacement Algorithms

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
50 Page Replacement Algorithms 4 PPT Group Discussion

SESSION NUMBER : 13

Session Outcome: 1 Comparision between Segmentation and Paging

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
50 Comparision between Segmentation and Paging 5 Talk Case Study

SESSION NUMBER : 14

Session Outcome: 1 Free Space Management

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
50 Free Space Management 4 PPT Case Study

SESSION NUMBER : 15

Session Outcome: 1 Monitors implementation

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
50 Monitors implementation 3 PPT One minute paper

SESSION NUMBER : 16

Session Outcome: 1 Thrashing, Demand Paging

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods

about:blank 5/15
17/08/2025, 23:04 about:blank
50 Thrashing, Demand Paging 5 PPT Group Discussion

SESSION NUMBER : 17

Session Outcome: 1 Deadlock Avoidance

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
50 Deadlock Avoidance 2 PPT One minute paper

SESSION NUMBER : 18

Session Outcome: 1 Dead lock relatedproblems solving

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
50 Dead lock relatedproblems solving 3 PPT One minute paper

SESSION NUMBER : 19

Session Outcome: 1 VIRTUAL MEMORY, MEMORY MANAGEMENT& SWAPPING

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
50 VIRTUAL MEMORY, MEMORY MANAGEMENT& SWAPPING 2 PPT One minute paper

SESSION NUMBER : 20

Session Outcome: 1 Condition Variables

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
50 Condition Variables 4 Talk Group Discussion

SESSION NUMBER : 21

Session Outcome: 1 Semaphores and Monitors

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
50 Semaphores and Monitors 4 PPT Seminars

SESSION NUMBER : 22

Session Outcome: 1 Page Replacement Algorithms

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
50 Page Replacement Algorithms 3 PPT One minute paper

SESSION NUMBER : 23

Session Outcome: 1 Deadlocks: characterization, Prevention

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
50 Deadlocks: characterization, Prevention 4 PPT Group Discussion

SESSION NUMBER : 24

Session Outcome: 1 Deadlock Avoidance

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
50 Deadlock Avoidance 4 PPT Seminars

SESSION NUMBER : 25

Session Outcome: 1 Dead lock related problems solving

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance 1 Talk
APPLICABLE ---
--- NOT
20 Resource Allocation Graph 3 Talk
APPLICABLE ---
25 Banker's algorithms 3 Talk Quiz/Test Questions

SESSION NUMBER : 26

Session Outcome: 1 Dead lock related problems solving

about:blank 6/15
17/08/2025, 23:04 about:blank
Teaching- Learning Active Learning
Time(min) Topic BTL
Methods Methods
50 Dead lock related problems solving 4 PPT Seminars

SESSION NUMBER : 27

Session Outcome: 1 Disk Scheduling algorithms

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
50 Disk Scheduling algorithms 3 PPT Seminars

SESSION NUMBER : 28

Session Outcome: 1 Redundant Disk Arrays (RAID)

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
50 Redundant Disk Arrays (RAID) 3 PPT Group Discussion

SESSION NUMBER : 29

Session Outcome: 1 Files and Directories, File system Implementation

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
50 Files and Directories, File system Implementation 3 PPT Group Discussion

SESSION NUMBER : 30

Session Outcome: 1 Data Integrity protection

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
50 Data Integrity protection 5 PPT Group Discussion

SESSION NUMBER : 31

Session Outcome: 1 Inter-Process Communication

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
50 Inter-Process Communication 3 PPT Group Discussion

SESSION NUMBER : 32

Session Outcome: 1 Types of Allocating Devices, Dedicated Devices, Shared devices and Virtual devices

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
50 Types of Allocating Devices, Dedicated Devices, Shared devices and Virtual devices 3 Talk Seminars

SESSION NUMBER : 33

Session Outcome: 1 Real-time and Embedded Systems, Fault Tolerance

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
50 Real-time and Embedded Systems, Fault Tolerance 3 PPT Seminars

SESSION NUMBER : 34

Session Outcome: 1 Real-Time Systems: System characteristics

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance 1 Talk
APPLICABLE ---
25 Real-time and Embedded Systems 2 PPT One minute paper
--- NOT
20 Fault Tolerance 2 Talk
APPLICABLE ---

SESSION NUMBER : 35

Session Outcome: 1 Real-Time Systems: System characteristics

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
50 Real-Time Systems: System characteristics 2 Talk Seminars

SESSION NUMBER : 36

Session Outcome: 1 Implementing Real Time Operating Systems

about:blank 7/15
17/08/2025, 23:04 about:blank
Teaching- Learning Active Learning
Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance 1 Talk
APPLICABLE ---
--- NOT
35 Implementing Real Time Operating Systems 3 PPT
APPLICABLE ---
--- NOT
20 Summary 2 PPT
APPLICABLE ---

SESSION NUMBER : 37

Session Outcome: 1 Real-Time CPU scheduling Protection

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
50 Real-Time CPU scheduling Protection 4 PPT Seminars

SESSION NUMBER : 38

Session Outcome: 1 Real-Time CPU scheduling Security

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
50 Real-Time CPU scheduling Security 4 PPT Group Discussion

SESSION NUMBER : 39

Session Outcome: 1 Types of Real time Systems

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
50 Types of Real time Systems 5 PPT Case Study

Tutorial Course DELIVERY Plan:

List of Experiments supposed to finish in Open Lab Sessions:

Lab
session List of Experiments CO-Mapping
no

1 Problems on Process Scheduling algorithms CO1

2 CPU Scheduling - II ( ROUND ROBIN) CO1

3 VIRTUAL MEMORY, MEMORY MANAGEMENT & SWAPPING CO1

4 Page Replacement Algorithms CO2

5 Comparision between Segmentation and Paging CO2

6 Thrashing, Demand Paging- CO3

7 Deadlocks: characterization, Prevention CO3

8 Disk Scheduling algorithms CO4

9 Inter-Process Communication CO4

10 Real-time and Embedded Systems, Fault Tolerance CO4

11 Implementing Real TimeOperating Systems CO5

Tutorial Session wise Teaching – Learning Plan

SESSION NUMBER : 1

Session Outcome: 1 Problems on Process Scheduling algorithms

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
50 problems 4 Chalk Case Study

SESSION NUMBER : 2

Session Outcome: 1 CPU Scheduling - II ( ROUND ROBIN)

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods

about:blank 8/15
17/08/2025, 23:04 about:blank
--- NOT
50 CPU Scheduling - II ( ROUND ROBIN) 3 LTC
APPLICABLE ---

SESSION NUMBER : 3

Session Outcome: 1 VIRTUAL MEMORY, MEMORY MANAGEMENT & SWAPPING

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
50 VIRTUAL MEMORY, MEMORY MANAGEMENT & SWAPPING 3 LTC
APPLICABLE ---

SESSION NUMBER : 4

Session Outcome: 1 Page Replacement Algorithms

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
50 Page Replacement Algorithms 3 PPT
APPLICABLE ---

SESSION NUMBER : 5

Session Outcome: 1 Comparision between Segmentation and Paging

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
50 Comparision between Segmentation and Paging 3 LTC
APPLICABLE ---

SESSION NUMBER : 6

Session Outcome: 1 Thrashing, Demand Paging

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
50 Thrashing, Demand Paging 3 Talk
APPLICABLE ---

SESSION NUMBER : 7

Session Outcome: 1 Deadlocks: characterization, Prevention

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
50 Deadlocks: characterization, Prevention 4 LTC
APPLICABLE ---

SESSION NUMBER : 8

Session Outcome: 1 Disk Scheduling algorithms

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
50 Disk Scheduling algorithms 3 LTC
APPLICABLE ---

SESSION NUMBER : 9

Session Outcome: 1 Inter-Process Communication

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
50 Inter-Process Communication 3 LTC
APPLICABLE ---

SESSION NUMBER : 10

Session Outcome: 1 Real-time and Embedded Systems, Fault Tolerance

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
50 Real-time and Embedded Systems, Fault Tolerance 3 LTC
APPLICABLE ---

SESSION NUMBER : 11

Session Outcome: 1 Implementing Real TimeOperating Systems

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
50 Implementing Real TimeOperating Systems 3 PPT One minute paper

about:blank 9/15
17/08/2025, 23:04 about:blank
Practical Course DELIVERY Plan:
Tutorial
Session Topics CO-Mapping
no

Unix commands -- Man, Who, pwd etc Problem Description: Stanley wants to get started with terminal commands in
Linux. Help him out toper from the following set of statements: a. He wants to know the current directory that he is
1 CO6
working with, in the system. After identifying the current directory, he desires to create a folder called Marvel. b. Now, he
wants to list out all the Avengers of the “Marvel” universe. He adds the following set of Avengers to Avengers.txt:

UNIX FILE OPERATIONS AND SYSTEM CALLS 1. Write a C program that reads file.txt line by line and prints the
first 10-digit number in the given file (digits should be continuous), If not found then print the first 10 characters
2 CO6
excluding numbers. 2. Write a C program that saves 10 random numbers to a file, using your own “rand. h” header file
which contains your own random () function.

PROCESS API 1. write a program for implementing process management using the following system calls of the UNIX
3 operating system: fork, exec, getpid, exit, wait, close 2. To write a program for implementing Directory management CO6
using the following system calls of the UNIX operating system: opendir, readdir

Process Scheduling 1. Write a program for implementing process management using the following system calls of the
UNIX operating system: fork, exec, getpid, exit, wait, close. 2 T -series creates a text document (song.txt) that contains
the lyrics of a song. They want to know how many lines and words are present in the song.txt. They want to utilize Linux
4 CO6
directions and system calls to accomplish their objective. Help T -T-series to finish their task by utilizing a fork system
call. Print the number of lines in song.txt using the parent process and print the number of words in it using the child
process

Process Scheduling -II 1. Write a C program to implement the FCFS process scheduling algorithm. 2. Write a C program
5 to implement the SJF process scheduling algorithm. 3. Write a C program to implement the Round Robin process CO6
scheduling algorithm.

Virtualizing the CPU and Memory 1. write a C program to implement Dynamic Memory Allocation. 2. write a C program
to implement the Memory Management concept using the technique of Best fit algorithms. 3. write a C program to
6 CO6
implement the Memory Management concept using the technique worst fit algorithms. 4. write a C program to implement
the Memory Management concept using the technique of first fit algorithms.

Memory Management and Allocation Techniques 1. Write a C Program to implement the Memory Fixed Partitioning
7 Technique (MFT) algorithm. 2. Write a C program to implement the Memory Variable Partitioning Technique (MVT) CO6
algorithm.

PAGE REPLACEMENT TECHNIQUES - I 1. write a C program to implement the FIFO page replacement algorithm. 2.
8 CO6
write a C program to implement the LRU page replacement algorithm

PAGE REPLACEMENT ALGORITHMS - II REVISION 1. Write a C program to simulate Optimal page replacement
9 CO6
algorithms. 2. Write a C program to simulate LFU page replacement algorithms.

DEAD LOCKS 1. Write a C program to simulate the Bankers Algorithm for Deadlock Avoidance. 2. Write a C program
10 CO6
to simulate the Bankers Algorithm for Deadlock Prevention.

Concurrency 1. Write a C program to implement the Producer-Consumer problem. 2. Write a C program to implement the
11 CO6
Dining Philosopher problem

DISK SHEDULING ALGORITHMS 1. Write a C program to implement the FCFS Disk Scheduling Algorithm. 2. Write
12 a C program to implement the SCAN Disk scheduling algorithm. 3. Write a C program to implement the CSCAN Disk CO6
scheduling algorithm.

Inter Process Communication 1. Write a C program to implement IPC using shared memory. 2. Write a C program to
13 CO6
print numbers in a sequence using Thread Synchronization

File Organization 1. Write a C program to organize the file using single-level directory. 2. Write a C program to organize
14 CO6
the file using a level directory.

SHELL SCRIPTING 1. Write a Shell Script to accept a number and find Even or ODD 2. Write a Shell Script to find the
15 Factorial of a given number. 3. Write a Shell Script to find the Greatest of the given Three numbers. 4. Write a Shell CO6
Script to accept numbers and print sorted numbers.

Practical Session wise Teaching – Learning Plan

SESSION NUMBER : 1

Session Outcome: 1 Unix commands

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
10 Introduction and Attendance 1 Talk
APPLICABLE ---
--- NOT
20 Introduction to UNIX OS 3 PPT
APPLICABLE ---
--- NOT
30 Unix Commands 3 PPT
APPLICABLE ---

about:blank 10/15
17/08/2025, 23:04 about:blank
--- NOT
30 Shell Script 3 PPT
APPLICABLE ---
--- NOT
10 Summary & Conclusion 1 Talk
APPLICABLE ---

SESSION NUMBER : 2

Session Outcome: 1 UNIX FILE OPERATIONS AND SYSTEM CALLS

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
10 Introduction and Attendance 1 Talk
APPLICABLE ---
--- NOT
20 Introduction to UNIX OS 3 PPT
APPLICABLE ---
--- NOT
40 Unix Commands 3 PPT
APPLICABLE ---
--- NOT
20 Shell Script 3 PPT
APPLICABLE ---
--- NOT
10 Summary & Conclusion 2 Talk
APPLICABLE ---

SESSION NUMBER : 3

Session Outcome: 1 PROCESS API

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
10 Attendance 2 Talk
APPLICABLE ---
PROCESS API 1. write a program for implementing process management using the following
system calls of the UNIX operating system: fork, exec, getpid, exit, wait, close 2. To write a --- NOT
50 3 PPT
program for implementing Directory management using the following system calls of the APPLICABLE ---
UNIX operating system: opendir, readdir
--- NOT
40 Summary & Conclusion 2 PPT
APPLICABLE ---

SESSION NUMBER : 4

Session Outcome: 1 Process Scheduling

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
10 Attendance 2 Talk
APPLICABLE ---
Process Scheduling 1. Write a program for implementing process management using the --- NOT
50 3 PPT
following system calls of the UNIX operating system: fork, exec, getpid, exit, wait, close. APPLICABLE ---
--- NOT
40 Summary & Conclusion 2 Talk
APPLICABLE ---

SESSION NUMBER : 5

Session Outcome: 1 Process Scheduling -II

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
10 Attendance 2 Talk
APPLICABLE ---
--- NOT
50 Attendance 3 PPT
APPLICABLE ---
--- NOT
40 Summary & Conclusion 2 Talk
APPLICABLE ---

SESSION NUMBER : 6

Session Outcome: 1 Virtualizing the CPU and Memory

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
10 Attendance 2 Talk
APPLICABLE ---
Virtualizing the CPU and Memory 1. write a C program to implement Dynamic Memory --- NOT
50 3 PPT
Allocation. APPLICABLE ---
--- NOT
40 Summary & Conclusion 2 Talk
APPLICABLE ---

SESSION NUMBER : 7

Session Outcome: 1 Memory Management and Allocation Techniques

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
about:blank 11/15
17/08/2025, 23:04 about:blank
--- NOT
10 Attendance 2 Talk
APPLICABLE ---
Memory Management and Allocation Techniques 1. Write a C Program to implement the
--- NOT
50 Memory Fixed Partitioning Technique (MFT) algorithm. 2. Write a C program to implement 3 PPT
APPLICABLE ---
the Memory Variable Partitioning Technique (MVT) algorithm.
--- NOT
40 Viva, Summary & Conclusion 2 Talk
APPLICABLE ---

SESSION NUMBER : 8

Session Outcome: 1 PAGE REPLACEMENT TECHNIQUES - I 1. write a C program to implement the FIFO page replacement algorithm. 2. write a C program to
implement the LRU page replacement algorithm

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
10 Attendance 2 Talk
APPLICABLE ---
--- NOT
50 write a C program to implement the FIFO page replacement algorithm. 3 PPT
APPLICABLE ---
--- NOT
40 Viva, Summary & Conclusion 2 Talk
APPLICABLE ---

SESSION NUMBER : 9

Session Outcome: 1 PAGE REPLACEMENT ALGORITHMS - II REVISION 1. Write a C program to simulate Optimal page replacement algorithms. 2. Write a C
program to simulate LFU page replacement algorithms.

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
10 Attendance 2 Talk
APPLICABLE ---
--- NOT
50 1. Write a C program to simulate Optimal page replacement algorithms 3 PPT
APPLICABLE ---
--- NOT
40 Viva, Summary & Conclusion 2 Talk
APPLICABLE ---

SESSION NUMBER : 10

Session Outcome: 1 DEAD LOCKS 1. Write a C program to simulate the Bankers Algorithm for Deadlock Avoidance. 2. Write a C program to simulate the Bankers
Algorithm for Deadlock Prevention.

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
10 Attendance 2 Talk
APPLICABLE ---
--- NOT
50 1. Write a C program to simulate the Bankers Algorithm for Deadlock Avoidance. 3 PPT
APPLICABLE ---
--- NOT
40 1. Write a C program to simulate the Bankers Algorithm for Deadlock Avoidance. 2 Talk
APPLICABLE ---

SESSION NUMBER : 11

Session Outcome: 1 Concurrency 1. Write a C program to implement the Producer-Consumer problem. 2. Write a C program to implement the Dining Philosopher
problem

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
10 Attendance 2 Talk
APPLICABLE ---
--- NOT
50 Write a C program to implement the Producer-Consumer problem. 3 Talk
APPLICABLE ---
--- NOT
40 Viva, Summary & Conclusion 2 Talk
APPLICABLE ---

SESSION NUMBER : 12

Session Outcome: 1 DISK SHEDULING ALGORITHMS

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
10 Attendance 2 Talk
APPLICABLE ---
Write a C program to implement the FCFS Disk Scheduling Algorithm. 2. Write a C program --- NOT
50 3 PPT
to implement the SCAN Disk scheduling algorithm APPLICABLE ---
--- NOT
40 Viva, Summary & Conclusion 2 Talk
APPLICABLE ---

SESSION NUMBER : 13

Session Outcome: 1 Inter Process Communication 1. Write a C program to implement IPC using shared memory. 2. Write a C program to print numbers in a
sequence using Thread Synchronization

about:blank 12/15
17/08/2025, 23:04 about:blank
Teaching- Learning Active Learning
Time(min) Topic BTL
Methods Methods
--- NOT
10 Attendance 2 Talk
APPLICABLE ---
--- NOT
50 1. Write a C program to implement IPC using shared memory. 3 PPT
APPLICABLE ---
--- NOT
40 Viva, Summary & Conclusion 2 Talk
APPLICABLE ---

SESSION NUMBER : 14

Session Outcome: 1 File Organization 1. Write a C program to organize the file using single-level directory. 2. Write a C program to organize the file using a level
directory.

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
10 Attendance 2 Talk
APPLICABLE ---
--- NOT
50 1. Write a C program to organize the file using single-level directory. 3 PPT
APPLICABLE ---
--- NOT
40 Viva, Summary & Conclusion 2 Talk
APPLICABLE ---

SESSION NUMBER : 15

Session Outcome: 1 SHELL SCRIPTING

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
10 Attendance 2 Talk
APPLICABLE ---
1. Write a Shell Script to accept a number and find Even or ODD 2. Write a Shell Script to find --- NOT
50 3 PPT
the Factorial of a given number APPLICABLE ---
--- NOT
40 Viva, Summary & Conclusion 2 Talk
APPLICABLE ---

Skilling Course DELIVERY Plan: NO Delivery Plan Exists

Skilling Session wise Teaching – Learning Plan

No Session Plans Exists

WEEKLY HOMEWORK ASSIGNMENTS/ PROBLEM SETS/OPEN ENDEDED PROBLEM-SOLVING EXERCISES etc:

Assignment
Week Assignment Type Topic Details co
No

COURSE TIME TABLE:

Hour 1 2 3 4 5 6 7 8 9
Day Component
Theory --- --- --- H-S4 H-S5 H-S5 -- -- ---
Tutorial --- --- --- H-S3 -- -- -- -- ---
Mon
Lab --- --- --- -- -- -- H-S1 H-S1 ---
Skilling --- --- --- -- -- -- -- -- ---
Theory -- -- H-S4 -- -- -- H-S3 H-S3 ---
Tutorial -- -- -- -- -- -- -- -- ---
Tue
Lab H-S4 H-S4 H-S2 H-S2 H-S5 H-S5 H-S6 H-S6 ---
Skilling -- -- -- -- -- -- -- -- ---
Theory -- H-S6 --- --- H-S2 H-S2 H-S3 H-S3 ---
Tutorial H-S6 -- --- --- -- -- -- -- ---
Wed
Lab -- -- --- --- -- -- -- -- ---
Skilling -- -- --- --- -- -- -- -- ---
Theory H-S5 H-S5 H-S1 H-S1 --- --- --- --- ---
Tutorial H-S4 -- -- -- --- --- --- --- ---
Thu
Lab -- -- -- -- --- --- --- --- ---
Skilling -- -- -- -- --- --- --- --- ---
Theory H-S6 --- H-S2 H-S2 --- --- -- --- ---
Tutorial -- --- -- H-S5 --- --- H-S2 --- ---
Fri
Lab -- --- -- -- --- --- -- --- ---
Skilling -- --- -- -- --- --- -- --- ---
Sat Theory H-S1,H-S4,H-S6 H-S1,H-S4,H-S6 -- -- --- --- -- --- ---
Tutorial -- -- -- -- --- --- H-S1 --- ---
Lab -- -- H-S3 H-S3 --- --- -- --- ---

about:blank 13/15
17/08/2025, 23:04 about:blank
Skilling -- -- -- -- --- --- -- --- ---
Theory -- -- -- -- -- -- -- -- --
Tutorial -- -- -- -- -- -- -- -- --
Sun
Lab -- -- -- -- -- -- -- -- --
Skilling -- -- -- -- -- -- -- -- --

REMEDIAL CLASSES:

Supplement course handout, which may perhaps include special lectures and discussions that would be planned, and schedule notified according

SELF-LEARNING:

Assignments to promote self-learning, survey of contents from multiple sources.

S.no Topics CO ALM References/MOOCS

DELIVERY DETAILS OF CONTENT BEYOND SYLLABUS:

Content beyond syllabus covered (if any) should be delivered to all students that would be planned, and schedule notified accordingly.
S.no Advanced Topics, Additional Reading, Research papers and any CO ALM References/MOOCS

EVALUATION PLAN:

Evaluation Type Evaluation Component Weightage/Marks Assessment Dates Duration (Hours) CO1 CO2 CO3 CO4 CO5 CO6
End Semester Weightage 16 16
Lab End Semester Exam 180
Summative Max Marks 50 50
Evaluation Weightage 24 4.8 4.8 4.8 4.8 4.8
Total= 40 % End Semester Exam 180
Max Marks 100 20 20 20 20 20
Weightage 8 8
Continuous Evaluation - Lab Exercise 120
Max Marks 50 50
In Semester Weightage 6 1.2 1.2 1.2 1.2 1.2
Home Assignment and Textbook 120
Formative Max Marks 50 10 10 10 10 10
Evaluation Weightage 8 1.6 1.6 1.6 1.6 1.6
Total= 28 % Tutorial 120
Max Marks 50 10 10 10 10 10
Weightage 6 1.2 1.2 1.2 1.2 1.2
ALM 120
Max Marks 50 10 10 10 10 10
Weightage 6 6
Lab In Semester Exam 120
In Semester Max Marks 50 50
Summative Weightage 13 6.5 6.5
Semester in Exam-II 120
Evaluation Max Marks 50 25 25
Total= 32 %
Weightage 13 6.5 6.5
Semester in Exam-I 120
Max Marks 50 25 25

ATTENDANCE POLICY:

Every student is expected to be responsible for regularity of his/her attendance in class rooms and laboratories, to appear in scheduled tests and examinations and
fulfill all other tasks assigned to him/her in every course
In every course, student has to maintain a minimum of 85% attendance to be eligible for appearing in Semester end examination of the course, for cases of medical
issues and other unavoidable circumstances the students will be condoned if their attendance is between 75% to 85% in every course, subjected to submission of
medical certificates, medical case file and other needful documental proof to the concerned departments

DETENTION POLICY :

In any course, a student has to maintain a minimum of 85% attendance and In-Semester Examinations to be eligible for appearing to the Semester End Examination,
failing to fulfill these conditions will deem such student to have been detained in that course.

PLAGIARISM POLICY :

Supplement course handout, which may perhaps include special lectures and discussions

COURSE TEAM MEMBERS, CHAMBER CONSULTATION HOURS AND CHAMBER VENUE DETAILS:

Supplement course handout, which may perhaps include special lectures and discussions
Delivery Component Sections of Chamber Chamber Consultation Chamber Consultation Signature of
Name of Faculty
of Faculty Faculty Consultation Day (s) Timings for each day Room No: Course faculty:
Saidireddy
L 3-MA - - - -
Malgireddy
Saidireddy
P 4-MA,3-MA - - - -
Malgireddy
Saidireddy
T 4-MA,3-MA - - - -
Malgireddy
Sumalakshmi H L 2-MA,1-MA - - - -

about:blank 14/15
17/08/2025, 23:04 about:blank
Sumalakshmi H P 1-MA,2-MA - - - -
Sumalakshmi H T 1-MA,2-MA - - - -
Sasidhar Kothuru L 6-MA,5-MA - - - -
Sasidhar Kothuru P 5-MA,6-MA - - - -
Sasidhar Kothuru T 5-MA,6-MA - - - -
Narasimha K L L 4-MA - - - -

GENERAL INSTRUCTIONS

Students should come prepared for classes and carry the text book(s) or material(s) as prescribed by the Course Faculty to the class.

NOTICES

Most of the notices are available on the LMS platform.

All notices will be communicated through the institution email.

All notices concerning the course will be displayed on the respective Notice Boards.

Signature of COURSE COORDINATOR

(Sumalakshmi C H)

Signature of Department Prof. Incharge Academics & Vetting Team Member

Department Of CSE-1

HEAD OF DEPARTMENT:

Approval from: DEAN-ACADEMICS

(Sign with Office Seal) [object HTMLDivElement]

about:blank 15/15