Brainscape's Knowledge GenomeTM

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


See full index

Operating Systems > Midterm Terms > Flashcards

Midterm Terms Flashcards

1
Q

Process Control Block

A

data package that contains register contetns, values of all variables, state of any I/O, pointers to all open files, any interruptes, the program in memory, the program counter

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

Time quanta

A

The period of time a process is allowed to run uninterrupted

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

Context Switching

A

The switching of the CPU from one process to another

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

Turn Around Time

A

Completion time - arrival time

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

Multilevel queue

A

A scheduling algorithm that gives preference to short jobs, I/O processes, and separates processe sinto categories based on the need of the processor

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

Deadlock

A

A problem occuring when resources for Job A to occur are competing with Job B. B cannot start until A finishes.

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

Preemptive multitasking

A

A multitasking method that shares processing time with all running programs.

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

Process/Resource diagram

A

R1, P1, R2, P2, R3, P3

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

Recovery Algorithm

A

Identify the victim process, the one with the lowest priority and pull the process out of the key so its resources are available

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

Volume

A

A single accessible storage area with a single file system

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

Volume descriptor

A

Describes the characteristics of the file system information present on a given CD-ROM or volume.

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

Master File Directory

A

An essential data structure on any ITS file system, one level of directories instead of hierarchial.

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

Block

A

A portion of allocated memory.

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

Single User System

A

Only one program can be run at a time.

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

Fixed Partitions

A

The OS has a job scheduler. It keeps track of incoming jobs and which partitions are free, and if there is enough space for a program to fit.

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

Dynamic partitions

A

Good at assigning space for initialprograms, but suffer from external fragmentation over time

17
Q

Relocatable Dynamic Partitions

A

Dynamic partitions that the operating system can move around to free up space for a new process in the queue.

18
Q

Kernel

A

Responsible for resource allocation, low-level hardware interfaces, security.

19
Q

Compaction

A

Moves all the allocated blocks to one end of memory (defragmentation)

20
Q

Page

A

Small, fixed sized blocks of virtual memory.

21
Q

Page Frame

A

Just like a page but in physical memory, not logical memory

22
Q

Demand Paging

A

A page is not loaded until it is referenced by a process

23
Q

Program Counter

A

A processor register that indicates where a computer is in its program sequence

24
Q

Page Fault

A

Occurs when the kernel needs a page, finds it doesn’t exist in physical memory because it has been paged-out, and re-reads it in from disk

25
Q

Page Replacement Policy

A

The steps carried out by the operating system when a page fault occurs

26
Q

Segment

A

Are user defined logical modules in a program.

27
Q

Segmentation Fault

A

An error in which a running Unix program attempts to access memory not allocated to it and terminates with a segmentation violation error and usually a core dump.

28
Q

Pipe

A

A form of redirection to send the output of one program to another program for further processing

29
Q

Symbolic Link

A

A file that links to another file.

30
Q

External Fragmentation

A

When free memory is separated into small blocks and is interspersed by allocated memory

31
Q

Internal Fragmentation

A

A partition is split to hold more jobs

32
Q

Memory Map Table

A

Keeps track of which page frames are free.

33
Q

Process

A

An instance of a program in execution

34
Q

Process scheduling algorithms

A

FIFO, Shortest Job First, Priority, Round Robin, Multilevel queue

35
Q

Redirection

A

In Unix, to send output from a process to a different file or device.

36
Q

Round Robin

A

Process scheduling algorithm

37
Q

Virtual Memory

A

Using a disk as an extension of RAM

38
Q

CPU Bound Processes (in multilevel queues)

A

When the time for a task to complete is determined principally by the speed of the CPU

39
Q

I/O Bound Processes

A

When the time it takes to complete a computation is determined principally by the period spent waiting for I/O operations to be completed.

Operating Systems (10 decks)

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