1.2.1 system software Flashcards

1
Q

what is an operating system

A

A collection of programs that work together to provide an interface between the user and a computer.

Operating systems enable the user to communicate with the computer and perform certain low-level tasks involving the
management of computer memory and resources

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

describe how virtual memory is used when there is not enough RAM

A

-A section of the hard drive is used to act as RAM
-sections of programs that are not currently in use are temporarily moved to virtual memory through paging.
-this frees up memory for other programs in RAM

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

similarities and differences between paging and segmentation

A

BOTH are used when RAMs space is inefficient, can cause disk thrashing

paging uses equal sized sections called pages

segmentation uses variable sized, logical sections called segments

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

give 3 functions of an operating system

A

-memory management
-resource management
-i/o management
-security
-user interface
-utility software

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

what is an interrupt

A

a signal generated by software or hardware to indicate to the processer that a process needs attention.

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

Explain the stages of the interrupt service routine

A

-interrupt register is checked at the end of every FDE cycle
-if there is an interrupt that is of higher priority compared to the current process the current contents of the registers in the CPU are transferred into a stack
- the relevent interrupt service routine (ISR) is loaded into RAM
-A flag is set to signal the ISR has begun
-the flag is reset once the ISR has finished
-interrupt register checked again. If interrupts are of a higher priority the process is repeated.
-if there are no interrupts with a higher priority, the contents of the stack are popped and placed back into the special memory registers.
-the fetch decode execute cycle renews as before

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

are the scheduling algorithms pre-emptive or non pre-emptive

A

pre-emptive- RR, SRT, MLFQ
non pre-emptive-FCFS, SJF

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

Give one advantage and one disadvantage of using multilevel feedback queues for scheduling

A

Advantages- services most urgent interrupts
Disadvantages-hard to implement

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

define a real time operating system and when it may be used

A

real time operating systems perform a task within a guaranteed time frame. They are used in systems were a response within a given time frame is critical e.g life support systems, self driving cars, power systems

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

Describe three functions of the BIOS

A

-POST(power on self test) which ensures that all hardware is correctly connected and functionality.
-checking the CPU clock, memory and processor
-testing for external memory devices

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

what is the role of a device driver

A

enables the operating system to interact with hardware devices

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

describe an instance in which a virtual machine may be used

A

-testing programs
-protecting from malware
-running software compatible with different versions and types of operating systems

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

Give one advantage and one disadvantage of intermediate code

A

Advantage - platform independent, portable
Disadvantage-slower execution

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

Pre-emptive

A

Jobs are actively made to start and stop by the
operating system.

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

Non pre-emptive

A

Once a job is started, it is left alone until it is
completed.

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

Round robin

A

Each job is given a section of processor time - known as a time slice - within
which it is allowed to execute. Once each job in the queue has used its first
time slice, the operating system again grants each job an equal slice of
processor time. This continues until a job has been completed

14
Q

First come first served

A

Jobs are processed in chronological order by which they entered the queue.
Although this is straightforward to implement, FCFS again does not allocate
processor time based on priority.

15
Q

Shortest job first

A

The queue storing jobs to be processed is ordered according to the time
required for completion, with the longest jobs being serviced at the end.
This type of scheduling is most suited to batch systems, where shorter jobs
are given preference to minimise waiting time.
However it requires the processor to know or
calculate how long each job will take and this
is not always possible

16
Q

Shortest remaining time

A

The queue storing jobs to be processed is
ordered according to the time eft for
completion, with the jobs with the least
time to completion being serviced first.
Again, there is a risk of processor starvation for longer jobs if short jobs are
added to the job queue.

17
Q

Distributed type of os

A

This is a type of operating system which is run across multiple devices,
allowing the load to be spread across multiple computer processors when a
task is run

18
Q

Embedded type of os

A

Built to perform a small range of specific tasks,
this operating system is catered towards a
specific device. They are limited in their
functionality and hard to update although they
consume significantly less power than other
types of OS.

19
Q

Multi-tasking type of os

A

Multi-tasking operating systems enable the user to carry out tasks seemingly
simultaneously. This is done by using time slicing to switch quickly between
programs and applications in memory.

20
Q

Multi-user type of os

A

Multiple users make use of one computer. Therefore a scheduling algorithm must be used to ensure processor time is shared fairly between jobs. Without a suitable scheduling algorithm, there is a risk of processor starvation, which is when a process is not given enough processor time to execute and complete.

21
Q

why is the BIOS critical

A

The BIOS is critical to the computer system as it is only
after these checks are completed that the operating system
can be loaded into RAM from the hard disk

22
Q

Intermediate Code

A

Code that is halfway between machine code and object code is called intermediate code.
This is independent of the processor architecture so can be used across different
machines and operating systems.

23
Q

Paging

A

Paging is when memory is split up into equal-sized sections known as pages, with programs being made up of a certain number of equally-sized pages. These can then be swapped between main memory and the hard disk as needed.

24
Q

Segmentation

A

Segmentation is the splitting up of memory into logical sized divisions, known as segments, which vary in size. These are representative of the structure and logical flow of the program, with segments being allocated to blocks of code such as conditional statements or loops

25
Q

Emmulator

A

They trick a program into thinking its running on its native hardware when in fact it is running on an entirely different machine

The programs themselves are not aware they are being emulated

26
Q

Bios

A

Responsible for loading the operating system when the computer first turns on

27
Q

Multi level feedback queues

A

Several ready quesues are used, each with a different scheduling algorithm. Jobs can move between queues as their priorities change