For some reason i cant seem to find the answer to this anywhere on the internet for the midterm 2008 cs 537

Assume a 32-bit virtual address space and further assume that we are using paging. Also assume that the virtual address is chopped into a 20-bit virtual page number (VPN) and a 12-bit offset. The TLB has the following contents in each entry: a 20-bit VPN, a 20-bit PPN, and an 8-bit PID field. This TLB only has four entries, and they look like this: VPN PPN PID

00000 00FFF 00

00000 00AAB 01

00010 F000A 00

010FF 00ABC 01 Note all these numbers are in hex. Thus, each represents four bits (e.g., hex F is 1111, hex A is 1010, hex 7 is 0111, and so forth). That is why the 20-bit VPN and PPN are represented by five hex numbers each. Now, for each of the following virtual address, say whether we have a TLB hit or a TLB miss. If it is a hit, provide the resulting physical address (in hex). Note: unless said otherwise, virtual addresses are also in hex. (a) PID 00 generates the virtual address: 00000000

(b) PID 01 generates the virtual address: 00000000

(c) PID 00 generates the virtual address: FF00FFAA

(d) PID 00 generates the virtual address: 0010FFAA

(e) PID 01 generates the virtual address: 0010FFAA

(f) PID 00 generates the virtual address: 000000FF

(g) PID 01 generates the virtual address: 00000FAB

(h) PID 00 generates the virtual address: 010FFFFF

(i) PID 01 generates the binary virtual address 00000001000011111111010100001111

(j) PID 00 generates the binary virtual address 00000001000011111111010100001111

(k) PID 02 generates the virtual address: 00000000