Brainscape's Knowledge GenomeTM

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


See full index

Computer Science > Operating Systems > Flashcards

Operating Systems Flashcards

1
Q

What is software?

A
  • A collection of electronically stored instructions

(i. e., a program) that allows one to interact with a computer

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

What are the two categories software can be categorized into?

A
  1. Application Software

2. System Software

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

What is application software?

A
  • A computer program designed to help people perform

an activity

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

What is system software?

A
  • A type of computer program that is designed to run a computer’s hardware and application programs.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Examples of application software

A
  1. Office suites (e.g., Office 2016)
  2. Image editors (e.g., GIMP)
  3. Web browsers (e.g., Chrome)
  4. Video conferencing (e.g., Zoom, Skype)
  5. Acrobat reader …
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Examples of system software

A
  1. Operating systems (e.g., macOS, Windows, Linux)

2. Anti-malware (e.g., Trend Micro Anti-Virus )

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

Three Roles of an Operating System

A

1) Process management
- Manage numerous,
concurrently running programs
2) Memory management
- Allocate and track efficiently
3) Device management
- Grant and share access to computer’s hardware

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

Recall that a process is a program in ———

A

exceution

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

How many processes can a CPU process at one time?

A

-one

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

Kernel

A
  • Core of a computer’s operating system and generally has complete control over everything in the system.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

GUI

A

Graphic User Interface: Type of user interface through which users interact with electronic devices via visual indicator representations (icons, mouses, menus)

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

CMD: Command for Microsoft windows

A
  • Used to execute entered commands and perform advanced administrative functions.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What are the five stages of processing?

A
  1. New
  2. Ready
  3. Waiting
  4. Running
  5. Terminated
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q
  1. New - State of Processing
A
  • New process that has been created but has not yet been admitted by the OS for its execution.
  • A new process is not loaded into the main memory, but its process control block (PCB) has been created
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q
  1. Ready-State of Processing
A
  • A process that is prepared to execute when given the opportunity by the OS.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q
  1. Waiting-/Blocked State of Processing
A
  • A process cannot continue executing until some event occurs like for example, the completion of an input-output operation.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q
  1. Running-State of Processing
A
  • The process is currently being executed.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q
  1. Terminated- State of Processing
A
  • A process or job that has been released by the OS, either because it is completed or is aborted for some issue.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

What can cause a process to move into a waiting state?

A
  • If it needs more data or information from the user in order to complete it
  • if it needs to wait for a resource, such as waiting for user input, or waiting for a file to become available.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

What is data structure?

A
  • Used by the OS to manage information

about a process

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

What current values are managed by the data structure?

A

1) The program counter (where the execution should
start/resume)
2) All CPU registers for the process (CPU state)
3) base and bound registers or page-map tables (memory management info, see later)
4) Accounting information (owner, priority, files and network connections open)

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

What does each state contain?

A
  • Each state contains a list of PCBs, one for each process in that state
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
23
Q

What is a new PCB first created?

A
  • When the process is first created and persists until the process terminates
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
24
Q

What happens to the corresponding PCB when the process moves from one state to another?

A
  • Moves from one state list in the operating system
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
Q

What happens each time a process is moved to the running state?

A
  1. Register values for the currently running process
    are stored into its PCB
  2. Its PCB is moved to the list of the state into which it goes
  3. Register values of the new process moving into the running state are loaded into the CPU
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
26
Q

What is a context switch?

A
  • Exchange of register information
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
27
Q

What is used to determine which processes move from ready to run?

A
  • CPU Scheduling Algorithms
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
28
Q

Types of CPU Scheduling Algorithms? (3)

A
  1. Non-preemptive scheduling
  2. Preemptive scheduling
  3. Turn-around time
29
Q

Why is the PCB needed?

A
  • Needed in order to know what has happened and what needs to happen next
30
Q

Non-preemptive Scheduling

A
  • The currently executing process gives up the CPU voluntarily
31
Q

When can non-preemptive scheduling be used?

A

-When a process terminates or switches from a running to a waiting state.

32
Q

Preemptive scheduling

A
  • Method where the tasks are mostly assigned with their priorities.
33
Q

Turn Around Time

A
  • The amount of time between when a process arrives in the ready state the first time and when it exits the running state for the last time
34
Q

When can pre-emptive scheduling be used?

A
  • Used when a process switches from running state to ready state or from the waiting state to ready state.
35
Q

Service Time

A
  • The amount of CPU time that a process will need before it either finishes or voluntarily exits the CPU
36
Q

Types of Non-Preemptive Scheduling

A
  1. First-Come, First-Served

2. Shortest Job Next

37
Q

First-Come, First-Served (Non-Prem)

A
  • Processes are moved to the CPU in the order in which they arrive in the ready state
38
Q

Shortest Job Next (non-prem)

A
  • Process with shortest estimated running time in the ready state is moved into the running state first
39
Q

Round Robin (prem)

A
  • Each process runs for a specified time slice and moves from the running state to the ready state to await its next turn if not finished
40
Q

Difference between logical vs physical address

A
  • The logical address is generated by CPU during a program execution whereas, the physical address refers to a location in the memory unit.
41
Q

Logical Address

A
  • Reference to a stored value relative to the program
    making the reference
  • Virtual address that can be viewed by the user, not a real address
42
Q

Physical Address

A
  • Actual address in the main memory
43
Q

Three types of memory management

A
  1. Single Contiguous MM
  2. Partition Memory Management
  3. Paged Memory Management
44
Q

what two programs are in single continuous MM?

A
  1. Operating System

2. Application Program

45
Q

Partition Memory Management

A
  • Has the OS and any number of other programs in the memory at the same time
46
Q

What does the OS of the Single Partian MM have at the same time?

A
  • Has only the OS and one anther program in the memory at the same time
47
Q

What are the two schemes for dividing up memory among programs:

A
  1. Fixed Partition

2. Dynamic Partition

48
Q

Fixed Partition

A
  • Main memory is divided into a fixed number of partitions into which programs can be loaded
49
Q

Dynamic Partitions

A
  • Such partitions are created as needed to fit the programs waiting to be loaded
50
Q

Base Register

A
  • A register that holds the beginning address of the current partition (the one that is running)
51
Q

Bounds Register

A
  • A register that holds the length of the current partition
52
Q

Partition Selection Algorithms

A

1 Best Fit

  1. First Fit
  2. Worst Fit
53
Q

First Fit

A
  • Allocate the program to the first partition

big enough to hold it

54
Q

Best Fit

A
  • Allocate program to the smallest partition

big enough to hold it

55
Q

Worst Fit

A
  • Allocate program to the largest partition

big enough to hold it

56
Q

Paged Memory Technique

A
  • A technique in which processes are divided into fixed-size pages and stored in memory frames when loaded
57
Q

Frame

A
  • A fixed-size portion of main memory that holds a process page
58
Q

Page

A
  • A fixed-size portion of a process that is stored into a

memory frame

59
Q

What information does the Page-program hold?

A
  • Information about the address of the process
60
Q

What info does the frame main memory have?

A
  • Information about where the process is in the main memory
61
Q

Demand paging

A
  • An extension of paged memory management in

which pages are brought into memory on demand

62
Q

Page Swap

A

-The act of bringing in a page from secondary
memory, which often causes another page to be
written back to secondary memory

63
Q

Virtual Memory

A
  • The illusion that there are no restrictions on the size
    of a program because an entire process doesn’t have
    to be in memory at the same time
64
Q

Thrashing

A
  • Inefficient processing caused by constant page swaps
65
Q

Device drivers

A

Software that instructs the OS on how to

communicate with a piece of hardware

66
Q

Examples of drivers are required for hardware

A

I/O ports (e.g., USB), printers, video hardware, audio

hardware, storage devices, wireless network adapters, webcams

67
Q

What does virtualization allow for?

A
  • Allows a guest OS, as a virtual machine app,
    to run inside the host OS
    1. The guest OS communicate with virtual hardware
    2. The virtual machine then translates this to calls to the
    actual hardware
68
Q

Virtualization Benefits

A
  1. Reduced costs of hardware and power consumption
  2. Reduced costs for software licenses
  3. Software can be tested on multiple virtualized
    environments before being released
  4. Development of software can happen using another OS
69
Q

Virtualization Drawbacks

A
  1. Host machine requires more resources
  2. Host machine suffers more wear and tear
  3. Might not be able to virtualize specialized hardware
  4. Problems more difficult to diagnose

Computer Science (8 decks)

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