Knowee
Questions
Features
Study Tools

What is the critical section problem? Mention three conditions that must be satisfied by itssolution.2) Explain different types of thread in Operating System3) Explain external fragmentation with example4) Give different file access methods5) Explain the role of PCB.6) Write a short note on file directory structure.7) What are system calls? Explain different types of system calls with example.8) Explain Deadlock and how to prevent it?9) Consider the following set of processes.1. Draw Gantt chart for FCFS, SJF(Preemptive) and Round Robin (Quantum=2).2. Calculate average waiting timeProcess Arrival Time Burst Timep1 0 10p2 1 5p3 2 210) Consider the following page reference string: 4,3,2,1,4,3,5,4,3,2,1,5. Assume [10] framesize=3.How many page faults would occur for FIFO, Optimal and LRU algorithm?11) Explain the concept of segmentation with an example.12) Write a short note on file directory structure.13) Suppose that a disk drive has 200 Cylinders, numbered 0 to 199. Queue = 98, 183, [10]41, 122, 14, 124, 65, 67. The drive is currently serving a request at cylinder 54 andthe previous request was at cylinder 20.Find total number of head movements needed to satisfythe requests for the FCFS, SSTF and SCAN disk scheduling algorithm?

Question

What is the critical section problem? Mention three conditions that must be satisfied by itssolution.2) Explain different types of thread in Operating System3) Explain external fragmentation with example4) Give different file access methods5) Explain the role of PCB.6) Write a short note on file directory structure.7) What are system calls? Explain different types of system calls with example.8) Explain Deadlock and how to prevent it?9) Consider the following set of processes.1. Draw Gantt chart for FCFS, SJF(Preemptive) and Round Robin (Quantum=2).2. Calculate average waiting timeProcess Arrival Time Burst Timep1 0 10p2 1 5p3 2 210) Consider the following page reference string: 4,3,2,1,4,3,5,4,3,2,1,5. Assume [10] framesize=3.How many page faults would occur for FIFO, Optimal and LRU algorithm?11) Explain the concept of segmentation with an example.12) Write a short note on file directory structure.13) Suppose that a disk drive has 200 Cylinders, numbered 0 to 199. Queue = 98, 183, [10]41, 122, 14, 124, 65, 67. The drive is currently serving a request at cylinder 54 andthe previous request was at cylinder 20.Find total number of head movements needed to satisfythe requests for the FCFS, SSTF and SCAN disk scheduling algorithm?

...expand
🧐 Not the exact question you are looking for?Go ask a question

Solution

  1. The critical section problem is a term used in computing to describe a situation where multiple processes need access to shared resources. The problem arises when these processes are executed concurrently and the outcome of the execution depends on the sequence or timing of the processes. The solution to this problem must satisfy three conditions: mutual exclusion, progress, and bounded waiting.

  2. In an Operating System, there are two types of threads: User threads and Kernel threads. User threads are managed by users while Kernel threads are managed by the OS itself.

  3. External fragmentation occurs when free memory is divided into small blocks and is scattered throughout the system. For example, if a system has 10MB of free memory divided into 2MB blocks, a program requiring 5MB of continuous memory would not be able to run, despite there being enough total free memory.

  4. File access methods include: Sequential Access, Direct/Random Access, and Indexed Access.

  5. The Process Control Block (PCB) is a data structure used by the Operating System to manage information about a process. It contains information such as process state, program counter, CPU registers, and memory management information.

  6. File directory structure is the way files are organized on a storage device. It can be hierarchical (tree-like structure), flat (all files at the same level), or networked (complex structure with multiple paths to a file).

  7. System calls are interfaces between the process and the operating system. They can be categorized into Process Control, File Management, Device Management, Information Maintenance, and Communication.

  8. Deadlock is a situation where a set of processes are blocked because each process is holding a resource and waiting for another resource acquired by some other process. Deadlock can be prevented by ensuring at least one of the four Coffman conditions (mutual exclusion, hold and wait, no preemption, circular wait) does not hold.

  9. This question requires a visual representation for the Gantt chart and calculations for the average waiting time which cannot be provided in this text-based response.

  10. This question requires calculations for the number of page faults which cannot be provided in this text-based response.

  11. Segmentation is a memory management technique where each job is divided into several segments of different sizes, one for each module that contains pieces that perform related functions. An example could be a program divided into segments like the main program, function, variables, etc.

  12. File directory structure is the way files are organized on a storage device. It can be hierarchical (tree-like structure), flat (all files at the same level), or networked (complex structure with multiple paths to a file).

  13. This question requires calculations for the total number of head movements which cannot be provided in this text-based response.

This problem has been solved

Similar Questions

What is the Process synchronization? State various methods to solvethe critical section problem.____

In Computer Organization and Design, which of the following justifies the reason to prevent problems that occur in critical sections:If a process is executed in the critical section, then the number of other processes that are being implemented in their critical sections sharing the common resource depends upon the capability of the operating system to resolve the conflict of resources.A process that is waiting to operate in its critical section must be given immediate access if no other processes are operating in their own critical sections that share the resources.There must be a limit to the number of times in which other processes are allowed to enter their critical section between the request and grant of a different process.

what is critical section problem and how to solve it

In designing and implementing an operating system, two important principles include:Group of answer choicespolicy and system callspolicy and mechanismresource allocation and file managementmechanism and interrupt handling

The FCFS algorithm is particularly troublesome for ____________a) operating systemsb) multiprocessor systemsc) time sharing systemsd) multiprogramming systems

1/2

Upgrade your grade with Knowee

Get personalized homework help. Review tough concepts in more detail, or go deeper into your topic by exploring other relevant questions.