Midterms and Exams
Midterm
Final Exam ("Second Midterm"):
Outline:
1. Memory Management
a. What are the structures in the OS that support
the functions of memory management?
i. Page Tables
ii. Page Frame Database
iii. Free lists
b. What are the algorithms in the OS that support
the functions of memory management?
i. Page replacement policies: FIFO, LRU,
Belady's algorithm
ii. Fixed-space vs. variable space: Working
Set, page fault frequency
c. The dynamic operation of a VM system
i. How does this really work?
What
happens when you run a program?
How
are pages faulted in and out?
What is swapping?
How
does the OS figure out how much memory to give to a process?
What
is thrashing?
2.
Disks / Secondary Storage
a. How do disks work physically?
b. What are dynamics of disk operation?
c. How do we schedule disks?
3.
File systems
a. What do file systems do?
b. What are key issues in file systems
c. How does a unix file system work?
i. Directories
ii. Inodes
iii. Buffer cache
d. Specific details of Berkeley Unix FFS
e. Log-structured file systems (LFS)
4.
Networks
a. Types of networks: LANs, WANs
b. Network layers
c. Message communication
d. Circuit switching vs. packet switching
5.
Distributed file systems
a. Issues
b. Examples: NFS, AFS, Sprite
6.
Remote Procedure Call
a. How RPC works
b. Stubs
c. Binding
d. Marshalling
|