✅1.2.1 Systems 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 computer

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

Three from:
- Memory management
- Resource management
- I/Output management
- Interrupt management
- Security
- User interface
- Utility software

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

What is an interrupt?

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
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 not currently being used are temporarily moved into 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
5
Q

Explain the stages of the Interrupt Service Routine.

A

● Interrupt register checked at the end of each Fetch-Decode-Execute cycle.
● If there is an interrupt exists with a higher priority to the current process, the current contents of the registers
in the CPU are transferred into a stack.
● The relevant 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 place 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
6
Q

Are these scheduling algorithms pre-emptive or non pre-emptive? FCFS, SRT, SJF, MLFQ, RR

A

Pre-emptive: RR, SRT, MLFQ
Non-preemptive: FCFS, SJF

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

What are the advantages and disadvantages of using Multilevel Feedback Queues for scheduling?

A

Advantage: Services most urgent interrupts first
Disadvantage: Hard to implement

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
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 eg. life support systems, self-driving cars, power systems.

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

Describe three functions of the BIOS.

A

Running tests upon the computer’s start-up:
● POST (Power-on self test) which ensures that all hardware is correctly connected and functional
● 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
10
Q

What is a device driver?

A

A program that controls the operation of a specific type of device (e.g. printer, keyboard, mouse, etc.) that is part of a computer system. Manufacturers build hardware devices in different ways so a device driver provides an interface that allows the operating system and other software to interact with the device, without having to deal with the particular hardware implementation of the device.

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

Describe an instance in which a Virtual Machine may be used.

A

● Testing programs
● Protection 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
12
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
13
Q

What are 4 examples of operating systems?

A
  1. Windows
  2. MacOS
  3. IOS
  4. Android
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Why is paging, segmentation and virtual memory used?

A

To ensure the main memory is shared efficiently between programs.

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

When may a software interrupt occur?

A

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

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

When may a hardware interrupt occur?

A

When an I/O operation is complete or an error such as “printer out of paper” occurs

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

What is a schedular?

A

The operating system module responsible for making sure that processor time is used as efficiently as possible.

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

What are the similarities and differences of paging and segmentation?

A

Both: Use virtual memory to swap parts of the program. And both are ways of splitting up memory.
Paging: Splits memory into equal-sized sections called pages, these can then be swapped between main memory and the hard disk as needed.
Segmentation: Splits memory into variable-sized, logical sections called segments. 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.

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

What are 5 scheduling algorithms?

A
  1. Round Robin
  2. First Come First Served
  3. Shortest Job First
  4. Shortest Time remaining
  5. Multi Level Feedback Queues
20
Q

What happens in the Round Robin Scheduling algorithm?

A

In round robin scheduling, processor time is divided equally among all running tasks. Each time period is called a time slice. Each process gets a time slice, and if the process has not finished when this time is up, it stops running and the computer switches to the next process. The process that has been suspended will only be able to resume running when it is next allocated processor time.

21
Q

What happens in the First Come First Served Scheduling algorithm?

A

Processes run from start to finish in the order in which the processor receives their request to run.

22
Q

What is the Shortest Remaining Time Scheduling algorithm?

A

The processes with the shortest time to completion go first, until a different task is added with a shorter time to completion, which then takes priority.

23
Q

What is the Shortest Job First Scheduling algorithm?

A

Processes are queued and the process that needs the shortest total time to complete goes first.

24
Q

What is an advantage of the Shortest Job First scheduling algorithm?

A

It reduces wait times because shorter processes are removed quickly, which means that the processor can allocate more time to longer jobs.

25
What is a disadvantage of the Shortest Job First scheduling algorithm?
This type of scheduling is susceptible to starvation if shorter jobs keep being added; the scheduler will keep prioritising these jobs, which means that longer processes will not be serviced
26
What is a distributed operating system?
Form of parallel processing system which spreads the load over multiple computer servers. A single job is split up into several tasks and each of these is run on a separate computer, coordinated by the operating system, in such a way that it appears to a user to be a single system.
27
What is a multi-tasking system?
An operating system which enables the user to carry out tasks seemingly simultaneously. This is done by using time slicing to switch quickly between programs and applications in memory.
28
What is a multi-tasking, multi-user system (time-sharing system)?
An operating system where a single powerful mainframe or supercomputer is connected to dozens or hundreds of terminals all using the mainframe CPU. Each user gets a slice of processor time according to a scheduling algorithm.
29
What happens in a Multi-Level Feedback Queue Scheduling Algorithm?
The scheduler maintains many queues of jobs, usually grouped by priority and similarity of job. The CPU will switch between queues to get jobs to complete.
30
What is an embedded operating system?
Built to perform a small range of specific tasks, this operating system is catered towards a specific device.
31
What are 2 disadvantages of an embedded operating system?
1. They are limited in their functionality 2. They are hard to update
32
What is 1 advantage of an embedded operating system?
They consume significantly less power than other types of OS
33
What is a buffer?
Memory designed to hold data that is on its way to somewhere else
34
What are two different strategies which could be used to manage the available memory?
Paging and segmentation
35
Explain two reasons scheduling is important?
1. To process as many jobs as possible in the least possible time. 2. To maximise the number of interactive users with fast response times.
36
What are 2 benefits of memory management?
1. Efficient allocation of memory enables multitasking, (allowing multiple programs to run at once). 2. It maintains security, it does not let programs access memory reserved for other programs
37
What does a pre-emptive scheduling algorithm mean?
Jobs are actively made to start and stop by the operating system.
38
What does a non-preemptive scheduling algorithm mean?
Once a job is started, it is left alone until it is completed.
39
What does POST (Power-on self test) do?
Ensures that all hardware are correctly connected and functional.
40
What is intermediate code?
Code that is halfway between machine code and object code
41
Where is BIOS stored?
EEPROM (electrically erasable programmable read only memory)
42
What is a Virtual Machine?
Any instance where software is used to take on the function of the machine, including executing intermediate code or running an operating system within another to emulate different hardware.
43
What are 2 advantages of Round Robin Scheduling?
1. All processes get a fair share of the CPU 2. Predictable, as every process gets equal time
44
What are 2 disadvantages of Round Robin Scheduling?
1. Choosing the right time quantum can be difficult 2. This can lead to a high turnaround time and waiting time for long processes
45
What is 1 advantage of First Come First Served scheduling?
1. Fair in the sense that processes are served in the order they arrive
46
What are 2 disadvantages of First Come First Served scheduling?
1. This can lead to poor performance if a long process arrives before shorter processes. 2. High-priority tasks wait for their turn in the queue
47
Real-time OS is one OS, name 4 other types of operating systems?
1. Embedded OS 2. Distributed OS 3. Multi-tasking OS 4. Multi-user OS