Computer Science exam

multiple-choice questions

QUESTION 1
1. A solution to the problem of external fragmentation is ______________
a. larger memory space
b. smaller memory space
c. compaction
d. none of the above
why ?
QUESTION 2
2. External fragmentation will not occur when _________________
a. first-fit is used
b. best-fit is used
c. worst-fit is used
d. no matter which algorithm is used, it will always occur
why ?
QUESTION 3
3. With paging there is no ____________ fragmentation
a. internal
b. external
c. either type of
d. none of the above
why ?
QUESTION 4
4. When there is a large logical address space, the best way of paging would be ___
a. not to page at all
b. a two-level paging algorithm
c. to page the page table itself
d. all of the above
why ?
QUESTION 5
5. In paged memory systems, if the page size is increased, then the internal fragmentation generally _____________________
a. becomes less
b. becomes more
c. remains constant
d. none of the above
why ?
QUESTION 6
6. The offset ‘d’ of the logical address must be ________________________
a. greater than the segment limit
b. between 0 and the segment limit
c. between 0 and the segment location
d. greater than the segment number
why ?
7.  A multilevel page table is preferred in comparison to a single level page table for translating virtual address to physical address because
a.  it reduces the memory access time to read or write a memory location
b.  it helps to reduce the size of page table needed to implement the virtual address space of a process
c.  it is required by the translation look aside buffer
d.  it helps to reduce the number of page faults in page replacement algorithms
why ?
QUESTION 8
8. The segment placement strategy that is most efficient is __
a. first-fit
b. best-fit
c. worst-fit
d. they are all the same level of efficiency
why ?
QUESTION 9
9. When a process generates an address reference, this reference is always a(n)
a. virtual address
b. real address
c. page frame address
d. none of the above
why ?
QUESTION 10
10.  Which page replacement strategy is consider most optimal ?
a. LRU
b. FIFO
c. Random
d. they are all the same
why ?
QUESTION 11
11. (in your own words) Explain how LRU can be approximated. Include the role the reference (use) bit and dirty pages play in the implementation of this algorithm.
QUESTION 12
12. Explain the role of the TLB in the mapping of virtual to real addresses.
QUESTION 13
13. Explain the algorithm for each of these placement strategies:  best fit, worst fit, first fit, and next fit.  Why would something called “worst-fit” even be a consideration?
QUESTION 14
14. Why are segmentation and paging sometimes combined into one scheme?
QUESTION 15
15. Explain the process of mapping a virtual address to a real address in a combined paging/segmentation system using a TLB
QUESTION 16
16. What is a working set?

PLACE THIS ORDER OR A SIMILAR ORDER WITH US TODAY AND GET A GOOD DISCOUNT