Back to marketplace

1.2 Software and software development

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 provide an interface between the user and the computer

#2
Front (Question)

What are some features of OS/operating systems? (5)

Back (Answer)

-memory management -file management -security/authentication -utility software -user management/interface

#3
Front (Question)

What are the forms of memory management used by the OS? (3) Why are these used instead of RAM?

Back (Answer)

-paging -segmentation -virtual memory when RAM isn’t large enough to store all the programs being used, these are techniques to ensure that requests/programs are still handled

#4
Front (Question)

What is paging?

Back (Answer)

-form of memory management used by the OS -memory split into equal sizes -physical divisions of memory -pages are swapped between main memory and the hard disk as needed

#5
Front (Question)

What is segmentation?

Back (Answer)

-form of memory management used by the OS -memory split into logical sized divisions (segments) -unequal sizes -segments represent the structure and logical flow of the program

#6
Front (Question)

What is virtual memory?

Back (Answer)

-form of memory management used by the OS -section of the hard drive acts as RAM when space to store programs is low -sections of programs not currently being used are temporarily moved into virtual memory through paging

#7
Front (Question)

What is an issue when using the memory management techniques?

Back (Answer)

disk thrashing -the computer ‘freezes’ due to pages being swapped too frequently between the hard disk and main memory

#8
Front (Question)

What are interrupts?

Back (Answer)

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

#9
Front (Question)

What is needed to be considered when allocating processor time to interrupts?

Back (Answer)

the level of priority it has

#10
Front (Question)

How are interrupts stored?

Back (Answer)

stored within a priority queue in an interrupt register

#11
Front (Question)

How can we check for interrupts and service them?

Back (Answer)

through the interrupt service routine (ISR)

#12
Front (Question)

What does the ISR do to check for interrupts?

Back (Answer)

checks the interrupt register at the end of each FDE cycle

#13
Front (Question)

What does the ISR do if an interrupt exists?

Back (Answer)

if there is an interrupt which exists with a higher priority to the current process: -current contents of the registers in the CPU are transferred to a stack -a relevant ISR is loaded into RAM -a flag is sent to signal the ISR has begun -the flag is reset once the ISR has finished -process is repeated

#14
Front (Question)

What happens after the ISR has serviced an interrupt?

Back (Answer)

-f there are no interrupts with a higher priority to the current process: -contents of the stack are popped back into the registers -FDE cycle resumes

#15
Front (Question)

What is scheduling?

Back (Answer)

allocating processing time to sections of programs being run (jobs)

#16
Front (Question)

What do we mean if something is pre-emptive?

Back (Answer)

jobs are actively made to start and stop by the OS

#17
Front (Question)

What do we mean if something is non pre-emptive?

Back (Answer)

once a job has been started, it is left alone until completed

#18
Front (Question)

What are the types of scheduling algorithms? (5) List if they are pre-emptive or not

Back (Answer)

Pre-emptive: round robin shortest remaining time (SRT) multilevel feedback queues (MLFQ) Non pre-emptive first come first serve (FCFS) shortest job first (SJF)

#19
Front (Question)

What is round robin?

Back (Answer)

scheduling algorithm -each job given a section of processor time (time slice) where it runs -once the job has used its first time slice, they are given another slice of processor time until the job is completed -once completed, the job is removed from the queue

#20
Front (Question)

What are +/- of round robin?

Back (Answer)

+all jobs will eventually be attended to -longer jobs will take a much longer time for completion -doesn’t take into account priorities/urgencies of jobs

#21
Front (Question)

What is FCFS?

Back (Answer)

scheduling algorithm (first come first served) -jobs are processed in chronological order by which they entered the queue

#22
Front (Question)

What are some +/- of FCFS?

Back (Answer)

+straightforward to implement -doesn’t take into account priorities/urgencies of jobs

#23
Front (Question)

What is MLFQ?

Back (Answer)

scheduling algorithm (multilevel feedback queues) -makes use of multiple queues, ordered based on priorities

#24
Front (Question)

What are +/- of MLFQ?

Back (Answer)

+takes into consideration of different job priorities -difficult to implement