OS And Runtime Basics Flashcards

1
Q

When should you use the heap instead of the stack?

A

if you don’t know exactly how much data you will need at run time or if you need to allocate a lot of data.

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

memory hierarchy

A

a concept in which computers have a few megabytes of very fast, expensive, volatile cache memory, a few gigabytes of medium-speed, medium-priced, volatile main memory, and a few terabytes of slow, cheap, nonvolatile magnetic or solid-state disk storage, not to mention removable storage, such as DBDs and USB sticks

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

memory manager

A

the part of the operating. system that manages (part of) the memory hierarchy

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

ROM stands for

A

Read-Only Memory

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

RAM stands for

A

Random Access Memory

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

BIOS stands for

A

Basic Input Output System

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

What was the danger of in early operating system memory models having the OS be stored in RAM?

A

a bug in the user program can wipe out the operating system, possibly with disastrous result

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

What memory model is used in some handheld computers and embedded systems?

A

device drivers at top of memory in a ROM, and the and the rest of the system in RAM down below

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

Buffer

A

data buffer (or just buffer) is simply a region of a physical memory storage used to temporarily store data while it is being moved from one place to another. Typically, the data is stored in a buffer as it is retrieved from an input device (such as a microphone) or just before it is sent to an output device (such as speakers). However, a buffer may be used when moving data between processes within a computer. A majority of buffers are implemented in software

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

Round Robin

A

a CPU scheduling algorithm where each process is assigned a fixed time slot in a cyclic way. It is simple, easy to implement, and starvation-free as all processes get fair share of CPU. … It is preemptive as processes are assigned CPU only for a fixed slice of time at most.

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