Final Review
Andy Wang
Operating Systems
COP 4610 / CGS 5765
Coverage



Total: 72 points; 1 min / point
50 points based on lectures 25-43,
assignment 9, and project 3
22 points for everything

11 points based on your ability to apply
various principles learned in the class
File Systems and Disk
Management

Definitions


File
File header
File Systems and Disk
Management

Short answers

File system components


Ways to access a file


Disk management, naming, protection,
reliability
Sequential, random, content-based
File usage patterns
File Systems and Disk
Management

Short answers

Disk allocation policies

Contiguous, link-list, segment-based,
indexed, multilevel indexed, hashed
Naming and Directories

Definitions





i_node
Directory
Name collisions
Absolute path name
Path resolution
Naming and Directories

Short answers

Different ways to organize a name space





Flat name space
Hierarchical name space
Relational name space
Contextual naming
Content-based naming
Transactions and Reliability

Definitions





Metadata
fsck
Log
Two-phase locking
Striping
Transactions and Reliability

Short answers


Characteristics of a transaction
RAID levels
Protection and Security

Definitions





Security
Protection
Access matrix
Access control list
Capability list
Protection and Security

Short answers

Three goals of security


Three security components



confidentiality, data integrity, system
availability
authentication, authorization, enforcement
Kerberos protocol
Public key encryption
Protection and Security

Short answers

Classes of security problems

Eavesdropping, abuse of privilege, imposter,
Trojan horse, salami attack, logic bomb,
denial-of-service attacks
Network Protocols

Definitions




Protocols
Port
Byzantine uncertainty
Two-phase commit
Network Protocols

Short answers



Internet protocol
Unreliable data protocol
Transmission control protocol
Networks and Distributed
Systems

Definitions





Distributed systems
Network
Packet
Arbitration
Routing
Networks and Distributed
Systems

Short answers

Ethernet arbitration techniques


carrier sensing, collision detection, adaptive
randomized waiting
Point-to-point vs. broadcast network
RPC and Distributed FS

Definitions



Location transparency
Microkernel operating systems
Procedure stubs
RPC and Distributed FS

Short answers




Advantages of using RPC for IPC
Design principles of NFS
NFS vs. AFS
xFS design principles
Project 3

Short answers

Steps to obtain the content of a FAT entry
Everything






CPU-IO scheduling schemes
Deadlock resolution techniques
Demand paging algorithms
Booting sequence
Process creation
Address translation schemes
Some Exam-taking
Techniques


Use bullets instead of complete
sentences
State what you do know and why
existing methods do not work