wayground logo

Free Printable Worksheets

NEW

Font size

S
M
L
XL
Worksheets

Operating System Concepts

Total questions: 37

Worksheet time: 19mins

Name
Class
Date
1.

What is the purpose of an interrupt in an operating system?

a)

To schedule tasks for execution

b)

To suspend the execution of a process

c)

To signal the occurrence of an event needing immediate attention

d)

To manage memory allocation

2.

Which of the following is an example of a system call?

a)

Open a file

b)

Run a program

c)

Terminate a process

d)

All of the above

3.

In which of the following scenarios does a process enter a “waiting” state?

a)

The process is waiting for user input.

b)

The process is running and utilizing the CPU.

c)

The process is terminated.

d)

The process is executing in the kernel mode.

4.

What does the term “context switching” refer to in an operating system?

a)

Changing from one process to another

b)

Changing from one user to another

c)

Switching between input and output devices

d)

Switching from kernel mode to user mode

5.

What is the function of the "scheduler" in an operating system?

a)

Managing memory

b)

Managing input/output devices

c)

Assigning CPU time to processes

d)

Handling process creation and termination

6.

Which of the following is a characteristic of a distributed operating system?

a)

It only runs on a single computer system.

b)

It manages a collection of independent computers to appear as a single coherent system.

c)

It uses only centralized control for resource management.

d)

It does not support networking features.

7.

Which of the following is the primary purpose of a "bootstrap loader"?

a)

To load the operating system into memory during startup

b)

To allocate memory to the operating system

c)

To provide a user interface

d)

To handle network communication

8.

Which of the following is a method of process synchronization?

a)

Multithreading

b)

Semaphores

c)

Context switching

d)

Virtual memory

9.

Which of the following techniques is used by an operating system to ensure that multiple processes can safely access shared resources?

a)

Deadlock detection

b)

Paging

c)

Synchronization mechanisms

d)

Process scheduling

10.

A Process Control Block(PCB) does not contain which of the following?

a)

Code

b)

Stack

c)

Bootstrap program

d)

Data

11.

The number of processes completed per unit time is known as __________

a)

Output

b)

Throughput

c)

Efficiency

d)

Capacity

12.

A single thread of control allows the process to perform _________

a)

only one task at a time

b)

multiple tasks at a time

c)

only two tasks at a time

d)

all of the mentioned

13.

The child process can __________

a)

be a duplicate of the parent process

b)

never be a duplicate of the parent process

c)

cannot have another program loaded into it

d)

never have another program loaded into it

14.

Which process can be affected by other processes executing in the system?

a)

cooperating process

b)

child process

c)

parent process

d)

init process

15.

When several processes access the same data concurrently and the outcome of the execution depends on the particular order in which the access takes place is called ________

a)

dynamic condition

b)

race condition

c)

essential condition

d)

critical condition

16.

If a process is executing in its critical section, then no other processes can be executing in their critical section. What is this condition called?

a)

mutual exclusion

b)

critical exclusion

c)

synchronous exclusion

d)

asynchronous exclusion

17.

Which one of the following is a synchronization tool?

a)

thread

b)

pipe

c)

semaphore

d)

socket

18.

A semaphore is a shared integer variable __________

a)

that can not drop below zero

b)

that can not be more than zero

c)

that can not drop below one

d)

that can not be more than one

19.

What is Interprocess communication?

a)

allows processes to communicate and synchronize their actions when using the same address space

b)

allows the processes to only synchronize their actions without communication

c)

allows processes to communicate and synchronize their actions

d)

none of the mentioned

20.

Which of the following two operations are provided by the IPC facility?

a)

write & delete message

b)

delete & receive message

c)

send & delete message

d)

receive & send message

21.

Concurrent access to shared data may result in ____________

a)

data consistency

b)

data insecurity

c)

data inconsistency

d)

none of the mentioned

22.

The segment of code in which the process may change common variables, update tables, write into files is known as ____________

a)

program

b)

critical section

c)

non – critical section

d)

synchronizing

23.

Which of the following conditions must be satisfied to solve the critical section problem?

a)

Mutual Exclusion

b)

Progress

c)

Bounded Waiting

d)

All of the mentioned

24.

Mutual exclusion implies that ____________

a)

if a process is executing in its critical section, then no other process must be executing in their critical sections

b)

if a process is executing in its critical section, then other processes must be executing in their critical sections

c)

if a process is executing in its critical section, then all the resources of the system must be blocked until it finishes execution

d)

none of the mentioned

25.

Semaphore is a/an _______ to solve the critical section problem.

a)

hardware for a system

b)

special program for a system

c)

integer variable

d)

none of the mentioned

26.

What are the two atomic operations permissible on semaphores?

a)

wait and signal

b)

stop and wait

c)

hold and signal

d)

none of the mentioned

27.

What are the two kinds of semaphores?

a)

mutex & counting

b)

binary & counting

c)

counting & decimal

d)

decimal & binary

28.

A binary semaphore is a semaphore with integer values ____________

a)

1

b)

-1

c)

0.8

d)

0.5

29.

In the bounded buffer problem, there are the empty and full semaphores that ____________

a)

count the number of empty and full buffers

b)

count the number of empty and full memory spaces

c)

count the number of empty and full queues

d)

none of the mentioned

30.

To ensure difficulties do not arise in the readers – writers problem _______ are given exclusive access to the shared object.

a)

readers

b)

writers

c)

readers and writers

d)

none of the mentioned

31.

Peterson’s solution is restricted to ___ processes that alternate execution between their critical sections and remainder sections

a)

1

b)

2

c)

3

d)

4

32.


The part of program where the shared resource is accessed is called ________________

a)

program

b)

race condition

c)

synchronizing

d)

critical section

33.

When Buffer is empty

a)

Producer can produce

b)

Consumer can consume

c)

Producer can consume

d)

Consumer can produce

34.

When Buffer is full

a)

Producer can produce

b)

Consumer can consume

c)

Producer can consume

d)

Consumer can produce

35.

Multiple processes are permitted to concurrently acquire a reader–writer lock in read mode, but only one process may acquire the lock for ___, as exclusive access is required for _________

a)

reading, readers

b)


reading, writers

c)

writing, writers

d)

writing, readers

36.

At which state the process is waiting to be assigned to a processor?

a)

New

b)

Running

c)

Waiting

d)

Ready

37.

____ memory is placed between the CPU and the main memory.

a)

Virtual memory

b)

ROM

c)

RAM

d)

Cache