[go: up one dir, main page]
Scribd
Upload
21 views2 pages

OS LAB Syllabus

The document outlines the objectives and experiments for the CS8461 Operating Systems Laboratory course, focusing on Unix commands, CPU scheduling algorithms, process creation, inter-process communication, deadlock handling, and memory management techniques. Students will engage in practical experiments to implement various operating system concepts and algorithms. By the end of the course, students will be able to analyze and compare different algorithms and implement key operating system functionalities.

Uploaded by

poo2290
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
21 views2 pages

OS LAB Syllabus

The document outlines the objectives and experiments for the CS8461 Operating Systems Laboratory course, focusing on Unix commands, CPU scheduling algorithms, process creation, inter-process communication, deadlock handling, and memory management techniques. Students will engage in practical experiments to implement various operating system concepts and algorithms. By the end of the course, students will be able to analyze and compare different algorithms and implement key operating system functionalities.

Uploaded by

poo2290
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

CS8461 OPERATING SYSTEMS LABORATORY LTPC 0042

OBJECTIVES

 To learn Unix commands and shell programming

 To implement various CPU Scheduling Algorithms

 To implement Process Creation and Inter Process Communication.

 To implement Deadlock Avoidance and Deadlock Detection Algorithms

 To implement Page Replacement Algorithms

 To implement File Organization and File Allocation Strategies

LIST OF EXPERIMENTS

1. Basics of UNIX commands

2. Write programs using the following system calls of UNIX operating system fork, exec, getpid, exit, wait, close,

stat, opendir, readdir

3. Write C programs to simulate UNIX commands like cp, ls, grep, etc.

4. Shell Programming

5. Write C programs to implement the various CPU Scheduling Algorithms

6. Implementation of Semaphores

7. Implementation of Shared memory and IPC

8. Bankers Algorithm for Deadlock Avoidance

9. Implementation of Deadlock Detection Algorithm

10. Write C program to implement Threading & Synchronization Applications

11. Implementation of the following Memory Allocation Methods for fixed partition

a) First Fit b) Worst Fit c) Best Fit

12. Implementation of Paging Technique of Memory Management

13. Implementation of the following Page Replacement Algorithms a) FIFO b) LRU c) LFU

14. Implementation of the various File Organization Techniques

15. Implementation of the following File Allocation Strategies a) Sequential b) Indexed c) Linked

TOTAL: 60 PERIODS
OUTCOMES: At the end of the course, the student should be able to

 Compare the performance of various CPU Scheduling Algorithms

 Implement Deadlock avoidance and Detection Algorithms

 Implement Semaphores

 Create processes and implement IPC

 Analyze the performance of the various Page Replacement Algorithms

 Implement File Organization and File Allocation Strategies

You might also like