Back to marketplace

1.2.1 Systems software - Gurjot

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

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

Card preview (24)

#1
Front (Question)

what is an operating system

Back (Answer)

a collection of programs that work together in order to provide an interface between the user and the computer

#2
Front (Question)

state some features that an operating system provides

Back (Answer)

• memory management • file management • utility software • user interface

#3
Front (Question)

what is paging

Back (Answer)

when memory is split up into equal sized sections (called pages). these can be swapped between main memory and hard disk as needed.

#4
Front (Question)

what is segmentation

Back (Answer)

splitting up memory into logical sized divisions (called segment).

#5
Front (Question)

what is virtual memory

Back (Answer)

using a section of hard drive to act as RAM when the space in the main memory in insufficient. sections currently not in use are moved into virtual memory through paging

#6
Front (Question)

what are the issues with the 3 ways of memory management

Back (Answer)

it causes disk thrashing (when the computer freezes as pages are being swapped too frequently between hard disk and main memory.)

#7
Front (Question)

what are interrupts

Back (Answer)

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

#8
Front (Question)

describe the steps of the interrupt service routine

Back (Answer)

• Interrupt Request: Device signals the CPU • Acknowledgement and Save Content: CPU finishes current task, saves state to the stack • Identify and Execute ISR: CPU identifies interrupt source and runs ISR • Restore and Resume: CPU restore saved context and resumes main program

#9
Front (Question)

what is pre-emptive scheduling

Back (Answer)

jobs are actively made to start and stop by the operating system

#10
Front (Question)

give examples of pre-emptive scheduling

Back (Answer)

• multi level feedback queues • shortest time remaining • round robin

#11
Front (Question)

what is non pre-emptive scheduling

Back (Answer)

once a job is started, its left alone until completed

#12
Front (Question)

give examples of non pre-emptive scheduling

Back (Answer)

• first come first served • shortest job first

#13
Front (Question)

describe round robin scheduling

Back (Answer)

each job is given a section of processor time, if not completed in the time, its put back in the queue.

#14
Front (Question)

describe first come first served

Back (Answer)

jobs are processed in order of which entered the queue first

#15
Front (Question)

describe multi level feedback queues

Back (Answer)

makes uses of multiple queues, ordered based on different priority.

#16
Front (Question)

describe shortest job first

Back (Answer)

jobs processed in ordered according to the time required for completion, with the shortest at the front

#17
Front (Question)

describe shortest time remaining

Back (Answer)

the queue storing jobs is ordered according for the time left for completion. if a new job enters the queue, its compared to the one being processed and is replaced with the one being replaced if it has a shorter completion time.

#18
Front (Question)

what is processor starvation

Back (Answer)

when a process does not receive enough time in order to be completed.

#19
Front (Question)

what scheduling algorithms are at risk of processor starvation

Back (Answer)

• shortest time remaining • shortest job first

#20
Front (Question)

describe a distributed operating system

Back (Answer)

an os run across multiple devices, so load is spread across multiple processors.

#21
Front (Question)

describe an embedded os

Back (Answer)

built to perform a small range of specific tasks catered to a specific device

#22
Front (Question)

describe a multi tasking os

Back (Answer)

enables user to carry out tasks seemingly simultaneously using time slicing

#23
Front (Question)

describe a multi user os

Back (Answer)

makes use of a supercomputer , and scheduling algorithm to ensure time is shared fairly between jobs

#24
Front (Question)

describe a real time os

Back (Answer)

designed to perform a task in a guaranteed time frame