Describe how bit stuffing works.

A capability ticket / entry provides access rights per resource.

Define Deadlock. What causes it?  How can it be resolved?

With respect to short term scheduling, name three things that users generally want from the system and briefly describe each.

A process with 10 threads in it runs on a system where the kernel handles all thread management; how many of the threads can continue to run if one of them blocks?

Name three things that using virtual memory on a computer lets you do that you can’t do if it does not use virtual memory?

Approximately how many bytes are actually available on a “100 GB” hard drive?

Your boss is discussing error handling in an OS. He says that memory-related traps are considered more serious so are always handled ahead of (i.e., have priority over) lesser traps like arithmetic traps (e.g., divide by zero). Is he right? Why or why not?

Deadlines are used by processes to tell the kernel the times by which they must have started and/or stopped running.

64-bit systems perform better with 8 Gbytes of real memory than they do with only 4 Gbytes.