Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
2 views

Operating System Lab Syllabus[1]

The Operating Systems Lab course (23CS2114) aims to teach students the principles and components of operating systems, along with skills for program development and debugging. Students will learn about file systems, memory management, deadlock algorithms, and scheduling through practical programming assignments. The course aligns with the National Education Policy and includes a variety of textbooks and reference materials.

Uploaded by

vanadita sharma
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

Operating System Lab Syllabus[1]

The Operating Systems Lab course (23CS2114) aims to teach students the principles and components of operating systems, along with skills for program development and debugging. Students will learn about file systems, memory management, deadlock algorithms, and scheduling through practical programming assignments. The course aligns with the National Education Policy and includes a variety of textbooks and reference materials.

Uploaded by

vanadita sharma
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

OPERATING SYSTEMS LAB

Course Code: 23CS2114 Continuous Evaluation: 60 Marks


Pre-Requisite : NIL End Semester Examination: 40 Marks
LT P:0 02
Credits: 1

COURSE OBJECTIVES
1. To understand the operating system principles and its implementations.
2. To understand the main components of an OS & their functions.
3. To provide necessary skills for developing and debugging programs in order to optimize
performance of OS.
4. To study the process management and scheduling.

COURSE LEARNING OUTCOMES (CLO)


The syllabus has been prepared in accordance with National Education Policy (NEP). After completion of
course, students would be able to:
1. Demonstrate the various operations of file system.
2. Understand and Implement Memory management schemes, Thread and synchronization
3. Implement Deadlock algorithms and page replacement algorithms.
4. Apply the process synchronous concept using message queue, shared memory, semaphore for given
situation.
5. Implement Scheduling algorithms.

COURSE LEARNING OUTCOMES (CLO)-COURSE OBJECTIVES (CO) MAPPING

CLO1 CLO2 CLO3 CLO4 CLO5


CO1 
CO2 
CO3  
CO4 

LIST OF PROGRAMS
1. Write a program to implement CPU scheduling for first come first serve.

2. Write a program to implement CPU scheduling for shortest job first.

3. Write a program to perform priority scheduling.

4. Write a program to implement CPU scheduling for Round Robin.

5. Write a program for page replacement policy using a LRU

6. Write a program for page replacement policy using FIFO.

7. Write a program for page replacement policy using Optimal.


98
8. Write a program to implement first fit, best fit and worst fit algorithm for Memory management.

9. Write a program to implement reader/writer problem using semaphore.

10. Write a program to implement Banker’s algorithm for deadlock avoidance.

TEXT BOOKS
1. Abraham Silberschatz Peter B. Galvin and Greg Gagne, Operating System Concepts, Wiley 8th
Edition, 2008.

2. Garry. J. Nutt, Operating Systems: A Modern Perspective, Addison-Wesley

3. Andrew S. Tanenbaum and Herbert Bros, Modern Operating Systems (4th Edition), Pearson

REFERENCE BOOKS
1. William Stallings, “Operating Systems – internals and design principles”, Prentice Hall India, 5 th
Edition, 2005.

99

You might also like