Scribd
Upload
30 views

OS Lab - Lesson Plan

Uploaded by

papu varsha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
30 views

OS Lab - Lesson Plan

Uploaded by

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

ANAND INSTITUTE OF HIGHER TECHNOLOGY

Kazhipattur.
DEPARTMENT OF INFORMATION TECHNOLOGY

Format No: Issue No: Rev:

COURSE PLAN
SUBJECT CODE : CS8461 SUBJECT NAME: Operating System Lab
ACADEMIC YEAR : 2021-2022 SEMESTER : 04

AIM:
To implement the Unix operating system concepts such as I/O system calls,
process scheduling, memory management and file allocation technique.
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

OUTCOME:

 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

NAME OF THE FACULTY: Ms.R.Ranjani, Assistant Professor/IT

SYLLABUS:
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: 45
Hardware and Software required for a batch of 30 students.

Hardware:
30 Personal Computers

Software:
Linux:
 Ubuntu / OpenSUSE / Fedora / Red Hat / Debian / Mint OS
 Linux could be loaded in individual PCs.

LESSON PLAN:

Batch - I

S.No Period Topic to be Covered Proposed Actual Cumulative


Date Date Periods
1 3-5 Basics of UNIX commands 16.03.2022 3
2. 3-5 System calls of Unix operating system 22.03.2022 6
3. 3-5 To simulate Unix commands 30.03.2022 9
4. 3-5 Shell Programming 05.04.2022 12
5. 3-5 CPU Scheduling Algorithms 11.04.2022 15
6. 3-5 Implementation of Semaphores 19.04.2022 18
7. 3-5 Implementation of Shared memory and 25.04.2022 21
IPC
8. 3-5 Bankers Algorithm for Deadlock 24
30.04.2022
Avoidance
9. 3-5 Implementation of Memory Allocation 7.05.2022 27
Methods for fixed partition
10. 3-5 Implementation of Paging Technique of 07.05.2022 27
Memory Management
11 3-5 Implementation of the following Page 16.05.22 30
Replacement Algorithms
12 3-5 Implementation of the following File 28.05.22 33
Allocation Strategies

Batch - II

S.No Period Topic to be Covered Proposed Actual Cumulative


Date Date Periods
1 3-5 Basics of UNIX commands 18.03.2022 3
2. 3-5 System calls of Unix operating system 23.03.2022 6
3. 3-5 To simulate Unix commands 07.04.2022 9
4. 3-5 Shell Programming 13.04.2022 12
5. 3-5 CPU Scheduling Algorithms 21.04.2022 15
6. 3-5 Implementation of Semaphores 26.04.2022 18
7. 3-5 Implementation of Shared memory and 21
4.05.2022
IPC
8. 3-5 Bankers Algorithm for Deadlock 24
16.05.2022
Avoidance
9. 3-5 Implementation of Memory Allocation 27
18.05.2022
Methods for fixed partition
10. 3-5 Implementation of Paging Technique of 27
18.05.2022
Memory Management
11 3-5 Implementation of the following Page 30
23.05.2022
Replacement Algorithms
12 3-5 Implementation of the following File 33
25.05.2022
Allocation Strategies

Content beyond Syllabus

S.No Name of the Experiments Proposed Date Actual Date


1 Deadlock -Banker’s algorithm
2 Disk scheduling

Result Analysis
Number of Students Signature
Total No of
S.No Test
Students Faculty HOD
Attended Passed Failed Pass %
1 model

Faculty in charge HOD

You might also like