Brainscape's Knowledge GenomeTM

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


See full index

OS > Test 1 > Flashcards

Test 1 Flashcards

1
Q

Bits start at 0, turn to 1 when referenced.

A

Bit-shifting:

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

A smaller, faster memory, located closer to a processor core, which stores copies of the data from frequently used main memory locations.

A

Cache Memory

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

Command line interface: Basically, command prompt for Linux.

A

CLI

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

The practice of using a network of remote servers hosted on the internet to store, manage, and process data, rather than a local server or a personal computer.

A

Cloud computing

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

The process of storing the state of a process or thread, so that it can be restored and resume execution at a later point. This allows multiple processes to share a single central processing unit (CPU) and is an essential feature of a multitasking operating system.

A

Context switching

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

Central processing unit that executes instructions for the computer.

A

CPU

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

Task that ties up the CPU for a long period of time, so other programs need to wait.

A

CPU Bound

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

the operating system copies a disk page into physical memory only if an attempt is made to access it and that page is not already in memory.

A

Demand paging

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

It allows users to view and control the hardware attached to the computer.

A

Device manager

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

When there are small and non-contiguous memory blocks which cannot be assigned to any process.

A

External fragmentation

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

An operating system scheduling algorithm that automatically executes queued requests and processes in order of their arrival.

A

(FCFS) First come first serve

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

Where the oldest (first) entry, or ‘head’ of the queue, is processed first.

A

(FIFO) First in first out

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

Mark of when a job is finished.

A

FINISHED

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

Fits data into memory by scanning from the beginning of available memory to the end, until the first free space which is at least big enough to accept the data is found. This space is then allocated to the data.

A

First-fit method

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

A memory allocation scheme in which main memory is sectioned off, with portions assigned to each user. Also called static partitions. It contrasts with dynamic partitions.

A

Fixed partition system

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

The graphical user interface is a form of user interface that allows users to interact with electronic devices through graphical icons.

A

GUI

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

State the first job that is entered is in.

A

HOLD

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

A job that requires a large number of input/output operations, resulting in substantial free time for the CPU.

A

I/O Bound

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

When there is a difference between required memory space vs the allocated memory space.

A

Internal Fragmentation

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

A hardware signal that suspends execution of a program and activates the execution of a special program known as the interrupt handler. It breaks the normal flow of the program being executed.

A

Interrupt

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

computer application for controlling unattended background program execution of jobs.

A

Job scheduler

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

computer program at the core of a computer’s operating system that has complete control over everything in the system.

A

Kernel

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

Page management algorithm that decides what process it takes out by which has been least used.

A

(LRU) Last recently used

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

region of a computer, to which the central processor has immediate or direct access.

A

Main memory

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

Is a process in which the free space is collected in a large memory chunk to make some space available for processes.

A

Memory Compaction

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

changing existing memory allocations and mappings to use different underlying physical pages.

A

Memory defragmentation

27
Q

to provide ways to dynamically allocate portions of memory to programs at their request, and free it for reuse when no longer needed.

A

Memory manager

28
Q

A database that comprises complete information about how the memory is structured in a computer system.

A

Memory map table

29
Q

A computer processor on a single integrated circuit with two or more separate processing units.

A

Multi core processor

30
Q

rudimentary form of parallel processing in which several programs are run at the same time on a processor:

A

Multiprogramming system

31
Q

An empty entry in a list.

A

Null entry

32
Q

The software that supports a computer’s basic functions, such as scheduling tasks, executing applications, and controlling peripherals.

A

Operating system

33
Q

A type of hardware interrupt caused by a reference to a page that does not reside in memory.

A

Page fault

34
Q

The process of moving a page out of main memory and into secondary storage so that another page can be moved into memory in its place.

A

Page swap

35
Q

A memory allocation scheme based on the concept of dividing a user’s job into sections of equal size to allow for noncontiguous program storage during execution.

A

Paged memory

36
Q

A composite of two submanagers, the Job Scheduler and the Process Scheduler. It decides how to allocate the CPU, monitors whether it is executing a process or waiting, and controls job entry to ensure the balanced use of resources.

A

Process manger

37
Q

The low-level scheduler of the Processor Manager that sets up the order in which processes in the READY queue will be served by the CPU.

A

Process scheduler

38
Q

Information stored in the job’s PCB that indicates the current location in memory of the job and the resources responsible for that status.

A

Process status

39
Q

Random access memory.

A

RAM

40
Q

Job is waiting to run.

A

Job is waiting to run.

41
Q

A computing system used in time-critical environments that require guaranteed response times, such as in navigation, rapid transit, and industrial control systems.

A

Real-time systems

42
Q

A data structure that contains the value that must be added to each address referenced in the program so that it will be able to access the correct memory addresses after relocation.

A

Relocation register

43
Q

A job status that means that the job is executing.

A

RUNNING

44
Q

A memory allocation scheme based on the concept of dividing a user’s job into logical groupings of code to allow for noncontiguous program storage during execution.

A

Segmented memory allocation

45
Q

System that allows one user at a time.

A

Single-user system

46
Q

is an engineered technique for adding capability to a computer.

A

Slots

47
Q

Another term for fixed partition.

A

Static partitions

48
Q

A phenomenon in a virtual memory system where an excessive amount of page swapping between main memory and secondary storage results in higher over-head and little useful work.

A

Thrashing

49
Q

A portion of a process that can run independently.

A

Thread

50
Q

A data structure that contains information about the cur-rent status and characteristics of a thread.

A

(TCB) Thread control block

51
Q

Decides which thread should run.

A

Thread scheduler

52
Q

A composite measure of a system’s efficiency that counts the number of jobs served in a given unit of time.

A

Throughput

53
Q

A period of time assigned to a process for execution. When it expires the resource is preempted, and the process is assigned another time quantum for use in the future.

A

Time quantum

54
Q

The portion of the operating system that users interact with directly. It is one of the most unique and most recognizable components of an operating system.

A

User interface

55
Q

The creation of a virtual version of hardware or software. Operating system virtualization allows a single CPU to run multiple operating system images at the same time.

A

Virtualization

56
Q

A job status that means that the job cannot continue until a specific resource is allocated or an I/O operation has finished.

A

WAITING

57
Q

A collection of pages to be kept in main memory for each active process in a virtual memory environment.

A

Working set

58
Q

Any process scheduling strategy that, based on predeter-mined policies, interrupts the processing of a job and transfers the CPU to another job.

A

Preemptive algorithm

59
Q

A job scheduling strategy that functions without exter-nal interrupts so that, once a job captures the processor and begins execution, it remains in the RUNNING state, uninterrupted, until it issues an I/O request or it is finished.

A

Non-preemptive algorithm

60
Q

A queuing policy used to ensure that jobs that have languished in the system for a long time in the lower level queues will eventually complete their execution.

A

Aging

61
Q

The name given to several registers allocated to each active process, whose contents associate several of the process segments and page numbers with their main memory addresses.

A

Associative memory

62
Q

A type of computing system that executes programs, each of which is submitted in its entirety, can be grouped into batches, and execute without external intervention.

A

Batch System

63
Q

A main memory allocation scheme that considers all free blocks and selects for allocation the one that will result in the least amount of wasted space.

A

Best fit method

OS (5 decks)

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