Untitled
Untitled
Untitled
Câu hỏi 2 Choose the best answer about Round Robin algorithm of CPU scheduling; If
Đúng there are N processes in the ready queue and the time quantium is q, then
Đạt điểm 1,00 each process must wait no longer than ______ time units until its next time
trên 1,00 quantum
Select one:
a. (N+1).q
b. (N+2).q
d. (N-1).q
c. OS/2
d. Window NT
/
Câu hỏi 4 Choose the best answer about threads
Đúng
c. The many-to-many model has the user threads number smaller than the kernel
threads number
d. The many-to-many model can have as many user threads as necessary so that the
OS can manage well
Câu hỏi 5 How many components does a computer system usually have? What are
Đúng they?
Đạt điểm 1,00
trên 1,00 Select one:
a. 3: hardware, application programs, database.
Select one:
a. True
b. False
/
Câu hỏi 7 RPC stands for ________
Đúng
Select one:
a. True
b. False
Câu hỏi 9 A set of resources' allocations such that the system can allocate resources
Đúng to each process in some order, and still avoid a deadlock is called ________
Đạt điểm 1,00
trên 1,00 Select one:
a. Safe state
c. Starvation
d. Unsafe state
/
Câu hỏi 10 What is an operating system?
Sai
c. A resource allocator that manages all resources, and decides between conflicting
requests for e icient and fair resource use
Câu hỏi 12 The Hardware mechanism that enables a device to notify the CPU is called
Đúng __________
Đạt điểm 1,00
trên 1,00 Select one:
a. DMA
b. System Call
d. Interrupt
/
Câu hỏi 13 The concept of virtual memory is based on one or both of two basic
Đúng techniques: segmentation and paging
Đạt điểm 1,00
trên 1,00 Select one:
a. False
b. True
Câu hỏi 14 For ensuring the e icient operation of the system itself via resource
Đúng sharing, set of OS functions provides:
Đạt điểm 1,00
trên 1,00 Select one:
a. Resource allocation, Accounting, Protection and security. (**)
b. Computer Organization
d. Computer Architecture
/
Câu hỏi 17 There is no solution for process has deadlock in critical section (CS)
Đúng
b. False
Câu hỏi 19 Which of the following concept is best to preventing page faults?
Đúng
b. Paging
c. Hit ratios
Câu hỏi 20 The biggest drawback is that there is no protection between threads
Đúng
b. True
/
Câu hỏi 21 The long-term scheduler selects a group of I/O-bound jobs or a group of
Đúng CPU bound programs for subsequent activity
Đạt điểm 1,00
trên 1,00 Select one:
a. True
b. False
Câu hỏi 22 The kernel keeps track of the state of each task by using a data structure
Đúng called __
Đạt điểm 1,00
trên 1,00 Select one:
a. User control block
Câu hỏi 23 Which scheduler must work low in order not to waste significant CPU time?
Đúng
b. long-term
c. low-term
d. average-term
Câu hỏi 24 A process will be in ___________ state if it was waiting for an event that will
Đúng never occur
Đạt điểm 1,00
trên 1,00 Select one:
a. Safe
b. Dead lock
c. Terminated
d. Starvation
/
Câu hỏi 25 The problem of internal fragmentation can be lessened in systems
Đúng employing a fixed-partition memory management scheme by using:
Đạt điểm 1,00
trên 1,00 Select one:
a. Fixed size partitions
b. False
b. Batch OS
c. Multiprocessors OS
/
Câu hỏi 29 The Dining-Philosophers Problem is an example of ____
Đúng
c. Process creation
Câu hỏi 30 The task of subdividing memory between the O/S and processes is
Sai performed automatically by the O/S and is called:
Đạt điểm -0,25
trên 1,00 Select one:
a. Protection
b. Relocation
c. Memory Management
/
Câu hỏi 1 Context-switch time is dependent on ______
Đúng
b. Hardware support.
Câu hỏi 2 The solution to Critical Section Problem is: Mutual Exclusion, Progress and
Đúng Bounded Waiting.
Đạt điểm 1,00
trên 1,00 Select one:
a. The statement is contradictory
Câu hỏi 3 Which of the following concept is best to preventing page faults?
Đúng
b. Paging
d. Hit ratios
/
Câu hỏi 4 Which scheduler must work low in order not to waste significant CPU time?
Đúng
b. low-term
c. average-term
d. long-term
c. Windows 2000
d. OS/2
Câu hỏi 6 In the ___________ method of data transfer, the participation of the
Đúng processor is eliminated during data transfer.
Đạt điểm 1,00
trên 1,00 Select one:
a. Bu ering
b. Caching
Câu hỏi 7 The concept of virtual memory is based on one or both of two basic
Đúng techniques: segmentation and paging
Đạt điểm 1,00
trên 1,00 Select one:
a. False
b. True
/
Câu hỏi 8 DMA is ________
Đúng
b. Operating system
c. Computer Architecture
d. Computer Organization
b. Heavy Weight
c. Inter Thread
d. Mutliprocessors
/
Câu hỏi 12 The practice in which a program and data are organized in such a way that
Đúng various modules can be assigned the same region of memory is called:
Đạt điểm 1,00
trên 1,00 Select one:
a. Relocation
c. Sharing
d. Overlaying
/
Câu hỏi 15 Which of the following file name extension suggests that the file is Backup
Đúng copy of another file?
Đạt điểm 1,00
trên 1,00 Select one:
a. TXT
b. BAK
c. COM
d. BASH
Câu hỏi 16 Under multiprogramming, turnaround time for short jobs is usually
Đúng ________ and that for long jobs is slightly __________
Đạt điểm 1,00
trên 1,00 Select one:
a. Shortened; Lengthened
b. Shortened; Unchanged
c. Shortened; Shortened
d. Lengthened; Shortened
Câu hỏi 17 There is no solution for process has deadlock in critical section (CS)
Đúng
b. True
b. False
/
Câu hỏi 19 In a multithreaded environment _______
Đúng
Câu hỏi 20 For ensuring the e icient operation of the system itself via resource
Đúng sharing, set of OS functions provides:
Đạt điểm 1,00
trên 1,00 Select one:
a. Both (*) and (**) are correct.
/
Câu hỏi 22 What is a pair of sockets?
Đúng
b. The many-to-many model can have as many user threads as necessary so that the
OS can manage well
Select one:
a. True
b. False
/
Câu hỏi 25 The Hardware mechanism that enables a device to notify the CPU is called
Đúng __________
Đạt điểm 1,00
trên 1,00 Select one:
a. Interrupt
c. System Call
d. DMA
Câu hỏi 26 The long-term scheduler selects a group of I/O-bound jobs or a group of
Đúng CPU bound programs for subsequent activity
Đạt điểm 1,00
trên 1,00 Select one:
a. True
b. False
b. Linux
c. Windows SDK
d. Unix
Câu hỏi 28 How many components does a computer system usually have? What are
Đúng they?
Đạt điểm 1,00
trên 1,00 Select one:
a. 3: hardware, application programs, database.
/
Câu hỏi 29 Choose the best answer about Round Robin algorithm of CPU scheduling; If
Đúng there are N processes in the ready queue and the time quantium is q, then
Đạt điểm 1,00 each process must wait no longer than ______ time units until its next time
trên 1,00 quantum
Select one:
a. (N-1).q
c. (N+1).q
d. (N+2).q
Câu hỏi 30 The biggest drawback is that there is no protection between threads
Đúng
b. True
/
Câu hỏi 1 Which of the following file name extension suggests that the file is Backup
Đúng copy of another file?
Đạt điểm 1,00
trên 1,00 Select one:
a. BASH
b. TXT
c. COM
d. BAK
Câu hỏi 2 Choose the best answer about Round Robin algorithm of CPU scheduling; If
Đúng there are N processes in the ready queue and the time quantium is q, then
Đạt điểm 1,00 each process must wait no longer than ______ time units until its next time
trên 1,00 quantum
Select one:
a. (N-1).q
b. (N+2).q
d. (N+1).q
c. Hardware support.
/
Câu hỏi 4 In a virtural memory environment
Đúng
b. segmentation and page tables are stored in the cache and do not add any
substantial overhead. (*)
c. The many-to-many model can have as many user threads as necessary so that the
OS can manage well
d. The many-to-many model has the user threads number smaller than the kernel
threads number
/
Câu hỏi 7 What is a pair of sockets?
Đúng
Câu hỏi 9 Under multiprogramming, turnaround time for short jobs is usually
Đúng ________ and that for long jobs is slightly __________
Đạt điểm 1,00
trên 1,00 Select one:
a. Lengthened; Shortened
b. Shortened; Unchanged
c. Shortened; Shortened
d. Shortened; Lengthened
Select one:
a. True
b. False
/
Câu hỏi 11 The Dining-Philosophers Problem is an example of ____
Đúng
b. Process creation
Câu hỏi 12 Choose the best answer about "information sharing" reason in process
Đúng cooperation
Đạt điểm 1,00
trên 1,00 Select one:
a. All answers are correct.
b. We may want to construct the system in a modular fashion, dividing the system
functions into separate processes or threads
c. Even an individual user may have many tasks on which to work at one time
/
Câu hỏi 14 Super computers typically employ _______
Đúng
b. Batch OS
d. Server OS
b. False
/
Câu hỏi 18 Which scheduler must work low in order not to waste significant CPU time?
Đúng
b. middle-term
c. average-term
d. long-term
Câu hỏi 19 A set of resources' allocations such that the system can allocate resources
Đúng to each process in some order, and still avoid a deadlock is called ________
Đạt điểm 1,00
trên 1,00 Select one:
a. Unsafe state and Starvation
b. Unsafe state
c. Starvation
d. Safe state
/
Câu hỏi 21 The practice in which a program and data are organized in such a way that
Đúng various modules can be assigned the same region of memory is called:
Đạt điểm 1,00
trên 1,00 Select one:
a. Relocation
b. Sharing
c. Overlaying
Câu hỏi 22 Which of the following concept is best to preventing page faults?
Đúng
c. Hit ratios
Select one:
a. False
b. True
b. Unix
d. Windows SDK
/
Câu hỏi 25 The long-term scheduler selects a group of I/O-bound jobs or a group of
Đúng CPU bound programs for subsequent activity
Đạt điểm 1,00
trên 1,00 Select one:
a. True
b. False
Câu hỏi 26 Choose the best answer about context switch: In the time when context
Đúng switch occurs,
Đạt điểm 1,00
trên 1,00 Select one:
a. no process is executed
Câu hỏi 27 The basic idea behind paging is to divide physical memory into a number of
Đúng equal sized blocks called _______, and to divide a programs logical
Đạt điểm 1,00 memory space into blocks of the same size called _______
trên 1,00
Select one:
a. Frames; Pages (*)
b. Inter Thread
c. Light weight
d. Mutliprocessors
/
Câu hỏi 29 In the ___________ method of data transfer, the participation of the
Đúng processor is eliminated during data transfer.
Đạt điểm 1,00
trên 1,00 Select one:
a. Indirect Memory Access
c. Bu ering
d. Caching
/
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 _________ Dynamic linking
2) Which of the following is crucial time while accessing data on the disk? Seek
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
___________. Polling and Interrup
4) Unix Operating System is an __________.
1 Time Sharing Operating System 2 Multi-User Operating System 3 Multi-
tasking Operating System 4 All the Above
5) Which of the following memory allocation scheme suffers from External
fragmentation? Segmentation
6) Information about a process is maintained in a _________.
Process Control Block
7) Distributed OS works on the ________ principle. Single system image
8) The problem of fragmentation arises in ________. Heap allocation
9) Which file system does DOS typically use ? FAT16
10) The program is known as _________ which interacts with the inner part of
called kernel. Shell
11) The time taken by the disk arm to locate the specific address of a sector for
getting information is called __________. Seek Time
12) Which file system does Windows 95 typically use ? FAT32
13) Identify the odd thing in the services of operating system.
Error detection and correction
14) Cryptography technique is used in ________. Protection
15) Which of the following is not advantage of multiprogramming?
Decreased operating system overhead
16) In ______ OS, the response time is very critical.
Real-time
17) An optimal scheduling algorithm in terms of minimizing the average waiting
time of a given set of processes is ________.
Shorest job - first scheduling algorithm
18) Real time systems are ________.
Used for monitoring events as they occur
19) Which technique was introduced because a single job could not keep both
the CPU and the I/O devices busy? Multiprogramming
20) Inter process communication can be done through __________.
Messages
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 __________.Aging
22) CPU performance is measured through ________.
Throughput
23) PCB = Process Control 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 ? 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. Kernel
26) The primary job of the operating system of a computer is to ________.
Manage Resources
27) With the round robin CPU scheduling in a time-shared system ________.
1 Using very large time slice degenerates in to first come first served algorithm
28) Which of the following is a criterion to evaluate a scheduling algorithm? All
of the above
29) Which of the following is contained in Process Control Block (PCB)? All of
the Above
30) Super computers typically employ _______. Multiprocessors OS
1) 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?
Both A and B false
3) Which of the following will determine your choice of systems software for
your computer ?
1 Is the applications software you want to use compatible with it ?
2 Is it expensive ?
3 Is it compatible with your hardware ?
4 Both 1 and 3
4) What is a shell ? It is a command interpreter
5) The operating system manages ________. All of the above
6) The Hardware mechanism that enables a device to notify the CPU is called
__________. Interrupt
7) ___________ begins at the root and follows a path down to the specified
file Absolute path name
8) Process State is a part of Process Control block
9) Virtual Memory is commonly implemented by __________.
Demand Paging
10) Virtual memory is __________.
An illusion of extremely large main memory
11) The kernel keeps track of the state of each task by using a data structure
called __ Process control block
12) A binary semaphore has the values one or zero
13) _________ page replacement alogorithm suffers from Belady's
anamoly. FIFO
14) A program at the time of executing is called ________. A Process
15) _________ is a high speed cache used to hold recently referenced page table
entries a part of paged virtual memory
Translation Lookaside buffer
16) If you don¿t know which version of MS-DOS you are working with, which
command will you use after booting your operating system ?
VER command
17) _______ OS pays more attention on the meeting of the time limits. Real
time
18) A process said to be in ___________ state if it was waiting for an event that
will never occur. Dead lock
19) The removal of process from active contention of CPU and reintroduce them
into memory later is known as ____________.
Swapping
20) The problem of thrashing is effected scientifically by ________.
Program structure
21) Paging _________. solves the memory fragmentation problem
22) Real time systems are ________.
Used for monitoring events as they occur
23) A thread is a __________ process .Light wieght
24) _________ allocates the largest hole (free fragmant) available in the
memory. Worst Fit
25) Number of CPU registers in a system depends on ____________.
Computer Architecture
26) A major problem with priority scheduling is _________. Starvation
27) A ___________ contains information about the file, including ownership,
permissions, and location of the file contents.
File Control Block (FCB)
28) Which directory implementation is used in most Operating System?
Tree directory structure
29) The term " Operating System " means ________. A set of programs which
controls computer working
30) The operating system of a computer serves as a software interface between
the user and the ________. Hardware
1) The collection of processes on the disk that is waiting to be brought into
memory for execution forms the ___________ Input queue
2) Demand paged memory allocation
1 allows the virtual address space to be independent of the physical memory
3) Which is not an Operating System ? Windows 3.1
4) The operating system manages ________.
1 Memory 2 Processor 3 Disk and I/O devices 4 All of the above
5) It is not the layer of the Operating system. Critcal Section
6) ___________ begins at the root and follows a path down to the specified
file .Absolute path name
7) Who is called a supervisor of computer acitvity ? Operating system
8) 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?
1 Only A 2 Only B 3 Both A and B 4.None of the above
9) 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 __________. System Call
10) Mutual exclusion if one process is in a critical region others are excluded
11) Which scheduler controls the degree of multiprogramming?
Long term scheduler
12) What is the name of the software which can be legally compiled and often
used for free? Public domain program
13) The problem of fragmentation arises in ________. Heap allocation
14) 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 ________. Round Robin Scheduling
15) Thrashing occurs ________.
when excessive swapping takes place
16) Boundary registers ________.
Track the beginning and ending the program
17) The principle of locality of reference justifies the use of ________.
Cache memory
18) The section of code which accesses shared variables is called as
__________. Critical section
19) Thrashing _______Implies excessive page I/O
20) In memory management , a technique called as paging, physical memory is
broken into fixed-sized blocks called ___________. Frames
21) The state of a process after it encounters an I/O instruction is __________.
Blocked/Waiting
22) 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 :Circular Wait
23) Which of the following file name extension suggests that the file is Backup
copy of another file ?BAK
24) The degree of Multiprogramming is controlled by Long-term Scheduler
25) The higher versions of operating systems are so written that programs
designed for earlier versions can still be run. What is it called ?
Upward Compatibility
26) A scheduling algorithm is fair :if no process faces starvation
27) A critical region
is a piece of code which only one process executes at a time
28) Semaphore can be used for solving __________. Synchronization
29) The operating system of a computer serves as a software interface between
the user and the ________. Hardware
30) What is the name of the software which deals with the running of the actual
computer and not with the programming problems? System program
1, Which the following do not belong to queues for processed? PCB queue
2, When the process issues an I/O request: It is a place in an I/O queue
3,When a process terminates: It is removed from all queues
4, What is long-term scheduler? It selects which process has to be brought into
the ready queue
5, If all processes I/O bound, the ready queue will almost always be ____ and the
Short term Scheduler will have a ___ to do. Empty, little
6, What is a medium-term scheduler? It select which process to remove from
memory by swapping.
7,What if a short-term scheduler? It selects which process has to be executed nest
and allocates CPU.
8. The primary distinction between the short term scheduler and the long term
scheduler is: The frequency of their execution.
9,The only state transition that is initiated by the user process itself is: block.
10. 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: Ready state.
11, In a multiprogramming environment: more than one process resides in the
memory
12, Suppose that a process is in “Blocked” state waiting for some I/O service.
When the service is completed, it goes to the: Ready state
13,The context of a process in the PCB of a process does not contain: context
switch time.
14, Which of the following need not necessarily be saved on a context switch
between processes? Translation lookaside buffer
15, Which of the following does not interrupt a running processes? Scheduler
process.
1,Which module gives control of the CPU to the process selected by the short-
term scheduler? dispatcher
2. The processes that are residing in main memory and are ready and waiting to
execute are kept on a list called : ready queue
3. The interval from the time of submission of a process to the time of
completion is termed as : turnaround time
4. Which scheduling algorithm allocates the CPU first to the process that
requests the CPU first? first-come, first-served scheduling.
5. In priority scheduling algorithm
CPU is allocated to the process with highest priority
6. In priority scheduling algorithm, when a process arrives at the ready queue, its
priority is compared with the priority of
currently running process
7. Time quantum is defined in :round robin scheduling algorithm
8. Process are classified into different groups in
multilevel queue scheduling algorithm
9. In multilevel feedback scheduling algorithm
a process can move to a different classified ready queue
10. Which one of the following can not be scheduled by the kernel? user level
thread
1. Three important design principles in operating systems are:
Caching, virtualization, and support for concurrency
2. Changing the permissions on your files is easy in Linux because:
There is a built-in command-line utility for doing so
3. 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) 140 bytes (f) none
of the above
4. When a process is created using the classical fork() system call, which of the
following is not inherited by the child process? process ID
5. The text segment of a process address space contains:
The executable code associated with the process
6. The threading model supported by the Linux operating system is: one-to-one
89. ___________ begins at the root and follows a path down to the specified file
: Absolute path name
93. Which of the following will determine the choice of systems software for your
computer? A. Is the applications software you want to use compatible with
it ? B. Is it expensive? C. Is it compatible with your hardware?
D. Both A and C.
94. The removal of process from active contention of CPU and reintroduce them
into memory later is known as ____________: swapping.
1, A thread is a __________ process. Light weight
2,_________ allocates the largest whole (free fragment) available in the memory.
Worst fit
3,A major problem with priority scheduling is _________.Starvation
4, A ___________ contains information about the file, including ownership,
permissions, and location of the file contents. File Control Block (FCB)
5,Which is not the state of the process? Privileged
6,The term "operating system" means
A set of programs which controls computer working
7,To improve disk performance
_________ is a high speed cache used to hold recently referenced page table
entries a part of paged virtual memory
Translation Lookaside buffer
8,Which directory implementation is used in most Operating System?
Tree directory structure
9,Process is: A program in execution
10,A Page Fault occurs :When the page in not in the memory
12, The bankers algorithm is used to: Prevent deadlock in Operating Systems
13,A ______is a collection of procedures, variables and data structures grouped
together. Monitor
14,Physical memory is divided into fixed sized blocks called_______ Frames
1. What is operating system? all of the mentioned
2. To access the services of operating system, the interface is provided by the
:System call
3. Which one of the following is not true? kernel is made of various modules
which can not be loaded in running operating system
4. Which one of the following error will be handle by the operating system? all
of the mentioned
5. The main function of the command interpreter is
to get and execute the next user-specified command
6. By operating system, the resource management can be done via
both time and space division multiplexing
7. If a process fails, most operating system write the error information to a
______ : log file
8. Which facility dynamically adds probes to a running system, both in user
processes and in the kernel? DTrace
9. Which one of the following is not a real time operating system? Palm OS
10. The OS X has ____________hybrid kernel
11, File is generally defined to be: A collection of similar records
12, Which of the following is not file structure? Ring
13,____ is a specialized WRITE command for existing data files that allows for
adding records to end of the file. APPEND
14, Which of the following is not a ell-known technique for organizing the
physical storage block for a file? Sparse block allocation
15, Disk can be divided up into one or more partitions. The first block of every
partitions is called: MBR
16,Which of the following is correct about symbolic links?
Symbolic links can point to files in the same machines.
17, Increasing file system performance is implemented by _____: Defragmenting
Disks
18, Which of the following is true about the data rate for disk management? The
larger the block size is the faster the data rate is
19, Which class of I/O devices that Scanner belongs to? Block devices.
20, In the memory-mapped I/O system, in order that CPU communicates with the
control registers in the devices, the control register is assigned: I/O address.
21,Programmed I/O should be acceptable for which of the following system?
Embedded systems.
22, Which of the following statements is not correct about DMA?
DMA controller is usually faster than CPU.
31, Saving the state of the old process and loading the saved state of the new
process is called: context switch
32, Process state is a part of : Heap allocation.
33, Which is not the function of the OS: Virus Protection.
34, In ____ OS, the response time is very critical. Real-time.
35,Which of the following is contained in PCB? All of above (Process Number,
List of Open Files, Memory Limits)
36, The removal of process form active contention of CPU and reintroduce them
into memory later is known as: Swapping.
37, Which of the following statement is not true : Multithreading implies Mutil-
user.
38, Which technique was introduce because a single job could not keep both the
CPU and the I/O devices busy : Multiprogramming.
39, The collection of processes on brought into memory for execusion form the :
Input queue
39, ______ scheduler selects the jobs from the pool of jobs and loads into the
ready queue. Long-term