1.2.1 - systems software Flashcards

7, 8

1
Q

operating system

A

Controls the hardware and software of a computer system and provides a user interface.

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

Name the 5 types of operating systems.

A
  1. multi-tasking
  2. multi-user
  3. distributed
  4. embedded
  5. real-time
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

multi-tasking OS

A

Each active program is scheduled to receive a slice of processing time in quick rotation, giving the impression they are operating at the same time.

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

multi-user OS

A

Allows more than one person to use a computer at the same time.

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

distributed OS

A

Combines the processing power of multiple computers across a network for a single task.

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

embedded OS

A

Tend to run on dedicated hardware so they run with maximum efficiency, using low-powered processors and very little memory.

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

real-time OS

A

Processes have to be guaranteed to execute within a known time frame.

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

Basic Input Output System (BIOS)

A

Responsible for loading the OS when the computer first turns on. Initialises and tests the system hardware components.

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

bootstrap

A

Used to load the OS kernel into memory.

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

device driver

A

Software that tells the OS how to communicate with a device.

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

virtual machine

A

A program that has the same functionality as a physical computer.

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

5 functions of an operating system

A

1- memory management
2- interrupt service routines
3- processor scheduling
4- backing store management
5- management of all input and output

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

paging

A
  • memory is split into pages of size 4Kb each
  • a process currently in memory may be held in several non-contiguous pages
  • a page table uses mapping to store a link between the physical memory address and the logical address space of each process
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

segmentation

A

The logical division of address space into varying length segments based on the program’s structure.

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

interrupt

A

A signal from a software program, hardware device or internal clock to the CPU.

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

When does a software interrupt occur?

A

When an application program terminates or requests certain services from the OS.

17
Q

example of a hardware interrupt

A

‘printer out of paper’

18
Q

interrupt service routines

A
  • suspends execution of running process
  • disables interrupts of a lower priority
  • puts values of registers onto system stack
  • interrupt service routine is called
19
Q

4 objectives of a scheduler

A

1- maximise output
2- be fair to all users on a multi-user system
3- provide acceptable response time to all users
4- ensure hardware resources are kept as busy as possible

20
Q

round robin scheduling

A

Each process is given a time slice controlled by an interval timer. If the process does not complete before its time expires, the despatcher gives the CPU to the next process. Guarantees a reasonable response time for all users.

21
Q

first come first served scheduling

A

Jobs are processed in the order in which they arrive. No system of priorities.

22
Q

shortest remaining time scheduling

A

The process with the smallest estimated time to completion is run next. However, it requires knowledge of how long a job will take. Possible for batch jobs like payroll.

23
Q

shortest job first scheduling

A

The process with the smallest estimated running time is run next.

24
Q

multi-level feedback queues scheduling

A

This algorithm is designed to:
- give preference to short jobs
- give preference to I/O bound processes
- separate processes into categories based on their need for the processor