wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

he dieu hanh

Total questions: 115

Worksheet time: 1hrs 4mins

Name
Class
Date
1.

Routine is not loaded until it is called. All routines are kept on disk in a relocatable load format. The main program is loaded into memory & is executed. This type of loading is called _________

a)

Dynamic loading

b)

Dynamic linking

c)

Static loading

d)

Overlays

2.

Which of the following is crucial time while accessing data on the disk?

a)

Seek time

b)

Rotational time

c)

Transmission time

d)

Waiting time

3.

The host repeatedly checks if the controller is busy until it is not. It is in a loop that status register's busy bit becomes clear. This is called _____________ and a mechanism for the hardware controller to notify the CPU that it is ready is called ___________.

a)

Interrupt and Polling

b)

Polling and Spooling

c)

Polling and Interrupt

d)

Deadlock and Starvation

4.

Unix Operating System is an __________.

a)

Time Sharing Operating System

b)

Multi-User Operating System

c)

Multi-tasking Operating System

d)

All the Above

5.

Which of the following memory allocation scheme suffers from External fragmentation?

a)

Pure demand paging

b)

Swapping

c)

Segmentation

d)

Paging

6.

Information about a process is maintained in a _________.

a)

Translation Lookaside Buffer

b)

Stack

c)

Process Control Block

d)

Program Control Block

7.

Distributed OS works on the ________ principle

a)

Multi system image

b)

File Foundation

c)

Networking image

d)

Single system image

8.

The problem of fragmentation arises in ________.

a)

Stack allocation storage

b)

Heap allocation

c)

Stack allocation storage

d)

Stack allocation with dynamic binding

9.

Which file system DOS typically use?

a)

FAT16

b)

FAT32

c)

NTFS

d)

LMFS

10.

The program is known as _________ which interacts with the inner part of called kernel

a)

Compiler

b)

Protocol

c)

Shell

d)

Device Driver

11.

The time taken by the disk arm to locate the specific address of a sector for getting information is called __________.

a)

Search Time

b)

Rotational Latency

c)

Seek Time

d)

Response Time

12.

Which file system does Windows 95 typically use ?

a)

FAT16

b)

FAT32

c)

NTFS

d)

LMFS

13.

A ___________ contains information about the file, including ownership, permissions, and location of the file contents.

a)

File

b)

File Control Block (FCB)

c)

File system

d)

Device drivers

14.

Identify the odd thing in the services of operating system.

a)

Accounting

b)

Protection

c)

Error detection and correction

d)

Dead lock handling

15.

Cryptography technique is used in ________.

a)

Polling

b)

Protection

c)

File Management

d)

Job Scheduling

16.

Which of the following is not an advantage of multiprogramming?

a)

increased throughput

b)

shorter response time

c)

decreased operating-system overhead

d)

ability to assign priorities to jobs

e)

None of the above

17.

In ______ OS, the response time is very critical.

a)

Multitasking

b)

Online

c)

Batch

d)

Real-time

18.

An optimal scheduling algorithm in terms of minimizing the average waiting time of a given set of processes is ______

a)

Round robin scheduling algorithm

b)

FCFS scheduling algorithm

c)

Shorest job - first scheduling algorithm

d)

None of the above

19.

Which technique was introduced because a single job could not keep both the CPU and the I/O devices busy?

a)

Spooling

b)

Multiprogramming

c)

Preemptive scheduling

d)

Time-sharing

20.

Inter process communication can be done through __________.

a)

Messages

b)

Mails

c)

System Calls

d)

Traps

21.

In Priority Scheduling a priority number (integer) is associated with each process. The CPU is allocated to the process with the highest priority (smallest integer = highest priority). The problem of, Starvation ? low priority processes may never execute, is resolved by __________.

a)

Mutual Exclusion

b)

Aging

c)

Terminating the process

d)

Semaphore

22.

CPU performance is measured through ________.

a)

Throughput

b)

MHz

c)

Flaps

d)

None of the above

e)

lêu lêu đố anh bắt được em :3

23.

PCB is ________

a)

Printed Circuit Board

b)

Process Control Block

c)

Printed Control Board

d)

Process Center Block

24.

Software is a program that directs the overall operation of the computer, facilitates its use and interacts with the user. What are the different types of this software ?

a)

Operating system

b)

Languages

c)

Utilities

d)

All of the above

25.

A __________ is a software that manages the time of a microprocessor to ensure that all time critical events are processed as efficiently as possible. This software allows the system activities to be divided into multiple independent elements called tasks.

a)

Shell

b)

Kernel

c)

Processor

d)

Device Driver

26.

The primary job of the operating system of a computer is to ________.

a)

manage resources

b)

provide utilities

c)

command resources

d)

be user friendly

27.

With the round robin CPU scheduling in a time-shared system ________.

a)

Using extremely small time slices degenerate in to last in first out algorithm

b)

Using very large time slice degenerates in to first come first served algorithm

c)

Using medium sized time slices leads to shortest request time first algorithm

d)

Using extremely small time slices improve performance

28.

Which of the following is a criterion to evaluate a scheduling algorithm?

a)

CPU Utilization: Keep CPU utilization as high as possible.

b)

Throughput: number of processes completed per unit time

c)

Waiting Time: Amount of time spent ready to run but not running

d)

All of the above

29.

Which of the following is contained in Process Control Block (PCB)?

a)

Process Number

b)

List of Open files

c)

Memory Limits

d)

All of the Above

30.

Super computers typically employ _______.

a)

Desktop OS

b)

Real-time Operating System

c)

Multiprocessors OS

d)

None of the above

e)

All of the above

31.

Consider the two statements.

(A) A network operating system, the users access remote resources in the same manner as local resource.

(B) In a distributed operating system, the user can access remote resources either by logging into the appropriate remote machine or transferring data from the remote machine to their own machine. Which of the statement is true?

a)

Only A

b)

Only B

c)

Both A and B False

d)

Both A and B True

32.

Which of the following will determine your choice of systems software for your computer ?

one ore more:

a)

(1) Is the applications software you want to use compatible with it ?

b)

(2) Is it expensive ?

c)

(3) Is it compatible with your hardware ?

33.

What is a shell ?

a)

It is a command interpreter

b)

It is a pointer

c)

It is a thread activity

d)

It is a service

34.

The operating system manages ________.

a)

Memory

b)

Processor

c)

Disks and I/O devices

d)

All of the above

e)

None of the above

35.

The Hardware mechanism that enables a device to notify the CPU is called __________.

a)

Polling

b)

Interrupt

c)

System Call

d)

None of the above

36.

___________ begins at the root and follows a path down to the specified file

a)

Relative path name

b)

Absolute path name

c)

Standalone name

d)

All of the above

37.

Process State is a part of

a)

Process Control Block

b)

Printed Circuit Board

c)

File Allocation Table

d)

None of the above

38.

Virtual Memory is commonly implemented by __________.

a)

Segmentation

b)

Swapping

c)

Demand Paging

d)

None of the above

39.

Virtual memory is __________.

a)

An extremely large main memory

b)

An extremely large secondary memory

c)

An illusion of extremely large main memory

d)

A type of memory used in super computers

40.

The high paging activity is called ________.

a)

Inter process communication

b)

Thrashing

c)

Context Switch

d)

None of the above

41.

The kernel keeps track of the state of each task by using a data structure called ________.

a)

Process Control Block

b)

User Control Block

c)

Memory Control Block

d)

None of the above

42.

_________ page replacement alogorithm suffers from Belady's anamoly.

a)

Optimal Page Replacement

b)

LRU

c)

FIFO

d)

Both LRU and FIFO

43.

A program at the time of executing is called ________.

a)

Dynamic Program

b)

Static Program

c)

Binded Program

d)

A Process

44.

_________ is a high speed cache used to hold recently referenced page table entries a part of paged virtual memory

a)

Translation Lookaside buffer

b)

Inverse page table

c)

Segmented page table

d)

All the above

45.

If you don¿t know which version of MS-DOS you are working with, which command will you use after booting your operating system ?

a)

FORMAT command

b)

DIR command

c)

VER command

d)

DISK command

e)

None of the above

46.

_________ OS pays more attention on the meeting of the time limits

a)

Distributed

b)

Network

c)

Online

d)

Real time

47.

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

a)

Safe

b)

Dead Lock

c)

Unsafe

d)

Starvation

48.

The removal of process from active contention of CPU and reintroduce them into memory later is known as ____________.

a)

Interrupt

b)

Swapping

c)

Signal

d)

Thread

49.

The problem of thrashing is effected scientifically by ________.

a)

Program Structure

b)

Program Size

c)

Primary Storage Size

d)

None of the above

50.

Paging _________.

a)

solves the memory fragmentation problem

b)

allows modular programming

c)

allows structured programming

d)

avoids deadlock

51.

A thread is a __________ process

a)

Heavy Weight

b)

Mutliprocess

c)

Inter Thread

d)

Light weight

52.

_________ allocates the largest hole (free fragmant) available in the memory.

a)

First Fit

b)

Best Fit

c)

Worst Fit

d)

None of the above

e)

All of the above

53.

Number of CPU registers in a system depends on ____________.

a)

Operating System

b)

Computer Architecture

c)

Computer Organization

d)

All of the above

54.

A major problem with priority scheduling is _________.

a)

Definite blocking

b)

Starvation

c)

Low priority

d)

None of the above

55.

Which directory implementation is used in most Operating System?

a)

Single level directory structure

b)

Two level directory structure

c)

Tree directory structure

d)

Acyclic directory structure

56.

The term " Operating System " means ________.

a)

A set of programs which controls computer working

b)

The way a computer operator works

c)

Conversion of high-level language in to machine level language

d)

The way a floppy disk drive operates

57.

The operating system of a computer serves as a software interface between the user and the ________.

a)

Hardware

b)

Peripheral

c)

Memory

d)

Screen

58.

The collection of processes on the disk that is waiting to be brought into memory for execution forms the ___________

a)

Ready queue

b)

Device queue

c)

Input queue

d)

Priority queue

59.

It is not the layer of the Operating system.

a)

Kernel

b)

Application program

c)

Shell

d)

Critical selection

60.

Who is called a supervisor of computer acitvity ?

a)

Memory

b)

Operating System

c)

I/O Devices

d)

Control Unit

61.

Consider the two statements.

(A) Protection is an internal problem.

(B) Security is considered as an external environment within which the system works. Which of the statement is not true?

a)

Only A

b)

Only B

c)

Both A and B

d)

None of the above

62.

The process related to process control, file management, device management, information about system and communication that is requested by any higher level language can be performed by __________.

a)

Editors

b)

Compilers

c)

System Call

d)

Caching

63.

Which scheduler controls the degree of multiprogramming?

a)

Short term scheduler

b)

Long term scheduler

c)

Middle term scheduler

d)

None of the above

64.

What is the name of the software which can be legally compiled and often used for free?

a)

Shareware program

b)

Public domain program

c)

Firmware program

d)

Mindware

e)

None of the above

65.

In interactive environments such as time-sharing systems, the primary requirement is to provide reasonably good response time and in general, to share system resources equitably. In such situations, the scheduling algorithm that is most popularly applied is ________.

a)

Shortest Remaining Time Next (SRTN) Scheduling

b)

Priority Based Preemptive Scheduling

c)

Round Robin Scheduling

d)

None of the above

66.

Thrashing occurs ________.

a)

when excessive swapping takes place

b)

when you thrash your computer

c)

whenever deadlock occurs

d)

when no swapping takes place

67.

In memory systems, boundary registers ________.

a)

are used for temporary program variable storage

b)

are only necessary with fixed partitions

c)

track page boundaries

d)

track the beginning and ending of programs

68.

The principle of locality of reference justifies the use of ________.

a)

reenterable

b)

non reusable

c)

virtual memory

d)

cache memory

69.

The section of code which accesses shared variables is called as __________.

a)

Critical section

b)

Block

c)

Procedure

d)

Semaphore

70.

In memory management , a technique called as paging, physical memory is broken into fixed-sized blocks called ___________.

a)

Pages

b)

Frames

c)

Blocks

d)

Segments

71.

The state of a process after it encounters an I/O instruction is __________.

a)

Ready

b)

Blocked/Waiting

c)

Idle

d)

Running

72.

In one of the deadlock prevention methods, impose a total ordering of all resource types, and require that each process requests resources in an increasing order of enumeration. This voilates the _______________ condition of deadlock

a)

Mutual exclusion

b)

Hold and Wait

c)

Circular Wait

d)

No Preemption

73.

Which of the following file name extension suggests that the file is Backup copy of another file ?

a)

TXT

b)

COM

c)

BAK

d)

BAS

74.

The higher versions of operating systems are so written that programs designed for earlier versions can still be run. What is it called ?

a)

Up gradiability

b)

Upward mobility

c)

Universality

d)

Upward Compatibility

75.

A scheduling algorithm is fair

a)

if no process faces starvation

b)

if a process is starved, detect it and run it with high priority

c)

if it uses semaphores

d)

only if a queue is used for scheduling

76.

Semaphore can be used for solving __________.

a)

Wait & signal

b)

Deadlock

c)

Synchronization

d)

Priority

77.

What is the name of the software which deals with the running of the actual computer and not with the programming problems?

a)

Operating system

b)

Systems program

c)

Object program

d)

Source program

78.

Which the following do not belong to queues for processed?

a)

Job Queue

b)

PCB Queue

c)

Device Queue

d)

Ready Queue

79.

When the process issues an I/O request:

a)

It is placed in an I/O queue

b)

It is placed in a waiting queue

c)

It is placed in the ready queue

d)

It is placed in the Job queue

80.

What is long-term scheduler?

a)

It selects processes which have to be brought into the ready queue

b)

It selects processes which have to be executed next and allocates CPU

c)

It selects processes which heave to remove from memory by swapping

d)

None of the above

81.

If all processes I/O bound, the ready queue will almost always be ____ and the Short term Scheduler will have a ___ to do

a)

full, little

b)

full, lot

c)

empty, little

d)

empty, lot

82.

What is a medium-term scheduler?

a)

It selects which process has to be brought into the ready queue

b)

It selects which process has to be executed next and allocates CPU

c)

It selects which process to remove from memory by swapping

d)

None of the above

83.

What is a short-term scheduler?

a)

It selects which process has to be brought into the ready queue

b)

It selects which process has to be executed next and allocates CPU

c)

It selects which process to remove from memory by swapping

d)

None of the above

84.

The primary distinction between the short term scheduler and the long term scheduler is:

a)

The length of their queues

b)

The type of processes they schedule

c)

The frequency of their execution

d)

None of these

85.

The only state transition that is initiated by the user process itself is:

a)

block

b)

dispatch

c)

wake up

d)

timer run out

e)

None of the above

86.

In a time-sharing operating system, when the time slot given to a process is completed, the process goes from the running state to the:

a)

Blocked state

b)

Ready state

c)

Suspended state

d)

Terminated state

87.

In a multiprogramming environment:

a)

the processor executes more than one process at a time

b)

the programs are developed by more than one person

c)

more than one process resides in the memory

d)

a single user can execute many programs at the same time

88.

Suppose that a process is in “Blocked” state waiting for some I/O service. When the service is completed, it goes to the:

a)

Running state

b)

Ready state

c)

Suspended state

d)

Terminated state

e)

À thế à, bỏ câu này nhé 😘

89.

The context of a process in the PCB of a process does not contain:

a)

the value of the CPU registers

b)

the process state

c)

memory-management information

d)

context switch time

90.

Which of the following does not interrupt a running processes?

a)

A device

b)

Timer

c)

Scheduler process

d)

Power failure

e)

Câu này dễ, mà xin lỗi tao không biết câu này 😗

91.

Which module gives control of the CPU to the process selected by the short-term scheduler?

a)

dispatcher

b)

interrupt

c)

scheduler

d)

none of the above

92.

The processes that are residing in main memory and are ready and waiting to execute are kept on a list called:

a)

ready queue

b)

job queue

c)

wait queue

d)

device queue

93.

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

a)

waiting time

b)

turnaround time

c)

response time

d)

throughput

94.

Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?

a)

first-come, first-served scheduling

b)

shortest job scheduling

c)

priority scheduling

d)

none of the mentioned

95.

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

96.

Time quantum is defined in :

a)

shortest job scheduling algorithm

b)

round robin scheduling algorithm

c)

priority scheduling algorithm

d)

multilevel queue scheduling algorithm

97.

In multilevel feedback scheduling algorithm

a)

a process can move to a different classified ready queue

b)

classification of ready queue is permanent

c)

processes are not classified into groups

d)

none of the mentioned

98.

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 above

99.

Three important design principles in operating systems are:

a)

throughput, response time, and support for priority

b)

caching, virtualization, and support for concurrency

c)

parallelism, concurrency, and multi-anything

d)

All of the above

100.

In message-passing IPC on a Linux system, the maximum message size permitted is:

a)

1 byte

b)

4 bytes

c)

32 bytes

d)

64 bytes

e)

none of the above

101.

When a process is created using the classical fork() system call, which of the following is not inherited by the child process?

a)

process address space

b)

process ID

c)

user ID

d)

open files

e)

signal handlers

102.

The text segment of a process address space contains:

a)

the statically allocated data associated with the process

b)

the dynamically allocated data associated with the process

c)

the executable code associated with the process

d)

the inter-process communication (IPC) messages for the process

e)

the text-messaging chat messages for the process

103.

The threading model supported by the Linux operating system is:

a)

many-to-one

b)

one-to-one

c)

one-to-many

d)

mayny-to-many

e)

all of the above

104.

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 above

105.

By operating system, the resource management can be done via

a)

(1) time division multiplexing

b)

(2) space division multiplexing

c)

both (1) and (2)

d)

none of the above

106.

If a process fails, most operating system write the error information to a ______

a)

log file

b)

another running process

c)

new file

d)

none of the above

107.

Which facility dynamically adds probes to a running system, both in user processes and in the kernel?

a)

DTrace

b)

DLocate

c)

DMap

d)

DAdd

108.

Which one of the following is not a real time operating system?

a)

VxWorks

b)

Windows CE

c)

RTLinux

d)

Palm OS

109.

The OS X has ____________

a)

monolithic kernel

b)

hybrid kernel

c)

microkernel

d)

monolithic kernel with modules

110.

File is generally defined to be:

a)

A collection of similar records

b)

Similar to a condition variable

c)

An orchestration tool for containers

d)

A process, a thread activity, or, generally, a unit of computation on a computer

111.

____ is a specialized WRITE command for existing data files that allows for adding records to end of the file.

a)

APPEND

b)

UPDATE

c)

REWRITE

d)

MODIFY

112.

Which is not the function of the OS

a)

Memory management

b)

Disk management

c)

Application management

d)

Virus protection

113.

Programmed I/O should be acceptable for which of the following system?

a)

Interactive systems

b)

Multiprogramming systems

c)

Embedded systems

d)

None of the above

114.

(...) provide an object-oriented way of implementing file systems, allows the same system call interface ( the API) to be used for different types of file systems

a)

FCB, File Control Block

b)

VFS, Virtual File Systems

c)

FSS, File System Structure

d)

All of the above

115.

Which of the following is not an advantage of multiprogramming?

a)

increased throughput

b)

shorter response time

c)

decreased operating-system overhead

d)

ability to assign priorities to jobs

e)

None of the above