5/1/2019 Practice Fill-ins
Practice Fill-ins
I have decided to make a portion of the exam fill-in-the-blank. The main advantage is that it takes you less time and eases any time pressure on the real final. Here are some typical questions.
i. When a linker converts a relative address to the corresponding absolute address, we say it is ____________________ the relative address.
Copyright By PowCoder代写 加微信 powcoder
relocating
ii. A program in execution is called a ______________.
process (or thread)
iii. The processor scheduling algorithm resulting in the smallest average waiting time is _____________.
shortest job (or process) next (or first)
iv. A directed graph with processes represented as circles, resources represented as squares, and requests and allocations represented as arcs is called a ______________.
resource allocation graph (or reusable resource graph)
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 ________________.
translation lookaside buffer (or TLB)
vi. The set of pages referenced by the last k memory references ending at reference t is called the _____________.
working set at time t with window k (or just working set)
vii. The memory management scheme in which the virtual address space is NOT contiguous is ______________.
segmentation
viii. The practical file system based on linked allocation is the _______________,
FAT file system
ix. In the most common Unix file system, each file and directory has an associated ____________.
i-node (or inode)
x. A disk controller that loads/stores from/to main system memory is performing _________________.
direct memory access (or DMA)
file:///allan/gottlieb/courses/os/exams/final/practice/practice-final-fill-in-ans.html 1/1
程序代写 CS代考 加微信: powcoder QQ: 1823890830 Email: powcoder@163.com