CS 537 - Quiz #2

1. One of the best scheduling polices is shortest-time-to-completion first, or STCF. What does it do? Why is it almost never used?

2. We've looked at computing physical addresses from base and bounds, now let's do the reverse! (note: "0x" before a number signifies that it's in hexadecimal format)
	VA 0: 0x00000308 (decimal: 776) --> VALID: 0x00003913 (decimal: 14611)
	VA 1: 0x00000255 (decimal: 597) --> VALID: 0x00003860 (decimal: 14432)
	VA 2: 0x000003a1 (decimal: 929) --> SEGMENTATION VIOLATION
What is the value of the base register? What about the bounds?

3. A virtual address space is 1GB (that's 30 bits for addressing, and you're welcome). Page size is 1KB (10 bits). Page table entries (PTEs) hold only a valid bit and a physical frame number (PFN). The system has 2^15 physical page frames (the one in class yesterday had 2^3, or 8). How much memory is used per process for a linear page table?