OS REVIEWER

0.0(0)
Studied by 5 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/157

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 1:15 PM on 12/14/24
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

158 Terms

1
New cards

Window Graphing System

A system that implements graphical user interfaces with user interface controls and illustrations.

2
New cards

File Tables

Structures used to hold information about the existence of files.

3
New cards

I/O status information

Information associated with the input/output state.

4
New cards

Interrupts

External events that operate independently.

5
New cards

Application Binary Interface (ABI)

Standard binary portability between programs.

6
New cards

Program counter

The address of the next instruction to be executed.

7
New cards

Job

A single program and a numerous sequenced setup process.

8
New cards

Linux Operating System

A free open-source variant of the UNIX operating system.

9
New cards

Process Control Information

Additional information the operating system needs to control processes.

10
New cards

User Mode

A less-privileged execution mode of an operating system.

11
New cards

Security Reference Monitor

Enforces access validation and audit generation.

12
New cards

I/O tables

Structures that manage input/output devices in a computer system.

13
New cards

Exit State

The state when a process is released from the pool of executable processes.

14
New cards

Multi-programmed Batch System

A system that processes multiple programs simultaneously.

15
New cards

Application Binary Interface

A collection of machine language instructions for binary portability.

16
New cards

True about process attributes

They consist of processor register information.

17
New cards

True about time-sharing systems

They allow multiple users simultaneous access to the system.

18
New cards

True about Android system

It is a Linux-based system originally designed for mobile phones.

19
New cards

Not True about serial processing

It allows the processor to handle multiple jobs simultaneously.

20
New cards

True about a trap in process switching

It relates to errors generated within the currently running process.

21
New cards

Not attributed to a process during program execution

The same identifier to each process.

22
New cards

Not described a process

It is a storage data structure.

23
New cards

True about kernel mode as an execution mode

It allows software to control the processor, its instructions and registers.

24
New cards

True about Windows operating systems

It operates the core OS software separately from application-oriented software.

25
New cards

Not an operating system service as a compiler interface

Management of virtual addresses, physical memory, and paging files.

26
New cards

True about halt instruction in process termination

It generates an interrupt to alert the OS that a process has been completed.

27
New cards

True about simple batch system

They process jobs in bulk.

28
New cards

True about process identification

It involves unique numeric identifiers.

29
New cards

Not an OS function

Extension of system functionality and running background user-mode activity.

30
New cards

Solaris

An operating system that implements a combined approach.

31
New cards

Race Condition

A situation where multiple threads read and write shared data.

32
New cards

Unblocked

This operation moves blocked threads into the ready queue for execution.

33
New cards

Hold and wait

This condition is prevented by requiring all resources simultaneously.

34
New cards

Responsive

Multithreading allows a program to continue running even if some part is blocked.

35
New cards

Resource allocation graph

A tool to characterize resource allocation to processes.

36
New cards

Condition Variable

Used to block a process or thread until a specific condition is met.

37
New cards

Multithreading

The ability of an OS to support concurrent paths of execution within a single process.

38
New cards

Binary semaphore

A semaphore that only takes the values zero and one.

39
New cards

Base Priority

The lower limit of a thread's dynamic priority.

40
New cards

Distributed Processing

The management of multiple processes executing on distributed systems.

41
New cards

Multicore System

Affects application design and performance with multiple threads.

42
New cards

Alert Status

Indicates whether a waiting thread may execute an asynchronous call.

43
New cards

Combined Approach

Runs multiple threads in parallel on multiple processors.

44
New cards

Monitor

A programming construct that encapsulates variables and initialization code.

45
New cards

All Process Threads share the same address space

Where both resources and threads arrangement exist.

46
New cards

Processes may exit while holding resources

Not a restriction in implementing deadlock avoidance.

47
New cards

Ability to communicate with each other

Not an OS concern due to concurrency.

48
New cards

Conflicting needs for resources by processes

Not true about concurrency.

49
New cards

Separated OS software from application

Not true about multithreading.

50
New cards

Aborting external deadlock process

Not a recovery method in deadlock detection.

51
New cards

Counting semaphore

This semaphore takes values greater than one.

52
New cards

Schedule thread whenever a process is blocked

Not a benefit of multithreaded programming.

53
New cards

A resource is not preempted

A condition must be present for deadlock to occur.

54
New cards

They encompass the ability to load multiple runnable programs

Not true about deadlock.

55
New cards

Infinite loop execution

Not true about the monitor mechanism.

56
New cards

Kernel maintains context information for the process

Not true about the combined approach.

57
New cards

Thread management code not needed on the application level

Not an advantage of user-level threads.

58
New cards

Application that processes binary data

Not a multithreaded application.

59
New cards

Web browser displaying images

Not attributed to threads.

60
New cards

Waiting Time

Criterion is the sum of time spent waiting in the ready queue.

61
New cards

Simple paging

Technique that divides memory into equal-sized frames.

62
New cards

Job queue

Contains all processes in the system.

63
New cards

Shortest remaining time first

An algorithm selecting process with smallest execution time.

64
New cards

Execution Time

Time required for process execution by the CPU.

65
New cards

Medium term Scheduler

Handles swapped-out processes in scheduling.

66
New cards

Virtual Memory Paging

Partition method that processes like segmentation without fragmentation.

67
New cards

Round Robin

Algorithm generating clock interrupts at periodic intervals.

68
New cards

Physical Addresses

Generated by the loader when a program is loaded into main memory.

69
New cards

Swapping

Also known as memory compaction.

70
New cards

Throughput

Measures how much work is performed by the processor.

71
New cards

Best-Fit

Placement algorithm choosing the block closest to requested size.

72
New cards

Simple Segmentation

Technique that divides each process into segments.

73
New cards

Virtual Memory

Gives processes and the kernel a private view of main memory.

74
New cards

True about long term Scheduling

Also known as job scheduler.

75
New cards

Not a requirement of memory management

Selecting a task or job to be dispatched.

76
New cards

Shortest remaining time first algorithm

Describes estimated processing time for selection.

77
New cards

NOT virtual memory characteristic

Provides fast access at a relatively high cost.

78
New cards

True about turnaround time

Difference between finish time and arrival time.

79
New cards

Fairness in scheduling

Means processes should be treated the same.

80
New cards

NOT considered a scheduling criterion

The average rate of placement algorithms.

81
New cards

True about response time

Time from request submission until response is received.

82
New cards

NOT TRUE about memory management

It holds data that is not in use.

83
New cards

NOT TRUE about virtual memory segmentation

It is similar to simple paging.

84
New cards

True about dynamic partitioning

It has no internal fragmentation.

85
New cards

True about fixed partitioning

Only produces minimal operating system overhead.

86
New cards

True about simple paging

May cause small amount of internal fragmentation.

87
New cards

Shortest job first algorithm

Best approach to minimize waiting time.

88
New cards

NOT TRUE about process scheduling

Divides CPU time among active processes and threads.

89
New cards

Input/output (I/O) devices

Hardware devices that manage input, deliver output, or process data.

90
New cards

Human-readable devices

Devices that communicate with computer users, like keyboards.

91
New cards

Machine-readable devices

Devices that communicate with electronic equipment, like sensors.

92
New cards

Communication devices

Devices that connect with remote devices, like modems.

93
New cards

Data transfer rate

Amount of digital data moved within a specific time.

94
New cards

Application

Specific use of a device depending on its purpose.

95
New cards

Control complexity

Difficulty level in operating a device.

96
New cards

Unit of transfer

Indicates whether data is transferred as a stream.

97
New cards

Data representation

Encoding scheme used by devices, including character codes.

98
New cards

Error conditions

Nature of errors that occur in I/O devices.

99
New cards

Device controllers

Components that act as interfaces between devices and drivers.

100
New cards

Device driver

Software module that integrates with the operating system.