Quiz
OS Part 1
Crie uma conta grátis para terminar este quiz
Salve seu progresso e veja sua nota final.
Já tem uma conta? Inicie sessão
Perguntas do quiz (124)
1In the blocking send, blocking receive
- Aboth sender and receiver are blocked until message is delivered
- Bnone of the above
- Cthe sending process sends the message and resumes operation
- Dthe sending process sends the message while receiver is blocked
2The table _____ contains the base address of each page in physical memory
- Aprocess
- Bmemory
- Cpage
- Dframe
3A state is safe, if:
- Athe system can allocate resources to each process in some order and still avoid deadlock
- Bthe system does not crash due to deadlock occurrence
- Cthe state keeps the system protected and safe
- Dall of the above
4In fixed sized partition, the degree of multiprogramming is bounded by ____
- Athe memory size
- Ball of the above
- Cthe number of partitions
- Dthe CPU utilization
5_____ is generally faster than _____
- Aworst fit, best fit
- Bbest fit, first fit
- Cfirst fit, best fit
- Dnone of the above
6The two atomic operations permissible on semaphores are: (several answer)
- Await
- Bsignal
- Chold
- Dstop
7Program:
- Ais the device where information stored
- Bis a sequence of the instructions
- Cis a device that performs a sequence of operations specified by instructions in memory
- Dis typically characterized by interactive processing and time-slicing of the CPU’s time to allow quick response to each user
8"Mutual exclusion" condition for deadlock is defined as:
- AOnly one process may use a resource at a time
- BNo resource can be forcibly removed from process holding it
- CProcess holds a resource while awaiting for other resource
- DEach process holds resource needed by next process in chain
9"Hold and wait" condition for a deadlock is defined as:
- AOnly one process may use a resource at a time
- BNo resource can be forcibly removed from process holding it
- CProcess holds a resource while awaiting for other resource
- DEach process holds resource needed by next process in chain
10A monitor is a type of:
- Anone of the above
- Bhigh level synchronization construct
- Clow level synchronization construct
- Dsemaphore
11What is NOT the example of consumable resources?
- AInformation in I\O buffers
- BSignals
- CMain memory
- DMessages
12Which one is a synchronization tool?
- Asocket
- Bthread
- Cpipe
- Dsemaphore
13A Process Control Block (PCB) does not contain which of the following?
- Astack
- Bdata
- Cprocess state
- Dbootstrap program
14With _____ only one process can execute at a time; meanwhile all other process are waiting for the processor. With _____ more than one process can be running simultaneously each on a different processor.
- AMultiprocessing, multiprogramming
- BUniprogramming, Multiprocessing
- CMultiprogramming, Uniprocessing
- DMultiprogramming, Multiprocessing
15Memory:
- Ais the device where information stored
- Bis a sequence of the instructions
- Cis a device that performs a sequence of operations specified by instructions in memory
- Dis typically characterized by interactive processing and time-slicing of the CPU’s time to allow quick response to each user
16This resource can be safely used by only one process at a time and is not depleted by that use:
- Arefurbished resource
- Breplenishing resource
- Creusable resource
- Drefreshing resource
17Which of the following condition is required for the deadlock to be possible?
- Amutual exclusion
- Ball of the above
- Cno resource can be forcibly removed from a process holding it
- Da process may hold allocated resources while awaiting assignment of other resources
18The _____ is used as an index into the page table
- Apage number
- Bpage offset
- Cframe bit
- Dframe offset
19A page fault:
- Aoccurs when a program accesses a page of memory
- Bis a reference to a page belonging to another program
- Cis an access to a page not currently in memory
- Dis an error is a specific page
20A state of a process is defined by:
- Athe activity is just executed by the process
- Bthe final activity of the process
- Cthe activity to next be executed by the process
- Dthe current activity of the process
21Suppose that a process is in “Blocked” state waiting for some I\O service. When a service is completed, it goes to the:
- AReady state
- BRunning state
- CTerminated state
- DSuspended state
22The link between two processes P and Q to send and receive a message is called:
- Amessage-passing link
- Ball of the above
- Ccommunication link
- Dsynchronization link
23Message passing system allows processes to:
- Ashare data
- Bcommunicate with one another without resorting to shared data
- Cname the recipient or sender of the message
- Dcommunicate with one another by resorting shared data
24Which of the following statements is false?
- AI\O transfers are more efficient with large pages
- Ba large page size causes instructions and data that will not be referenced brought into primary storage
- Ca small page size causes large page tables
- Dinternal fragmentation is increased with small pages
25The systems which allows only one process execution at a time, are called:
- Aunitasking systems
- Buniprocessing systems
- Cuniprogramming systems
- Dunicasting systems
26Remote Procedure Calls (RPC) are used:
- Anone of the above
- Bfor communication between two processes on separate systems
- Cfor communication between two processes on the same systems
- Dfor communication between two processes remotely different from each other on the same system
27A minimum of _____ variable(s) is/are required to be shared between processes to solve the critical section problem?
- Atwo
- Bthree
- Cone
- Dfour
28This resource can be created and destroyed
- Aresumable resource
- Brestartable resource
- Cconsumable resource
- Dfinite resource
29Fixed-length block of data in secondary memory is called:
- Anone of the above
- Bframes
- Csegments
- Dpages
30A relationship between processes such that each has some part (critical section) which must not be executed while the critical section of another is being executing, is known as?
- AMultitasking
- BSemaphore
- CMutual exclusion
- Dmultiprogramming
31Every address generated by the CPU is divided into two parts:
- Aframe offset
- Bpage number
- Cframe bit
- Dpage offset
32Segmentation suffers from external fragmentation?
- AVerdadeiro
- BFalso
33For each process OS creates and manages:
- AProcess control block
- BProgram code
- CProgram
- DThread control block
34What is a trap/exception?
- Auser generated interrupt caused by an error
- Bfailure of the system
- Chardware generated interrupt caused by an error
- Dsoftware generated interrupt caused by an error
35What is the reusable resource:
- Anone of the above
- Bthat can be used by more than one process at a time
- Cthat can be used by one process at a time and is not depleted by that use
- Dthat can be shared between various threads
36Interprocess communication:
- Anone of the above
- Ballows the processes to only synchronize their actions without communication
- Callows processes to communicate and synchronize their actions when using the same address space
- Dallows processes to communicate and synchronize their actions without using the same address space
37Which of the following transitions is not possible?
- Ablocked to running
- Brunning to blocked
- Cblocked to ready
- Dready to running
38Any program, no matter how small, will occupy an entire partition results in:
- Ainternal fragmentation
- Bsegmentation
- Cpaging
- Dexternal fragmentation
39This matrix defines requirements of processes i for the resources j
- AAllocation matrix
- BResource matrix
- CRequest matrix
- DClaim matrix
40Several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which the access takes place, is called a(n) _____
- AEntry section
- Brace section
- Cshared memory segments
- Dprocess synchronization
41The context of a process in the PCB of a process DOES NOT contain:
- Acontext switch time
- Bthe process state
- Cmemory-management information
- Dthe value of the CPU registers
42External fragmentation will not occur when:
- Ano matter which algorithm is used, it will always occur
- Bfirst fit is used
- Cbest fit is used
- Dnext fit is used
43A deadlock avoidance algorithm dynamically examines the _____, to ensure that a circular wait condition can never exist
- Aresources
- Boperating system
- Cresource allocation state
- Dsystem storage state
44The process control block is:
- Aprocess type variable
- Bdata structure
- Cblock in memory
- Dsecondary storage section
45This illustrates the progress of two processes competing for two resources:
- Ajoint process diagram
- Bjoint ingres diagram
- Cjoint regress diagram
- Djoint progress diagram
46In a multiprogramming environment:
- Athe programs are developed by more than one person
- Bmore than one process resides in the memory
- Csingle user can execute many programs at the same time
- Dthe processor executes more than one process at a time
47When high priority task is indirectly preempted by medium priority task effectively inverting the relative priority of the two tasks, the scenario is called:
- Apriority exchange
- Bpriority inversion
- Cpriority removal
- Dpriority modification
48Main memory is broken into fixed-sized blocks called _____
- Anone of the above
- Bpages
- Cframes
- Dsegments
49The first fit, best fit and worst fit are strategies to select a
- Aprocess from a queue to put in memory
- Ball of the above
- Cfree hole from a set of available holes
- Dprocessor to run the next process
50The Banker’s algorithm is referred to as
- Adenial of service
- Bresource allocation denial
- Cloan allocation denial
- Dresource allocation refusal
51The code that changes the value of the semaphore is:
- Anon-critical section code
- Bremainder section code
- Cnone of the above
- Dcritical section code
52The two kinds of semaphores are: (Several answers)
- Amutex
- Bcounting
- Cbinary
- Ddecimal
53"Circular wait" condition for deadlock is defined as:
- AOnly one process may use a resource at a time
- BNo resource can be forcibly removed from process holding it
- CProcess holds a resource while awaiting for other resource
- DEach process holds resource needed by next process in chain
54Banker’s algorithm for resource allocation deals with:
- Adeadlock prevention
- Bmutual exclusion
- Cdeadlock recovery
- Ddeadlock avoidance
55What is compaction?
- Aa paging technique
- Ba technique for overcoming fatal error
- Ca technique for overcoming internal fragmentation
- Da technique for overcoming external fragmentation
56Process is:
- Aa job in secondary memory
- Ba unit of activity characterized by execution of a sequence of instructions, a current state, and an associated set
- Ccontents of main memory
- Dprogram in high level language kept on disk
57A single thread of control allows the process to perform:
- Aboth
- Bonly one task at a time
- Cmultiple tasks at a time
- Dnone
58When the memory allocated to a process is slightly larger than a process, then:
- Aboth will occur
- Bexternal fragmentation occurs
- Cinternal fragmentation occurs
- Dnone of the above
59A problem encountered in multitasking when a process is perpetually denied necessary resources is called:
- Astarvation
- Bdeadlock
- Caging
- Dinversion
60The memory allocation scheme subject to "internal fragmentation" is:
- Asegmentation
- Bvirtual memory segmentation
- Cfixed partitioning
- Dpure demand paging
61Which one is deadlock avoidance algorithm?
- Adining philosophers problem
- Belevator algorithm
- Cbanker’s algorithm
- Dround-robin algorithm
62What is a method of memory allocation by which the program is subdivided into equal portions, or pages and core is subdivided into equal portions or blocks?
- Avirtual memory
- Bsegmentation
- Cpaging
- Dpartition
63Variable-length block of data that resides in secondary memory is called:
- Anone of the above
- Bframes
- Csegments
- Dpages
64The memory allocation scheme subject to "external fragmentation" is:
- Asegmentation
- Bswapping
- Cmultiple contiguous fixed partitioning
- Dpure demand paging
65Four necessary conditions for deadlock to exist are: mutual exclusion, no-preemption, circular wait and
- Arace condition
- Bdeadlock avoidance
- Chold and wait
- Dstarvation
66A binary semaphore is semaphore with integer values: (Several answers)
- A1
- B0
- C-1
- D0.5
67Program always deals with:
- Alogical address
- Bphysical address
- Crelative address
- Dabsolute address
68The systems which allows only one process execution at a time, are called
- Auniprogramming systems
- Bunitasking systems
- Cuniprocessing sysems
- Dunicasting systems
69Swapping:
- Aallows many programs to use memory simultaneously
- Ballows each program in turn to use the memory
- Cdoes not work with overlaying
- Dnone of the above
70When several processes access the same data concurrently and the outcome of the execution depends on the particular order in which the access take place, is called:
- Adynamic condition
- Brace condition
- Ccritical condition
- Dessential condition
71If a page table entry is present in the TLB, then it is known as a:
- Abuffer miss
- BTLB miss
- Cpage fault
- DTLB hit
72With paging there is no _____ fragmentation
- Aeither type of
- Bnone of the above
- Cexternal
- Dinternal
73The address of a page table in memory is pointed by:
- Apage table base register
- Bstack pointer
- Cpage register
- Dprogram counter
74What is a medium-term scheduler?
- Ait selects which process has to be executed next and allocates CPU
- Bnone of the above
- Cit selects which process has to be brought into the ready queue
- Dit selects which process has to remove from memory by swapping
75"No preemption" condition for a deadlock is defined as:
- AOnly one process may use a resource at a time
- BNo resource can be forcibly removed from process holding it
- CProcess holds a resource while awaiting for other resource
- DEach process holds resource needed by next process in chain
76Processor:
- Ais the device where information stored
- Bis a sequence of the instructions
- Cis a device that performs a sequence of operations specified by instructions in memory
- Dis typically characterized by interactive processing and time-slicing of the CPU’s time to allow quick response to each user
77Fixed-length block of main memory is called _____
- Aframes
- Bsegments
- Cnone of the above
- Dpages
78The initial value of the semaphore that allows only one of the many processes to enter their critical section, is?
- A1
- B0
- C2
- D10
79Mutual exclusion means that:
- Aif a process is executing in its critical section, then other processes must be executing in their critical section
- Bif a process is executing in its critical section, then all the resources of the system must be blocked until it finishes exclusion
- Cif a process is executing in its critical section, then no other process must be executing in their critical sections
- Dnone of the above
80For every process there is a _____.
- Apointer to page table
- Bcopy of page table
- Cframe table
- Dpage table
81In operating system, each process has its own
- Aall of the mentioned
- Baddress space and global variables
- Cset of data
- Dprogram code
82Listing the sequence of instructions that are executed is called:
- Atrace
- Bprogram counter
- Cinstruction
- Dcontrol block
83The segment of code in which the process may change common variables, update tables, write into files known as:
- Acritical section
- Bprogram
- Cnon-critical section
- Dmutual exclusion
84Deadlock inevitable region can be referred as:
- Afun region
- Bfatal region
- Cfinal region
- Dfalse region
85How to solve a problem of equal-size partitions?
- Aunequal-size partitions
- Bsegmentation
- Ccompaction
- Dvirtual memory segmentation
86Paging?
- Aallows multiple programs to reside in separate areas of core at the time
- Bis a method of memory allocation by which the program is subdivided into equal portions, or pages and core is subdivided equal portions or blocks
- Cis a method of allocating processor time
- Dconsists of those addresses that may be generated by a processor during execution of a computation
87In internal fragmentation, memory is internal to a partition and:
- Ais not being used
- Bnone of the above
- Cis always used
- Dis being used
88A set of processes is deadlock if:
- Aeach process is blocked and will remain so forever
- Bnone of the above
- Call processes are trying to kill each other
- Deach process is terminated
89A memory used to provide a high speed is called?
- Acache
- Bmain memory
- Cdisk buffer
- Dstack pointer
90In indirect communication between processes P and Q:
- Athere is a mailbox to help communication between P and Q
- Bnone of the above
- Cthere is another machine between the two processes to help communication
- Dthere is another process R to handle and pass on the messages between P and Q
91Semaphore is a/an _____ to solve the critical section problem?
- Aspecial program for a system
- Bcomplex structure
- Cinteger variable
- Dhardware for a system
92Which of the following is not the state of a process?
- Anew
- Brunning
- Cold
- Dready
93The address of the next instruction to be executed by the current process is provided by the:
- Apipe
- Bprogram counter
- CCPU registers
- Dprocess stack
94Which of the following is not true about the memory management?
- Asegmentation suffers from external fragmentation
- Bpaging suffers from internal fragmentation
- Cvirtual memory is used only in multi-user systems
- Dsegmented memory can be paged
95The primary distinction between the short-term scheduler and long-term scheduler is:
- Athe length of their queues
- Bnone of the above
- Cthe type of processes the schedule
- Dthe frequency of their execution
96In the non-blocking send, blocking receive:
- Athe sending process sends the message and resumes operation
- Bsender continues on, receiver is blocked until the requested message arrives
- Cthe sending process keeps sending until it receives a message
- Dnone of the above
97The objective of multi-programming is to:
- Ahave multiple programs waiting in a queue ready to run
- Bto maximize CPU utilization
- Cto minimize CPU utilization
- Dall of the above
98A system is in the safe state if:
- Aa. the system can allocate resources to each process in some order and stil avoid a deadlock
- Bb. there exist a safe sequence
- Cboth a and b
- Dnone of the above
99When memory is divided into a several fixed sized partitions, each partition may contain _____
- Aexactly one process
- Bnone of the above
- Cat least one process
- Dmultiple processes at once
100In the non-blocking send, non-blocking receive:
- Athe sending process keeps sending until it receives a message
- Bneither of processes are required to wait
- Cthe sending process keeps sending until the message is received
- Dthe sending process sends the message and resumes operation
101A process can be terminated due to:
- Afatal error
- Bnormal exit
- Call of the mentioned
- Dkilled by another process
102What is a short-term scheduler?
- Ait selects which process has to be executed next and allocates CPU
- Bnone of the above
- Cit selects which process has to be brought into the ready queue
- Dit selects which process has to remove from memory by swapping
103In contiguous memory allocation:
- Aeach process is contained in a single contiguous section of memory
- Bnone of the above
- Cthe memory space is contiguous
- Dall processes is contained in a single contiguous section of memory
104External fragmentation exists when:
- Anone of the above
- Bthe total memory is insufficient to satisfy a request
- Cenough total memory exists to satisfy a request but it is not contiguous
- Da request cannot be satisfied even when the total memory is free
105CPU fetches the instruction from memory according to the value of?
- Astatus register
- Bprogram counter
- Cinstruction register
- Dprogram status word
106A sequence of instructions, in a computer language, to get the desired result, is known as:
- Aalgorithm
- Binstruction
- Cprocess
- Dprogram
107Semaphores:
- Aare used for memory management
- Bsynchronize critical resources to prevent deadlock
- Care used to do I/O
- Dsynchronize critical resources to prevent contention
108This matrix defines the current allocation to process i of the resource j
- AAllocation matrix
- BResource matrix
- CRequest matrix
- DClaim matrix
109The operating system maintains a _____ table that keeps track of how many frames have been allocated, how many are there, and how many are available
- Amemory
- Bpage
- Cframe
- Dsegment
110For non-sharable resources like a printer, mutual exclusion:
- Amust exist
- Bnone of the above
- Cmust not exist
- Dmay exist
111If a process is executing in its critical section, then no other processes can be executing in their critical section. This condition is called
- Acritical exclusion
- Basynchronous exclusion
- Cmutual exclusion
- Dsynchronous exclusion
112Interprocess communication:
- Aallows process to synchronize activity
- Bis never necessary
- Cis usually done via disk drives
- Dis required for all processes
113The available vector defines:
- Atotal amount of resources required for all processes
- Btotal amount of each resource in the system
- Ctotal amount of each resource allocated to all processes
- Dtotal amount of each resource NOT allocated to any process
114A task in a blocked state
- Ais running
- Bis executable
- Cmust still be placed in the run queues
- Dis waiting for same temporarily unavailable resources
115The systems which allows only one process execution at a time, are called:
- Aunitasking systems
- Buniprocessing systems
- Cuniprogramming systems
- Dnone of the above
116What is NOT an example of reusable resource
- Asemaphores
- Bprocessors
- Cinterrupt
- Di/o channels
117An un-interruptible unit is known as:
- Asingle
- Bnone of the above
- Cstatic
- Datomic
118How to solve a problem of "external" fragmentation?
- Aunequal-size partitions
- Bsegmentation
- Ccompaction
- Dvirtual memory segmentation
119Runtime mapping from virtual to physical address is done by?
- ACPU
- Bnone of the above
- Cmemory management unit
- DPCI
120A solution to the problem of external fragmentation is:
- Acompaction
- Blarger memory size
- Cunequal size parts
- Dsmaller memory space
121in the non-blocking send, non-blocking receive:
- ANeither of processes are required to wait
- BThe sending process keeps sending until it receives a message
- CThe sending process keeps sending until the message is received
- DThe sending process sends the message and resumes operation
122In segmentation, each address is specified by:
- AA segment number and an offset
- BA page number and an offset
- CA frame number and an offset
- DA segment number and a key
123Virtual memory takes advantage of:
- ALarge secondary memory
- BModular programming
- CFast CPU
- DScheduling
124Which of the replacement algorithms selects for the next reference is the longest?
- AOptimal
- BLRU
- CClock
Informações
- Descrição
- Suicidal Operating Systems [Teachers: Teshebayeva Karagoz, Mishina Aigerim ; Final Exam + STATE EXAM] ▼ Quiz sobre OS Part 1, criado por Good Guy Beket em 18-12-2017.
- Autor
- Good Guy Beket
- Idioma
- English
- Visualizações
- 1.088
- Etiquetas
- Avaliação
- 5,0 de 5 · 2 avaliações Avalie este quiz