CS 3733 Operating Systems Final Exam Review: Spring 2004

buffering, spooling, multiprogramming, time sharing, distributed systems.

process state, process control block, concurrent processes, independent and cooperating processes,

storage and linkage classes, the meaning of the word static.

job queue, ready queue, device queues, schedulers, performance criteria, FCFS, SJF, SJFA, round robin, priorities, preemptive scheduling, multilevel queues, multilevel feedback queues, process scheduling simulator experiments, load average and context switch calculations (like from assignment 2). Know how to do problems like the one assigned in class

chains, fans, and trees of processes

open, close, read, write, pipe dup2, getpid, getppid.
Understand that read and write do not always process all information requested. Exception: small write to a pipe or FIFO.

file descriptors and file pointers, file descriptor table, system file table, redirection.
Understand the difference in buffering when using file descriptors and file pointers.

directories, inodes, hard links, symbolic links,

producer-consumer problem, critical sections, critical section problem, mutual exclusion, progress, bounded waiting, busy waiting, Peterson's solution, Test-and-Set, Swap, semaphores, bounded buffer with semaphores, monitors, dining philosophers, thread synchronization with mutexes

Using the signal mask, catching and ignoring signals, waiting for signals, interrupted system calls

client-server model, connectionless and connection-oriented, UICI, sockets, WWW communication

FCFS, SSTF, SCAN, LOOK, C-SCAN, C-LOOK, bad blocks

partitions, paging, TLB, virtual memory, page replacement (FIFO, LRU, optimal, second chance, clock), calculation of effective memory access time.