Trang chủ Đề thi 868

Câu Hỏi Trắc Nghiệm Ôn Tập Hệ Điều Hành 4 - Đại Học Sư Phạm Kỹ Thuật TP.HCM Miễn Phí, Có Đáp Án

Ôn tập môn Hệ Điều Hành 4 với các câu hỏi trắc nghiệm dành cho sinh viên Đại học Sư Phạm Kỹ Thuật TP.HCM. Bộ câu hỏi bao gồm các kiến thức về hệ điều hành, quản lý tài nguyên, và cấu trúc hệ thống. Làm bài trắc nghiệm online miễn phí, có đáp án chi tiết giúp sinh viên củng cố kiến thức và chuẩn bị tốt cho các kỳ thi.

Từ khoá: câu hỏi trắc nghiệm hệ điều hànhôn tập hệ điều hành 4Đại học Sư Phạm Kỹ Thuật TP.HCMtrắc nghiệm hệ điều hành có đáp ánbài tập hệ điều hành miễn phíôn thi hệ điều hànhtrắc nghiệm hệ điều hành 4học hệ điều hành onlinehệ điều hành 4 SPKTbài tập hệ điều hành

Số câu hỏi: 60 câuSố mã đề: 1 đềThời gian: 1 giờ

11,409 lượt xem 868 lượt làm bài

Bạn chưa làm đề thi này!

Xem trước nội dung
Câu 1: 1 điểm
The process is ……..
A.  
an instance of a program in execution
B.  
a program only
C.  
a processor state
D.  
the kernel state
Câu 2: 1 điểm
The mechanism that brings a page into memory only when it is needed is called …..
A.  
segmentation
B.  
fragmentation
C.  
demand paging
D.  
page replacement
Câu 3: 1 điểm
The two paradigms of IPC are ………… and …….
A.  
call, reply
B.  
shared memory, message passing
C.  
send, receive
D.  
call by value, call by reference
Câu 4: 1 điểm
A program is passive while a process is ……….
A.  
inactive
B.  
spontaneous
C.  
active
D.  
impulse
Câu 5: 1 điểm
FIFO scheduling is ……….
A.  
preemptive scheduling
B.  
non-preemptive scheduling
C.  
deadline scheduling
D.  
fair share scheduling
Câu 6: 1 điểm
……… ensures that once the transaction completes successively, the results of the operations become permanent.
A.  
serializability
B.  
synchronizability
C.  
atomicity
D.  
durability
Câu 7: 1 điểm
A process is created and is initially put in the ……..
A.  
ready queue
B.  
device queue
C.  
i/o queue
D.  
waiting queue
Câu 8: 1 điểm
Which directory implementation is used in most the Operating System?
A.  
single-level directory structure
B.  
two-level directory structure
C.  
tree directory structure
D.  
acyclic directory structure
Câu 9: 1 điểm
Isolation property is also known as ………
A.  
Performance
B.  
Serializability
C.  
Durability
D.  
Atomicity
Câu 10: 1 điểm
A thread is a ……….
A.  
task
B.  
process
C.  
program
D.  
lightweight process
Câu 11: 1 điểm
The interval from the fine submission of a process to the time of completion is the ……
A.  
waiting time
B.  
blocked time
C.  
turnaround time
D.  
response time
Câu 12: 1 điểm
The term “Operating System” means ……….
A.  
a set of programs that controls computer working
B.  
the way a computer operator works
C.  
conversion of a high-level language into a machine-level language
D.  
the way a floppy disk drive operates
Câu 13: 1 điểm
Generally we have user-level threads and ………..
A.  
Programmer-level thread
B.  
kernel-level thread
C.  
program-level thread
D.  
process level thread
Câu 14: 1 điểm
To ensure that the ……… condition never occurs in the system, we must guarantee that, whenever a process requests a resource, it does not have any other resource.
A.  
mutual exclusion
B.  
no-preemption
C.  
circular waits
D.  
hold and wait
Câu 15: 1 điểm
Resource locking ……..
A.  
allows multiple tasks to simultaneously use resource
B.  
forces only on task to use any resource at any time
C.  
can easily cause a deadlock condition
D.  
is not used for disk drives
Câu 16: 1 điểm
A program responsible for assigning the CPU to the process that has been selected by the short-term scheduler is known as ………
A.  
scheduler
B.  
dispatcher
C.  
debugger
D.  
compiler
Câu 17: 1 điểm
The ………. instruct the Kernel to do various operations of the calling program and exchange data between the Kernel at the program.
A.  
shell
B.  
editors
C.  
system calls
D.  
commands
Câu 18: 1 điểm
Which of the following buffering strategies are used in interprocess communication?
A.  
null pointer
B.  
single message buffer
C.  
multiple message buffer
D.  
all of the above
Câu 19: 1 điểm
The process of splitting of data into equal size partitions over multiple disks is known as …..
A.  
data stripping
B.  
array of disks
C.  
RAID
D.  
SCAN
Câu 20: 1 điểm
Pipes allow the transfer of data between processors in a ………. manner.
A.  
last in first out
B.  
shortest job first
C.  
multilevel queue
D.  
first in first out
Câu 21: 1 điểm
The process of storing extra or duplicate information used for rebuilding the lost information in event of disk failure is known as …
A.  
stripping
B.  
redundancy
C.  
disk array
D.  
RAID
Câu 22: 1 điểm
A thread that is to be canceled is often referred to as the…
A.  
target thread
B.  
thread cancellation
C.  
asynchronous cancellation
D.  
defined cancellation
Câu 23: 1 điểm
……….. ensures that every message sent to a group of receivers will be delivered to either all of them or none of them.
A.  
Ordered delivery
B.  
Atomicity
C.  
Survivability
D.  
Reliability
Câu 24: 1 điểm
An arrangement of records in a sequence in which they arrive is known as a ………..
A.  
pile
B.  
file
C.  
disk
D.  
directory
Câu 25: 1 điểm
……….. also known as monitor mode.
A.  
User mode
B.  
System mode
C.  
Unprivileged mode
D.  
Process mode
Câu 26: 1 điểm
The technique, for sharing the time of a computer among several jobs, which switches jobs so rapidly such that each job appears to have the computer to itself, is called ……..
A.  
time-sharing
B.  
time out
C.  
time domain
D.  
multitasking
Câu 27: 1 điểm
For batch and payroll applications which of the following file organization is better ……..
A.  
random file
B.  
sequential file
C.  
indexed file
D.  
hashed file
Câu 28: 1 điểm
Name the scheduler that selects among the processes that are ready to execute and allocates the CPU to one of them.
A.  
Long-term scheduler
B.  
Medium-term scheduler
C.  
Job scheduler
D.  
Short-term scheduler
Câu 29: 1 điểm
Failure during inter-process communication may be due to …..
A.  
loss of request transfer unit
B.  
single datagram messages
C.  
multi datagram messages
D.  
message passing
Câu 30: 1 điểm
The process of direct mapping by using some faster algorithms is called………
A.  
hashing
B.  
searching
C.  
sorting
D.  
indexing
Câu 31: 1 điểm
Name the system in which the processors do not share memory and each processor that its own local memory.
A.  
Tightly coupled system
B.  
Parallel processing system
C.  
Loosely coupled system
D.  
Batch processing system
Câu 32: 1 điểm
Which technique was introduced because a single job could not keep both the CPU and I/O devices busy?
A.  
Time-sharing
B.  
Spooling
C.  
preemptive scheduling
D.  
Multiprogramming
Câu 33: 1 điểm
Those directories in which the root directory has all system files and no other sub-directory is known as …
A.  
flat directory
B.  
single directory
C.  
hierarchical directory
D.  
indexed directory
Câu 34: 1 điểm
Which is responsible for maintaining all the important abstractions of the operating system?
A.  
Kernel
B.  
System libraries
C.  
System utilities
D.  
Daemons
Câu 35: 1 điểm
A four-message reliable IPC protocol for client-server communication works as ……..
A.  
request, reply, acknowledgment
B.  
reply, acknowledgment, request, acknowledgment
C.  
request, acknowledgment, reply, acknowledgment
D.  
request, request, reply, acknowledgment
Câu 36: 1 điểm
A path name that starts at the root directory is ……….
A.  
absolute
B.  
relative
C.  
hybrid
D.  
hierarchical
Câu 37: 1 điểm
Where does the problem of fragmentation occur?
A.  
Static storage allocation
B.  
Static allocation storage
C.  
Stack allocation with dynamic binding
D.  
Heap allocation
Câu 38: 1 điểm
Idempotency basically means ………
A.  
reliability
B.  
repeatability
C.  
Survivability
D.  
flexibility
Câu 39: 1 điểm
All path names are specified relative to the working directory ……..
A.  
absolute path name
B.  
relative path name
C.  
hybrid path name
D.  
hierarchical path name
Câu 40: 1 điểm
The time taken by the disk arm to locate the specific address of a sector for getting information is called ……..
A.  
rotational latency
B.  
seek time
C.  
search time
D.  
response time
Câu 41: 1 điểm
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
Câu 42: 1 điểm
What is the primary job of the operating system is a computer?
A.  
Command resources
B.  
Manage resources
C.  
Provide utilities
D.  
Be user friendly
Câu 43: 1 điểm
The ……… is a user process that initiates a remote procedure call.
A.  
client
B.  
server
C.  
network
D.  
operating system
Câu 44: 1 điểm
Which of the following memory allocation scheme suffers from external fragmentation?
A.  
Segmentation
B.  
Pure demand paging
C.  
Swapping
D.  
Paging
Câu 45: 1 điểm
Which of the following is used to remove of process from active contention of the CPU and reintroduce them into memory later?
A.  
Interrupt
B.  
Swapping
C.  
Signal
D.  
Thread
Câu 46: 1 điểm
The operating system manages …..
A.  
memory
B.  
processor
C.  
disk and I/O devices
D.  
all of the above
Câu 47: 1 điểm
Information about a process is maintained in a ………
A.  
stack
B.  
translation looks like a side buffer
C.  
process control block
D.  
program control block
Câu 48: 1 điểm
Paging ………
A.  
solves the memory fragmentation problem
B.  
allows modular programming
C.  
allows structured programming
D.  
avoids deadlock
Câu 49: 1 điểm
Which is not the layer of the Operating system?
A.  
Kernel
B.  
Shell
C.  
Application program
D.  
Critical Section
Câu 50: 1 điểm
Distributed OS works on the ………… principle.
A.  
file foundation
B.  
single system image
C.  
multi-system image
D.  
networking image
Câu 51: 1 điểm
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
Câu 52: 1 điểm
In ……. condition, processes are allowed to request new resources without releasing the resources that they are currently holding.
A.  
Mutual exclusion
B.  
Hold and wait
C.  
No preemption
D.  
Circular wait
Câu 53: 1 điểm
The time taken by the disk arm to locate the specific address of a sector for getting information is called …..
A.  
rotational delay
B.  
seek time
C.  
search time
D.  
response time
Câu 54: 1 điểm
The principle of locality of reference justifies the use of ……..
A.  
virtual memory
B.  
interrupts
C.  
main memory
D.  
cache memory
Câu 55: 1 điểm
In ………. condition, a resource that has been allocated to a process becomes available for allocation to another process only after it has been voluntarily released by the process holding it.
A.  
Mutual exclusion
B.  
Hold and wait
C.  
No preemption
D.  
Circular wait
Câu 56: 1 điểm
Identify the odd thing in the services of the operating system …
A.  
Accounting
B.  
Protection
C.  
Error detection and correction
D.  
Deadlock handling
Câu 57: 1 điểm
Multiprocessing ………..
A.  
makes the operating system simpler
B.  
allows multiple processes to run simultaneously
C.  
is completely understood by all major computer vendors
D.  
allows the same computer to have the multiple processors
Câu 58: 1 điểm
In …………. condition, two or more processes must form a circular chain in which each process is waiting for a resource that is held by the next member of the chain.
A.  
Mutual exclusion
B.  
Hold and wait
C.  
No preemption
D.  
Circular wait
Câu 59: 1 điểm
Which of the following is not the advantage of multiprogramming?
A.  
Increased throughput
B.  
Shorter response time
C.  
Decreased operating system overhead
D.  
Ability to assign priorities of jobs
Câu 60: 1 điểm
Which is not a state of the process?
A.  
Blocked
B.  
Running
C.  
Ready
D.  
Privileged