Podcast
Questions and Answers
What is the waiting time of each of these processes? (Use FCFS)
What is the waiting time of each of these processes? (Use FCFS)
What is the average waiting time for these processes? (Use FCFS)
What is the average waiting time for these processes? (Use FCFS)
5.75
What is the turnaround time of each of these processes? (Use FCFS)
What is the turnaround time of each of these processes? (Use FCFS)
What is the average turnaround time for these processes? (Use FCFS)
What is the average turnaround time for these processes? (Use FCFS)
Signup and view all the answers
What is the waiting time of each of these processes? (Use Round Robin with time quantum = 4)
What is the waiting time of each of these processes? (Use Round Robin with time quantum = 4)
Signup and view all the answers
What is the average waiting time for these processes? (Use Round Robin with time quantum = 4)
What is the average waiting time for these processes? (Use Round Robin with time quantum = 4)
Signup and view all the answers
What is the turnaround time of each of these processes? (Use Round Robin with time quantum = 4)
What is the turnaround time of each of these processes? (Use Round Robin with time quantum = 4)
Signup and view all the answers
What is the average turnaround time for these processes? (Use Round Robin with time quantum = 4)
What is the average turnaround time for these processes? (Use Round Robin with time quantum = 4)
Signup and view all the answers
What is the bootstrap program?
What is the bootstrap program?
Signup and view all the answers
The memory layout of a process consists of 4 sections, what are these sections and what are the contents of each section?
The memory layout of a process consists of 4 sections, what are these sections and what are the contents of each section?
Signup and view all the answers
What are advantages of Multiprocessor Systems?
What are advantages of Multiprocessor Systems?
Signup and view all the answers
What is External Fragmentation? What are the solutions to it?
What is External Fragmentation? What are the solutions to it?
Signup and view all the answers
Draw the diagram of process states.
Draw the diagram of process states.
Signup and view all the answers
What are the four conditions of deadlock?
What are the four conditions of deadlock?
Signup and view all the answers
What is the difference between Ordinary pipes and Named pipes?
What is the difference between Ordinary pipes and Named pipes?
Signup and view all the answers
What are advantages and disadvantages of the First Come First Served (FCFS) scheduling algorithm?
What are advantages and disadvantages of the First Come First Served (FCFS) scheduling algorithm?
Signup and view all the answers
What are the advantages of multithreading?
What are the advantages of multithreading?
Signup and view all the answers
What is the direct access memory (DMA)?
What is the direct access memory (DMA)?
Signup and view all the answers
Use the first-fit algorithm to place these processes in memory.
Use the first-fit algorithm to place these processes in memory.
Signup and view all the answers
Which algorithm makes the most efficient use of memory?
Which algorithm makes the most efficient use of memory?
Signup and view all the answers
Consider a computer system with a 32-bit logical address and 4 KB page size. The system supports up to 512 MB of physical memory. How many entries are there in the page table?
Consider a computer system with a 32-bit logical address and 4 KB page size. The system supports up to 512 MB of physical memory. How many entries are there in the page table?
Signup and view all the answers
In a multi-programmed system, the process (currently executing by CPU) may have to wait for an I/O operation to complete. In this case, the CPU will do which of the following?
In a multi-programmed system, the process (currently executing by CPU) may have to wait for an I/O operation to complete. In this case, the CPU will do which of the following?
Signup and view all the answers
Which of the following operating system structures is removing all non-essential components from the kernel and implementing them as user-level programs that reside in separate address spaces?
Which of the following operating system structures is removing all non-essential components from the kernel and implementing them as user-level programs that reside in separate address spaces?
Signup and view all the answers
Which of the following instructions is not privileged?
Which of the following instructions is not privileged?
Signup and view all the answers
Deciding which processes (or parts of processes) and data to move into and out of memory is an activity of:
Deciding which processes (or parts of processes) and data to move into and out of memory is an activity of:
Signup and view all the answers
Which of the following is a type of computing that delivers storage, computing, and applications as a service across a network?
Which of the following is a type of computing that delivers storage, computing, and applications as a service across a network?
Signup and view all the answers
CLI stands for:
CLI stands for:
Signup and view all the answers
Virtualization allows operating systems to run as applications within other operating systems.
Virtualization allows operating systems to run as applications within other operating systems.
Signup and view all the answers
If a process in the “running” state and an interrupt occurs, then the process will be in the “Waiting” state.
If a process in the “running” state and an interrupt occurs, then the process will be in the “Waiting” state.
Signup and view all the answers
Caching is copying information from storage system A to storage system B where B is slower than A.
Caching is copying information from storage system A to storage system B where B is slower than A.
Signup and view all the answers
Hard-disk drives are volatile storage devices and faster than the nonvolatile memory devices.
Hard-disk drives are volatile storage devices and faster than the nonvolatile memory devices.
Signup and view all the answers
Each device controller type has an operating system device driver to manage it.
Each device controller type has an operating system device driver to manage it.
Signup and view all the answers
With DMA, device controller transfers blocks of data from buffer storage directly to main memory without CPU intervention.
With DMA, device controller transfers blocks of data from buffer storage directly to main memory without CPU intervention.
Signup and view all the answers
Study Notes
Operating Systems - Exam Questions
-
Question 1a: Processes (P1, P2, P3, P4) arrive at time 0 with burst times (milliseconds): P1-4, P2-3, P3-5, P4-7. Use FCFS scheduling algorithm to solve for waiting times, average waiting time, turnaround times, and average turnaround time.
-
Question 1b: Processes (P1, P2, P3, P4) arrive at time 0 with burst times (milliseconds): P1-7, P2-6, P3-5, P4-8. Use SJF scheduling algorithm to solve for waiting times, average waiting time, turnaround times, and average turnaround time.
-
Question 1c: Processes (P1, P2, P3, P4) arrive at time 0 with burst times (milliseconds): P1-10, P2-6, P3-4, P4-8. Use Round Robin scheduling algorithm (time quantum = 4) to solve for waiting times, average waiting time, turnaround times, and average turnaround time.
Question 2 (32 Marks)
-
a. Bootstrap program: A program that initializes a computer by loading the operating system into memory.
-
b. Memory layout of a process: Consists of 4 sections - Text, Data, Stack, Heap.
-
Text section - Instructions of the program.
-
Data section - Static variables and initialized global data.
-
Stack section - Dynamic variables, function calls, and return addresses.
-
Heap section - Dynamic data allocated during runtime.
-
c. Advantages of Multiprocessor Systems: Increased throughput, reliability, cost-effectiveness, responsiveness, and resource sharing.
-
d. External Fragmentation: The memory is fragmented into small, unusable pieces; solutions include compaction (moving allocated memory together) and segmentation (memory split into fixed-size chunks).
-
e. Process States Diagram: A diagram visually representing the various stages a process undergoes (e.g., new, ready, running, waiting, terminated).
-
f. Deadlock conditions: Mutual exclusion, hold and wait, no preemption, circular wait.
-
g. Ordinary pipes vs. Named pipes: Ordinary pipes are temporary and unidirectional, named pipes have a persistent name and can be bidirectional.
-
h. First Come First Served (FCFS) scheduling algorithm: Advantages - Simple to understand and implement, Disadvantages - Can lead to long wait times for shorter processes, average waiting time can be high especially during periods with long and short processes.
-
i. Multithreading advantages: Increased responsiveness, resource sharing, efficient context switching, simplified programming in concurrent cases.
-
j. Direct Memory Access (DMA): A hardware mechanism that allows a device to directly access main memory without involving the CPU.
Question 3 (16 Marks)
-
a. Memory partitioning (five partitions): Given the various sizes of partitions and the size of processes, determine the best fit, first fit and worst fit approaches.
-
b. Page table entries: Calculate the page table entries given the 32-bit logical address, page size (4KB), and supported physical memory (512 MB).
Question 4 (12 Marks)
-
a. Choose the correct answer for the provided multiple choice questions.
- I/O Operations in Multiprogramming, Operating System structures and instruction types, and the functionality & processes of memory management.
Studying That Suits You
Use AI to generate personalized quizzes and flashcards to suit your learning preferences.
Related Documents
Description
This quiz covers various scheduling algorithms in Operating Systems, including FCFS, SJF, and Round Robin. It challenges students to calculate waiting times and turnaround times based on given burst times for multiple processes. Perfect for students preparing for exams in this field.