Processes
Scheduling
Synchronization
Memory
Grab Bag
100

A state where a process is utilizing the CPU

What is running?

100

A scheduling algorithm that prevents starvation

What is First In, First Out or What is Round Robin?
100

In the dining philosophers problem, forcing each philosopher to pick up the left fork and then the right fork (with no mutex) causes this condition. 

What is deadlock?

100

The name of equally sized pieces of physical memory

What is a page frame?

100

A hard drive scheduling algorithm that organizes reads and writes by closest to the head's current position.

What is Shortest Seek Time First (SSTF)?

200

The parts of the Process Control Block saved when a process is moved from the CPU

What are the CPU registers?

200

When a process state is saved and the process is removed from the CPU

What is a context switch

200

In the readers, writers problem allowing all readers to "cut the line" in front of waiting writers can lead to this condition.

What is starvation?

200

A concept where pieces of a process are only loaded from virtual memory when they are required by the loader

What is demand paging

200

The two methods of determining when a device driver is ready for CPU operations

What is polling and interrupts?
300

A process's state when waiting for Input or Output?

What is the Blocked state?

300

An amount of time allocated to a process before the schedule must decide to keep the same process or load a new process

What is a quantum?

300

Mutex are designed to protect this code.

What is the critical section?

300

A method of transferring data from a device to physical memory without utilizing the CPU

What is Direct Memory Access (DMA)?

300

A method of detecting deadlocks in a resource allocation graph.

What is the graph reduction algorithm?

400

The operating system component that transitions a program to a process

What is the loader?

400

A structure containing information about a system resource.

What is a Resource Control Block?

400

In the Dining Philosophers problem, this condition is not met when a philosopher must pick up the left and right fork before releasing the mutex.

What is concurrency?

400

A C function that returns a pointer to memory on the heap

What is malloc()?

400

A method of separating logical process parts in virtual and physical memory

What is segmentation?

500

The value returned from the fork() function to the parent process.

What is the child process ID?

500

An operating system concept that creates the illusion of multiple process running simultaneously, even though, only one process can run on the CPU at a time.

What is time-sharing?

500

A function or series of functions using synchronization privatives to ensure synchronization and mutual exclusion of critical section code.

What is a monitor?

500

A data structure for tracking free space on secondary storage

What is a bitmap

500

A hard drive method of dealing with bad blocks where all good blocks after the bad block are moved to the right

What is sector slipping?