20491127
Descripción
Test por hoffa HOFFMAN, actualizado hace más de 1 año
|
Creado por hoffa HOFFMAN
hace más de 4 años
|
|
Pregunta 1
Pregunta
227. The __________ is used as an index into the page table.
Respuesta
-
● frame bit
-
● frame offset
-
● page offset
-
● page number
Pregunta 2
Pregunta
228. The _____ table contains the base address of each page in physical
memory.
Respuesta
-
● frame
-
● page
-
● memory
-
● process
Pregunta 3
Pregunta
229. With paging there is no ________ fragmentation.
Respuesta
-
● internal
-
● external
-
● none of the above
-
● either type of
Pregunta 4
Pregunta
230. The operating system maintains a ______ table that keeps track of how
many frames have been allocated, how many are there, and how many are
available.
Respuesta
-
● segment
-
● frame
-
● page
-
● memory
Pregunta 5
Pregunta
231. For every process there is a __________.
Respuesta
-
● page table
-
● frame table
-
● copy of page table
-
● pointer to page table
Pregunta 6
Pregunta
232. If a page number is not found in the TLB, then it is known as a:
Respuesta
-
● TLB ht
-
● buffer miss
-
● TLB miss
Pregunta 7
Pregunta
233. If a page table entry is present in the TLB, then it is known as a:
Respuesta
-
● TLB hit
-
● page fault
-
● TLB miss
-
● buffer miss
Pregunta 8
Pregunta
234. If a page table entry is not in main memory, then it is known as a:
Respuesta
-
● TLB miss
-
● TLB hit
-
● buffer miss
-
● page fault
Pregunta 9
Pregunta
235. In segmentation, each address is specified by (четыре вопроса в одном)choose two):
Respuesta
-
● a key
-
● a value
-
● a segment number, an offset
Pregunta 10
Pregunta
236. The set-associative map technique is a combination of the direct and associative
technique
Respuesta
-
true
-
false
Pregunta 11
Pregunta
237. The spatial aspect of the locally of reference means ________
Respuesta
-
d. That the recently executed instruction is executed again next
-
c. That the instruction executed will be executed at a later time
-
b. That the recently executed won’t be executed again
-
a. That the instruction in close proximity of the instruction executed will be executed in future
Pregunta 12
Pregunta
238. The technique of searching for a block by going through all the tags is ______
Respuesta
-
d. Binary search
-
c. indirect search
-
b. Associative search
-
a. Linear search
Pregunta 13
Pregunta
239. The memory blocks are mapped on to the cache with the help of _________
Respuesta
-
d. Write policy
-
c. Replacement policy
-
b. Mapping functions
-
a. Hash functions
Pregunta 14
Pregunta
240. For 4 page frames, the following is the reference string:
1 2 3 4 2 1 5 6 2 1 2 3 7 6 3 2 1 2 3 6
How many page faults does the LRU page replacement algorithm produce(четыре вопроса в одном)including
page faults when the frames were free)?
Respuesta
-
d. 8
-
c. 12
-
b. 14
-
a. 10
Pregunta 15
Pregunta
241. Consider a logical address space of 32 pages with 512 words per page, mapped
onto a physical memory of 16 frames. How many bits are required in the physical
address?
Respuesta
-
d. 14
-
c. 12
-
b. 15
-
a. 13
Pregunta 16
Pregunta
242. Assuming a 1-KB page size, for the following address reference(четыре вопроса в одном)provided as
decimal number) 256, what is the page number?
Respuesta
-
0
-
-2
-
2
Pregunta 17
Pregunta
243. At a particular time of computation the value of a counting semaphore is 7. Then
20P operations were completed on this semaphore. The resulting value of the
semaphore is
Respuesta
-
d. 2
-
c. 42
-
b. 12
-
a. 7
Pregunta 18
Pregunta
244. If it is not possibl e to tell, by looking at the program, what will happen when
it executes, then the program is
Respuesta
-
d. non-distributed
-
c. non-deterministic
-
b. non-deadlocked
-
a. non-divisible
Pregunta 19
Pregunta
245. The program follows to use a shared binary semaphore T:
Process A
int Y;
A1: Y=X*2;
A2: X=Y;
signal(четыре вопроса в одном)T);
Process B
int Z;
B1:wait(четыре вопроса в одном)t);
B2: Z = X + 1;
X = Z;
T is set to 0 before either process begins execution and, as before, X is set to 5. Now,
how many different values of X are possible after both processes finish executing?
Respuesta
-
d. three
-
c. four
-
b. one
-
a. two
Pregunta 20
Pregunta
246. Computer programmers are often concerned with synchronization constraints,
which are requirements pertaining to the order of events. They are:
Respuesta
-
d. Serialization and Mutual exclusion
-
c. Queueing and dispatching
-
b. Scheduling and dispatching
-
a. Serialization and Mutual inclusion
Pregunta 21
Pregunta
247. The effectiveness of the cache memory is based on the property of ______
Respuesta
-
d. Locality of reference
-
c. Memory localisation
-
b. Memory size
-
a. Memory access time
Pregunta 22
Pregunta
248. In direct mapping the presence of the block in memory is checked with the help
of _______ field.
Respuesta
-
d. ser
-
c. tag
-
b. block
-
a. word
Pregunta 23
Pregunta
249. This matrix gives the maximum requirement of each process for each resource
Respuesta
-
d. Allocation matrix
-
c. Claim matrix
-
b. Resources matrix
-
a. Available matrix
Pregunta 24
Pregunta
250. If the resource allocation graph contains a cycle
Respuesta
-
d. then a deadlock does not exist
-
c. then the system is in a safe state
-
b. either deadlock exists or system is in a safe state
-
a. then a deadlock exists
Pregunta 25
Pregunta
251. Segment replacement algorithms are more complex than page replacement
algorithms because
Respuesta
-
d. Segments are better than pages
-
c. Pages are better than segments
-
b. Segments have variable sizes
-
a. Segments have fixed size
Pregunta 26
Pregunta
252. When does processor generate an Interrupt indicating a memory access fault?
Respuesta
-
d. If there is no enough free memory for the running application
-
c. If it encounters a logical address that is not in main memory
-
b. If it encounters a logical address that is not in cache memory
-
a. If it encounters a logical address that is not in secondary memory
Pregunta 27
Pregunta
253. Which of the replacement algorithms selects for replacement that page for which
the time to the next reference is the longest?
Respuesta
-
d. LRU
-
c. Clock
-
b. optimal
-
a. FIFO
Pregunta 28
Pregunta
254. Given five memory partitions of 100KB, 500KB, 200KB, 300KB, and 600KB. The
first-fit algorithm places processes of 212KB, 417KB, 112KB, and 426KB. In whch
partition 426KB is placed?
Respuesta
-
f. 300KB
-
e. 100KB
-
d. 500KB
-
c. 200KB
-
b. 600KB
-
a. No sufficient amount
Pregunta 29
Pregunta
255. Given five memory partitions of 100KB, 500KB, 200KB, 300KB, and 600KB. The
worst-fit algorithm places processes of 212KB, 417KB, 112KB, and 426KB. In whch
partition 426KB is placed?
Respuesta
-
f. 300KB
-
e. 100KB
-
d. 200KB
-
c. 600KB
-
b. No sufficient amount
-
a. 500KB
Pregunta 30
Pregunta
256. For 4 page frames, the following is the reference string:
1 2 3 4 2 1 5 6 2 1 2 3 7 6 3 2 1 2 3 6
How many page faults does the Optimal page replacement algorithm produce
(четыре вопроса в одном)including page faults when the frames were tree)?
Respuesta
-
d. 12
-
c. 10
-
b. 8
-
a. 14
Pregunta 31
Pregunta
257. A computer system has 6 tape drives, with ‘n’ processes competing for them.
Each process may need 3 tape drives. The maximum value of ‘n’ for which the system
is guaranteed to be deadlock free is
Respuesta
-
d. 2
-
c. 1
-
b. 3
-
a. 4
Pregunta 32
Pregunta
258. A system has 3 processes sharing 4 resources. If each process needs a
maximum of 2 units then
Respuesta
-
d. deadlock can never occur
-
c. they all will starve
-
b. deadlock must occur
-
a. deadlock may occur
Pregunta 33
Pregunta
259. The two kinds of semaphore are
Respuesta
-
d. counting & decimal
-
c. mutex & counting
-
b. decimal & binary
-
a. binary & counting
Pregunta 34
Pregunta
260. The size of a process is limited to the size of
Respuesta
-
d. secondary storage
-
c. physical memory
-
b. external storage
-
a. none of the mentioned
Pregunta 35
Pregunta
261. In FIFO page replacement algorithm, when a page must be replaced
Respuesta
-
d. none of the mentioned
-
c. newest page is chosen
-
b. oldest page is chosen
-
a. random page is chosen
Pregunta 36
Pregunta
262. For larger page tables, they are kept in main memory and a ______ points to the page
table
Respuesta
-
d. page table register pointer
-
c. page table base
-
b. page table base pointer
-
a. page table base register
Pregunta 37
Pregunta
263. The essential content(s) in each entry of a page table is/are
Respuesta
-
d. Page frame number
-
c. Both virtual page number and page frame number
-
b. Access right information
-
a. Virtual page number
Pregunta 38
Pregunta
264. When a program tries to access a page that is mapped in address space but not loaded
in physical memory, then
Respuesta
-
d. fatal error occurs
-
c. segmentation fault occurs
-
b. page fault occurs
-
a. no error occurs
Pregunta 39
Pregunta
265. A page fault occurs when
Respuesta
-
d. a page gives inconsistent data
-
c. a page is invisible
-
b. a page cannot be accessed due to its absence from memory
-
a. all of the mentioned
Pregunta 40
Pregunta
266. sem.wait()
Respuesta
-
d. decrements the semaphore
-
c. reads the semaphore
-
b. initializes the semaphore
-
a. increments the semaphore
Pregunta 41
Pregunta
267. Each entry in a segment table has a
Respuesta
-
d. segment base
-
c. segment peak
-
b. segment value
-
a. none of the mentioned
Pregunta 42
Pregunta
268. Virtual memory takes advantage of
Respuesta
-
d. Scheduling
-
c. Modular programming
-
b. Large secondary memory
-
a. Fast CPU
Pregunta 43
Pregunta
269. Because of virtual memory, the memory can be shared among
Respuesta
-
d. processes
-
c. threads
-
b. none of the mentioned
-
a. instructions
Pregunta 44
Pregunta
270. If no frames are free and modify bit is set for all pages in frames, _____ page
transfer(s) is/are required
Respuesta
-
d. one
-
c. four
-
b. three
-
a. two
Pregunta 45
Pregunta
271. Which is the fastest cache mapping function?
Respuesta
-
c. Set associative mapping
-
b. Direct mapping
-
a. Fully associative mapping
Pregunta 46
Pregunta
272. This bit indicates if the slot holds a block belonging to the program being executed
Respuesta
-
d. Dirty bit
-
c. Valid bit
-
b. Control bit
-
a. Reference bit
Pregunta 47
Pregunta
273. The size of virtual storage is limited by….
Respuesta
-
i. The set of physical addresses
-
g. the amount of main memory and secondary memory
-
f. The portion of a process that is in a secondary memory at any time
-
e. the actual number of main storage locations
-
d. The portion of a secondary memory that contains pages or segments of particular application
-
c. the number of processors in a system
-
b. The portion of a process that is actually in mean memory at any time
-
a. the addressing scheme of the computer system and by the amount of secondary memory
Pregunta 48
Pregunta
274. Optimal page - replacement algorithm is difficult to implement, because
Respuesta
-
d. it is too complex
-
c. it requires future knowledge of the reference string
-
b. it is extremely expensive
-
a. it requires a lot of information
Pregunta 49
Pregunta
276. When several processes access the same data concurrently and the outcome of the
execution depends on the particular order in which the access takes place, is called:
Respuesta
-
d. dynamic condition
-
c. critical condition
-
b. essential condition
-
a. race condition
Pregunta 50
Pregunta
277. Given five memory partitions of 100KB, 500KB, 200KB, 300KB, and 600KB. The bestfit algorithm places processes of 212KB, 417KB, 112KB, and 426KB. In whch partition
112KB is placed?
Respuesta
-
f. No sufficient amount
-
e. 300KB
-
d. 100KB
-
c. 500KB
-
b. 200KB
-
a. 600KB
Pregunta 51
Pregunta
278. Address Binding is
Respuesta
-
d. binding two addresses together to form a new address in a different memory space
-
c. locating an address with the help of another address
-
b. a mapping from one address space to another
-
a. going to an address in memory
Pregunta 52
Pregunta
279. When free memory is split into many unconnected pieces we call it:
Respuesta
-
d. Compaction
-
c. Internal fragmentation
-
b. External fragmentation
-
a. Memory distribution
Pregunta 53
Pregunta
280. If the size of logical address space is 2 to the power of m, and a page size is 2 to the
power of n addressing units, then the high order _____ bits of a logical address designate
the page number, and the ____ low order bits designate the page offset
Respuesta
-
d. m, n
-
c. m - n, n
-
b. n, m
-
a. m - n, m
Pregunta 54
Pregunta
281. Assuming a 1-KB page size, for the following address reference(четыре вопроса в одном)provided as
decimal number) 2375, what is the page number?
Respuesta
-
2
-
1
-
3
Pregunta 55
Pregunta
282. A system has 12 magnetic tape drives and 3 processes: P0, P1, and P2. Process P0
requires 10 tape drives, P1 requires 4 and P2 requires 9 tape drives. Process Maximum
needs Currently allocated
P0 10 5
P1 4 2
P2 9 2
Which of the following sequence is a safe sequence?
Respuesta
-
d. P0, P1, P2
-
c. P2, P0, P1
-
b. P1, P0, P2
-
a. P1, P2, P0
Pregunta 56
Pregunta
283. If there are 32 segments, each of size 1KB, then the logical address should have
Respuesta
-
d. 15 bits
-
c. 16 bits
-
b. 14 bits
-
a. 13 bits
Pregunta 57
Pregunta
284. A multilevel page table is preferred in comparison to a single level page table for
translating virtual address to physical address because
Respuesta
-
d. it helps to reduce the size of page table needed to implement the virtual address space of a process
-
c. it reduces the memory access time to read or write a memory location
-
b. it is required by the translation lookaside buffer
-
a. It helps to reduce the number of page faults in page replacement algorithms
Pregunta 58
Pregunta
285. If the resources are always preempted from the same process, _______ can occur
Respuesta
-
d. aging
-
c. system cash
-
b. starvation Problems
-
a. deadlock
Pregunta 59
Pregunta
286. Which one of the following is a visual (mathematical) way to determine the deadlock
occurrence?
Respuesta
-
d. resource allocation graph
-
c. inversion graph
-
b. deadlock occurrence graph
-
a. starvation graph
Pregunta 60
Pregunta
287. To ensure that the hold and wait condition never occurs in the system, it must be
ensured that
Respuesta
-
d. all the mentioned
-
c. a process can request resources only when it has none
-
b. each process must request and be allocated all its resources before it begins its execution
-
a. whenever a resource is requested by a process, it is not holding any other resources
Pregunta 61
Pregunta
288. If no cycle exists in the resource allocation graph
Respuesta
-
d. none of the mentioned
-
c. then the system will be in a safe state
-
b. then the system will not be in a safe state
-
a. all the mentioned
Pregunta 62
Pregunta
289. The memory allocation scheme subject to “internal” fragmentation is?
Respuesta
-
d. fixed partitioning
-
c. virtual memory segmentation
-
b. pure demand paging
-
a. segmentation
Pregunta 63
Pregunta
290. Thrashing _______ the CPU utilization
Respuesta
-
d. increases
-
c. none of the mentioned
-
b. decreases
-
a. keeps constant
Pregunta 64
Pregunta
291. The data structures available in the Banker’s algorithm are (выберите один или
несколько ответов)
Respuesta
-
c. all of the mentioned
-
d. available
-
b. need
-
a. allocation
Pregunta 65
Pregunta
292. Each request requires that the system consider the _______ to decide whether the
current request can be satisfied or must wait to avoid a future possible deadlock
Respuesta
-
d. future requests and releases of each process
-
c. resources currently available
-
b. processes that have previously been in the system
-
a. resources currently allocated to each process
Pregunta 66
Pregunta
293. What is the drawback of banker’s algorithm
Respuesta
-
d. the number of processes does not change as time progresses
-
c. in advance processes rarely know that how much resource they will need
-
b. resources are always available
-
a. none of the mentioned
Pregunta 67
Pregunta
294. For a deadlock to arise, which of the following conditions must hold simultaneously?
(выберите один или несколько ответов)
Respuesta
-
d. hold and wait
-
c. all the mentioned
-
b. no preemption
-
a. mutual exclusion
Pregunta 68
Pregunta
295. Memory partitioning algorithm that uses binary tree as a data structure is called
Respuesta
-
d. Next-fit algorithm
-
c. Best-fit algorithm
-
b. First-fit algorithm
-
a. Buddy system
Pregunta 69
Pregunta
296. A mutex
Respuesta
-
d. is a hexademical value
-
c. must be accessed from only one process
-
b. can be accessed from multiple processes
-
a. cannot be accessed by processes
Pregunta 70
Pregunta
297. ________ replacement allows each process to only select from its own set of allocated
frames
Respuesta
-
d. universal
-
c. global
-
b. public
-
a. local
Pregunta 71
Pregunta
298. LRU page - replacement algorithm associates with each page the ________
Respuesta
-
d. time it was brought into memory
-
c. the time of that page’s last use
-
b. all of the mentioned
-
a. page after and before it
Pregunta 72
Pregunta
299. Which of the following is true?
Respuesta
-
d. Overlays are used to increase the size of physical memory
-
c. Overlays are used to increase the logical address space
-
b. When overlays are used, the size of a process is not limited to the size of the physical memory
-
a. Overlays are used whenever the physical address space is smaller than the logical address space
Pregunta 73
Pregunta
300. The bounded buffer problem is also known as
Respuesta
-
d. Readers - Writers problem
-
c. Dining - Philosopher problem
-
b. Banker’s algorithm
-
a. Producer - Consumer problem
Pregunta 74
Pregunta
301. Semaphore operation semV() is alternative to
Respuesta
-
d. semaphore initialization
-
c. semaphore read
-
b. sem.signal()
-
a. sem.wait()
¿Quieres crear tus propios Tests gratis con GoConqr? Más información.