Download Exam Review Andy Wang Operating Systems COP 4610 / CGS 5765

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts

Plan 9 from Bell Labs wikipedia , lookup

Copland (operating system) wikipedia , lookup

CP/M wikipedia , lookup

Distributed operating system wikipedia , lookup

DNIX wikipedia , lookup

VS/9 wikipedia , lookup

Burroughs MCP wikipedia , lookup

Process management (computing) wikipedia , lookup

Thread (computing) wikipedia , lookup

Transcript
Exam Review
Andy Wang
Operating Systems
COP 4610 / CGS 5765
Coverage



Total: 50 points; 1 min / point
42 points based on lectures 1-13,
assignments 1-4, and project 1
8 points based on your ability to apply
various principles learned in the class
Introduction and History

Definitions




Operating system
Job
Batch system
Timesharing
Introduction and History

Short answers

Four phases of OS history

OS design goals
Concurrency: Threads, Address
Spaces, and Processes

Definitions




Thread
Address space
Process
Context switch
Concurrency: Threads, Address
Spaces, and Processes

Definitions





Uniprogramming
Multiprogramming
Multithreading
Multiprocessing
Multitasking
Concurrency: Threads, Address
Spaces, and Processes

Short answers





Benefits of concurrency
Program vs. process
Dispatching loop
Thread state diagram
Amdahl’s law
Genesis: From Raw
Hardware to Processes

Definitions




Master boot record
System call
User mode
Kernel mode
Genesis: From Raw
Hardware to Processes

Short answers



Booting sequence
System call sequence
Process creation
CPU Scheduling

Definitions

Starvation
CPU Scheduling

Short answers







Preemptive vs. nonpreemptive scheduling
FIFO
RR
SJN
SRTF
Multilevel feedback queues
Lottery scheduling
Cooperating Threads

Definitions


Atomic operation
Race condition
Cooperating Threads

Short answers



Independent threads
Cooperating threads
Decision tree
Synchronization

Definitions


Mutual exclusion
Critical section
Synchronization

Short answers

Code verification
Implementing Mutual
Exclusion

Definitions

Busy waiting
Implementing Mutual
Exclusion

Short answers

Ways to implement locks
Semaphores and Bounded
Buffer

Definitions

Semaphore
Semaphores and Bounded
Buffer

Short answers



Semaphores vs. integers
Two uses of semaphores
Code verification (producer/consumer)
More on Semaphores

Definitions



Safety
Liveness
Fairness
Project 1


shell
Write a C program