Operating Systems Flashcards

1
Q

What is software?

A

A collection of electronically stored instructions that allows one to interact with a computer

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

What are the 2 types of software?

A
  1. Application software
  2. System software
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

True or False
System software lies between application software and hardware

A

True

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

Operating Systems have 3 rows, which are what?

A
  1. Process management
  2. Memory management
  3. Device management
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What is process management?

A

manages numerous concurrently running programs

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

What can cause a process to move to the waiting stage?

A

When there is not enough data

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

What is the process for instructions to be completed?

A
  1. New
    - Operating systems copy program code into RAM

*ADMITTED

  1. Ready
    - another process may be running

*Dispatch

  1. Running
    - CPU is executing the instructions

*EXIT

  1. Terminated
    - Memory and other resources are freed
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What is CPU Scheduling?

A

The act of determining which process in the ready state should be moved to the running state

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

Which process gets to move from the ready state to the running state first?

A
  • First-come, First-served
  • Shortest Job Next
  • Round Robin
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What are the 2 kinds of scheduling rules?

A
  1. Non-preemptive scheduling
  2. Preemptive scheduling
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What is Non-preemptive scheduling?

A

Once you go into the running stage, you are guaranteed to finish the process

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

What is Preemptive scheduling?

A

Sometimes, when we are being served, we get interrupted by another process

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

What is a turn-around time?

A

The amount of time between when a process arrives in the ready state for the first time and when it exits the running state for the last time
- total time for the process to be executed

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

What is service time?

A

The time needed for each is listed in this table

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

How does First-come first first-served work?

A

The first ordering structure that comes in is the first processed

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

Is first-come, first-served non-preemptive or preemptive?

A

non-preemptive

17
Q

How does Shortest Job Next work?

A

looks at all the processes in the ready state and dispatches the one with the shortest service time

18
Q

Is Shorest Job Next preemptive or preemptive?

A

non-preemptive

19
Q

What is a problem that can arise while using the Shortest Job Next?

A

The service time may not always be known ahead of time

20
Q

True or False
Shortest Job Next is a provably optimal strategy for average turn-around time

21
Q

How does Round Robin work?

A

distributes an equal processing time for each process and will establish time slices for each until each process is completed

22
Q

Is Round Robin non-preemptive or preemptive?

A

preemptive

23
Q

Which of the CPU scheduling algorithms is the most fair?

A

Round Robin