1.2.1 Systems Software Flashcards

You may prefer our related Brainscape-certified flashcards:
1
Q

1.2.1 A)
What is an os

A

collection of programs that work together to give an interface between user and computer

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

1.2.1 B)
Why is memory managment needed

A

memory must be shared fairly between multiple programs as ram not large enough to hold all. so os allocated amount of procosser time each task gets

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

1.2.1 B)
What are the three types of memory managment

A

paging, segmentation and virtual memory

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

1.2.1 B)
What is paging

A

memory is split up into equal sized section these can be swapped in and out of memory from secondary storage. However could seperate instructions like a loop.

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

1.2.1 B)
What is segmentation

A

splits memory into logical size division which may vary in size. Represents the structure and logical flow of program.

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

1.2.1 B)
What is virtual memory

A

uses a section of seconday storage to act as ram. part of program not in use temp moved through paging.
However disk thrashing can occur, this is when the computer freezes due to pages being swapped to frequently so they are spending move time moving instructions then executing them.

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

1.2.1 C)
What is an interrupt

A

Are signals generated by software or hardware to indicate to the cpu that a process needs attention

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

1.2.1 C)
How are interrupts stored

A

based on priority on urgent stored in order of priority within an abstract data structure callled priority qeue which is in the interrupt register

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

1.2.1 C)
How does Interrupt servies routine work

A

1)At the end of the fde cycle processor checks content of interrupt register
2) if an iterrupt of higher prority is found the content of the memory registers are temp transfered to a stack
3)cpu then responds to interrupt by loading the correct interrupt servies routine into the ram. A flag is sent to signal that the ISR began
4) Queue checked again for interrupts, this is repeated untill all have been servises. All interrupts have higher priorty then regular programs
5) pop the frame of the stack to continue the fde cycle

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

1.2.1 D)
What is scheduling

A

function of OS to ensure all sections of programs being run (jobs) recieve a fair amount of processing time.
How long , what next ??

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

1.2.1 D)
What catagories can schedulings algorthims be placed into

A

pre-emptive
non pre-emptive

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

1.2.1 D)
pre-emptive vs non pre-emptive

A

Pre - jobs are activly made to stop and start by using the os
non pre - once job starts left alone untill completion

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

1.2.1 D)
What are types of pre-emptive scheduling algorthims

A

Round robin
multi-level feedback
shortest time remaining

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

1.2.1 D)
What are types of non pre-emptive scheduling algorthims

A

First come first serve
shortest job first

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

1.2.1 D)
explain the round robin scheduling algorthim

A

Each job given section of processor time (slice) to execute. All jobs have equal time untill complete and removed from queue. Long jobs are ineff , doesnt take prority into account

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

1.2.1 D)
explain the first come first serve scheduling algorthim

A

Chronological order from joining queue

17
Q

1.2.1 D)
explain the multi-level feedback scheduling algorthim

A

multiple queues with diffrent priorites , difficult to implicate

18
Q

1.2.1 D)
explain the shortest job first scheduling algorthim

A

req processer to calc how task takes. risks processor stavation if continuious short jobs join queue

19
Q

1.2.1 D)
explain the shortest time remaining scheduling algorthim

A

req processer to calc how task takes. risks processor stavation if continuious short jobs join queue but if a shorted job joins queue it will take priorty

20
Q

1.2.1 E)
What are the diffrent types of OS explain

A

1) distributed - runs across multiple devices allowing the
load to be spread accross multiple computer cpus
2) Embedded - preforms a small range of specific tasks consumes less power
3) multi-tasking - multiple userrs make use of some computer must use scheduling alg risk of cpu starvation
4) real time - used in critcal time computers were takes happen in a guaranteed time frame

21
Q

1.2.1 F)
What is BIOS

A

Basic input output system, first system to run pc relies on it for running tests before loading OS into memory

22
Q

1.2.1 F)
What are the tests that bios carry out

A

1) POST - power on self test ensures hardware are correctly connected and functional
2) checks cpu clock , memory and cpu is operational
3) tests for external memory

23
Q

1.2.1 F)
Why is bios needed

A

As OS can only be loaded into the RAM from secondary storage

24
Q

1.2.1 F)
What is a bootstrap

A

Loads OS kernel into main memory

25
Q

1.2.1 F)
What is a kernel in terms of BIOS and OS

A

Kernel ensures smooth OS interface between hardware and software

26
Q

1.2.1 G )
What is a device driver

A

Program that provided by the OS allowing OS to interact with hardware by translating OS instructions into instructions the hardware will understand
specific to computers architecutre

27
Q

1.2.1 H)
What is a virtual machine

A

A Virtual Machine (VM) is a computer resource that uses software instead of a physical computer to run programs and deploy apps

28
Q

1.2.1 H)
What are the benifits of a virtual machine in terms of a server

A

can split a physical server into many so if one fails another can pick it up.

29
Q

1.2.1 H)
What are the properties of a VM
+ve and -ve

A

Provides an environment with a translator to run intermediate code. +VE )This allows for an evironment for testing different OS saves time and money of purchasing another device with a different OS.
-VE ) can ve slower running intermediate code on a VM compared to low level code.

30
Q

1.2.1 H)
What are some other uses for VM’s

A

Protection from malware - malware will effect the VM not the physical device its being run on.
Allows user to run incompatable software - able to run os specific programs like a console on a pc

31
Q

1.2.1 H )
What is intermediate code

A

halfway between machine code and object code