Back to marketplace

2.1 System Sofware

No description yet. This curated deck is ready for daily study.

Total cards: 21•Content version: v4•Public deck•Updated: 8/1/2026

Card preview (21)

#1
Front (Question)

What are operating systems?

Back (Answer)

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

#2
Front (Question)

What functions does the OS provide?

Back (Answer)

• User interface • Memory management • Interrupt handling • Processor scheduling

#3
Front (Question)

User interface

Back (Answer)

Allows the operating system to hide the complexity of hardware

#4
Front (Question)

Memory management

Back (Answer)

• 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

#5
Front (Question)

Pages

Back (Answer)

• Available memory is divided into fixed size chunks called pages • Each page has an address

#6
Front (Question)

What process does paging fix?

Back (Answer)

• A process loaded into RAM is allocated sufficient pages, but those pages may not be contiguous in physical terms

#7
Front (Question)

How do page tables fix problems?

Back (Answer)

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

#8
Front (Question)

Segments

Back (Answer)

Spaces of memory that can relate to parts of a program

#9
Front (Question)

Segmentation

Back (Answer)

Dividing memory into segments

#10
Front (Question)

Virtual memory

Back (Answer)

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

#11
Front (Question)

Disk Thrashing

Back (Answer)

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

#12
Front (Question)

Interrupts

Back (Answer)

CPU instructions can be interrupted when necessary

#13
Front (Question)

How are interrupts processed?

Back (Answer)

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

#14
Front (Question)

What happens when an interrupt is detected?

Back (Answer)

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

#15
Front (Question)

Interrupt priority

Back (Answer)

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

#16
Front (Question)

Processor Scheduling

Back (Answer)

OS schedules when each application can use the CPU

#17
Front (Question)

Round Robin

Back (Answer)

• 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
Front (Question)

First come first serve

Back (Answer)

The first job to arrive is executed until it completes

#19
Front (Question)

Shortest remaining time

Back (Answer)

• 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
Front (Question)

Multi level feedback queues

Back (Answer)

• 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
Front (Question)

Starvation

Back (Answer)

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