Memory Management
Paging
File System
I/O Device Interfacing
Disks
100

This is the theory that young objects die more quickly than new ones.

What is the generational hypothesis?
100

I contain mappings from pages to page frames.

What is a page table?

100

In this type of file layout, an inode contains pointers to all the blocks in the file.

What is an indexed file layout?

100

I involve repeatedly checking the status of the I/O interrupt.

What is polling?

100
The time it takes for the head to find the correct track on the disk.

What is seek time?

200

This type of fragmentation occurs when there is unused memory between units of allocation. Coalescing free blocks is used to cope with this type of fragmentation.

What is internal fragmentation?

200

This occurs when a process tries to access a page that is currently not in physical memory.

What is a page fault?

200
______ are files that contain mappings to inodes.

Directories

200

I involve doing other things while waiting for the I/O, then reading the data once I am notified that the I/O is complete.

What is an interrupt?

200

I have better random access performance and am more resistant to physical damage in comparison to disks.

What are solid state drives?

300

Some disadvantages to this type of relocation include no protection, memory must be allocated contiguously, and the inability to move an address after it is placed.

What is static relocation?

300

I am a page replacement algorithm that throws out the page that hasn't been used for the most clock cycles.

What is the Least Recently Used algorithm?

300

3 criteria for evaluating file systems.

What is speed, reliability, and usability.

300

An advantage to me is that I provide speedy transfer rates, however, I require additional hardware to work.

What is direct memory access?

300

I am a disk scheduler that uses a greedy algorithm.

What is Shortest Seek Time First?

400

This type of garbage collection involves copying reachable objects into a "to" space, reclaiming the "from" space en masse, and the start of new allocation to the "to" space.

What is semi-sweep?

400

I am a page replacement algorithm that involves looping through a circular list of pages and evicting a page whose reference bit is 0.

What is a clock?

400

Grouping transactions together so that they are atomic, durable, and serializable.

What is Journaling?

400

4 pieces of hardware associated with an I/O device.

What is the bus, device port, controller, the actual device?

400

I am a disk scheduling algorithm that involves heading in one direction until there are no more requests, then moving the opposite direction.

What is elevator?

500

I am a type of relocation that involves the use of a relocation register that converts virtual addresses to get physical addresses.

What is dynamic relocation?

500
The larger I am, the less memory overhead is used, the smaller I am, the more overhead used.

What is page size?

500

I utilize write-back caching for user data and write-through caching for metadata.

What is FSCK?

500

What registers does the device port hold?

What is status, control, data-in, data-out?

500

I am a disk scheduling algorithm that involves going all the way to the inner track then jumping to the outer track and going back in again.

What is CSCAN / CLOOK?

M
e
n
u