CS 140 Final: CS 140cs140 final autumn 2007 solutions

• School: Stanford University
• Department: Computer Science
• Course: CS 140
• Professor: All

Document Summary

In accordance with both the letter and the spirit of the stanford. Honor code, i did not cheat on this exam. Furthermore, i did not and will not assist anyone else in cheating on this exam. The exam has 15 questions totaling 100 points. Some questions may be much harder than others. Consider an x86 virtual machine monitor (vmm) such as vmware that uses binary translation for guest os kernel code. Some instructions can be translated identi- cally, meaning the exact same instruction is executed regardless of whether the os is running on the vmm or on raw hardware. Other instructions must be translated non-identically. (for example, since the vmm must intercept all hardware interrupts, the lidt instruction which loads the address of interrupt descriptor table cannot be translated identically. ) There may be more than one answer: ret, movl global, %eax, jmp *%eax, call printf, push %cs. Hardware mmus translate virtual to physical page numbers in accessed memory ad- dresses.