Wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

Operating System Quiz 1

Total questions: 30

Worksheet time: 30mins

Name
Class
Date
1.

In Operating Systems, which of the following is/are CPU scheduling algorithms?

a)

Priority

b)

Round Robin

c)

Shortest Job First

d)

All

2.

Which command is used to make a hidden directory in linux?

a)

mkdir -h directoryName

b)

mkdir hidden directoryName

c)

mkdir -hd directoryName

d)

mkdir .directoryName

3.

A server ____ request.

a)

Controls

b)

Hide

c)

Request

d)

Responds

4.

Firewall acts as ____ between networks.

a)

Barrier

b)

Border

c)

Messenger

d)

None of all.

5.

What does the following command do?

mv file1 file2

a)

moves file1 and file2

b)

combines file1 and file2

c)

renames file1 to file2

d)

renames file2 to file1

6.
CPU scheduling is the basis of
a)

multiprogramming operating systems

b)

larger memory sized systems

c)

multiprocessor systems

d)

unicore programming

7.
Where is the operating system placed in the memory?
a)
either low or high memory
b)
in the low memory
c)
in the high memory
d)
moderate memory
8.
Which one of the following is not a real time operating system?
a)
RTLinux
b)
Palm OS
c)
QNX
d)
VxWorks
9.
When a process is in a “Blocked” state waiting for some I/O service. When the service is completed, it goes to the 
a)
Terminated state
b)
Suspended state
c)
Running state
d)
Ready state
10.
The FCFS algorithm is particularly troublesome for
a)
operating systems
b)
multiprocessor systems
c)
time sharing systems
d)
multiprogramming systems
11.
 For an effective operating system, when to check for deadlock?
a)
every time a resource request is made at fixed time intervals
b)
at fixed time intervals
c)
every time a resource request is made
d)
none of the mentioned
12.
Swapping _______ be done when a process has pending I/O, or has to execute I/O operations only into operating system buffers.
a)
must never
b)
maybe
c)
can
d)
must
13.
In real time operating system ____________
a)
process scheduling can be done only once
b)
all processes have the same priority
c)
kernel is not required
d)
a task must be serviced by its deadline period
14.
 For real time operating systems, interrupt latency should be ____________
a)
zero
b)
minimal
c)
maximum
d)
dependent on the scheduling
15.
 In Unix, which system call creates the new process?
a)
create
b)
fork
c)
new
d)
none of the mentioned
16.
Which one of the following error will be handle by the operating system?
a)
power failure
b)
lack of paper in printer
c)
connection failure in the network
d)
all of the mentioned
17.
 In Operating Systems, which of the following is/are CPU scheduling algorithms?
a)
Round Robin
b)
Shortest Job First
c)
Priority
d)
All of the mentioned
18.
 In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of ____________
a)
all process
b)
currently running process
c)
parent process
d)
init process
19.
 Which one of the following can not be scheduled by the kernel?
a)
kernel level thread
b)
user level thread
c)
process
d)
none of the mentioned
20.
 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
21.
 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
22.
The link between two processes P and Q to send and receive messages is called __________
a)
communication link
b)
message-passing link
c)
synchronization link
d)
all of the mentioned
23.
Because of virtual memory, the memory can be shared among ____________
a)
processes
b)
threads
c)
instructions
d)
none of the mentioned
24.

Race-Conditions can be overcome by:

a)

System calls

b)

Synchronization between applications

c)

Interface

d)

IPC

25.

Which of the following is a component of OS?

a)

System Call Interface

b)

Device Drivers

c)

Inter Process Communications

d)

All of these

26.

Fragmentation can be defined as:

a)

Memory space is available but not adequate

b)

Memory space is available but not relocatable

c)

Memory space is available but not contiguous

d)

Memory space is available but not ready as OS is busy

27.

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

28.

In virtual memory, RAM is split into fixed size partitions called:

a)

Block

b)

Page Frame

c)

Segment

d)

Page Table

29.

In virtual memory:

a)

process frame size = block size

b)

block size = process frame size

c)

process frame size varies

d)

Block size varies

30.

The replaced block in RAM need to be written back to swap space. This is called:

a)

Swap in

b)

Swap out

c)

Demand paging

d)

All of these

Similar Resources on Wayground

Electrical Computation

25 questions

Electrical Computation

quiz

Worksheet

•

University

QUIZ BLKBB-1

25 questions

QUIZ BLKBB-1

quiz

Worksheet

•

University

Cybersecurity PBQ Quiz

25 questions

Cybersecurity PBQ Quiz

quiz

Worksheet

•

University

春节词语

25 questions

春节词语

quiz

Worksheet

•

3rd Grade - Professio...

Ouat Quiz

26 questions

Ouat Quiz

quiz

Worksheet

•

5th Grade - Professio...

Among Us

28 questions

Among Us

quiz

Worksheet

•

KG - Professional Dev...

LEA I

25 questions

LEA I

quiz

Worksheet

•

University - Professi...

FINANCIAL MARKET

25 questions

FINANCIAL MARKET

quiz

Worksheet

•

University