OS chapter 3 Flashcards

1
Q

What is multitasking/multiprocessing/
pseudo-parallelism?

A

The ability to apparently run two programs at the same time.

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

What term refers to two processes accessing the same shared resource at the same time?

A

Race conditions

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

What is the difference between a program and a process?

A

A program may not be running but a process is actually running.

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

The IBM 1401 and 7094 computers are examples of which generation of computing?

A

Second generation

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

__________ scheduling ensures that a job is done when promised.

A

Guaranteed

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

Most modern systems use ____________.

A

preemptive multitaskiing

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

Which of the following is NOT one of the three (3) process states?

Blocked
Ready
Running
All of these are process states

A

All

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

___________ scheduling allots a time period called a quantum for each process.

A

Round Robin

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

A _________ is a running program along with data, stack, program counter, stack pointer and other registers.

A

process

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

What does the OS keep track of processes with and what information is kept?

A

A table that keeps the state, program counter, stack pointer, memory allocation, file status, etc.

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

How do processes communicate?

A

Interprocess communication.

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

How is interprocess communication used?

A

There are multiple means, one being with interrupts, letting the processor know its time to switch processes.

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

Describe the process of running multiple processes: A, B, C, and D concurrently.

A

A runs first, then B runs, then C, Then D, then it wraps back around to A, cycling through until the processes finish. No two run at the same time.

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

What is a process tree?

A

It describes the relationship between parent child processes. Some processes spawn other processes, which are called child processes.

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

What is a ready process?

A

A process that could run, but is not on its turn.

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

What is a blocked process?

A

A blocked process has been running but is waiting for a device such as
a printer or a disk drive.

17
Q

What is the critical section of a process?

A

The point where it accesses shared resources.

18
Q

What is mutual exclusion?

A

When you lock out processes from accessing an in-use resource.

19
Q

What are the different process priority criteria and what do they mean?

A

Fairness - each process gets equal share of the CPU time.
Efficiency - keep the CPU busy.
Response time minimal for interactive users.
Turnaround minimal for batch users.
Throughput - maximize number of jobs per hour.

20
Q

What kinds of process scheduling do computers use?

A

run-to-completion scheduling
preemptive multitasking
cooperative multitasking

21
Q

What is preemptive multitasking?

A

A system that has a process run for a set maximum amount of time, and then interrupts it for another process to begin.

22
Q

Types of process scheduling

A

Round robin
Priority
Shortest Job first
Guaranteed scheduling

23
Q

What is Priority scheduling?

A

Gives the most important job top priority.

24
Q

What is Round Robin Scheduling?

A

allots a time period called a quantum for each process.

25
Q

What is a quantum in process scheduling?

A

The length of time given to a process to run.

26
Q

What is Guaranteed scheduling?

A

ensures that a job is done when
promised.