Unit 2 Flashcards

1
Q

is a program in execution and
must progress in a sequential fashion.

A

Process

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

to select the next task and get it
ready for processing

A

Dispatch

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

A program is an __________; only when
a processor “breathes life” into it, does it
become the “active” entity we call a process

A

inanimate entity

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

a group of digits, characters or
works that are held in one reaction of an I/O
medium and handled as an input.

A

Blocks

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Input becomes available.

A

Wake up

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

TCB

A

Thread Control Block

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

if the process does not
voluntarily relinquish the CPU before the
time interval expires, the interrupt causing
the operation system to regain control.

A

Timerrunout

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

PCB

A

process control block

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

is the module that gives control of the
CPU to the process selected by the short-term
scheduler

A

Dispatcher

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

The processes that are residing in the main
memory and are ready and waiting to execute are
kept on a list called the

A

Ready queue.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

its policy is to give all users equal service.

A

Single Queue Mechanism

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

its policy is to give high priority on a short processor.

A

Multiple Queue Mechanism

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

is also known as task control block. It serves as a dictionary for any information that may vary from process to process.

A

Process Control Block

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

is an OS that elects the next job to be
admitted to the system and the next process to run.

A

Scheduler

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

It determines when a particular program should be loaded into the memory for each execution.

A

Long Term (High Level / Job Scheduler)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

It determine which I/O device will be used to
service a particular I/O request. It is executed somewhat more frequently than to make swapping decision.

A

Medium Term (I/O Scheduler)

17
Q

Select from the process that are ready to execute and allocates the CPU to one of them. A process may execute for only a few milliseconds before waiting for an I/O request.

A

Short Term (CPU scheduler / Dispatcher)

18
Q

is the state of indefinite waiting that processes may reach when competing for system resources or when attempting to communicate.

A

Deadlock

19
Q

if each resource type has only one instance, only one process at a time can use the resource.

A

Mutual Exclusion

20
Q

there must exist a process that is
holding at least one resource and is waiting to
acquire additional resources that are currently being
held by other process

A

Hold and Wait

21
Q

a resource can be released only voluntarily by the process holding it after that process has completed its task.

A

No Preemption

22
Q

there must exist a set of processes waiting for resources that is held by other processes and so on.

A

Circular Wait / Cycle

23
Q

is a useful tool to represent the deadlock situation in a system.

A

resource allocation graph (RAG)

24
Q

The state may be new, ready, running, waiting, halted and so on.

A

Process State

25
Q

The counter indicates the address of the next instruction to be executed for the process.

A

Program Counter

26
Q

The registers vary in number and type, depending on the computer’s architecture.

A

CPU Registers

27
Q

this information includes a process priority, pointer to scheduling queues and any other scheduling parameters.

A

CPU Scheduling Information

28
Q

this information may include the value of the base and limit registers, the page table or the segment tables depending on the memory system used by the operating system.

A

Memory Management Information

29
Q

this information includes the amount of CPU and real tie used, time limits, account numbers, job or process numbers and so on.

A

Accounting Information

30
Q

the information includes the list of I/O devices (such as tape drives) allocated to this process, a list of open files and so on.

A

I/O Status Information

31
Q

is one that spends of its time doing I/O than it spends doing computations

A

I/O Bound Process

32
Q

is one that generates I/O requests infrequently, using more of its time doing computation.

A

CPU Bound Process

33
Q

it is when a process reintroduced into memory and its execution can be continued where it left off

A

Swapping