[go: up one dir, main page]

0% found this document useful (0 votes)
3K views2 pages

CS3461 Oslab

This document outlines the objectives, experiments, and outcomes of an Operating Systems Laboratory course. The course objectives include installing operating systems, learning Unix commands and shell programming, and implementing CPU scheduling, deadlock avoidance/detection, paging, and memory allocation algorithms. The 15 listed experiments involve tasks like installing operating systems, process management, inter-process communication, memory allocation methods, and file organization techniques. Upon completing the course, students will be able to define and implement Unix commands, compare CPU scheduling and memory allocation methods, define file organization and allocation strategies, and implement disk scheduling algorithms.

Uploaded by

Anurekha Prasad
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
3K views2 pages

CS3461 Oslab

This document outlines the objectives, experiments, and outcomes of an Operating Systems Laboratory course. The course objectives include installing operating systems, learning Unix commands and shell programming, and implementing CPU scheduling, deadlock avoidance/detection, paging, and memory allocation algorithms. The 15 listed experiments involve tasks like installing operating systems, process management, inter-process communication, memory allocation methods, and file organization techniques. Upon completing the course, students will be able to define and implement Unix commands, compare CPU scheduling and memory allocation methods, define file organization and allocation strategies, and implement disk scheduling algorithms.

Uploaded by

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

CS3461 OPERATING SYSTEMS LABORATORY L T P C

0 0 3 1.5
COURSE OBJECTIVES:
 To install windows operating systems.
 To understand the basi cs o f Unix command and shell programming.
 To implement various CPU scheduling al gorithms.
 To implement Deadlock Avoidance and Deadlock Detection Al gorithms
 To implement Page Replacement Al gorithms
 To implement various memor y allocation methods.
 To be familiar with Fi le Or gani zation and Fi le Allocation Strategies.

LIST OF EXPERIMENTS:
1. Installation of windows operating system
2. Illustrate UNIX commands and Shell Programming
3. Process Management using System Calls : Fork, Exit, Getpid, Wait, Close
4. Write C programs to i mplement the various CPU Scheduling Al gor ithms
5. Illustrate the inter process communication st rategy
6. Implement mutual exclusion by Semaphore
7. Write C programs to avoid Deadlock using Banker 's Al gorithm
8. Write a C program to Im plement Deadlock Detection Al gorithm
9. Write C program to i mplement Threading
10. Implement the paging Technique using C program
11. Write C programs to i mplement the following Memor y Allocation Methods
a. First Fit b. Worst Fit c. Best Fit
12. Write C programs to i mplement the various Page Replacement Al gorithms
13. Write C programs to Implement the various File Or gani zation Techniques
14. Implement the followi ng File Allocation Strategies using C programs
a. Sequential b. Indexed c. Linked
15. Write C programs f or the i mplementation of various disk scheduling
algorithms
16. Install any guest operating system li ke Linux using VMware.
TOTAL:45 PERIO DS
COURSE OUTCOMES:
At the end of this cour se, the students will be able to:
CO1 : Define and i mp l ement UNIX Commands.
CO2 : Compare the performance of various CPU Scheduling Al gor ithms.
CO3 : Compare and contrast various Memor y Allocation Methods.
CO4 : Define File Or ganization and File Allocation Strategies.
CO5 : Implement vari ous Disk Scheduling Al gorithms.

You might also like