wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

Operating System Sessional Exam

Total questions: 60

Worksheet time: 30mins

Name
Class
Date
1.
Software is a series of ____________ that tells a computer what tasks to perform and how to perform them.
a)
data
b)
information
c)
instruction
d)
utility
2.
________________programs that control or maintain the operations of the computer and its devices.
a)
Software
b)
System Software
c)
Application software
d)
Utility program
3.
_________________are programs that designed to help users to be more productive with their personal tasks.
a)
Software
b)
System Software
c)
Application software
d)
Utility program
4.
Function of system software is to serve as the _________ between the user, the application software, and the computer’s hardware
a)
interface
b)
program
c)
application
d)
server
5.
____________a set of programs containing instructions that work together to coordinate all the activities among computer hardware resources
a)
Operating system
b)
System Software
c)
Application software
d)
Utility program
6.

1. Without the Operating System the computer is useless

a)

True

b)

False

7.

Which of these symbols represent UNIX?

a)
b)
c)
8.

The Operating System is a program that allows different ____________ and various pieces of hardware to _________with each other.

a)

application, software

b)

software , application

c)

application , communicate

d)

software, communicate

9.

How can the OS help manage security of the system?

a)

The OS can hire backup

b)

User accounts may be password protected

c)

Files can self destruct after a set time

10.
The picture shows a type of user interface as a function of operating system
a)
Command Line
b)
Graphical user interface
11.

A user process gets access to kernel through:

a)

Interface

b)

System Calls

c)

Kernel

d)

IPC

12.

Race-Conditions can be overcome by:

a)

System calls

b)

Synchronization between applications

c)

Interface

d)

IPC

13.

Which of the following is a component of OS?

a)

System Call Interface

b)

Device Drivers

c)

Inter Process Communications

d)

All of these

14.

If one logs into the system as a guest user, the OS has to detect it and accordingly allow different resources to be accessed with permitted/limited privileges. This is called:

a)

Security Assessment

b)

Access Control

c)

Security management

d)

Synchronization

15.

Given 5 memory partitions of 100kb, 500kb, 200kb, 300kb, 600kb (in order), how would the best fit algorithm place processes of size 212kb, 417kb, 112b, and 426kb (inorder)? The below show process->partition link mentioning allocation to that partition.

a)

212kb -> 500kb

417kb -> 600kb

112kb ->288kb

426kb -> wait

b)

212kb -> 600kb

417kb -> 500kb

112kb ->388kb

426kb -> wait

c)

212kb -> 300kb

417kb -> 500kb

112kb ->200kb

426kb -> 600kb

d)

212kb -> 300kb

417kb -> 500kb

112kb ->200kb

426kb -> 522kb

16.

Concurrent access to shared data may result in _

a)

data consistency

b)

data insecurity

c)

data inconsistency

d)

None

17.

A situation where several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which access takes place is called ____________

a)

data consistency

b)

race condition

c)

aging

d)

starvation

18.

What are the two kinds of semaphores?

a)

mutex & counting

b)

binary & counting

c)

counting & decimal

d)

decimal & binary

19.

What is a mutex?

a)

is a binary mutex

b)

must be accessed from only one process

c)

can be accessed from multiple processes

d)

none of the mentioned

20.

The bounded buffer problem is also known as ____________

a)

Readers – Writers problem

b)

Dining – Philosophers problem

c)

Producer – Consumer problem

d)

none

21.

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

22.

Processes have....

a)

2 states

b)

3 states

c)

4 states

d)

5 states

23.

What is the ready state of a process?

a)

a) when the process is scheduled to run after some execution

b)

b) when the process is unable to run until some task has been completed

c)

c) when process is using the CPU

d)

none of the mentioned

24.

The address of the next instruction to be executed by the current process is provided by the __________

a)

CPU registers

b)

Program counter

c)

Process stack

d)

Pipe

25.

Which of the following is not the state of a process?

a)

New

b)

Old

c)

Waiting

d)

Running

26.

What scheduling algorithm assigns the CPU

to the process with the highest priority?

a)

FIFO

b)

SJF non preemptive

c)

SJF preemptive

d)

priority

27.

The interval from the line of submission of a process to the time of completion is termed as ____

a)

waiting time

b)

throughput

c)

turnaround time

d)

response time

28.

Which algorithm is defined in Time quantum?

a)

shortest job scheduling algorithm

b)

round robin scheduling algorithm

c)

priority scheduling algorithm

d)

multilevel queue scheduling algorithm

29.

In priority scheduling algorithm ____________

a)

CPU is allocated to the process with highest priority

b)

CPU is allocated to the process with lowest priority

c)

Equal priority processes can not be scheduled

d)

None of the mentioned

30.

the process is swapped out of memory and later swapped into memory is done by

a)

short term

b)

medium term

c)

long term

d)

none

31.

Which of the following condition is required for deadlock to be possible?

a)

mutual exclusion

b)

a process may hold allocated resources while awaiting assignment of other resources

c)

no resource can be forcibly removed from a process holding it

d)

all of the mentioned

32.

A system is in the safe state if

a)

the system can allocate resources to each process in some order and still avoid a deadlock

b)

there exist a safe sequence

c)

all of the mentioned

d)

none of the mentioned

33.

Which one of the following is the deadlock avoidance algorithm?

a)

banker’s algorithm

b)

round-robin algorithm

c)

elevator algorithm

d)

karn’s algorithm

34.

A process said to be in ___________ state if it was waiting for an event that will never occur.

a)

Safe

b)

Unsafe

c)

Starvation

d)

Dead lock

35.

A system has 12 magnetic tape drives and 3 processes : P0, P1, and P2. Process P0 requires 10 tape drives, P1 requires 4 and P2 requires 9 tape drives.

Process :P0 P1 P2

Maximum needs (process-wise: P0 through P2 top to bottom) :10 4 9

Currently allocated (process-wise)5 2 2

a)

P0, P1, P2

b)

P1, P2, P0

c)

P2, P0, P1

d)

P1, P0, P2

36.

Only one thread at a time can use a resource

a)

mutual exclusion

b)

hold and wait

c)

no preemption

d)

CIRCULAR WAIT

37.

When the OS is managing memory, SEGMENTATION uses:

a)

Logical addressing

b)

Physical addressing

38.

What is the name used to describe what happens when idle processes are moved from the swap file, back to RAM?

a)

Interrupt

b)

Thrashing

c)

Page In

d)

Page Out

39.

There are two types of optimisation techniques used by a OS, they are ...

a)

Paging

b)

Planning

c)

Segmentation

d)

Segregation

40.

Paging ...

a)

Splits programs into different sizes across memory

b)

Splits programs into the same size across memory

c)

Moves the data around

d)

Allows data to be non-contiguously stored

41.

Segmentation ...

a)

Does not store items not currently in use into secondary storage

b)

Splits programs into different sizes across memory

c)

Moves the data around

d)

Allows data to be contiguously stored

42.

What does contiguous mean?

a)

Data is split into random allocations

b)

Data is stored randomly another

c)

Data is illogically stored onto memory

d)

Data is logically stored one after another

43.

Disk thrashing is when ...

a)

The memory controller spends too much time swapping between RAM and ROM

b)

The memory controller spends too much time swapping between memory and virtual memory

c)

The memory controller spends too much time swapping between the SSD and virtual memory

d)

The memory controller spends too much time swapping between memory and RAM

44.

Pages not currently in use can be stored on ...

a)

RAM

b)

SSD/HDD

c)

Virtual memory

d)

ROM

45.

One technique for overcoming external fragmentation is __________ .

a)

loading

b)

compaction

c)

relocation

d)

partitioning

46.

Select the type of CPU Scheduling showed in the Diagram A1 above.

a)

Multilevel Feedback Queue

b)

Multilevel Queue

c)

Multilevel Memory Queue

d)

Multilevel Ready Queue

47.

Define the action that can prevent “no-preemption” deadlock condition?

a)

A particular resource can only be requested when no others are being used

b)

Release any resource already being used if the process can't get an additional resource

c)

Assign number to the resources and only request in ascending order

d)

Allow preemption

48.

Select the CORRECT conditions for a deadlock to occur.

i.Mutual exclusion

ii.Hold-and-wait

iii.Wait-and-Interrupt

iv.No-preemption

a)

i, ii and iii

b)

i, ii and iv

c)

i, iii and iv

d)

ii, iii and iv

49.

What do you call the main screen you see when your PC has finished booting up?

a)

Desktop

b)

File Explorer

c)

Recycle bin

d)

Folder

50.

To organise our files, we use ....

a)

Folders

b)

Recycle Bin

c)

Operating System

d)

Files

51.

Which of these is the file extension for a MS Office document?

a)

.txt

b)

.docx

c)

.xlsx

d)

.pptx

52.

Which of these are file extensions for image files? (select ALL correct answers)

a)

.jpg

b)

.png

c)

.mpg

d)

.exe

e)

.gif

53.

_________________________configuration uses data striping techniques, where data is striped across all the disks within a RAID set.

a)

RAID 0

b)

RAID 1

c)

RAID 2

d)

RAID 3

54.

In RAID, which level is not a fault tolerant?

a)

Level 0

b)

Level 3

c)

Level 4

d)

Level 5

55.

RAID 1 is based on ________________ technique.

a)

Striping

b)

Mirroring

c)

Parity

d)

None of the above

56.

In which RAID level using error correction mechanism with Hamming ECC to recover the data?

a)

RAID 0

b)

RAID 1

c)

RAID 2

d)

RAID 3

57.
The _______ policy results in the fewest number of page faults.
a)
optimal
b)
LRU
c)
FIFO
58.
With _________, a page is brought into main memory only when a reference is made to a location on that page.
a)
demand paging
b)
prepaging
c)
Placement Policy
59.

Consider the following sequence of page references:

1 2 3 4 4 2 1 4 1 3 4


Determine how many page faults will occur for the "FIFO" algorithms, assuming there are only "2 frames".

a)

9 page faults

b)

7 page faults

c)

5 page faults

d)

3 page faults

60.

Consider the following sequence of page references:

7 0 1 2 0 3 0 4 2 3 0


Determine how many page faults will occur for the "FIFO" algorithms, assuming there are only "3 frames".

a)

12 page faults

b)

10 page faults

c)

8 page faults

d)

6 page faults

Similar Resources on Wayground

C5. Marketing

64 questions

C5. Marketing

quiz

Worksheet

•

University - Professi...

CS8392 - Object Oriented Programming - Unit 1

63 questions

CS8392 - Object Oriented Programming - Unit 1

quiz

Worksheet

•

University

Microprocessor & Microcontroller Basics

60 questions

Microprocessor & Microcontroller Basics

quiz

Worksheet

•

University

CD19-MIDTERM EXAM

65 questions

CD19-MIDTERM EXAM

quiz

Worksheet

•

University

Preparing for MTA Certification

60 questions

Preparing for MTA Certification

quiz

Worksheet

•

KG - University

Associate Diploma in Software Development Quiz- Set 1 (Amal)

60 questions

Associate Diploma in Software Development Quiz- Set 1 (Amal)

quiz

Worksheet

•

University

QUIZ-PAB-2 2023

62 questions

QUIZ-PAB-2 2023

quiz

Worksheet

•

University

ATM OPERATIONS

59 questions

ATM OPERATIONS

quiz

Worksheet

•

University