www.OS.com V

Question 1 of 74

1

227. The __________ is used as an index into the page table.

Select one of the following:

● frame bit
● frame offset
● page offset
● page number

Explanation

Question 2 of 74

1

228. The _____ table contains the base address of each page in physical
memory.

Select one of the following:

● frame
● page
● memory
● process

Explanation

Question 3 of 74

1

229. With paging there is no ________ fragmentation.

Select one of the following:

● internal
● external
● none of the above
● either type of

Explanation

Question 4 of 74

1

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.

Select one of the following:

● segment
● frame
● page
● memory

Explanation

Question 5 of 74

1

231. For every process there is a __________.

Select one of the following:

● page table
● frame table
● copy of page table
● pointer to page table

Explanation

Question 6 of 74

1

232. If a page number is not found in the TLB, then it is known as a:

Select one of the following:

● TLB ht
● buffer miss
● TLB miss

Explanation

Question 7 of 74

1

233. If a page table entry is present in the TLB, then it is known as a:

Select one of the following:

● TLB hit
● page fault
● TLB miss
● buffer miss

Explanation

Question 8 of 74

1

234. If a page table entry is not in main memory, then it is known as a:

Select one of the following:

● TLB miss
● TLB hit
● buffer miss
● page fault

Explanation

Question 9 of 74

1

235. In segmentation, each address is specified by (четыре вопроса в одном)choose two):

Select one of the following:

● a key
● a value
● a segment number, an offset

Explanation

Question 10 of 74

1

236. The set-associative map technique is a combination of the direct and associative
technique

Select one of the following:

true
false

Explanation

Question 11 of 74

1

237. The spatial aspect of the locally of reference means ________

Select one of the following:

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

Explanation

Question 12 of 74

1

238. The technique of searching for a block by going through all the tags is ______

Select one of the following:

d. Binary search
c. indirect search
b. Associative search
a. Linear search

Explanation

Question 13 of 74

1

239. The memory blocks are mapped on to the cache with the help of _________

Select one of the following:

d. Write policy
c. Replacement policy
b. Mapping functions
a. Hash functions

Explanation

Question 14 of 74

1

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)?

Select one of the following:

d. 8
c. 12
b. 14
a. 10

Explanation

Question 15 of 74

1

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?

Select one of the following:

d. 14
c. 12
b. 15
a. 13

Explanation

Question 16 of 74

1

242. Assuming a 1-KB page size, for the following address reference(четыре вопроса в одном)provided as
decimal number) 256, what is the page number?

Select one of the following:

0
-2
2

Explanation

Question 17 of 74

1

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

Select one of the following:

d. 2
c. 42
b. 12
a. 7

Explanation

Question 18 of 74

1

244. If it is not possibl e to tell, by looking at the program, what will happen when
it executes, then the program is

Select one of the following:

d. non-distributed
c. non-deterministic
b. non-deadlocked
a. non-divisible

Explanation

Question 19 of 74

1

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?

Select one of the following:

d. three
c. four
b. one
a. two

Explanation

Question 20 of 74

1

246. Computer programmers are often concerned with synchronization constraints,
which are requirements pertaining to the order of events. They are:

Select one of the following:

d. Serialization and Mutual exclusion
c. Queueing and dispatching
b. Scheduling and dispatching
a. Serialization and Mutual inclusion

Explanation

Question 21 of 74

1

247. The effectiveness of the cache memory is based on the property of ______

Select one of the following:

d. Locality of reference
c. Memory localisation
b. Memory size
a. Memory access time

Explanation

Question 22 of 74

1

248. In direct mapping the presence of the block in memory is checked with the help
of _______ field.

Select one of the following:

d. ser
c. tag
b. block
a. word

Explanation

Question 23 of 74

1

249. This matrix gives the maximum requirement of each process for each resource

Select one of the following:

d. Allocation matrix
c. Claim matrix
b. Resources matrix
a. Available matrix

Explanation

Question 24 of 74

1

250. If the resource allocation graph contains a cycle

Select one of the following:

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

Explanation

Question 25 of 74

1

251. Segment replacement algorithms are more complex than page replacement
algorithms because

Select one of the following:

d. Segments are better than pages
c. Pages are better than segments
b. Segments have variable sizes
a. Segments have fixed size

Explanation

Question 26 of 74

1

252. When does processor generate an Interrupt indicating a memory access fault?

Select one of the following:

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

Explanation

Question 27 of 74

1

253. Which of the replacement algorithms selects for replacement that page for which
the time to the next reference is the longest?

Select one of the following:

d. LRU
c. Clock
b. optimal
a. FIFO

Explanation

Question 28 of 74

1

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?

Select one of the following:

f. 300KB
e. 100KB
d. 500KB
c. 200KB
b. 600KB
a. No sufficient amount

Explanation

Question 29 of 74

1

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?

Select one of the following:

f. 300KB
e. 100KB
d. 200KB
c. 600KB
b. No sufficient amount
a. 500KB

Explanation

Question 30 of 74

1

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)?

Select one of the following:

d. 12
c. 10
b. 8
a. 14

Explanation

Question 31 of 74

1

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

Select one of the following:

d. 2
c. 1
b. 3
a. 4

Explanation

Question 32 of 74

1

258. A system has 3 processes sharing 4 resources. If each process needs a
maximum of 2 units then

Select one of the following:

d. deadlock can never occur
c. they all will starve
b. deadlock must occur
a. deadlock may occur

Explanation

Question 33 of 74

1

259. The two kinds of semaphore are

Select one of the following:

d. counting & decimal
c. mutex & counting
b. decimal & binary
a. binary & counting

Explanation

Question 34 of 74

1

260. The size of a process is limited to the size of

Select one of the following:

d. secondary storage
c. physical memory
b. external storage
a. none of the mentioned

Explanation

Question 35 of 74

1

261. In FIFO page replacement algorithm, when a page must be replaced

Select one of the following:

d. none of the mentioned
c. newest page is chosen
b. oldest page is chosen
a. random page is chosen

Explanation

Question 36 of 74

1

262. For larger page tables, they are kept in main memory and a ______ points to the page
table

Select one of the following:

d. page table register pointer
c. page table base
b. page table base pointer
a. page table base register

Explanation

Question 37 of 74

1

263. The essential content(s) in each entry of a page table is/are

Select one of the following:

d. Page frame number
c. Both virtual page number and page frame number
b. Access right information
a. Virtual page number

Explanation

Question 38 of 74

1

264. When a program tries to access a page that is mapped in address space but not loaded
in physical memory, then

Select one of the following:

d. fatal error occurs
c. segmentation fault occurs
b. page fault occurs
a. no error occurs

Explanation

Question 39 of 74

1

265. A page fault occurs when

Select one of the following:

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

Explanation

Question 40 of 74

1

266. sem.wait()

Select one of the following:

d. decrements the semaphore
c. reads the semaphore
b. initializes the semaphore
a. increments the semaphore

Explanation

Question 41 of 74

1

267. Each entry in a segment table has a

Select one of the following:

d. segment base
c. segment peak
b. segment value
a. none of the mentioned

Explanation

Question 42 of 74

1

268. Virtual memory takes advantage of

Select one of the following:

d. Scheduling
c. Modular programming
b. Large secondary memory
a. Fast CPU

Explanation

Question 43 of 74

1

269. Because of virtual memory, the memory can be shared among

Select one of the following:

d. processes
c. threads
b. none of the mentioned
a. instructions

Explanation

Question 44 of 74

1

270. If no frames are free and modify bit is set for all pages in frames, _____ page
transfer(s) is/are required

Select one of the following:

d. one
c. four
b. three
a. two

Explanation

Question 45 of 74

1

271. Which is the fastest cache mapping function?

Select one of the following:

c. Set associative mapping
b. Direct mapping
a. Fully associative mapping

Explanation

Question 46 of 74

1

272. This bit indicates if the slot holds a block belonging to the program being executed

Select one of the following:

d. Dirty bit
c. Valid bit
b. Control bit
a. Reference bit

Explanation

Question 47 of 74

1

273. The size of virtual storage is limited by….

Select one of the following:

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

Explanation

Question 48 of 74

1

274. Optimal page - replacement algorithm is difficult to implement, because

Select one of the following:

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

Explanation

Question 49 of 74

1

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:

Select one of the following:

d. dynamic condition
c. critical condition
b. essential condition
a. race condition

Explanation

Question 50 of 74

1

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?

Select one of the following:

f. No sufficient amount
e. 300KB
d. 100KB
c. 500KB
b. 200KB
a. 600KB

Explanation

Question 51 of 74

1

278. Address Binding is

Select one of the following:

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

Explanation

Question 52 of 74

1

279. When free memory is split into many unconnected pieces we call it:

Select one of the following:

d. Compaction
c. Internal fragmentation
b. External fragmentation
a. Memory distribution

Explanation

Question 53 of 74

1

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

Select one of the following:

d. m, n
c. m - n, n
b. n, m
a. m - n, m

Explanation

Question 54 of 74

1

281. Assuming a 1-KB page size, for the following address reference(четыре вопроса в одном)provided as
decimal number) 2375, what is the page number?

Select one of the following:

2
1
3

Explanation

Question 55 of 74

1

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?

Select one of the following:

d. P0, P1, P2
c. P2, P0, P1
b. P1, P0, P2
a. P1, P2, P0

Explanation

Question 56 of 74

1

283. If there are 32 segments, each of size 1KB, then the logical address should have

Select one of the following:

d. 15 bits
c. 16 bits
b. 14 bits
a. 13 bits

Explanation

Question 57 of 74

1

284. A multilevel page table is preferred in comparison to a single level page table for
translating virtual address to physical address because

Select one of the following:

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

Explanation

Question 58 of 74

1

285. If the resources are always preempted from the same process, _______ can occur

Select one of the following:

d. aging
c. system cash
b. starvation Problems
a. deadlock

Explanation

Question 59 of 74

1

286. Which one of the following is a visual (mathematical) way to determine the deadlock
occurrence?

Select one of the following:

d. resource allocation graph
c. inversion graph
b. deadlock occurrence graph
a. starvation graph

Explanation

Question 60 of 74

1

287. To ensure that the hold and wait condition never occurs in the system, it must be
ensured that

Select one of the following:

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

Explanation

Question 61 of 74

1

288. If no cycle exists in the resource allocation graph

Select one of the following:

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

Explanation

Question 62 of 74

1

289. The memory allocation scheme subject to “internal” fragmentation is?

Select one of the following:

d. fixed partitioning
c. virtual memory segmentation
b. pure demand paging
a. segmentation

Explanation

Question 63 of 74

1

290. Thrashing _______ the CPU utilization

Select one of the following:

d. increases
c. none of the mentioned
b. decreases
a. keeps constant

Explanation

Question 64 of 74

1

291. The data structures available in the Banker’s algorithm are (выберите один или
несколько ответов)

Select one of the following:

c. all of the mentioned
d. available
b. need
a. allocation

Explanation

Question 65 of 74

1

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

Select one of the following:

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

Explanation

Question 66 of 74

1

293. What is the drawback of banker’s algorithm

Select one of the following:

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

Explanation

Question 67 of 74

1

294. For a deadlock to arise, which of the following conditions must hold simultaneously?
(выберите один или несколько ответов)

Select one of the following:

d. hold and wait
c. all the mentioned
b. no preemption
a. mutual exclusion

Explanation

Question 68 of 74

1

295. Memory partitioning algorithm that uses binary tree as a data structure is called

Select one of the following:

d. Next-fit algorithm
c. Best-fit algorithm
b. First-fit algorithm
a. Buddy system

Explanation

Question 69 of 74

1

296. A mutex

Select one of the following:

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

Explanation

Question 70 of 74

1

297. ________ replacement allows each process to only select from its own set of allocated
frames

Select one of the following:

d. universal
c. global
b. public
a. local

Explanation

Question 71 of 74

1

298. LRU page - replacement algorithm associates with each page the ________

Select one of the following:

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

Explanation

Question 72 of 74

1

299. Which of the following is true?

Select one of the following:

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

	Created by hoffa HOFFMAN over 4 years ago

Quiz on www.OS.com V, created by hoffa HOFFMAN on 19/12/2019.

www.OS.com V

www.OS.com V

Question 1 of 74

227. The __________ is used as an index into the page table.

Select one of the following:

Explanation

Question 2 of 74

228. The _____ table contains the base address of each page in physical memory.

Select one of the following:

Explanation

Question 3 of 74

229. With paging there is no ________ fragmentation.

Select one of the following:

Explanation

Question 4 of 74

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.

Select one of the following:

Explanation

Question 5 of 74

231. For every process there is a __________.

Select one of the following:

Explanation

Question 6 of 74

232. If a page number is not found in the TLB, then it is known as a:

Select one of the following:

Explanation

Question 7 of 74

233. If a page table entry is present in the TLB, then it is known as a:

Select one of the following:

Explanation

Question 8 of 74

234. If a page table entry is not in main memory, then it is known as a:

Select one of the following:

Explanation

Question 9 of 74

235. In segmentation, each address is specified by (четыре вопроса в одном)choose two):

Select one of the following:

Explanation

Question 10 of 74

236. The set-associative map technique is a combination of the direct and associative technique

Select one of the following:

Explanation

Question 11 of 74

237. The spatial aspect of the locally of reference means ________

Select one of the following:

Explanation

Question 12 of 74

238. The technique of searching for a block by going through all the tags is ______

Select one of the following:

Explanation

Question 13 of 74

239. The memory blocks are mapped on to the cache with the help of _________

Select one of the following:

Explanation

Question 14 of 74

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)?

Select one of the following:

Explanation

Question 15 of 74

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?

Select one of the following:

Explanation

Question 16 of 74

242. Assuming a 1-KB page size, for the following address reference(четыре вопроса в одном)provided as decimal number) 256, what is the page number?

Select one of the following:

Explanation

Question 17 of 74

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

Select one of the following:

Explanation

Question 18 of 74

244. If it is not possibl e to tell, by looking at the program, what will happen when it executes, then the program is

Select one of the following:

Explanation

Question 19 of 74

Select one of the following:

Explanation

Question 20 of 74

246. Computer programmers are often concerned with synchronization constraints, which are requirements pertaining to the order of events. They are:

228. The _____ table contains the base address of each page in physical
memory.

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.

236. The set-associative map technique is a combination of the direct and associative
technique

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)?

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?

242. Assuming a 1-KB page size, for the following address reference(четыре вопроса в одном)provided as
decimal number) 256, what is the page number?

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

244. If it is not possibl e to tell, by looking at the program, what will happen when
it executes, then the program is

246. Computer programmers are often concerned with synchronization constraints,
which are requirements pertaining to the order of events. They are:

248. In direct mapping the presence of the block in memory is checked with the help
of _______ field.

251. Segment replacement algorithms are more complex than page replacement
algorithms because

253. Which of the replacement algorithms selects for replacement that page for which
the time to the next reference is the longest?

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?

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?

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)?

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

258. A system has 3 processes sharing 4 resources. If each process needs a
maximum of 2 units then

262. For larger page tables, they are kept in main memory and a ______ points to the page
table