Term
A ____ system allows many user to_______
A: distributed: run their programs concurrently
B: batch system: run their programs concurrently
c: time-sharing: interact with their programs concurrently
d: multi-programming system: interact with t |
|
Definition
|
|
Term
____ and ____ are two states of the process where the process is not in the main memory
A. Running : Ready B. Ready : Waiting C. Running : Waiting D. Suspended Ready : Suspended Waiting |
|
Definition
|
|
Term
___ and ___ are two states of the process where the process is in the main memory and is not using cpu.
A. Running : Ready B. Ready : Waiting C. Running : Waiting D. Suspended Ready : Suspended Waiting |
|
Definition
|
|
Term
____ selects which process should be executed next and allocates CPU.
A. Admission scheduler b. CPU scheduler C. Memory scheduler D. Job scheduler |
|
Definition
|
|
Term
___ selects which process should be temperately swapped out of memory.
a. admission scheduler b. CPU scheduler c. memory scheduler d. job scheduler |
|
Definition
|
|
Term
non-preemptive CPU scheduling decisions only take place when a process: ____ or ____
a. switches from running to waiting state, switches from running to ready state
b. switches from running to ready state, switches from waiting to ready
c. switch |
|
Definition
|
|
Term
following schedulong policies, _____, are preemptive.
a. fcfs,sjf,srtf b. sjf, rr c. fcfs,rr,srtf d. sjf,fcfs e. rr,srtf,mlfq |
|
Definition
|
|
Term
following sceduling policies ____ are non-preemptive
a. fcfs,sjf,srtf b. sjf, rr c. fcfs,rr,srtf d. sjf,fcfs e. rr,srtf,mlfq |
|
Definition
|
|
Term
when we optimize a CPU scheduling policy, we want to MAXIMIZE _____
a. CPU utilization and throughput b. throughput and average turnaround time c. average turnaround time and CPU utilization d. average waiting time and throughput e. average resp |
|
Definition
|
|
Term
When we optimize a CPU sheduling poilicy, we want to MINIMIZE _______.
a. CPU utilization and throughput b. throughput and average turnaround time d. average waiting time and throughput e. average respond time and average wait time |
|
Definition
|
|
Term
____ is a program (software system) all time present on the macine from power-on until power-off or a crash. |
|
Definition
|
|
Term
The two major goals of operating systems are ____ and _____ |
|
Definition
better use of hardware , good user environment |
|
|
Term
_____ is a processing technique that loads many jobs in the main memory that will run concurrenlty |
|
Definition
|
|
Term
____ is a processing technique that allows many users to get the CPU alternatively |
|
Definition
|
|
Term
_____ is a CPU register which contains the address of the next instruction to be executed |
|
Definition
|
|
Term
a computer system includes 4 types of hardware resources:______,______,_____ and buses |
|
Definition
|
|
Term
a ______ interrupt can be used to protect CPU form being infinitely used by a user program |
|
Definition
|
|
Term
____ is a hardware mechanism that allows I/O to/from memory transfers without frequent involvement of the CPU |
|
Definition
|
|
Term
_______ is a high-speed access memory used to hold most recently accessed data |
|
Definition
|
|
Term
If job X's base register has a value 200050 a and limit register 124000, then job X may legally visit memory space from address ___ to ____ |
|
Definition
|
|
Term
_____ is a CPU mode of execution that allows access to all privileged instuructions |
|
Definition
|
|
Term
if an interrupt occurs, the processor suspends execution of the current program and executes an _________ (a piece of software) to take care of the interrupt |
|
Definition
interrupt service routine |
|
|
Term
as one goes down the hierarchy of a memory system, the following occurs: cost per bit decreases, capacity _______, access time _____, access frequency ____ (Fill in either "decreases" or "increases") |
|
Definition
increases, increases, decreases |
|
|
Term
_______is the phase where the OS saves the registers values corresponding to one process and loads the register values of the next process to run |
|
Definition
|
|
Term
______ is a data structure used by the operating system to keep track of processes. In this data structure, each entry is called a _____, which is associated with a specific process. |
|
Definition
|
|
Term
__________scheduler determines the degree of multiprogramming of system |
|
Definition
|
|
Term
there are ______ possible schedules for n processes to be scheduled on one processor without preemption (Fill in the blank with a a formula in terms of N) |
|
Definition
|
|
Term
a process can be described as either _______ (the process spends mote time doing I/O than computation) or _______(the process generates I/O requests in frequently and spends more time doing computation) |
|
Definition
|
|
Term
Unix uses ______system call to generate a new process, and uses _____ system call to replace the process' memory space with a new program |
|
Definition
|
|
Term
a ________ is a basic unit of CPU utilization, and it is also called a lightweight process |
|
Definition
|
|
Term
there are two methods to define a java thread: to extend ______ class or implement _______ interface |
|
Definition
|
|
Term
many criteria have been used to assess scheduling algorithms. ______ is the number of processes that complete their execution per time unit. ____ is the average time to execute a process. ____ is the amount of time a process has been waiting in the read |
|
Definition
|
|
Term
Under ______ scheduling, once the CPU has been allocated to a process, the process keeps the CPU until it releases the CPU either by termination or by switching to blocked state. Under ___ scheduling, the scheduler may grasp the CPU from the running proc |
|
Definition
non-preemptive, preemptive |
|
|
Term
Most computer systems provide hardware support to differentiate among two modes of execution: kernel mode and user mode. Why ? |
|
Definition
the system needs some protection from malacious users & programs, thats why kernel mode exists. User mode must make a sys. cal to the OS to get any access to any low level functions or hardware |
|
|
Term
compare interrupts generated by software error and system calls(describe the similarities and differences between them) Why are system calls useful ? |
|
Definition
- both generate an interrupt -sys calls are usefull because you can use OS functions -interrupts are generated to notify program or OS of a problem |
|
|
Term
Do the "cache" problem on the mid-term |
|
Definition
|
|
Term
list 2 items shared among threads in a process, and 2 private to each thread |
|
Definition
shared: heap & global vars private: stack & register |
|
|
Term
Complete a extended state transition diagram |
|
Definition
|
|
Term
most batching systems use FCFS policy and most time-sharing system use RR, Why ? |
|
Definition
|
|
Term
Do number 8 on the mid-term, concerning Gantt charts ..... scheduling, shit like that ..... |
|
Definition
|
|