COMP 3000 Midterm review 2010: Difference between revisions

From Soma-notes
Line 27: Line 27:


==Essay 2 Questions==
==Essay 2 Questions==
None.
# Why have bigger disks and larger memories inspired revised system call interfaces?


==Essay 3 Questions==
==Essay 3 Questions==

Revision as of 17:09, 17 October 2010

Lab 1 Questions

  1. What are the key advantages of installing VM-specific device drivers in a guest OS?
  2. Typically, what does a guest OS's hard disk look like to the host OS?
  3. If a virtual machine is allocated 512 MB of RAM, how much physical RAM (as seen by the host OS) will be consumed?

Lab 2 Questions

  1. The execve system call gets three arguments: a full pathname to an executable, arguments, and environment variables. What are each of these for when "ls -a" is run?
  2. Why doesn't ldd report all the libraries that are listed in /proc/<PID>/maps?
  3. When a process becomes undead (a zombie), who can send it to its grave permanently? What must it do?
  4. UNIX files each have permissions for three classes of users. What are those classes? Extra credit: Does Windows have similar classes?


Lab 3 Questions

  1. A solution to the producer/consumer problem must take into account many conditions. What are three of them?
  2. Can the fork system call do everything the clone system call can do? Explain.
  3. What are three events that cause signals to be sent in UNIX?
  4. What system call do you use to send data over an already existing pipe?


Essay 1 Questions

  1. What is the key difference between an exokernel library OS and a guest OS running on a VM?
  2. Why can exokernels provide much better performance than a microkernel for certain workloads?

Essay 2 Questions

  1. Why have bigger disks and larger memories inspired revised system call interfaces?

Essay 3 Questions

  1. Which has better support for backwards compatibility, z/OS or Windows 7? Explain.
  2. How is a cluster like a mainframe? How is it different?

Essay 4 Questions

Essay 5 Questions

1. What is the main reason why modern schedluers, like the ULE and recent Linux schedulers, require a scheduling algorithm which operates in constant (O(1)) time? Explain?

2. Describe two ways that a scheduler can attempt to provide "fair" allocation of processor time to all threads in the system. Provide a description of the pros and cons of the methods you provide.

Essay 6 Questions

Essay 7 Questions

  1. What is a major obstacle to thread scalability? Explain.

Essay 8 Questions

  1. What new style of processing caused the development of the POSIX standards?

Essay 9 Questions

Essay 10 Questions

Essay 11 Questions

Essay 12 Questions