Operating Systems Quiz CTS Students CLub

A modern computer interface displaying various operating systems and coding elements, with a person thoughtfully analyzing the screen, in a tech-themed environment.

Operating Systems Mastery Quiz

Test your knowledge of operating systems with our engaging quiz designed specifically for CTS students! Dive into 16 challenging questions that cover a range of topics, including deadlock prevention, scheduling algorithms, and memory management.

Participate now to see how well you understand the complexities of operating systems:

Multiple choice questions
Focus on key OS concepts
Perfect for students and enthusiasts

16 Questions4 MinutesCreated by ReadingByte342

Which of the following is NOT a valid deadlock prevention scheme?

Release all resources before requesting a new resource

Number the resources uniquely and never request a lower numbered resource than the last one requested.

Never request a resource after releasing any resource

Request and all required resources be allocated before execution.

Consider three CPU-intensive processes, which require 10, 20 and 30 time units and arrive at times 0, 2 and 6, respectively. How many context switches are needed if the operating system implements a shortest remaining time first scheduling algorithm? Do not count the context switches at time zero and at the end.

A computer system supports 32-bit virtual addresses as well as 32-bit physical addresses. Since the virtual address space is of the same size as the physical address space, the operating system designers decide to get rid of the virtual memory entirely. Which one of the following is true?

Efficient implementation of multi-user support is no longer possible

The processor cache organization can be made more efficient now

Hardware support for memory management is no longer needed

CPU scheduling can be made more efficient now

In the following process state transition diagram for a uniprocessor system, assume that there are always some processes in the ready state: Now consider the following statements: I. If a process makes a transition D, it would result in another process making transition A immediately. II. A process P2 in blocked state can make transition E while another process P1 is in running state. III. The OS uses preemptive scheduling. IV. The OS uses non-preemptive scheduling. Which of the above statements are TRUE?

I and II

I and III

II and III

The enter_CS() and leave_CS() functions to implement critical section of a process are realized using test-and-set instruction as follows:

void enter_CS(X)

{ while test-and-set(X) ; }

void leave_CS(X)

{ X = 0; }

In the above solution, X is a memory location associated with the CS and is initialized to 0. Now consider the following statements: I. The above solution to CS problem is deadlock-free II. The solution is starvation free. III. The processes enter CS in FIFO order. IV More than one process can enter CS at the same time. Which of the above statements is TRUE?

I only

I and II

II and III

IV only

A thread is usually defined as a ‘light weight process’ because an operating system (OS) maintains smaller data structures for a thread than for a process. In relation to this, which of the followings is TRUE?

On per thread basis, the OS maintains only scheduling and accounting information.

On per-thread basis, the OS does not maintain virtual memory state

The OS does not maintain a separate stack for each thread

On per-thread basis, the OS maintains only CPU register state

Let the page fault service time be 10ms in a computer with average memory access time being 20ns. If one page fault is generated for every 10^6 memory accesses, what is the effective access time for the memory?

21ns

35ns

30ns

23ns

An application loads 100 libraries at startup. Loading each library requires exactly one disk access. The seek time of the disk to a random location is given as 10ms. Rotational speed of disk is 6000rpm. If all 100 libraries are loaded from random locations on the disk, how long does it take to load all libraries? (The time to transfer data from the disk block once the head has been positioned at the start of the block may be neglected)

1.50s

1.00s

1.25s

0.50s

Consider the following table of arrival time and burst time for three processes

P0, P1 and P2.

The pre-emptive shortest job first scheduling algorithm is used. Scheduling is carried out only at arrival or completion of processes. What is the average waiting time for the three processes?

4.33 ms

7.33 ms

5.0 ms

6.33 ms

Which of the following need not necessarily be saved on a context switch between processes?

Translation look-aside buffer

General purpose registers

Program counter

All of the above

Which of the following scheduling algorithms is non-preemptive? (

Multilevel Queue Scheduling

Round Robin

First-In First-Out

Multilevel Queue Scheduling with Feedback

The data blocks of a very large file in the Unix file system are allocated using

contiguous allocation

an extension of indexed allocation

indexed allocation

Linked allocation

) Which of the following statements about synchronous and asynchronous I/O is NOT true?

An ISR is invoked on completion of I/O in synchronous I/O but not in asynchronous I/O

In both synchronous and asynchronous I/O, an ISR (Interrupt Service Routine) is invoked after completion of the I/O

A process making a synchronous I/O call waits until I/O is complete, but a process making an asynchronous I/O call does not wait for completion of the I/O

In the case of synchronous I/O, the process waiting for the completion of I/O is woken up by the ISR that is invoked after the completion of I/O

Operating Systems Quiz CTS Students CLub

Operating Systems Mastery Quiz

More Surveys