Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

Operating System > Exam 3 > Flashcards

Exam 3 Flashcards

1
Q

MMU

A

Memory Management Unit

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

TLB

A

Translation Lookaside Buffer

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

FIFO

A

First In, First Out

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

DMA

A

Direct Memory Access

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

RAID

A

Redundant Array of Inexpensive Disks

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

dynamic relocation

A

moving things around in memory dynamically

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

swapping

A

Memory allocation changes as processes come into memory and leave it

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

memory compaction

A

“burping” the holes out from between the pages

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

coalescing

A

combining adjacent holes in RAM into one

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

virtual address

A

this can be added to the block’s base to get the physical address

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

page frame

A

block in REAL memory that may hold a page

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

page fault

A

an error that occurs when a block of memory that has not been stored in RAM has been attempted to be accessed

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

page table

A

An array with subscripts that correspond to blocks of virtual memory. The destination block of real memory is the value of that subscript. So array[virtualMemoryBlock] would hold the actual physical RAM address

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

translation lookaside buffer(TLB)

A

a small hardware device that maps virtual address to physical addresses without going through the page table

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

dirty page frame

A

when a page in RAM and a page on the disk differ (variables changed, etc)(One that has been modified)

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

working set

A

the set of pages that have been accessed in the k most recent

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

thrashing

A

excessive page files

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

cylinders

A

vertical sections of the piece of the disk

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

sectors

A

pieces of the track

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

cycle stealing

A

disk drives have higher priority than the CPU and will steal cycles from it on the bus

21
Q

tracks

A

a piece of the surface of the disk

22
Q

striping

A

when a file is spread across multiple disks

23
Q

cylinder skew

A

starting point for next larger track is offset from previous track, to account for time required for read/write head to move so it doesn’t have to wait for a complete revolution for start point to come back again

24
Q

elevator algorithm

A

goes up to the top, and down towards the bottom, picking processes as it goes up and down

25
Q

pits and lands

A

burning mountains and valleys on the surface of the cd to represent 1s and 0s

26
Q

mickey

A

unit of mouse movement

27
Q

pixel

A

a picture element

28
Q

i-node

A

an index node, stores the attributes and disk block locations of the filesystem object’s data

29
Q

in order to support multiprogramming with dynamic relocation, computer designers added what two special registers?

A

Base register and the limit register

30
Q

what data structures may be used to keep track of which sections of memory are used by a process and whech sections are holes

A

Bitmap, Linked List

31
Q

how would these structures be used to coalesce memory

A

bitmap-there’s nothing to do

linked list-take two nodes and merge them into one

32
Q

what is the difference between a page and a page frame?

A

page - virtual page

page frame- where it goes in real memory

33
Q

who or what deals with page faults

A

OS

34
Q

what is stored in a page table

A

the mapping between virtual and physical addresses

35
Q

Why is a translation lookaside often used?

A

speeds up the process of checking to see if a page has been loaded in memory

36
Q

what is an inverted page table and when might it be used

A

When subscripts and values are swapped. Subscripts = page frames and values = page

37
Q

what is the formula that determines the optimal page size?

A

p=sqrt(2se)

38
Q

what are the two types of backing stores

A

executable image

page file

39
Q

what is a platter

A

a circular disk - a track on top and a track on bottom

40
Q

a track

A

a ring of sectors on a disk

41
Q

a cylinder

A

a vertical group of platters

42
Q

a sector

A

a section of space in a track

43
Q

what is seek time

A

how much time it takes the read/write head to get to its destination

44
Q

what is rotation time or rotational delay

A

how long it takes for a sector to make it all the way around to its origin point

45
Q

describe the 6 RAID levels

A

0-striping; no parity; purely parallel and for speed
5-duplication across drives with parity bit, which is also shared by other drives so it’s shared uniformly
6-duplicated parity bits

46
Q

the time required to read or write a disk block is determined by what three factors?

A

seek time
rotation delay
transfer time

47
Q

explain how 24-bit RGB representation is used to render “true color”

A

One byte for Red, one for Green, one for Blue

48
Q

what would a system manager implement disk quotas?

A

keep anyone from hogging space

49
Q

what two techniques are often used to track the free blocks on a disk drive

A

bitmaps

link list

Operating System (3 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions