Hệ điều hành - Team SGAFs

Đề cương môn Hệ Điều Hành
Bản quyền thuộc Team SGAFs

Vui lòng không chỉnh sửa, xóa dữ liệu
(Không sửa lỗi chính tả)
NOTE
Chắc chắn đúng
Phân vân
Chắc chắn sai
=))) các bạn xem đông dậy
Các bạn xem thôi chứ đừng chỉnh sửa gì nha!!
Chúc qua môn
Trí Cá Chép: “Im lặng cho t làm bài ‘
Đề cương ôn tập 30 câu trắc nghiệm:

https://drive.google.com/file/d/1SyIV6kJ1wb4Qd87Qq7Xfxc8z7-uTcVT3/
view?usp=sharing
Kiểm tra đợt 1: (Max 9.5)
1. As a virtual machine manager, operating system provides a layer on the actual

hardware on which it performs the tasks of the user. And to the user, it seems
that all the work done is by the hardware.
Hãy chọn một:

Đúng
Sai
2. The instructions, which are not directly executed by the user but need to be
passed to the OS, are known as privileged instructions.
Hãy chọn một:
Đúng
Sai
3. The primary goals of operating system are convenience of the user and best
utilization of the hardware.
Hãy chọn một:

Đúng
Sai
4. Tập hợp các lệnh cần thiết để khởi động, nghĩa là để tải hệ điều hành vào trong
RAM được gọi là bộ khởi tạo (initialier).
Hãy chọn một:

Đúng
Sai
5. As a control program, operating system schedules and manages the allocation

of all resources in the computer system.
Hãy chọn một:

Đúng
Sai
6. Medium-term scheduler is invoked when there is need to swap out some

blocked process
7. . ______ shares characteristics with both hardware and software.
Select one:
Data.
None.
Software.
Operating system
8. Short-term scheduler is invoked when there is need to perform process

scheduling.
9. Long-term scheduler is invoked when there is need to perform job scheduling.
10. As a resource manager, operating system controls the user activities, I/O
access, and all other activities performed by the system.
Hãy chọn một:
Đúng
Sai
11. Layered architecture provides the modularity wherein there is a defined layer
for each group of functionality.
Hãy chọn một:
Đúng
Sai
12. Shell is the part wherein only essential modules of the operating system are
placed.
Hãy chọn một:
Đúng
Sai
13. System generation is the process of configuring the OS according to the

hardware and other specifications on a particular machine.
Hãy chọn một:
Đúng
Sai
14. An OS is a resource manager that in background manages the resources needed

for all the applications.
Hãy chọn một:
Đúng
Sai
15. From the system’s viewpoint, the operating system presents a friendly
environment wherein the user can work efficiently.
Hãy chọn một:
Đúng
Sai
16. An OS is a software that provides a working environment for the applications
of users
Hãy chọn một:
Đúng
Sai
17. Monolithic systems were not suitable for multi-programming/multi-tasking

environments due to the unprotected behaviour of the system.
Hãy chọn một:
Đúng
Sai
18. BIOS is a software that the OS uses to interface with different I/O devices like
keyboard, monitor, ports, and so on.
Hãy chọn một:
Đúng
Sai
19. An OS is a software that acts as an interface between the users and hardware of
the computer system.
Hãy chọn một:
Đúng
Sai
20. All the privileged instructions, that is, instructions that need to interact with
hardware and resources, and therefore passed on to the OS for execution, are
known as system calls.
Hãy chọn một:
Đúng
Sai
21. Multi-programming is the central concept in operating system that originates

all other concepts of operating system.
Hãy chọn một:
Đúng
Sai
22. Operating system is
Select one:
A collection of software routines
A collection of input-output devices
All of the options
A collection of hardware components
23. The set of instructions needed for booting, that is, to load the OS in RAM is
known as initialier.
Hãy chọn một:
Đúng
Sai
24. Hybrid architecture combines the features of microkernel and layered

architectures.
Hãy chọn một:
Đúng
Sai
25. System programs are utilities programs, which help the user and may call for
further system calls.
Hãy chọn một:
Đúng
Sai
26. .Interrupt vector is ___
Select one:
None of the mentioned
an address that is indexed to an interrupt handler
a unique identity given to an interrupt
a unique device number that is indexed by an address

27. .Which system call creates a new process in Unix?
Select one:
create
fork
release
new
28. From the system’s viewpoint, the operating system acts as an easy interface
between the user and computer system.
Hãy chọn một:
Đúng
Sai
29. .Direct Memory Access is used for ....
Select one:
All of the mentioned
High speed devices
Low speed devices
Utilizing CPU cycles
30. Multi-user systems place more than one job/program/task in the main memory
of the main computer system. The jobs are of different users who are connected
through terminals to the main computer. The jobs are scheduled by time-
sharing technique.
Hãy chọn một:
Đúng
Sai
31. Operating system
Select one:
provides a layered, user-friendly interface
links a program with the subroutines it references
None of the options
enables the programmer to draw a flowchart
32. .Which Operating System doesn’t support networking between computers?
Select one:
Windows 2000
Windows 95
Windows 3.1
Windows NT
33. Which operation is performed by an interrupt handler?
Select one:

Loading the current state of the system
Saving the interrupt handling code and executing it
Bringing back the system to the original state it was before the interrupt
occurred once done handling
34. Which of the following are loaded into main memory when the computer is
booted ?
Select one:
internal command instructions
utility programs
external command instructions
word processing instructions
35. From the user’s viewpoint, the operating system acts as a resource manager,
control program, and virtual machine manager.
Hãy chọn một:
Đúng
Sai
36. The operating system creates _____ from the physical computer.
Select one:
None.
Virtual device
Virtual space.
Virtual computers.
37. Which is the first program run on a computer when the computer boots up ?
Select one:
Operating system
System operations
System program
None
38. .The PID of the terminated child process is returned by which system call?
Select one:
wait
fork
exit
get
39. After receiving an interrupt from an I/O device, CPU _____
Select one:
hands over control of address bus and data bus to the interrupting device
branches off to the interrupt service routine immediately
branches off to the interrupt service routine after completion of the

current instruction
halts for a predetermined time

40. .Which of the following acts can cause a process to enter the Ready state?
Select one:
Process that has recently been admitted.
An I/O event has been completed.
It's waiting for its turn at the CPU.
41. .How does the software trigger an interrupt ?
Select one:
Running an interrupt trigger program
Executing a system program (sai)
Invoking a system call
Sending signals to CPU through bus
42. Multi-programming places more than one job/program/task in the main

memory.
Hãy chọn một:
Đúng
Sai
43. The operating system which was most popular in 1981 is called
Select one:
CP/M
MS-DOS
PC-DOS
OS/360
44. A system program that sets up an executable program in main memory ready
for execution is
Select one:
linker
assembler
loader
compiler
45. A type of systems software used on microcomputers is
Select one or more:
PC-DOS
Solaris
Androi
MS-DOS
46. . ______ is used in an operating system to separate mechanism from policy
Select one:
Multi level implementation.(sai)
Single level implementation.
None.
Two level implementation.
47. .Multiprogramming systems
Select one:
Are easier to develop than single programming systems.

Execute each job faster
Are used only one large mainframe computers.
Execute more jobs in the same time period.
48. When a time slot assigned to a process is completed in a time-sharing operating

system, the process transitions from running to _______
Select one:
Terminated state
Ready state
Waiting state
Suspended state
49. . Which is built directly on the hardware?.
Select one:
Application Software.
Computer Environment.
Database system
Operating system
50. _________ is technique in which the operating system of a computer executes

several programs concurrently by switching back and forth between them?
Select one:
Swapping
Partitioning
Multitasking
Windowing
51. .What is Operating System ?
Select one:
link to interface the hardware and application programs
collection of programs that manages hardware resources
system service provider to the application programs
all of the mentioned
52. .The first program that is executed when the computer is switched on is called
Select one:
bootstrap program
bootloader (sai)
initializer (sai)
start program (sai)
53. Kernel is the part wherein only essential modules of the operating system are
placed.
Hãy chọn một:
Đúng
Sai
54. .In Windows, the primary hard disk drives has the drive letter ____
Select one:
55. Multi-programmed batch systems place more than one jobs/programs/tasks in

the main memory of a batch prepared for same type of jobs and execute them
by switching between them.
Hãy chọn một:
Đúng
Sai
56. Process is _____
Select one:
A program in high level language kept on disk
An active program
A job in secondary memory
Contents of main memory
57. .What should be the extension to execute files?
Select one:
bat
exe (sai)
com
All
58. .Which file keeps commands to execute automatically when OS is started ?
Select one:
config.sys
autoexec.bat
command.com
any batch file
59. .Top layer in the layered scheme of operating system is
Select one:
User interface
Software
Hardware
Operating system
60. Multi-tasking systems place more than one job/program/task in the main
memory of the system. The jobs are scheduled by time-sharing technique.
Hãy chọn một:

Đúng
Sai
61. .The operating system manages
Select one:
Memory
Processes
All
Disk and Input/Output devices
62. .Which of the following Operating systems is better for implementing a Client-
Server network ?
Select one:
MS DOS.
Windows 2000
Windows 95
Windows 98
63. .Which Operating System doesn’t support long file names ?
Select one:
MS DOS
OS/2
Windows NT
Windows 95
64. .What is the function of an operating system ?
Select one:
Manages the flow of data and instructions
Takes care of scheduling jobs for execution
All
Manages computer’s resources very efficiently
65. .In terms of operating system, what is the name of the operating system that
reads and reacts?
Select one:
Real time system
Quick response time
Time sharing system
Batch system
66. . Which of the following Operating System does not implement multitasking
truly ?
Select one:
Windows XP
Windows 98.
MS DOS
Windows NT.
67. Supervisor state is
Select one:
entered by programs when they enter the processor
only allowed to the operating system
required to perform any I/O
never used
68. .In Unix, Fork is _____
Select one:
increasing the priority of a task
the creation of a new process
the dispatching of a task(sai)
the creation of a new job
69. The process of initializing a microcomputer with its operating system is called
___
Select one:
Boot recording (sai)
Warm booting (sai)
Booting
Cold booting (sai)
70. .The primary purpose of an operating system is:
Select one:
To allow people to use the computer..
To make the most efficient use of computer hardware.
To make computers easier to use..
To keep systems programmers employed.
71. .When a process reaches an I/O instruction, it is in the state _____
Select one:
ready (sai)
running (sai)
suspended
blocked
72. Exokernel works as an executive for application programs such that it ensures
the safe use of resources and allocates them to the applications.
Hãy chọn một:
Đúng
Sai
73. .Which runs on computer hardware and serve as platform for other software to
run on ?
Select one:
All.
Application program
Operating system.
System software
74. .When a time slot assigned to a process is completed in a time-sharing

operating system, the process transitions from running to _______
Select one:
Suspended state(sai)
Terminated state (sai)
Ready state
Waiting state
75. .Which is not the function of the Operating System ?
Select one:
Memory management
Application management
Virus Protection
Disk management
76. It's termed when the processes in the ready queue are chosen for the next
execution.
77. From the system’s viewpoint, the operating system presents a friendly
environment wherein the user can work efficiently.
Hãy chọn một:

Đúng
Sai
78. .Assume a process is "Blocked" while it waits for an I/O service. After the
service is finished, it is delivered to the _____
Select one:
Suspended state
Ready state
Terminated state
Running state
79. When an I/O device completes the read/write operation with a process, system
call is generated so that the process waiting for that device may use it.
80. .What is the difference between a short-term scheduler and a long-term

scheduler?
Select one:
It chooses the next process to run and allocates CPU to it.
It determines which process should be added to the ready queue.
By swapping, it chooses which process to remove from memory.
81. The fork system call in UNIX returns _____ for the child process and
______for the parent process.
Select one:
Zero, A Negative integer
Zero, A nonzero integer
A Negative integer, Zero
A nonzero integer, Zero
82. .A process in ready queue becomes ready for execution.

83. When a process in the ready queue is picked for execution and dispatched to
the CPU by the scheduling system, it becomes a ________
Select one:
process of getting ready
none
process is in progress.
waiting processl
84. What is the function of a medium-term scheduler?
Select one:
It determines which processes must be performed next and allocate CPU.
It determines which processes must be added to the ready queue.
It swaps out which processes to eliminate from memory.
85. What happens when a process comes to an end?
Select one:
It is taken out of all queues.
Its process control block has been de-allocated
Except for the job queue, it is eliminated from all.
Its process control block is never freed
86. The collection of user program, data section, stack, and the associated
attributes is called the ________
Select one:
wait state
process environment
running state
suspended state
87. Which of the following items does not belong in a process queue?
Select one:
PCB queue
Ready Queue
Device Queue
Job Queue
88. .If all processes are I/O bound, the ready queue will usually always be _______
, and the Short Term Scheduler will have a ______ to complete.
Select one:
full, lot
empty, little
full, little
empty, lot
89. .Which of the following errors will the operating system handle?
Select one:
A network connection failure.
all of the stated options.
A power outage.
insufficient paper in the printer

90. What is the purpose of a long-term scheduler?
Select one:
It selects processes to be performed next and allots CPU to them.
It picks out processes that need to be swapped out of memory.
It picks processes to be added to the ready queue.
91. .Any process that is limited to a subset of the parent's resources is prevented
from ____.
Select one:
Using a lot of secondary storage, which overloads the system.
under-loading the system by lowering CPU usage.
generating a large number of sub-processes to overburden the system.
crashing the system by consuming a large amount of resources.
92. .Which operation is performed by an interrupt handler?
Select one:
Loading the current state of the system
Saving the interrupt handling code and executing it

93. Each process in UNIX is identified by its _____.
Select one:
Process Control Block
Process Identifier
Device Queue
94. What is a process's ready state?
Select one:
when a process is consuming CPU resource.
none of the remaining options
When a procedure can't operate until a specific task is finished.
When a process is scheduled to run after a certain amount of time has passed.
95. The child process can __________
Select one:
never be loaded with another program.
cannot load another program into it.
a copy of the parent process
never be a copy of the parent process.

96. The operating system OS X has ____________
Select one:
microkernel
hybrid kernel
monolithic kernel
monolithic kernel with modules
97. Schedulers are classified using _______
Select one:
the system's use of them on a regular basis.
none
the system's total number of schedulers.
the system's total number of processes.
98. When a job is selected to be brought in the main memory, it is called long term
scheduler
99. . When a job is fetched in the memory, it becomes a process
Trả lời
100. A process may reach an instruction that requires it to wait for I/O
devices or another event while it is running. ______ is its state.
Select one:
running state
blocked state
suspended state
wait state
101. Which of the following are loaded into main memory when the
computer is booted ?
Select one:
utility programs
word processing instructions
internal command instructions
external command instructions
102. The blocked process waiting in the blocked queue in memory is

suspended and moved to the suspended queue in the disk
103. .Only one process can run at a time with _____________; all other
processes must wait for the processor. With ______________, many processes
can run at the same time, each on a different CPU.
Select one:
Multiprogramming, Multiprocessing
Uniprogramming, Multiprocessing
Multiprocessing, Multiprogramming
Multiprogramming, Uniprocessing
104. .When a process fails, most operating system write the error data to
______
Select one:
none of the mentioned
another process that is currently running
a new file
a log file is creataed
105. .What is the command interpreter's primary purpose?
Select one:
none of the remaining options
to get and execute the next command supplied by the user.
to act as a link between the API and the application program.
to manage files within the operating system

106. .Because of __________, a process can be terminated.
Select one:
mentioned options else.
a standard exit
an fatal mistake.
a method that kills it.
107. .Which system call in Unix generates a new process?
Select one:
Fork()
New()
Create()
108. .When a time slot assigned to a process is completed, the process moves
from the running state to the ____ in a time-sharing operating system.
Select one:
Ready state
Blocked state
Terminated state
Suspended state
109. ..A parent process that makes a system call ______ will be paused until
the child processes finish.
Select one:
exit
fork
wait
exec
110. . .Which of the following operating systems is not a real time operating
system?
Select one:
VxWorks
RTLinux
Palm OS
111. Insert 2 missing words to make the statement below correct:
Whenever a new job is entered into the system, it is stored in the
Trả lời
Job queue
112. refers to a process that gets swapped out of a blocked queue.
Select one or more:

interrupted process
swapped process
suspended process
blocked process
113. .When a process sends out an I/O request, _________.
Select one:
It is added to the ready queue
It is added to an I/O queue
It is added to the Job queue
It is added to a waiting queue
114. There is not _______ on the PCB of a process.
Select one:
the value of the CPU registers
the process state
context switch time
memory-management information
115. When a parent process exits _____, all child processes exit as well. This
is known as cascading termination.
Select one:
Normally or abnormally
Abnormally
Normally
116. When the event for which the blocked–suspended process was waiting
has occurred, its state changes to ready suspended
117. .Process is _____
Select one:
An active program
118. ._________ are those that only allow one process to run at a time.
Select one:
uniprocessing systems
unitasking systems
uniprogramming systems
119. .Which is the first program run on a computer when the computer boots
up ?
Select one:
None
System program
System operations
Operating sytem
120. .The main difference between the short and long term schedulers
is_____
Select one:
The type of processes they schedule
Their queue length
How often they are carried out
121. . Program is a active entity while process is passive

122. .In a multiprogramming environment __________
Select one:
the programs are created by a group of people.
The processor runs multiple processes at the same time..Process is _____
Multiple programs can be run by a single user at the same time.
the memory contains many processes.

123. . .Each process in an operating system has its own _______.
Select one:
signal handlers and pending alarms.
all of the mentioned.
address space and global variables.
open files.
124. .Which of the following statements is not correct?
Select one:
The kernel is made up of several modules that cannot be loaded into an
operating system that is already running.
During booting, the kernel is the first portion of the operating system to load
into memory.
The kernel is the program that makes up the operating system's central core.
During the whole computer session, the kernel remains in memory
125. Which of the following does not cause a running process to be

interrupted?
Select one:
The process of the scheduler.
Set a timer.
A machine.
A power outage.
126. . On a context switch between processes, which of the following does

not have to be saved?
Select one:
General purpose registers
Translation lookaside buffer
Program counter
127. .A real-time operating system is which of the following?
Select one:
VxWorks
RTLinux
Windows CE
Kiểm tra đợt 2: (Max 9.3)
1. Insert two missing words to make the statement below correct:
Short Term schedulers are the CPU schedulers that select a process from the
ready queue and allocate the CPU to one of them
2. If the quantumn time used in the round-robin scheduling algorithm is more than the
maximum time required to execute any process, then the algorithm will
Select one:
become to first come first serve
become to priority scheduling (sai)
become to shortest job first
become to shortest remaining time
3. Throughput is number of processes that complete their execution per time

unit
4. Consider the following system with time quantumn = 2
Proces Arrival Time Burst time

s
P1 0 5
P2 1 7
P3 3 4
he sequence of completion of the processes using the FCFS and RR scheduling is
Select one:
FCFS: P1, P3, P2 RR: P1, P2, P3
FCFS: P1, P2, P3 RR: P1, P2, P3
FCFS: P1, P3, P2 RR: P1, P3, P2
FCFS: P1, P2, P3 RR: P1, P3, P2

Trả lời
Waiting time is amount of time a process has been waiting in the ready
queue.
6. Which of the following need not necessarily be saved on a Context Switch between
processes?
Select one:
Translation look-aside buffer
General purpose registers
Program counter
Stack pointer
7. Insert thrScheduling isee missing characters to make the statement below correct:
A PCB includes information on the process's state
8. Insert 6 missing characters to make the statement below correct:
The Windows CreateProcess() system call creates a new process. The

equivalent
system call in UNIX is fork()
9. Consider a set of n tasks with known runtimes r 1, r2....rn to be run on a uniprocessor

machine. Which of the following processor scheduling algorithms will result in the
maximum throughput?
Select one:
first come first served
Shortest job first
Highest response ratio next
Round Robin
10. In FCFS scheduling, the process that requests the CPU first is allocated the CPU first
11. The state of a process after it reach an I/O instruction is
Select one:
ready
blocked
running
suspended
12. Consider the following scenario of processes:
Proces Arrival Time Burst time Priority

s
P1 9 16 4
P2 2 10 1
P3 12 2 3
P4 5 28 0
P5 0 11 2
The waiting time of P5 using preemptive priority scheduling is
Select one:
23
47
38
26
13. In a time-shared system, Round-Robin CPU scheduling is used.

Select one:
When employing very small time slices, the algorithm degenerates into the Last-In First-
Out (LIFO) method.
The shortest Request time First (SRTF) technique is achieved by using medium-sized
time slices.
Performance is improved by employing extremely short time slices.
When large time slices are used, the method degenerates into the First Come First
Served (FCFS) algorithm.
14. Which of the following is non-preemptive?
Select one:
MLQ
MLFQ
FCFS
RR
15. Match the following:
List - I List - II
(a) Spooling (i) Allows several jobs in memory to improve CPU utilization
(b) (ii)Access to shared resources among geographically

Multiprogrammi dispersed computers in a transparent way
ng
(c)Time sharing (iii) Overlapping I/O and computations
(d)Distributed (iv)Allows many users to share a computer simultaneously by

computing switching processor frequently
codes:
(a) (b) (c) (d)
(1) (iii) (i) (ii) (iv)
(2) (iii) (i) (iv) (ii)
(3) (iv) (iii) (ii) (i)
(4) (ii) (iii) (iv) (i)
Select one:
(3) (sai)
(4) (SAI )
(1)(sai)
(2)
16. A process may transition to the Ready state by which of the following actions?
Select one:
Completion of an I/O event
Awaiting its turn on the CPU
Newly-admitted process
All of the above
17. The processes are classified into different groups in which of following
scheduling algorithms?
MLQ
18. 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 state20.
19. Which of the following actions is/are typically not performed by the operating system
when switching context from process P1 to process P2?
Select one:
Changing address translation tables
Saving current register values of P1 and restoring saved register values for P2
Invalidating the translation look aside buffer
Swapping out the memory image of process P1 to the disk
Long-term schedulers are the job schedulers that select processes from the
job queue and load them into memory for execution.
21. In CPU scheduling, time taken for switching from one process to other is
pure overhead
22. dispatcher module gives control of the CPU to the process selected by the
short-term scheduler
23. turnaround time is amount of time to execute a particular process
24. In CPU sheduling, the preemptied process is then placed at the back of the Memory
allocation is generally performed through two methods: static and dynamic allocation.
25.
26. Consider a system contains n processes and system uses the round-robin scheduling
algorithm, which data structure is best suited for ready queue?
Select one:
stack(sai)
queue(sai)
circular queue
tree
27. 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
Select one:
Ready state
Waiting state(sai)
Terminated state
Suspended state
28. The performance of Round Robin algorithm depends heavily on
Select one:
the CPU bursts of the process
size of the process
the I/O bursts of the process
the size of the time quantum
29. Process is
Select one:
A program in execution
30. Consider the following scenario of processes:
Pr Arrival Burst
oc Time time
es
s
P1 0 8
P2 1 4
P3 2 9
P4 3 5
If SRTF scheduling is performed, what will be the turnaround time of P3 ?
Select one:
24
26
23(sai)
25
The time taken to stop one process and start another running is known as
dispatch latency
32. Round Robin schedule is essentially the pre-emptive version of
Select one:
FIFO
Shortest remaining time
Shorted job first
Longest remaining time
32.Consider the following system with time quantumn = 2
Pr Arrival Burst
oce Time time
ss
P1 0 5
P2 1 7
P3 3 4
The sequence of completion of the processes using the FCFS and RR scheduling is
Select one:
FCFS: P1, P3, P2 RR: P1, P3, P2
FCFS: P1, P2, P3 RR: P1, P3, P2
FCFS: P1, P3, P2 RR: P1, P2, P3
FCFS: P1, P2, P3 RR: P1, P2, P3
34. Consider the following system:
Process Arrival Time Burst time
P0 2 3
P1 3 1
P2 4 2
P3 0 7
P4 1 5
P5 5 1
If SRT scheduling is performed what will be the average waiting time of the processes?
35. Process is
Select one:
A job in secondary memory (SAI)

36. Consider the following systems:
P Arrival Burs
ro Time t time
ce
ss
0 9
1 5
P1 2 3
3 4
P2
P3
P4
If Round Robin (q = 2) scheduling is performed what will be the average waiting time of
the processes?
10.5
37. Consider the following system:
Process Arrival Time Burst time
P3 2 8
P1 0 5
P4 3 9
P2 1 7
If preemptive SJF scheduling is performed what will be the average waiting time for the
system?
7.75
38..Most popular 16-bit operating system is
Select one:
UNIX
TRS-DOS
CP/M
MS-DOS
39. Time quantum can be said
Select one:
multilevel queue scheduling algorithm
shortest job scheduling algorithm
round-robin scheduling algorithm
priority scheduling algorithm
40.At the ready queue when a process arrives In priority scheduling algorithm, the
priority of this process is compared with the priority of?
Select one:
parent process
init process
all process
currently running process
41. From the time of submission of a process to the time of completion, The interval is termed as
Select one:
waiting time
throughput
response time
turnaround time
42. .Which of the following process can be affected by other processes during execution
in the system?
Select one:
cooperating process
parent process
init process
child process
43 Consider a system contains n processes and system uses the round-robin scheduling
algorithm, which data structure is best suited for ready queue?62
Select one:
tree
circular queue
stack
queue
44. The primary job of operating system is to
Be user friendly
Command resources
Provide utilities
Manage resources
45.The turnaround time for short jobs during multiprogramming is usually Shortened and
that for long jobs is slightly ___________
Select one:
Lengthened
Unchanged
Shortened
Shortenedfv
46
In that order, processes P1, P2, P3, and P4 appear at times 0, 1, 2, and 3. Their burst CPU
times are 9, 5, 3, and 4, respectively. When employing SRT scheduling, the waiting time of
P1 is
12
time units.
47. Trap is a/an
Select one:
Operating system’s interrupt
Synchronous interrupt
Hardware interrupt
Asynchronous interrupt
48. A program that is bound by CPU might have
Select one:
None of the above
Cpu bursts many short
Cpu bursts a few short
Cpu bursts a few longer
49. Consider n processes sharing the CPU in RR fashion. If the context switching time is s units,
what must be the time quantum q such that the number of context switches is not reduced while
ensuring that each process gets a turn at the CPU every t seconds? Answer:
50. .Which of the following can not be scheduled by the kernel?

Select one:
process
kernel-level thread
user-level thread
51.The kernel of the operating system remains in primary memory (and other part of the
operating system remains in secondary storage) because
Select one:
It manages all interrupt calls
It is low level
It is mostly called
It controls all operations in a process
52. .FIFO scheduling is
Select one:
Deadline scheduling
Fair-share scheduling
Non-preemptive scheduling
Preemptive scheduling
54. .The FIFO algorithm said :
Select one:
executes the job first that needs a minimal processor
the job first executes that comes last in the queue
the job first executes that came in first in the queue

the job first executes that has maximum processor needs
55.Scheduling algorithm in multilevel feedback
Select one:
a process can move to a different classified ready queue…
classification of the ready queue is permanent
processes are not classified into groups
56. Consider the following system: P1, P2, P3, and P4 arrive at times 0, 1, 2, and 3 respectively.
Their CPU burst times are, respectively, 9, 5, 3, and 4. Using RR scheduling with time quantum =
5, the average turnaround time of the system is 13.75
57. Which file is the batch file that is read while booting a computer?
Select one:
Auto-batch
Auto.bat
Autoexec.bat
Autoexecutive.bat
58. In which the access takes place when different processes try to access the same data
concurrently and the outcome of the execution depends on the specific order, is called
Select one:
dynamic condition
race condition
critical condition
essential condition
59. How many types of multiprocessing models are there?
Select one:
4
60. .If _______ rule sequences the jobs Orders are processed in the sequence they arrive
Select one:
earliest due date
lack time remaining
critical ratios
first come, first served
61. Control of the CPU to the process selected by the short-term scheduler is assigned by
the module ________.
Select one:
scheduler
interrupt
dispatcher
62.Consider n processes sharing the CPU in RR fashion. If the context switching time is s
units, what must be the time quantum q such that the number of context switches is not
reduced while ensuring that each process gets a turn at the CPU every t seconds?
Answer:
63. .In an operating system, the portion of the process scheduler that forward processes
is concerned with:
Select one:
ready processes are assigning to CPU
ready processes are assigning to the waiting queue
running processes are assigning to blocked queue
65. At times 0, 2, 3, and 5, processes P0, P1, P2, and P3 appear in the sequence.The CPU
burst times for each of them are 5, 4, 7, and 6. They are given priority numbers 3, 4, 1, and
2 in that sequence (low number means high priority). When preemptive priority
scheduling is used, the sum of the turnaround times of processes is time 42 units.
66..Remote computing services involve the use of time sharing and
Select one:
Batch processing
Interactive processing
Multiprocessing
Real time processing
67. Consider below table of 4 processes under MLQ scheduling. Queue number denotes
the queue of the process. Priority of queue 1 is graeter than queue 2. Queue 1 uses
RR(q=2) and queue 2 uses FCFS.
Process Arrival time CPU burst time Queue number
P1 0 4 1
P2 0 3 1
P3 0 8 2
P4 10 5 1
The longest waiting process is P3 and its waiting time is 12
68. Software that measures, monitors, analyses and controls real-word events is called
Select one:
Business software
System software
Scientific software
Real-time software
69.Round robin is a
Select one:
Process scheduling policy
Memory allocation policy
Process synchronization policy
Kind of magnetic drum
70. Scheduling algorithm which allocates the CPU first to the process which requests the
CPU first?
Select one:
FCFS scheduling
shortest job scheduling
priority scheduling
71..In which the access takes place when different processes try to access the same
data concurrently and the outcome of the execution depends on the specific order, is
called
Select one:
essential condition
critical condition
race condition
dynamic condition
72. Which one is the example of hard real time system?
Select one:
Robotics (tui đoán)
Industrial control
Robotics and Industrial control
None of these (Tui nghĩ là k có)
73. Operating systems
Select one:
links a program with subroutine it references
provides a layer, user friendly interface
enables the programmer to draw a flow chart
all of these
74. Select one which algorithms tend to minimize the process flow time?
Select one:
Shortest Job First
First come First served
Earliest Deadline First
Longest Job First

76. Scheduling is
Select one:
the same regardless of the purpose of the system
quite simple to implement, even on large mainframes
unrelated to performance considerations
allowing job to use the processor
77. Consider the following system under FCFS scheduling.
Process Arrival time CPU burst time
P1 0 3
P2 1 2
P3 2 1
P4 3 4
P5 4 5
P6 5 2
If the context switching time is 1 then CPU utilization is (including switching at time 0)
78. The process can be classified into many groups in
Select one:
79A scheduling algorithm assigns priority based on how long a process takes to
complete. Priority zero is the starting point for all processes (the lowest priority). Every T
time units, the scheduler re-evaluates the process priorities and selects the next process
to schedule. If there are no I/O operations in the processes and they all arrive at the same
time 0, then this scheduling algorithm is equivalent to RR
80.Processes X, Y, Z, and T arrive at times 0, 1, 2, and 3 in that order. Their CPU burst
times are, respectively, 9, 5, 3, and 4. The turnaround time of Z is 15 time units while
using FCFS scheduling.
81. Under the category of_______ Round-robin scheduling falls:
Select one:
Nonpreemptive scheduling
Preemptive scheduling
82. Operating system is a collection of
Select one:
Input-output devices
All of these
Software routines
Hardware components
83.
Cryptography technique is used in
Select one:
Polling
File management
Job scheduling
Protection
84. The processes that are inhabited in main memory and are ready and waiting to
execute and remained on a list called
Select one:
process queue
ready queue
job queue
execution queue
85. Which of the following operating system write through catches?
Select one:
UNIX
XEVIX
DOS
ULTRIX
86. Processes A, B, C, and D arrive in that order at times 0, 1, 2, and 3. Their CPU burst
times are 9, 5, 3, and 4, respectively. When using non-peremptive SJF scheduling, B has a
complete time of
21
time units.
87.
88. P1, P2, P3, and P4 appear at times of 0, 2, 3, and 5, respectively. Their respective
execution times are 5, 4, 7, and 6. The average turnaround time of the system is
10.5
time units while using FCFS scheduler
89. A computer cannot “boot” if it does not have
Select one:
Assembler
Operating system
Complier
Loader
90. Process is
Select one:
91.
Scheduling algorithms that work on complex :
Select one:
uses most resources
are suitable for large computers
uses few resources
93. Of the following, the odd one is
Select one:
Spooler
Task manager
Executive
Kernel
94. Consider the following system: A, B, C, D, E have arrival times 0, 1, 2, 3, 4 respectively. Their
CPU burst times are, respectively, 18, 3, 4, 5, 3. If employing RR scheduling with time quantum =
4, then the waiting time of A is 15
95. .Select one which algorithms tend to minimize the process flow time?
Select one:
First come First served
Earliest Deadline First
Longest Job First
Shortest Job First
96.Assume that A, B, C, and D arrive at times 0, 2, 3, and 5 respectively. Their CPU burst times
are, respectively, 5, 3, 2, and 7. How many context switches will occur when using RR scheduling
with time quantum = 2? (excluding switching at time 0).
10
97.Assume that P0, P1, P2, and P3 arrive at times 0, 1, 2, and 3 respectively. Their CPU
burst times are, respectively, 9, 5, 3, and 4. When apply RR scheduling with time slice = 2,
the system's average waiting time is
10.5
98. In order, X, Y, Z, and T arrive at times 0, 2, 3, and 5. Priority numbers are assigned to
them in the order of 2, 1, 3, and 4 (low number means high priority). Their CPU burst
times are 5, 4, 7, and 6 respectively. Using preemptive priority scheduling, the average
waiting time for the system is
5.25
time units.
99. .The process can be classified into many groups in
Select one:
100. .Operating system is a collection of
Select one:
Hardware components
Input-output devices
Software routines
All of these
101..The processes that are inhabited in main memory and are ready and waiting to
execute and remained on a list called
Select one:
ready queue
execution queue
process queue
job queue
102.Consider the following system under FCFS scheduling.
Process Arrival time CPU burst time
P1 0 3
P2 1 2
P3 2 1
P4 3 4
P5 4 5
P6 5 2
If the context switching time is 1 then CPU utilization is 73.9 % (including switching at
time 0)
Kiểm tra đợt 3:

1.
Insert two missing words to make the statement below correct:
Long-term schedulers are the [job schedulers] that select processes from the
job queue and load them into memory for execution.
2.
Consider the following scenario of processes:
P Arrival Burs
ro Time t time
ce
ss
P1 0 8
P2 1 4
P3 2 9
P4 3 5
If SRTF scheduling is performed, what will be the turnaround time of P3 ? 24
3.
The OS is generally in the lower memory addresses in the memory.
4.
Supervisor state is
Select one:
only allowed to the operating system
required to perform any I/O
never used
entered by programs when they enter the processor
5.
Multitasking is technique in which the operating system of a computer executes several

programs concurrently by switching back and forth between them?
6.
A type of systems software used on microcomputers is
Select one or more:
Solaris
Androi
PC-DOS
MS-DOS
7.
In a paging scheme, 16-bit addresses are used with a page size of 512 bytes. If the
logical address is 0000010001111101.
The page number is
(1 sai)
2
8. In fixed partitioning, the partition size can be of
Select one:
variable size
fixed as well as variable
none
fixed size
9.
From the user’s viewpoint, the operating system acts as a resource manager, control
program, and virtual machine manager.
Hãy chọn một:
Đúng
Sai
10. The downside of calling a deadlock detection algorithm for every request is:
Select one:
Significant costs during calculation.
cost of deadlock detection algorithm due to memory consumption
consumes excess time in requests allocated memory
all correct
11.
Consider the two processes P1 and P2 accessing the shared variables X and Y protected
by the binary semaphore S1 and S2 respectively, both initiated by 1. The pseudocode of
P1 and P2 are follows:
P1: P2:
while(true){ while(tr
ue){
L1: ......
L3: ....
L2: ...... ..
X = X + 1; L4: ....
..
Y = Y - 1;
Y=Y
+ 1;
signal(S1);
X=Y-
signal(S2);
1;
}
signal
(S2);
signal
(S1);
To avoid deadlock, the correct operations at L1, L2, L3, L4 are, respectively?
Select one:
wait(S1); wait(S1); wait(S2); wait(S2);

12.
Which system call returns the PID of the terminated child process?
Select one:
wait
exit
get
fork
13. A system has 3 processes sharing 4 resources of the same type. If each process
needs up to 2 resources then deadlock may never happen
14. The requirements for solving a Critical Section problem are:
Select one or more:
mutual exclusion
progress
bounded waiting
15.
The swap space is reserved in __________
Select one:
the hard disk
none
the main memory
any secondary storage
16.
Which of the following is NOT true for plans to prevent and avoid deadlock?
Select one:
In the case of deadlock avoidance, resource requests are always granted if the resulting
state is safe
In the deadlock prevention, resource requests are always accepted if the resulting state
is safe
Avoid deadlock requires prior knowledge of resource requirements
Avoid deadlock is less restrictive than preventing deadlock
17.
In a paging scheme, 16-bit addresses are used with a page size of 512 bytes. If the
logical address is 0000010001111101.
The offset is 125
18.
What is the minimum number of memory accesses needed in paging?
Select one:
19.
Buddy system là một sự thỏa hiệp giữa ______

Select one:
phân trang và phân đoạn
các tùy chọn còn lại đều sai
phân vùng cố định và phân vùng động
phân mảnh ngoại và phân mảnh nội
20. Every entry of a page in the page table may also have its protection bits. These
protection bits are known as page protection bits (sai) valid protection bits(sai)
21. Belady’s anomaly is observed in the FIFO algorithm
22. To avoid deadlock
Select one:
a set number of allocated resources are required
All deadlocked processes need to be removed
only allocate resources to processes holding resources(sai?)
resource allocation needs to be done only once
23. starvation is a problem that is addressed when considering concurrent processes,

which are closely related to deadlock
24. The two types of semaphore are binary and counting
25. TLB hit ratio must be _____ to decrease the effective memory access time.
Select one:
high
none
low
no effect
26. What is the deadlock handling method?
A. Use methods to ensure the system will never enter a deadlock state
B. Allow the system to enter deadlock state and then recover
C. Pretend that deadlock never happens in the system
Select one:
A và C(sai)
A và B
A, B và C
27. A memory management unit performs memory-mapping by converting a logical

address into a physical address, with the help of __________
Select one:
limit registers
none
base and limit registers
base registers
28. Fixed partitioning is a method of partitioning the memory at the time of __________
Select one:
compilation
system generation
none
run-time
29. If the size of a process is an exact multiple of page size chosen, there will not be any
________ fragmentation.
Select one:
internal(sai)
internal and external both
none
external
30. Fixed partitioning method suffers from both fragmentation.
31. Which of the following statements is not correct for a solution to a critical section
problem ?
Select one:
No assumptions may be made about speeds or the number of CPUs.
Processes do not wait forever to enter its critical section.(sai)
No two processes may be simultaneously inside their critical sections.
Processes running outside its critical section may block other processes.
32. What is the semaphore initial value allows only one of many processes to enter its
critical section ?
Select one:
33. Pages and frames are equal in size.
34. Whenever a resource allocation request cannot be granted immediately, the deadlock
detection algorithm is invoked. This will help identify:
Select one:
Specific processes cause deadlock(sai)
All correct
set of processes in the deadlock queue
set of deadlocked processes(sai)
35. Larger the page size _____________ will be the memory wastage.
Select one:
the more
no effect
the less
none
36. Memory mapping through TLB is known as ___
Select one:
associative mapping
physical mapping(sai)
none
TLB mapping
37. To avoid race condition, the number of processes that can be concurrently within
their critical section is
Select one:
tùy thuộc vào hệ thống
38. In a system, there are three processes, P1, P2, and P3, divided into 32, 189, and 65
pages, respectively. If there are 115 frames in the memory, then the proportions in which
the frames will be allocated to the processes are
Select one:
11, 72, 21
18, 70, 27
13, 72, 24
13, 76, 26
39. A page table entry provides base address
40
Which of the following variable wait within the to enable a process
Select one:
objects Boolean objects can be used by condition variables
a condition is defined by a condition variable
semaphore must be used
50If there is a two-level paging structure, there are ____ memory accesses.
Select one:
none
51. Process synchronization can be done on which of the following levels
Select one:
software
hardware
both hardware and software

52. .Of the following, the odd one is
Select one:
Executive
Kernel
Spooler
Task manager
53. There is a system with 64 pages of 512 bytes page size and a physical memory of 32
frames. How many bits are required in the logical address? 15
54. Which of the following option is suitable when a process is executing in its critical
section, then no other processes can be executing in their critical section
Select one:
critical exclusion
synchronous exclusion
mutual exclusion
asynchronous exclusion
55. page table is a data structure used to store the base address of each page in the
process.
Kiểm tra đợt 4:
1. A process is said to be thrashing if it spends maximum time in paging rather than

its actual execution
Hãy chọn một:
Đúng
Sai
2. The 'Circular wait' condition can be prevented by
Select one:
using pipe
using thread
Define a linear order of resource types and enter the resource level
all not correct
3. A buddy system is a compromise between
Select one:
none
internal and external fragmentation
fixed and dynamic partitioning
paging and segmentation
4. A virtual memory system uses the FIFO page replacement policy and allocates a
fixed number of frames to the process. Consider the following statements:
P1: Increasing the number of page frames allocated to a process sometimes increases the page
fault rate
P2: Some programs do not show local reference.
Which of the following is correct?

Select one:
P1 is wrong but P2 is right
Both P1 and P2 are wrong
Both P1 and P2 are correct and P2 is not the reason for P1
Both P1 and P2 are correct and P2 is the reason for P1
5. ________ observes the working set of each process while executing and allocates
the number of frames required by it.
Select one:
Programmer
Processor
Operating system
User
6. The software implementing the VM system is known as VM handler

7. Memory allocation is generally performed through two methods: static and
dynamic allocation.
Hãy chọn một:

Đúng
Sai
8. An OS is a software that acts as an interface between the users and hardware of the computer
system.
Hãy chọn một:

Đúng
Sai
9.
47. Suppose there are 4 empty original page frames and the LRU page replacement
algorithm is used. If the page reference string is:
0,1,5,6,2,4,5,2.5, 0, 3, 1,2,5
When the 9th page fault occur, the required page index and data in frames in order
are
Select one:
Page 5 Frames: 2, 4, 5, 6
Page: 3 Frames: 1, 3, 5, 0
Page: 0 Frames: 2, 4, 5, 0
Page 3 Frames: 2, 3, 5,0
10. A process executes with the following page reference string:
134323420343123728747272702720702
Taking the working set window size as 10, what will be the working set for the time instant t1, t2,
and t3?
Select one:
t1: {0,1,2,3,4}, t2: {1,2,4,7,8}, t3: {0,2,7}
t1: {0,1,2,4}, t2: {1,2,3,4,7,8}, t3: {0,2,7}
t1: {0,2,1,3,4}, t2: {1,2,3,4,5,8}, t3: {0,2,7}
t1: {0,1,2,3,4}, t2: {1,2,3,4,7,8}, t3: {0,2,7}

11. An LRU can be implemented with three approaches: stack, counter, and matrix.
Hãy chọn một:

Đúng
Sai
12 .A includes information on the process's state.
13. The optimal algorithm is impractical because it is impossible to know
Select one:
the page size in advance
the future memory references
none
the page fault frequency
14. Virtual memory _____
Select one:
is secondary memory
is illusion of large primary memory
none
is large primary memory

15. Suppose there are 4 empty original page frames. The page reference string is:
0, 1, 3, 6, 2, 4, 5, 2, 5, 0, 3
If the CLOCK page replacement algorithm is used, the data in the page frames in order and the
victim page at the last requirement are ____
( The asterisk (*) represents use-bit = 1 )
Select one:
Frames: 3*, 4*, 1, 0 Victim Page: 5
Frames: 3*, 4, 5*, 0 Victim Page: 2
Frames: 3*, 4, 5, 0 Victim Page: 2

Frames: 2, 3*, 1, 5* Victim Page: 0
16. The virtual address space of a system is of the same size as the physical address space, the
operating system designers decide to free the virtual memory entirely. Which one of the
following is true?
Select one:
CPU scheduling can be implement more efficient
Hardware support is no longer needed from MMU
Efficient organization the processor cache can be made.
Implementation of multi-user support is no longer possible
17. Suppose there are 4 empty original page frames. The page reference string is:
1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6
When using the LRU page replacement algorithm, how many referenced pages are in and not in
the memory, respectively?
Select one:
hit = 11 miss = 9
hit = 14 miss = 6
ba tùy chọn còn lại đều không đúng

hit = 9 miss = 11
18. Consider the code for P1 and P2 processes to access their critical section whenever needed,
as shown below. The initial values of shared boolean variables S1 and S2 are randomly assigned.
P1:
while (S1 == S2) ;

P2:
Critica1 Section
while (S1 != S2) ;
S1 = S2;
Critica1 Section
S2 = not(S1);
Which of the following is a statement describing achieved properties?
Select one:
Progress but not mutual exclusion
Progress and mutual exclusion
Neither Progress or not Mutual exclusion
Mutual exclusion but not progress
19. When does a page fault occur?
Select one:
when a requested page isn't in RAM
when a requested page is in RAM
when an error occur on the page
when a page is corrupted

20. Rather than having the page table entry for a virtual page, ______ is taken as a page table
entry in the inverted page table.
Select one:
real page frame
PTBR
process number
PTLR
21. If the quantumn time used in the round-robin scheduling algorithm is more than the
maximum time required to execute any process, then the algorithm will
Select one:
become to priority scheduling
become to shortest job first
become to shortest remaining time
become to first come first serve
22. Consider the problem of creating two arrays a and b such that a [i] =
f1(i) with 0 ≤ i <n and b [i] = g2(a [i]) with 0 ≤ i <n.
Suppose this problem is separated into two simultaneous processes A and B so that A computes
array a and B calculates array b. The processes use two binary semaphores Sa and Sb, both
initialized to 0. Array a is shared by the two processes. The code for the process is shown below.
Process A:
private i; Process B:
for(i=0; i<n; i++){ private i;
a[i] = f1(i); for(i=0; i<n; i++){
ExitA(Sa,Sb); EntryB(Sa,Sb);
} b[i] = g2(a[i]);
What are the correct codes for ExitA and EntryB ?
Select one:
ExitA(Sa, Sb) { V(Sa); P(Sb);} EntryB(Sa, Sb) { V(Sb); P(Sa);}
ExitA(Sa, Sb) { P(Sa); V(Sb);} EntryB (Sa, Sb) { P(Sb); V(Sa);}

ExitA(Sa, Sb) { P(Sb); V(Sa);} EntryB(Sa, Sb) { V(Sb); P(Sa);}
ExitA(Sa, Sb) { V(Sa); V(Sb);} EntryB(Sa, Sb) { P(Sa); P(Sb);}
23. The huge size of a page table is handled with the hierarchical page table structure or inverted
page table structure.
Hãy chọn một:

Đúng
Sai
24. Second chance is also a page replacement algorithm.
Hãy chọn một:

Đúng
Sai
25 Thrashing take place when
Select one:
Processes are in waiting state
Processes frequently access pages not memory
Processes are in running state
a fault page happen
26. When there is more RAM, computer's performance is improved because
Select one:
larger virtual memory
larger memory is faster
fewer page faults occur
none
27. Clock page-replacement algorithm is another implementation of ______
Select one:
second chance
FIFO
OPT
LRU
28. Memory allocation is generally performed through two methods: static and dynamic
allocation.
Hãy chọn một:

Đúng
Sai
29. A page table must be updated as soon as the frame address of a page changes.
30. Let LRU, FIFO and MIN denote the number of page faults for the reference string 1, 2, 3, 2, 4,
1, 3, 2, 4, 1 using algorithms LRU, FIFO, MIN respectively with frame size as 3. Then
Select one:
MIN = FIFO
MIN<FIFO<LRU
MIN<LRU<FIFO
MIN = LRU
31. A computer system supports 32-bit virtual addresses as well as 32-bit

physical addresses. Since the virtual address space is of the same size as
the physical address space, the operating system designers decide to get
rid of the virtual memory entirely. Which one of the following is true?
(A) Efficient implementation of multi-user support is no longer possible
(B) The processor cache organization can be made more efficient now
(C) Hardware support for memory management is no longer needed
(D) CPU scheduling can be made more efficient now
32. _____ suffers from Belady's anomaly

Select one:
Both LRU and FIFO
LRU
OPT
FIFO
33. The number of page faults for the following reference string using LRU algorithm with
frame size as 3 is ____.
70120304230321201701
-> 12
Second-chance is observed in the FIFO algorithm that violates the general page fault
behaviour.
34. Consider a disk queue with I/O requests on the following cylinders in their arriving order:
54, 97, 73, 128, 15, 44, 110, 34, 45
The disk head is assumed to be at Cylinder 23. The total head movement using SSTF-scheduling
algorithm is 121
File System
1. .For each file there exists a ___________ that contains information about the file, including
ownership, permissions and location of the file contents.
Select one:
metadata
file control block
process control block
2.What will happen in a multi level directory structure?
Select one:
a mechanism for directory protection will have to applied
the subdirectories do not need protection once the directory is protected
the same previous techniques will be used as in the other structures

Hệ điều hành - Team SGAFs

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Hệ điều hành - Team SGAFs

Uploaded by

Copyright:

Available Formats

Đề cương môn Hệ Điều Hành

Bản quyền thuộc Team SGAFs

=))) các bạn xem đông dậy

Các bạn xem thôi chứ đừng chỉnh sửa gì nha!!

Chúc qua môn

Trí Cá Chép: “Im lặng cho t làm bài ‘

Đề cương ôn tập 30 câu trắc nghiệm:

Kiểm tra đợt 1: (Max 9.5)

1. As a virtual machine manager, operating system provides a layer on the actual

Hãy chọn một:

Hãy chọn một:

Hãy chọn một:

5. As a control program, operating system schedules and manages the allocation

Hãy chọn một:

6. Medium-term scheduler is invoked when there is need to swap out some

8. Short-term scheduler is invoked when there is need to perform process

Hãy chọn một:

Hãy chọn một:

13. System generation is the process of configuring the OS according to the

Hãy chọn một:

14. An OS is a resource manager that in background manages the resources needed

Hãy chọn một:

Hãy chọn một:

Hãy chọn một:

17. Monolithic systems were not suitable for multi-programming/multi-tasking

Hãy chọn một:

Hãy chọn một:

Hãy chọn một:

Hãy chọn một:

21. Multi-programming is the central concept in operating system that originates

Hãy chọn một:

22. Operating system is

A collection of software routines

A collection of input-output devices

All of the options

A collection of hardware components

24. Hybrid architecture combines the features of microkernel and layered

Hãy chọn một:

Hãy chọn một:

26. .Interrupt vector is ___

None of the mentioned

an address that is indexed to an interrupt handler

a unique identity given to an interrupt

a unique device number that is indexed by an address

Hãy chọn một:

29. .Direct Memory Access is used for ....

All of the mentioned

High speed devices

Low speed devices

Utilizing CPU cycles

Hãy chọn một:

31. Operating system

provides a layered, user-friendly interface

links a program with the subroutines it references

None of the options

enables the programmer to draw a flowchart

32. .Which Operating System doesn’t support networking between computers?

33. Which operation is performed by an interrupt handler?

All of the mentioned

Saving the interrupt handling code and executing it

internal command instructions

external command instructions

word processing instructions

Hãy chọn một: