Brainscape's Knowledge GenomeTM

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


See full index

OS > Test 2 > Flashcards

Test 2 Flashcards

1
Q

Name the series of conditions, when occurring in pairs simultaneously, can facilitate the creation of a deadlock.

A
  1. Mutual Exclusion
  2. Hold and Wait
  3. No Preemption
  4. Circular Wait
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Deadlock condition where only one process at a time can use a resource.

A

Mutual Exclusion

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

Deadlock condition where the process holding on resource is waiting to acquire a resource held by another process.

A

Hold and Wait

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

Deadlock condition where a resource can be released only by the process holding it after the process has completed its task.

A

No Preemption

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

Deadlock condition where a set of waiting process such that P(n-1) is waiting for resource from Pn1, and Pn1 is waiting for P0.

A

Circular Wait

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

______ contains the logical address space usable by a process.

A

Base and Limit Registers

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

A device that maps virtual addresses to physical addresses.

A

Memory Management Unit (MMU)

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

______ allows total physical memory space of processes to exceed available physical memory.

A

Swapping

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

A ______ is a fast disk large enough to accommodate copies of all memory images.

A

Backing Store

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

______-out, ______-in is a swapping variant for priority based scheduling.

A

Roll-out, Roll-in

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

______ occurs when the total required memory space EXISTS to satisfy a request, but it is not contiguous.

A

External Fragmentation

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

______ occurs when the allocated memory for a process might be SLIGHTLY LARGER than the requested memory.

A

Internal Fragmentation

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

What are the three solutions to the Dynamic Storage Allocation problem?

A
  1. First-fit: allocate the first hole that is big enough
  2. Best-fit: allocate the smallest hole that is big enough
  3. Worst-fit: allocate the largest hole (requires searching the entire list)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Used to translate logical addresses to physical addresses

A

Page Table

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

Sits between Main Memory and the CPU registers.

A

Cache

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

A ______ list Maintained to keep track of which frames can be allocated.

A

Free-frame list

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

A CPU cache that memory management hardware uses to improve virtual address translation speeds.

A

Transfer Lookaside Buffer (TLB)

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

The separation of user logical memory and physical memory.

A

Virtual Memory

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

The result from the first time there is a reference to a specific page in virtual memory.

A

Page Fault

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

______ paging only brings a page into memory when it is needed.

  • could result in a lot of page faults
  • can be optimized by loading entire process image to swap space at process load time
A

Demand Paging

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

Allows both the parent and child processes to initially share the same pages in memory.

A

Copy-on-write (COW)

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

A ______ bit can be used to reduce the overhead of page transfers; only modified pages are written to disk.

A

Modify (dirty) bit

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

What are the page replacement algorithms? (3)

A
  1. FIFO (first in first out)
  2. LRU (least recently used)
  3. Second chance (uses a reference bit; if the bit value is 1, decrement and leave in memory, but if the bit is 0 replace with next page.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
24
Q

Type of allocation that is proportional according to the size of the process.

A

Fixed Page Allocation

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

Type of replacement where a process selects a replacement frame from set of all frames.

  • one process can take frames from another’
  • process execution time can vary greatly
  • affords greater throughput
A

Global Replacement

26
Q

Type of replacement where a process selects from only its allocated sets of frames.

  • more consistent performance
  • possible under-utilization of memory
A

Local Replacement

27
Q

______ occurs when a process is busy swapping pages in and out of memory, so much so, that minimal work is actually performed.

A

Thrashing

28
Q

The time it takes to move the disk arm to the desired cylinder.

A

Random Access Time

29
Q

The time it takes for the desired sector to rotate under the disk read head.

A

Seek Time

30
Q

A ______ is many hosts attached to many storage units; common in large storage environments.

*storage is made available via LUN masking from specific arrays to specific servers

A

Storage Area Network (SAN)

31
Q

(total number of bytes transferred) / (total time between first request and completion of last request)

A

Bandwidth

32
Q

What are the sources of Disk I/O requests? (3)

A
  1. Operating System
  2. System Processes
  3. User Processes

*The Operating System maintains the queue of requests per disk or device.

33
Q

What are the Disk Scheduling Algorithms? (5)

A
  1. FCFS (first come first serve)
  2. SSTF (shortest seek time first)
  3. SCAN - arm starts reading at one end and services requests as it moves toward the other end, sweeping back and forth reversing direction.
  4. CSCAN - similar to SCAN, but instead of reversing direction the arm proceeds back to its original position.
  5. Look/CLOOK - arm only goes as far as the last request in either direction and reverses immediately.
34
Q

______ is dividing a disk into sectors that the disk controller can read and write.

*usually 512 bytes of data per sector

A

Low Level / Physical Formatting

35
Q

To ______ is to divide a disk into one or more cylinders, each treated as a logical disk.

A

Partition

36
Q

______ is basically making/implementing a file system.

A

Logical Formatting

37
Q

A Uniform logical view of information storage. The smallest allotment of nameable storage.

*structure is decided by the Operating System and/or program

A

File

38
Q

Name all File Attributes

A
  1. Name (only information in human readable form)
  2. Identifier (unique tag, identifies the file within the file system)
  3. Type
  4. Size
  5. Location
  6. Time, date, and user identification
39
Q

______ are create, write, read, reposition within file, delete, and truncate.

A

File Operations

40
Q

A Global table maintained containing process independent open file information.

A

Open-file Table

41
Q

______ mediates access to a file. (shared or exclusive)

  • Mandatory - access denied dependent upon the locks held and requested.
  • Advisory - process can find the status of locks and decide what to do.
A

Open File Locking

42
Q

File Access Methods (2)

A
  1. Sequential Access (tape drive model of file)

2. Direct Access (random access / relative access)

43
Q

The subdivisions of a disk are called ______.

*can be used raw (without a file system) or formatted (with a file system)

A

Partitions

44
Q

______ adds the ability to directly share data between users.

A

Acyclic-graph directories

45
Q

______ specifies how multiple users are to access a shared file system simultaneously.

A

Consistency Semantics

46
Q

A ______ uses the same page cache to cache both memory-mapped pages and ordinary file system I/O to avoid double caching data.

A

Unified Buffer Cache

47
Q

A ______ caches pages rather than disk blocks using virtual memory techniques and addresses.

*memory mapped I/O uses page caching, while routine I/O uses buffer disk cache via the file system.

A

Page Cache

48
Q

A ______ is a separate section of main memory for frequently used blocks.

A

Buffer Cache

49
Q

Type of allocation where each file has its own index block(s) of pointers to its data blocks.

A

Indexed Allocation

50
Q

Type of allocation where each file is a linked list of blocks (no external fragmentation).

*locating a block can tax I/O and increase seek times

A

Linked Allocation

51
Q

Type of allocation where each file occupies a set of contiguous, or adjacent blocks.

A

Contiguous Allocation

52
Q

A ______ table is a linear list with a hash data structure.

A

Hash Table

53
Q

A list of file names with pointer to data blocks

A

Linear List

54
Q

The ______ partition contains the Operating System and is mounted at boot time.

A

Root

55
Q

A _______ Control Block contains details about a volume (total number of blocks, number of free blocks, block size, and free block pointers).

A

Volume Control Block

56
Q

A _______ Control Block contains information needed by the system in order to boot an Operating System from a volume.

A

Boot Control Block

57
Q

A type of file system that manages metadata information and maintains file control blocks.

A

Logical File System

58
Q

A _______ Module understands files, logical addresses, and physical blocks; also responsible for translating logical block number to physical block number.

A

File Organization Module

59
Q

A _______ driver controls the physical device; manages I/O devices.

A

Device Driver

60
Q

A _______ Control Block is a storage structure consisting of information about a file. (exists per file)

A

File Control Block

OS (8 decks)

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