0% found this document useful (0 votes)
19 views1 page

Index - 1

The document lists various experiments related to programming and operating systems, primarily using the C programming language. It includes tasks such as implementing basic commands in Linux, simulating CPU scheduling algorithms, and solving problems like the Dining Philosopher and Producer-Consumer using semaphores. Additionally, it covers memory allocation algorithms, file organization techniques, and disk scheduling algorithms.
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)
19 views1 page

Index - 1

The document lists various experiments related to programming and operating systems, primarily using the C programming language. It includes tasks such as implementing basic commands in Linux, simulating CPU scheduling algorithms, and solving problems like the Dining Philosopher and Producer-Consumer using semaphores. Additionally, it covers memory allocation algorithms, file organization techniques, and disk scheduling algorithms.
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

S.

Experiment Date Signature


No. (Performed) (with date)
1. Basic Commands in Linux Operating System.

2. Basic shell program implementation.

3. Write a C program using the following system calls (fork,


exec).

4. Write a C program using the following system calls


(get_pid, exit).

5. Write a C program to simulate CPU scheduling algorithms:


FCFS, SJF, and Round Robin.

6. Implement the Dining Philosopher problem using


semaphores.

7. Implement the Producer – Consumer problem using


semaphores.

8. Write a C programs to simulate Intra & Inter – Process


Communication (IPC) techniques.

9. Write a C program to simulate Bankers Algorithm for


Deadlock Detection.

10. Write a C program to simulate Bankers Algorithm for


Deadlock Avoidance.

11. Write a C programs to simulate Page Replacement


Algorithms a) FIFO b) LRU

12. Implementation of memory allocation algorithms: a)First Fit


b) Best Fit c)Worst Fit).

13. Write a C program using the I/O system calls (open, read,
write, etc).

14. Simulate all File Organization Techniques a) Single level


directory b) Two level .

15. Simulate all file allocation strategies a) Sequential b)


Indexed c) Linked.

16. Write a C programs to simulate implementation of FCFS


Disk Scheduling Algorithms.

You might also like