Questions

OPERATING SYSTEMS LAB - PRACTICE QUESTIONS

1. Write a program to create a process in linux.

2. Write programs using the following system calls of Linux operating system:

fork, exec, getpid, exit, wait, close, stat, opendir, readdir

3. Write programs using the I/O system calls of Linux operating system (open, read, write)

4. Given the list of processes, their CPU burst times and arrival times, display/print the

Gantt chart for FCFS and SJF. For each of the scheduling policies, compute and print the

average waiting time and average turnaround time

5. Write a C program to simulate following non-preemptive CPU scheduling algorithms to

find turnaround time and waiting time.

a)FCFS b) SJF c) Round Robin (pre-emptive) d) Priority

6. Write a C program to simulate following contiguous memory allocation techniques

a) Worst-fit b) Best-fit c) First-fit

7. Write a C program to simulate paging technique of memory management.

8. Write a C program to simulate Bankers algorithm for the purpose of deadlock avoidance.

9. Write a C program to simulate disk scheduling algorithms a) FCFS b) SCAN c) C-SCAN

10. Write a C program to simulate page replacement algorithms a) FIFO b) LRU c) LFU

11. Write a C program to simulate producer-consumer problem using semaphores.

12. Write a program for file manipulation for display a file and directory in memory.

13. Write a program to simulate algorithm for deadlock prevention.

14. Write a C program to simulate following file allocation strategies.

a)Sequential b) Indexed c) Linked

Comments

  1. Anandan24 January 2025 at 21:53

    https://notebooklm.google.com/notebook/2579f237-b17b-4bb3-a3ec-5986dd43f5c9/audio

    ReplyDelete

Post a Comment

Popular posts from this blog

CSL 204 OPERATING SYSTEM LAB KTU IV SEM CSE

About Me Syllabus Scheme Program List Linux Basics 1. Linux History and GNU 2. Linux Basic Features and Architecture 3. How to Install Linux 4. Install Linux Inside Windows using WSL 5. Free software 6. Linux Chronology 7 .Package Management 8 .Compile and install from source 9 .Important Directories 10. File Permissions 11. Special Permissions 12 .Shell 13. Bash shell in windows 10 14 .Basic Linux command for beginners 15. Input Output Redirection  16. Directory Commands 17. File Commands 18 .Communication Commands 19. Information Commands  20 .IO Commands   21 .Process Management Commands 22. Account Administration Commands 23. Pipes and Filters  24. Top 100 commands to learn.         Familiarization of Basic  Linux Commands- ls, mkdir, rmdir , rm, cat, cp, mv , chmod          User and Group management- useradd, userdel,groupadd,groupdel, passwd           Familiarization of basic  ...
Read more

FCFS and SJF

Image
CPU Scheduling in Operating Systems: In the context of operating systems, CPU scheduling involves determining which process (or task) should be executed next by the central processing unit (CPU). The goal is to maximize CPU utilization, minimize waiting time, and ensure fair allocation of resources. Various scheduling algorithms are used to achieve these objectives. First-Come-First-Serve (FCFS) Scheduling: Definition: FCFS is the simplest CPU scheduling algorithm. It is non-preemptive, meaning once a process starts executing, it cannot be interrupted until completion. Processes are placed in a queue based on their arrival time. The process that arrives first gets executed first. Execution Order : Processes are executed in the order they arrive. The process at the front of the queue is selected for execution. Advantages: Easy to implement. Minimal overhead. Disadvantages: Often results in long waiting times. Leads to the convoy effect (where a long process holds up other processes). Sh...
Read more

Banker's Algorithm- Deadlock Detection

The Banker's Algorithm is a deadlock avoidance algorithm used in operating systems to prevent deadlocks in a system with limited resources. It was developed by Edsger Dijkstra in 1965. The algorithm ensures that the system will allocate resources in such a way that it will avoid deadlock, even if resources are requested in an arbitrary order. Let's break down the Banker's Algorithm into steps: 1. System Initialization: At the beginning, the system must know the total number of resources of each type and the maximum demand of each process. It also needs to keep track of the currently available resources of each type. 2. Allocation: When a process requests resources, the system must check if granting those resources would put it in an unsafe state (i.e., could potentially lead to a deadlock). If the request can be granted without causing an unsafe state, the resources are allocated. Otherwise, the process must wait until the requested resources can be safely allocated. Safety...
Read more