2.1 System Sofware Flashcards

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

What are operating systems?

A

OS manages hardware and provides an interface for the users and the application software

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

What functions does the OS provide?

A
  • User interface
  • Memory management
  • Interrupt handling
  • Processor scheduling
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

User interface

A

Allows the operating system to hide the complexity of hardware

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

Memory management

A
  • Programs and data need to be loaded into RAM
  • Operating systems must manage allocation of RAM to different programs
  • There may not be sufficient RAM for all desired processes to be completely loaded into RAM at once
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Pages

A
  • Available memory is divided into fixed size chunks called pages
  • Each page has an address
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What process does paging fix?

A
  • A process loaded into RAM is allocated sufficient pages, but those pages may not be contiguous in physical terms
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

How do page tables fix problems?

A

A page table maps between the logical locations and the physical memory locations

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

Segments

A

Spaces of memory that can relate to parts of a program

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

Segmentation

A

Dividing memory into segments

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

Virtual memory

A

Some of the pages of a current process are stored in virtual memory until they are swapped into RAM

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

Disk Thrashing

A

Where the computer has to constantly swap pages between virtual and primary memory and therefore slows down the computer

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

Interrupts

A

CPU instructions can be interrupted when necessary

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

How are interrupts processed?

A

CPU checks at the end of each clock cycle whether there are any interrupts to be processed

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

What happens when an interrupt is detected?

A

The processor stops fetching instructions and instead pushes the current contents of its registers onto a stack

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

Interrupt priority

A

Interrupts can themselves be interrupted if the new interrupt is of a higher priority

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

Processor Scheduling

A

OS schedules when each application can use the CPU

17
Q

Round Robin

A
  • Each job is allocated by FIFO a time during which it can use the CPU’s resources
  • If the hob has not been completed by the end of its slice, the next job is allocated a time slice
18
Q

First come first serve

A

The first job to arrive is executed until it completes

19
Q

Shortest remaining time

A
  • The time to completion is estimated as new job arrives
  • The job with the shortest remaining time to completion is executed, meaning that a shorter new job can take over from the current process
20
Q

Multi level feedback queues

A
  • Multiple queues are created with different priority levels
  • If a job uses too much CPU time it is moved to a lower priority queue
  • Processes can also be moved to a higher priority queue if they have waited a long time
21
Q

Starvation

A

When high priority processes keep executing and low priority processes get blocked for indefinite time