1.2.1 Flashcards

1
Q

OS

A

operating system

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

the need for an OS

A

allows the user to interact with hardware using a user interface

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

the function of an OS

A

Device driver
User
Application software
Memory/resource management
User interface
Hardware
Utility programs
File management
Interrupt handling

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

Multitasking

A

When you have more than one program open and running at the same time.
rge processor flits between them all so quickly it seems like it is happening at the same time

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

file management

A

allows you to: copy, delete, move files

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

user management

A

Allows multiple users to log into the same computer
each user can have different access levels

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

memory management

A

moving the location of a program in memory so the free space is together.
it is not desirable in practice.
takes a lot of time to move a program in memory or on disk, as addresses and free space references all need updating

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

paging

A

Pages are fixed size physical divisions.
Programs are split up to fit into a given number of pages.
Paging takes no account of how it splits the program, only that it splits it into fixed-sized pages.
It could separate the instructions inside a looping condition so they are in different pages, (isn’t efficient).

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

segmentation

A

Segments are different sized logical divisions.
Based on logical divisions, segmentation splits the program into multiple parts and places them in the available free space, leaving smaller areas of free space.

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

virtual memory

A

when there are too many open files and the computer can not keep all of them open at once because there is not enough space in RAM.
The least recently used file is put into secondary storage temporarily. If the user keeps trying to use all the files then they will have to keep swapping from the current memory to secondary storage which may cause disc thrashing.

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

interupts

A

when a program or other device needs immediate attention and needs to signal to the processor
(Interrupts always have a higher priority than normal programs)

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

the role of interupts and ISRs

A

interrupt service routine is simply a program with a set of instructions that need to be FDEed to carry out the operations of the interrupt
the contents of the program counter need to be changed to point to the address for the first instruction of the interrupt
the values held in the registers are copied into a data structure in memory known as the stack

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

interupts and ISRs within the FDE cycle

A

Fetch
Decode
Execute
Check for new interrupts

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

round robin sheduling

A

ecah process is allocated a fixed amount of run time (time slice)
executes a FCFS but if the process is not finished in the time slice it is moved to the back of the queue

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

first come first serve sheduling

A

the processes are executed in the order they arrive

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

multi-level feedback queues sheduling

A

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

only if a computer system has more than one processor or processor core

17
Q

shortest job first sheduling

A

needs to know how long each process takes (orders the current list)

the shortest run time is executed first

18
Q

shortest remaining time sheduling

A

similar to SJF but its pre-emptive

if a new item is added that is shorter it will be moved to the front of the queue

19
Q

distributed OSs

A

the operating system controls and coordinates many computers, presenting them to the user like a single system

20
Q

embedded OSs

A

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

21
Q

multi-tasking OSs

A

multiple process seemingly taking place at the same time

22
Q

multi-user OSs

A

multiple users using a system

23
Q

real time OSs

A

processes have to execute within a known time frame

lots of redundancy is built into these systems so they can handle sudden increases in input

(rarely run at ful capacity)

redundancy - backup components/systems to ensure uninteruptted running

24
Q

BIOS

A

Basic Input Output System
responsible for loading the operating system when the computer first turns on

25
Q

bootstrap

A

A boot loader program is used to load the operating system kernel into memory

26
Q

device drivers

A

Software that tells the operating system how to communicate with a device

27
Q

virtual machines

A

trick a program into thinking it’s running on its native hardware when, in fact, it’s running on an entirely different machine

28
Q

virtual machines - executing immediate code

A

java code is an example of intermediate code running on a virtual machine (designed to run on many different platforms)

it compilies its code into a half-way code known as bytecode or intermediate code

the code is translated by a Java Virtual Machine running on a target device, which then translates it into specific machine code

29
Q

virtual machines - running an OS within another

A

you can run nearly any OS of your choosing in a virtual machine