Font size
Worksheetshe dieu hanh
Total questions: 115
Worksheet time: 1hrs 4mins
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 _________
Dynamic loading
Dynamic linking
Static loading
Overlays
Which of the following is crucial time while accessing data on the disk?
Seek time
Rotational time
Transmission time
Waiting time
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 ___________.
Interrupt and Polling
Polling and Spooling
Polling and Interrupt
Deadlock and Starvation
Unix Operating System is an __________.
Time Sharing Operating System
Multi-User Operating System
Multi-tasking Operating System
All the Above
Which of the following memory allocation scheme suffers from External fragmentation?
Pure demand paging
Swapping
Segmentation
Paging
Information about a process is maintained in a _________.
Translation Lookaside Buffer
Stack
Process Control Block
Program Control Block
Distributed OS works on the ________ principle
Multi system image
File Foundation
Networking image
Single system image
The problem of fragmentation arises in ________.
Stack allocation storage
Heap allocation
Stack allocation storage
Stack allocation with dynamic binding
Which file system DOS typically use?
FAT16
FAT32
NTFS
LMFS
The program is known as _________ which interacts with the inner part of called kernel
Compiler
Protocol
Shell
Device Driver
The time taken by the disk arm to locate the specific address of a sector for getting information is called __________.
Search Time
Rotational Latency
Seek Time
Response Time
Which file system does Windows 95 typically use ?
FAT16
FAT32
NTFS
LMFS
A ___________ contains information about the file, including ownership, permissions, and location of the file contents.
File
File Control Block (FCB)
File system
Device drivers
Identify the odd thing in the services of operating system.
Accounting
Protection
Error detection and correction
Dead lock handling
Cryptography technique is used in ________.
Polling
Protection
File Management
Job Scheduling
Which of the following is not an advantage of multiprogramming?
increased throughput
shorter response time
decreased operating-system overhead
ability to assign priorities to jobs
None of the above
In ______ OS, the response time is very critical.
Multitasking
Online
Batch
Real-time
An optimal scheduling algorithm in terms of minimizing the average waiting time of a given set of processes is ______
Round robin scheduling algorithm
FCFS scheduling algorithm
Shorest job - first scheduling algorithm
None of the above
Which technique was introduced because a single job could not keep both the CPU and the I/O devices busy?
Spooling
Multiprogramming
Preemptive scheduling
Time-sharing
Inter process communication can be done through __________.
Messages
Mails
System Calls
Traps
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 __________.
Mutual Exclusion
Aging
Terminating the process
Semaphore
CPU performance is measured through ________.
Throughput
MHz
Flaps
None of the above
lêu lêu đố anh bắt được em :3
PCB is ________
Printed Circuit Board
Process Control Block
Printed Control Board
Process Center Block
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 ?
Operating system
Languages
Utilities
All of the above
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.
Shell
Kernel
Processor
Device Driver
The primary job of the operating system of a computer is to ________.
manage resources
provide utilities
command resources
be user friendly
With the round robin CPU scheduling in a time-shared system ________.
Using extremely small time slices degenerate in to last in first out algorithm
Using very large time slice degenerates in to first come first served algorithm
Using medium sized time slices leads to shortest request time first algorithm
Using extremely small time slices improve performance
Which of the following is a criterion to evaluate a scheduling algorithm?
CPU Utilization: Keep CPU utilization as high as possible.
Throughput: number of processes completed per unit time
Waiting Time: Amount of time spent ready to run but not running
All of the above
Which of the following is contained in Process Control Block (PCB)?
Process Number
List of Open files
Memory Limits
All of the Above
Super computers typically employ _______.
Desktop OS
Real-time Operating System
Multiprocessors OS
None of the above
All of the above
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?
Only A
Only B
Both A and B False
Both A and B True
Which of the following will determine your choice of systems software for your computer ?
one ore more:
(1) Is the applications software you want to use compatible with it ?
(2) Is it expensive ?
(3) Is it compatible with your hardware ?
What is a shell ?
It is a command interpreter
It is a pointer
It is a thread activity
It is a service
The operating system manages ________.
Memory
Processor
Disks and I/O devices
All of the above
None of the above
The Hardware mechanism that enables a device to notify the CPU is called __________.
Polling
Interrupt
System Call
None of the above
___________ begins at the root and follows a path down to the specified file
Relative path name
Absolute path name
Standalone name
All of the above
Process State is a part of
Process Control Block
Printed Circuit Board
File Allocation Table
None of the above
Virtual Memory is commonly implemented by __________.
Segmentation
Swapping
Demand Paging
None of the above
Virtual memory is __________.
An extremely large main memory
An extremely large secondary memory
An illusion of extremely large main memory
A type of memory used in super computers
The high paging activity is called ________.
Inter process communication
Thrashing
Context Switch
None of the above
The kernel keeps track of the state of each task by using a data structure called ________.
Process Control Block
User Control Block
Memory Control Block
None of the above
_________ page replacement alogorithm suffers from Belady's anamoly.
Optimal Page Replacement
LRU
FIFO
Both LRU and FIFO
A program at the time of executing is called ________.
Dynamic Program
Static Program
Binded Program
A Process
_________ is a high speed cache used to hold recently referenced page table entries a part of paged virtual memory
Translation Lookaside buffer
Inverse page table
Segmented page table
All the above
If you don¿t know which version of MS-DOS you are working with, which command will you use after booting your operating system ?
FORMAT command
DIR command
VER command
DISK command
None of the above
_________ OS pays more attention on the meeting of the time limits
Distributed
Network
Online
Real time
A process said to be in ___________ state if it was waiting for an event that will never occur.
Safe
Dead Lock
Unsafe
Starvation
The removal of process from active contention of CPU and reintroduce them into memory later is known as ____________.
Interrupt
Swapping
Signal
Thread
The problem of thrashing is effected scientifically by ________.
Program Structure
Program Size
Primary Storage Size
None of the above
Paging _________.
solves the memory fragmentation problem
allows modular programming
allows structured programming
avoids deadlock
A thread is a __________ process
Heavy Weight
Mutliprocess
Inter Thread
Light weight
_________ allocates the largest hole (free fragmant) available in the memory.
First Fit
Best Fit
Worst Fit
None of the above
All of the above
Number of CPU registers in a system depends on ____________.
Operating System
Computer Architecture
Computer Organization
All of the above
A major problem with priority scheduling is _________.
Definite blocking
Starvation
Low priority
None of the above
Which directory implementation is used in most Operating System?
Single level directory structure
Two level directory structure
Tree directory structure
Acyclic directory structure
The term " Operating System " means ________.
A set of programs which controls computer working
The way a computer operator works
Conversion of high-level language in to machine level language
The way a floppy disk drive operates
The operating system of a computer serves as a software interface between the user and the ________.
Hardware
Peripheral
Memory
Screen
The collection of processes on the disk that is waiting to be brought into memory for execution forms the ___________
Ready queue
Device queue
Input queue
Priority queue
It is not the layer of the Operating system.
Kernel
Application program
Shell
Critical selection
Who is called a supervisor of computer acitvity ?
Memory
Operating System
I/O Devices
Control Unit
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?
Only A
Only B
Both A and B
None of the above
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 __________.
Editors
Compilers
System Call
Caching
Which scheduler controls the degree of multiprogramming?
Short term scheduler
Long term scheduler
Middle term scheduler
None of the above
What is the name of the software which can be legally compiled and often used for free?
Shareware program
Public domain program
Firmware program
Mindware
None of the above
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 ________.
Shortest Remaining Time Next (SRTN) Scheduling
Priority Based Preemptive Scheduling
Round Robin Scheduling
None of the above
Thrashing occurs ________.
when excessive swapping takes place
when you thrash your computer
whenever deadlock occurs
when no swapping takes place
In memory systems, boundary registers ________.
are used for temporary program variable storage
are only necessary with fixed partitions
track page boundaries
track the beginning and ending of programs
The principle of locality of reference justifies the use of ________.
reenterable
non reusable
virtual memory
cache memory
The section of code which accesses shared variables is called as __________.
Critical section
Block
Procedure
Semaphore
In memory management , a technique called as paging, physical memory is broken into fixed-sized blocks called ___________.
Pages
Frames
Blocks
Segments
The state of a process after it encounters an I/O instruction is __________.
Ready
Blocked/Waiting
Idle
Running
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
Mutual exclusion
Hold and Wait
Circular Wait
No Preemption
Which of the following file name extension suggests that the file is Backup copy of another file ?
TXT
COM
BAK
BAS
The higher versions of operating systems are so written that programs designed for earlier versions can still be run. What is it called ?
Up gradiability
Upward mobility
Universality
Upward Compatibility
A scheduling algorithm is fair
if no process faces starvation
if a process is starved, detect it and run it with high priority
if it uses semaphores
only if a queue is used for scheduling
Semaphore can be used for solving __________.
Wait & signal
Deadlock
Synchronization
Priority
What is the name of the software which deals with the running of the actual computer and not with the programming problems?
Operating system
Systems program
Object program
Source program
Which the following do not belong to queues for processed?
Job Queue
PCB Queue
Device Queue
Ready Queue
When the process issues an I/O request:
It is placed in an I/O queue
It is placed in a waiting queue
It is placed in the ready queue
It is placed in the Job queue
What is long-term scheduler?
It selects processes which have to be brought into the ready queue
It selects processes which have to be executed next and allocates CPU
It selects processes which heave to remove from memory by swapping
None of the above
If all processes I/O bound, the ready queue will almost always be ____ and the Short term Scheduler will have a ___ to do
full, little
full, lot
empty, little
empty, lot
What is a medium-term scheduler?
It selects which process has to be brought into the ready queue
It selects which process has to be executed next and allocates CPU
It selects which process to remove from memory by swapping
None of the above
What is a short-term scheduler?
It selects which process has to be brought into the ready queue
It selects which process has to be executed next and allocates CPU
It selects which process to remove from memory by swapping
None of the above
The primary distinction between the short term scheduler and the long term scheduler is:
The length of their queues
The type of processes they schedule
The frequency of their execution
None of these
The only state transition that is initiated by the user process itself is:
block
dispatch
wake up
timer run out
None of the above
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:
Blocked state
Ready state
Suspended state
Terminated state
In a multiprogramming environment:
the processor executes more than one process at a time
the programs are developed by more than one person
more than one process resides in the memory
a single user can execute many programs at the same time
Suppose that a process is in “Blocked” state waiting for some I/O service. When the service is completed, it goes to the:
Running state
Ready state
Suspended state
Terminated state
À thế à, bỏ câu này nhé 😘
The context of a process in the PCB of a process does not contain:
the value of the CPU registers
the process state
memory-management information
context switch time
Which of the following does not interrupt a running processes?
A device
Timer
Scheduler process
Power failure
Câu này dễ, mà xin lỗi tao không biết câu này 😗
Which module gives control of the CPU to the process selected by the short-term scheduler?
dispatcher
interrupt
scheduler
none of the above
The processes that are residing in main memory and are ready and waiting to execute are kept on a list called:
ready queue
job queue
wait queue
device queue
The interval from the time of submission of a process to the time of completion is termed as
waiting time
turnaround time
response time
throughput
Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?
first-come, first-served scheduling
shortest job scheduling
priority scheduling
none of the mentioned
In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of
all process
currently running process
parent process
init process
Time quantum is defined in :
shortest job scheduling algorithm
round robin scheduling algorithm
priority scheduling algorithm
multilevel queue scheduling algorithm
In multilevel feedback scheduling algorithm
a process can move to a different classified ready queue
classification of ready queue is permanent
processes are not classified into groups
none of the mentioned
Which one of the following can not be scheduled by the kernel?
kernel level thread
user level thread
process
none of the above
Three important design principles in operating systems are:
throughput, response time, and support for priority
caching, virtualization, and support for concurrency
parallelism, concurrency, and multi-anything
All of the above
In message-passing IPC on a Linux system, the maximum message size permitted is:
1 byte
4 bytes
32 bytes
64 bytes
none of the above
When a process is created using the classical fork() system call, which of the following is not inherited by the child process?
process address space
process ID
user ID
open files
signal handlers
The text segment of a process address space contains:
the statically allocated data associated with the process
the dynamically allocated data associated with the process
the executable code associated with the process
the inter-process communication (IPC) messages for the process
the text-messaging chat messages for the process
The threading model supported by the Linux operating system is:
many-to-one
one-to-one
one-to-many
mayny-to-many
all of the above
Which one of the following error will be handle by the operating system?
power failure
lack of paper in printer
connection failure in the network
all of the above
By operating system, the resource management can be done via
(1) time division multiplexing
(2) space division multiplexing
both (1) and (2)
none of the above
If a process fails, most operating system write the error information to a ______
log file
another running process
new file
none of the above
Which facility dynamically adds probes to a running system, both in user processes and in the kernel?
DTrace
DLocate
DMap
DAdd
Which one of the following is not a real time operating system?
VxWorks
Windows CE
RTLinux
Palm OS
The OS X has ____________
monolithic kernel
hybrid kernel
microkernel
monolithic kernel with modules
File is generally defined to be:
A collection of similar records
Similar to a condition variable
An orchestration tool for containers
A process, a thread activity, or, generally, a unit of computation on a computer
____ is a specialized WRITE command for existing data files that allows for adding records to end of the file.
APPEND
UPDATE
REWRITE
MODIFY
Which is not the function of the OS
Memory management
Disk management
Application management
Virus protection
Programmed I/O should be acceptable for which of the following system?
Interactive systems
Multiprogramming systems
Embedded systems
None of the above
(...) 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
FCB, File Control Block
VFS, Virtual File Systems
FSS, File System Structure
All of the above
Which of the following is not an advantage of multiprogramming?
increased throughput
shorter response time
decreased operating-system overhead
ability to assign priorities to jobs
None of the above
