5/1/2019 Practice Fill-ins
Practice Fill-ins
i. When a linker converts a relative address to the corresponding absolute address, we say it is ____________________ the relative address.
ii. A program in execution is called a ______________.
Copyright By PowCoder代写 加微信 powcoder
iii. The processor scheduling algorithm resulting in the smallest average waiting time is _____________.
iv. A directed graph with processes represented as circles, resources represented as squares, and requests and allocations represented as arcs is called a ______________.
v. An associative memory where the index field is the page number and the other fields include the frame number, dirty bit, and valid bit is called a ________________.
vi. The set of pages referenced by the last k memory references ending at reference t is called the _____________.
vii. The memory management scheme in which the virtual address space is NOT contiguous is ______________.
viii. The practical file system based on linked allocation is the _______________,
ix. In the most common Unix file system, each file and directory has an associated ____________.
x. A disk controller that loads directly from and stores directly to main system memory is performing _________________.
file:///allan/gottlieb/courses/os/exams/final/practice/practice-final-fill-in.html 1/1
程序代写 CS代考 加微信: powcoder QQ: 1823890830 Email: powcoder@163.com