Test
OS | Quizzes #3 and #4
Preguntas del test (103)
1Utilities are:
- AProcessor registers
- BApplication programs
- COpcodes
- DSystem programs
2The process index register
- AContains the index into the process list of process currently controlling the processor.
- BContains the staring address of the region of memory occupied by the process.
- CDefine the region in memory occupied by the process
- DPoints to the next isntruction in that process to be executed
3The end user views a computer system in terms of:
- AA set of machine instructions
- BA set of applications
- CA set of system programs
- DUtilities
4Choose the storage management responsibility for «The OS can achieve efficiency by assigning memory to jobs only as needed:
- AProcess isolation
- BProtection and access control
- CAutomatic allocation and management
- DLong-term storage
- ESupport of modular programming
5"The OS as a User/Computer Interface" corresponds to the following objective:
- AEfficiency
- BConvenience
- CAbility to evolve
6_____ is generally faster than _____
- Afirst fit, best fit
- Bnone of the above
- Cbest fit, first fit
- Dworst fit, best fit
7Memory partitioning algorithm that uses binary tree as a data structure is called:
- AFirst-fit algorithm
- BBuddy system
- CNext-fit algorithm
- DBest-fit algorithm
8The address of a page table in memory is pointed by:
- Astack pointer
- Bpage table base register
- Cprogram counter
- Dpage register
9Which of the following is not true about the memory management?
- Asegmented memory can be paged
- Bvirtual memory is used only in multi-user systems
- Csegmentation suffers from external fragmentation
- Dpaging suffers from internal fragmentation
10Main memory is broken into fixed-size blocks called
- ANone of the above
- BSegments
- CFrames
- DPages
11In operating system each process has its own:
- Aaddress space and global variables
- Bset of data
- Cprogram code
- Dall of mentioned
12Mutual exclusion can be provided by the:
- Aboth
- Bmutex locks
- Cbinary semaphores
- Dnone of the above
13What is a medium-term scheduler?
- AIt selects which process has to be executed next and allocates CPU
- BIt selects which process has to be brought into the ready queue
- CIt selects which process to remove from memory by swapping
- DNone of the above
14The state of a process is defined by:
- AThe activity to next to be executed by the process
- BThe activity just executed by the process
- CThe current activity of the process
- DThe final activity of the process
15What is a ready state of a process?
- Awhen process is using the CPU
- Bwhen process is scheduled to run after some execution
- Cwhen process is unable to run unitl some task has been completed
- Dnone of the above
16Which one of the following is the deadlock avoidance algorithm?
- Around-robin algorithm
- Belevator algorithm
- Cbanker's algorithm
- Ddinning philosophers problem
17A state is safe if:
- Athe system can allocate resources to each process in some order and still avoid a deadlock
- Ball of the above
- Cthe state keeps the system protected and safe
- Dthe system does not crash due to deadlock occurrence
18The initial value of the semaphore, that allows only one of the many processes to enter their critical sections, is:
- A2
- B1
- C0
- D10
19The segment of code in which the process may change common variables, update tables, write into files is known as:
- Acritical section
- Bmutual exclusion
- Cnon-critical section
- Dprogram
20A problem encountered in multitasking when a process is perpetually denied necessary resources is called
- Astarvation
- Baging
- Cinversion
- Ddeadlock
21A system is in the safe state if:
- Anone of the above
- Bthere exist a safe sequence
- Cboth A and B
- Dthe system can allocate resources to each process in some order and still avoid a deadlock
22What is the reusable resource?
- Athat can be used by one process at a time and is not depleted by that use
- Bthat can be used by more than one process at a time
- Cthat can be shared between various threads
- Dnone of the above
23This illustrates the progress of two processes competing for two resources
- Ajoint progress diagram
- Bjoint ingres diagram.
- Cjoint regress diagram.
- Djoint process diagram.
24Current allocation of resources to processes where there is at least one sequence that does not result in deadlock is called
- ASafe state
- BAmbiguous state
- CUnsafe state
- DAlternative state
25The resource vector defines:
- Atotal amount of each resource in the system
- Btotal amount of each resource NOT allocated to any process
- Ctotal amount of resources required for all processes
- Dtotal amount of each resource allocated to all processes
26"No preemption" condition for deadlock is defined as
- ANo resource can be forcibly removed from process holding it.
- BProcess holds a resources while awaiting for other resource
- COnly one process may use a resource at a time
- DEach process holds resource needed by next process in chain
27This matrix defines the current allocation to process i of resource j:
- AClaim matrix
- BAllocation matrix
- CResource matrix
- DRequest matrix
28Which of the following cannot be interrupted?
- AProcess
- BThread
- CAtomic operation
- DModule
29A minimum of ____ variables is/are required to be shared between processes to solve critical section problem.
- Athree
- Btwo
- Cone
- Dfour
30For non-sharable resources like a printer, mutual exclusion:
- Amust exist
- Bmay exist
- Cmust not exist
- Dnone of the above
31A monitor is type of:
- Ahigh-level synchronization construct
- Bdeadlock
- Clow-level synchronization construct
- Dnone of the above
32An un-interruptible unit is known as:
- Aatomic.
- Bsingle
- Cstatic
- Dnone of the above
33Part of program, where the shared memory is accessed and which should be executed invisibly, is called:
- Acritical section
- Bsemaphores
- Cdirectory
- Dmutual exclusion
34Current allocation of resources to processes where there is no sequence that does not result in deadlock is called:
- ASafe state
- BUnsafe state
- CAlternative state
- DAmbiguous state
35Which of the following is not one of the principles of dealing with deadlock?
- AInitialization
- BDetection
- CPrevention
- DAvoidance
36Deadlock inevitable region can be referred to as a:
- Afatal region
- Bfalse region
- Cfinal region
- Dfun region
37When each process in the set is blocked awaiting for resource seized by another blocked process:
- Ait is deadlock
- Bit is deadend
- Cit is a softlock
- DIt is a mortallock
38What is NOT an example of reusable resource?
- AI/O channels
- BSemaphores
- CProcessors
- DInterrupt
39In the non-blocking send, blocking receive:
- Athe sending process sends the message and resumes operation
- Bthe sending process keeps sending until it receives a message
- Csender continues on, receiver is blocked until the requested message arrives
- Dnone of the above
40The degree of multi-programming is:
- Athe number of process in memory
- Bthe number of processes executed per unit time
- Cthe number of process in the ready queue
- Dthe number of process in the I/O queue
41What controls the process in a single-threaded process model?
- AProcess control block
- BKernel stack control block
- CUser address space control block
- DUser stack control block
42The context of a process in the PCB of a process DOESN'T contain:
- Amemory-management information
- Bcontext switch time
- Cthe process state
- Dthe value of CPU registers
43Job control language was used to:
- Aprovide instructions to the monitor to improve job setup time.
- Bcontrol the sequence of events as the resident monitor
- Ctranslate the user's program into object code
- Dexecute instructions
44The hardware and software used in providing applications to a user can be viewed in a:
- Asandwich fashion
- Bclassified fashion
- Clayered fashion
- Dleveled fashion
45Semaphore is a/an _____ to solve critical section problem.
- Ainteger variable
- Bspecial program for a system
- Ccomplex structure
- Dhardware for a system
46A situation where several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which access takes place is called
- Adata consistency
- Baging
- Crace condition
- Dstarvation
47«The OS as a resource manager» corresponds to the following objective:
- AEfficiency
- BConvenience
- CAbility to evolve
48Choose the storage management responsibility for «Programmers should be able to define program modules and to create, destroy and after the size of modules dynamically»:
- Along-term storage
- Bautomatic allocation and management
- Csupport of modular programming
- Dprocess isolation
49The first fit, best fit and worst fit are strategies to select a:
- Afree hole from a set of available holes.
- Bprocessor to run the next process
- Cprocess from a queue to put in memory
- Dall of the above
50For every process there is a:
- Apage table.
- Bcopy of page table
- Cframe table
- Dpointer to page table
51The memory allocation scheme subject to "internal" fragmentation is
- Afixed partitioning.
- Bvirtual memory segmentation
- Cpure demand paging
- Dsegmentation
52In memory systems, boundary registers
- Aare used for temporary program variable storage
- Bare only necessary with fixed partitions
- Care only necessary with unequal-length partitions
- Dtrack the beginning and ending of programs
53Any program, no matter how small, will occupy an entire partition results in
- Apaging
- Binternal fragmentation
- Csegmentation
- Dexternal fragmentation
54The Process Control Block is:
- Aa secondary storage section
- Bprocess type variable
- Cdata structure
- Da block in memory
55Which one of the following is synchronization tool?
- Asocket
- Bthread
- Cpipe
- Dsemaphore
56The link between two processes P and Q to send and receive messages is called:
- Acommunication link
- Bmessage-passing link
- Csynchronization tool
- Dall of the above
57This system handles multiple interactive jobs:
- ASerial procesing
- BSimple batch system
- CTime-sharing system
- DMultiprogrammed batch system
58"Two or more programs hung up waiting for each other". This error is caused by
- AImproper synchronization
- BNondeterminate program operation
- CDeadlocks
- DFailed mutual exclusion
59"Lost signals, duplicate signals received". This error is caused by:
- Aimproper synchronization
- Bnondeterminate program operation
- Cfailed mutual exclusion
- Ddeadlocks
60The principal tool available to system programmers in developing the early multiprogramming and multiuser interactive systems
- AInterrupt
- BJob Control Language
- CAd hoc Method
- DMonitor
61Fixed-length block of data in secondary memory is called:
- Aframes
- Bsegments
- Cpages
- Dnone of the above
62When the free memory is split into many unconnected pieces we call it:
- ACompaction
- BExternal fragmentation
- CMemory distribution
- DInternal fragmentation
63If a page number is not found in the TLB, then it is known as a:
- ATLB miss
- Bpage fault
- Cbuffer miss
- DTLB hit
64With paging there is no ______ fragmentation.
- Aeither type of
- Binternal
- Cexternal
- Dnone of the above
65If a page table entry is not in a main memory, then it is known as a:
- ATLB hit
- BTLB miss
- Cbuffer miss
- Dpage fault
66This matrix defines the amount of resources of type j requested by process i:
- ARequest matrix
- BResource matrix
- CClaim matrix
- DAllocation matrix
67«Hold and wait» condition for deadlock is defined as:
- Aprocess holds a resource while awaiting for other resource.
- Bno resource can be forcibly removed from process holding it
- Conly one process may use a resource at a time
- Deach process holds resource needed by next process in chain
68«Circular wait» condition for deadlock is defined as:
- Aeach process holds a resource needed by next process in chain.
- Bno resource can be forcibly removed from process holding it
- Conly one process may use a resource at a time
- Dprocess holds a resource while awaiting for other resource
69Four necessary conditions for deadlock to exist are: mutual exclusion, no-preemption, circular wait and _____
- Ahold and wait
- Bdeadlock avoidance
- Crace around condition
- Dbuffer overflow
- Enone of the above
70This resource can safely be used by only one process at a time and is not depleted by that use:
- Arefreshing resource
- Breplenishing resource
- Crefurbished resource
- Dreusable resource
71The available vector defines:
- Atotal amount of resources required for all processes
- Btotal amount of each resource allocated to all processes
- Ctotal amount of each resource NOT allocated to any process
- Dtotal amount of each resource in the system
72"No preemption" condition for deadlock is defined as:
- ANo resource can be forcibly removed from process holding it.
- BOnly one process may use a resource at a time
- CProcess holds a resource while awaiting for other resource
- DEach process holds resource needed by next process in chain
73For sharable resources, mutual exclusion
- Ais not required
- Bis required
- Cmay be or may not be required
- Dnone of the mentioned
74In 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
75In the non-blocking send, non-blocking receive:
- Asender continues on, receiver is blocked until the requested message arrives.
- 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
76"More than one attempts to make use of a shared resource at the same time". This error is caused by:
- Afailed mutual exclusion
- Bimproper synchronization
- Cdeadlocks
- Dnondeterminate program operation
77Which of the following state transitions is not possible?
- ABlocked to running
- BBlocked to ready
- CRunning to blocked
- DReady to running
78What is a short-term scheduler?
- AIt selects which process has to be executed next and allocates CPU
- BIt selects which process has to be brought into the ready queue
- CIt selects which process to remove from memory by swapping
- DNone of these
79What is a long-term scheduler?
- AIt selects which process has to be brought into the ready queue
- BIt selects which process has to be executed next and allocates CPU
- CIt selects which process to remove from memory by swapping
- DNone of these
80What is inter-process communication?
- ACommunication between two threads of same process.
- BCommunication between two process
- CCommunication within the process
- DNone of the mentioned
81There were no OS with
- ASerial processing
- BSimple batch systems
- CTime sharing systems
- DMultiprogrammed batch systems
82Inter-process communication
- Aallows processes to communicate and synchronize their actions without using the same address space
- Bnone of the above
- Callows the processes to only synchronize their actions without communication
- Dallows processes to communicate and synchronize their actions when using the same address space
83A sequence of instructions in a computer language to get the desired result is known as:
- Aalgorithm
- Bprocess
- Cinstruction
- Dprogram
84In 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
85A system clock generates an interrupts at a rate of approximately every 0.2 seconds. At each clock interrupt regained control and could assign processor to another user. Technique is known as:
- ATime scheduling
- BTime slicing
- CTime sliding
- DTime allocating
86In internal fragmentation, memory is internal to a partition and
- Ais not being used
- Bnone of the above
- Cis always used
- Dis being used
87The 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
88The algorithm is slow and may even tend to fill up memory with useless holes
- ABest fit
- BWorst fit
- CFirst fit
- DNone of the above
8924. Which 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
90Short-term scheduler, or dispatcher, picks a process. Each process in the queue is given some time in turn. The strategy is called
- ARound-robin technique
- BPrioritizing
- CCarousel technique
- DMerry-go-round technique
91The limit register:
- ADefines the size of the region of (in bytes or words)
- BContains the index into the process list of the process currently controlling the processor
- CPoints to the next instruction in that process to be executed
- DContains the staring address of the region of memory occupied by the process
92Dispatcher is:
- ASmall program which switches the processor from one process to another
- BTrace scheduler
- CInterrupt handler
- DUser account manager
93Process spawning is:
- ACreation of parent process
- BCreation of child process
- CTermination of parent process
- DTermination of child process
94The code that changes the value of the semaphore is:
- Aremainder section code
- Bnon – critical section code
- Ccritical section code
- Dnone of the mentioned
95This resource can be created and destroyed
- Aconsumable resource
- Bfinite resource
- Crestartable resource
- Dresumable resource
96What is NOT an example of consumable resource?
- AInformation in I/O buffers.
- BSignals
- CMain memory
- DMessages
97A binary semaphore is a semaphore with integer values (multiple choices):
- A1
- B—1
- C0
- D0.5
98If more than one user or program attempts to make use of a shared resource at the same time, it may cause the error of
- ADeadlocks
- BFailed mutual exclusion
- CNondeterminate program operation
- DImproper synchronization
99Mutual exclusion means that
- Aif a process is executing in its critical section, then no other process must be executing in their critical sections
- 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 other processes must be executing in their critical section
- Dnone of the above
100The two kinds of semaphores are:
- Amutex
- Bcounting
- Cbinary
- Ddecimal
101The objective of multi-programming is to:
- Ahave multiple programs waiting in a queue ready to run
- Bto maximize CPU utilization
- Cto minimize CPU utilization
102A relationship between processes such that each has some part (critical section) which must not be executed while the critical section or another
- AMutual exclusion
- BMultiprogramming
- CSemaphore
- DMultitasking
103What 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? It is a method of allocating processor time?
- APaging
- BVirtual memory
- CPartition
- DSegmentation
Información
- Descripción
- Suicidal Operating Systems [Teachers: Teshebayeva Karagoz, Mishina Aigerim ; Final Exam + STATE EXAM] ▼ Test sobre OS | Quizzes #3 and #4, creado por Good Guy Beket el 28/03/2019.
- Autor
- Good Guy Beket
- Idioma
- English
- Visitas
- 530
- Etiquetas
- Valoración
- Aún sin valoraciones Valora este test