logo

Crowdly

2025W Operating Systems (CS-3520-01)

Looking for 2025W Operating Systems (CS-3520-01) test answers and solutions? Browse our comprehensive collection of verified answers for 2025W Operating Systems (CS-3520-01) at moodle31.upei.ca.

Get instant access to accurate answers and detailed explanations for your course questions. Our community-driven platform helps students succeed!

Which of the following is a possible method to game a MLFQ scheduler and potentially monopolize the CPU?
View this question

What is the average response time (rounded to two decimal places) under STCF of the following workload?:

  • Job A arrives at time 0s and needs to run on the CPU for 60s
  • Job B arrives at time 5s and needs to run on the CPU for 10s
  • Job C arrives at time 10s and needs to run on the CPU for 3s

Note: assume that switching between processes is instantaneous (i.e., takes no time). Also assume that if the scheduler is preemptive, then it can make the decision to switch between jobs at any given time (i.e., as soon as another process arrives)

View this question

What is the average turnaround time (rounded to two decimal places) under STCF of the following workload?:

  • Job A arrives at time 0s and needs to run on the CPU for 60s
  • Job B arrives at time 5s and needs to run on the CPU for 10s
  • Job C arrives at time 10s and needs to run on the CPU for 3s

Note: assume that switching between processes is instantaneous (i.e., takes no time). Also assume that if the scheduler is preemptive, then it can make the decision to switch between jobs at any given time (i.e., as soon as another process arrives)

View this question

What is the average response time (rounded to two decimal places) under SJF of the following workload?:

  • Job A arrives at time 0s and needs to run on the CPU for 60s
  • Job B arrives at time 5s and needs to run on the CPU for 10s
  • Job C arrives at time 10s and needs to run on the CPU for 3s

Note: assume that switching between processes is instantaneous (i.e., takes no time). Also assume that if the scheduler is preemptive, then it can make the decision to switch between jobs at any given time (i.e., as soon as another process arrives)

View this question

We used a time-sharing method for virtualizing the CPU where only one process runs at a time (on a uniprocessor), so why don't we use a time-sharing model for virtualizing memory where only one process is in physical memory at a time?

View this question

The old UNIX file system was very similar to Very Simple File System (vsfs). Which of the following contributed to the system having poor performance?

View this question
What is polling in the context of I/O?
View this question
Why does a file system have to perform writes when it is only reading the file's data?
View this question
Suppose a disk has 256 data blocks, each 4KB in size total and the file system reserves 5 data blocks for inodes. If each inode is 128 bytes, what is the maximum number of files our file system can have?
View this question
Why do many file systems pre-allocate a certain number of contiguous data blocks when a file is created?
View this question

Want instant access to all verified answers on moodle31.upei.ca?

Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!