1.2 Software and software development Flashcards

1
Q

What is an operating system?

A

a collection of programs that provide an interface between user and computer.

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

What features do operating systems provide?

A

Memory management; Resource management; file management; input/output management; interrupt management; utility software; security; user interface.

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

What is memory management?

A

How the memory in the RAM is divided and identified by paging, segmentation and virtual memory

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

What is paging?

A

Splitting memory into equal sized physical divisions called pages.

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

What is segmentation?

A

Splitting memory into logical divisions called segments that represent the structure and flow of the program.

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

What are the similarities of paging and segmentation?

A

They allow the programs to efficiently use space in memory

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

What are the differences of paging and segmentation?

A

Pages are fixed size and fit into sections of memory , segments vary in size and are made of complete sections of memory.

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

What dose virtual memory do?

A

it uses a section of the hard drive acts as RAM when main memory doesn’t have enough space. sections of the program not currently in use are temporally moved to virtual memory.

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

Whats the downside to using virtual memory excessively?

A

Disk thrashing; when pages are being swapped between hard disk and main memory, as it takes a long time to transfer them.

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

What is resource managment?

A

scheduling

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

What is Scheduling?

A

Allowing sections of programs to be run and receive a fair amount of processing charity.

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

What are the two types of scheduling algorithms?

A

Pre-emptive and Non pre-emptive.

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

What are pre-emptive algorithms?

A

jobs are actively started or stopped by the operating system.
E.g. multilevel feedback queues, shortest remaining time, round robin

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

What are Non pre-emptive algorithms?

A

Once a job is started, it is left alone until it is completed
E.g. first come first served, shortest job first

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

What is the Round robin Scheduling algorithms?

A

each job has a section of processor time within which it is allowed to execute. longer jobs will take longer and job priority will not be taken into account.

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

What is the first come first serve scheduling algorithm?

A

Jobs are processed in chronological order. easy to implement, but doesn’t take priority into account.

17
Q

What is the multilevel feedback queues scheduling algorithm?

A

makes use of multiple queues which are ordered per priority, this is difficult to implement

18
Q

What is the shortest job first scheduling algorithm?

A

The jobs are ordered according completion time, longest jobs being completed at the end. this is beneficial to batch systems, but requires processor to calculate how long each job will take

19
Q

What is processor starvation?

A

When a particular process doesn’t receive enough processor time in order to execute and be completed.

20
Q

What is the shortest remaining time scheduling algorithm?

A

the queue is processed in order of time left from completion.

21
Q

What are interrupts?

A

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

22
Q

How are interrupts stored?

A

in a priority queue in an interrupt register

23
Q

How are interrupts serviced?

A

the interrupt service routine; if there is a interrupt with higher priority than current process, the current process are put in a stack. the processor loads the appropriate interrupt service routine and the flag is set. once processed the flag is reset interrupt queue checked before transferring the stack back into processors.

24
Q

What are the different processes of the operating system?

A

Distributed; Embedded; Multi-tasking;
Multiuser; Real time

25
Q

What is a distributed operating system?

A

a type of OS that runs across multiple devices and allows the load to be spread across multiple processors.

26
Q

What is a embedded operating system?

A

Devices built for a small range of specific tasks, with limited in their functionality and low power usage

27
Q

What is a multi-tasking operating system?

A

a OS that allows the user to carry out task seemingly simultaneously, though time slicing quickly switching between programs and applications in memory.

28
Q

What is a multi-tasking operating system?

A

when multiple users make use of one computer (normally supercomputer), needs a scheduling algorithm.

29
Q

What is a real time operating system?

A

an OS designed to performs a task within a guaranteed time frame, used in time-critical computer systems.

30
Q
A