Day 7

Question 1

A(n) _______ condition occurs due to a process depending on the timely output of another process.

Answer 1

Race

Question 2

_________ scheduling is a non-preemptive algorithm that utilizes a priority to determine when the process will run?

Answer 2

Priority

Question 3

Excessive swapping is known as ________.

Answer 3

Thrashing

Question 4

On a 32 bit system, virtual memory extends memory demands by providing a logical _____ of addressable space for every process.

Answer 4

2 GB

Question 5

Linux device drivers are installed as __________ in the /lib directory.

Answer 5

LKM

Question 6

Virtual memory is commonly implemented through the use of which of the following?

Answer 6

Virtual addressing, page directories, page tables, swap/page file.

Question 7

VMware ESXi Server is an example of a _____ VMM.

Answer 7

Type 1

Question 8

List examples of preemptive scheduling algorithms.

Answer 8

Round robin, multilevel queue, multilevel feedback queue

Question 9

Tracks data that is stored in cache.

Answer 9

Transaction look aside buffer

Question 10

Uses physical disk space to store memory data that is not actively being used in RAM

Answer 10

Swap/page file

Question 11

Every process has one. It contains entries used to point to specific page table entries.

Answer 11

Page Directories

Question 12

Usable by process resources in user mode, these identify the page directory entry, the page table, and the offset.

Answer 12

Virtual Addresses

Question 13

It contains pages that identify the page frame address of the data being sought

Answer 13

Page tables

Question 14

Holds global and static variables which exist throughout the life of the program.

Answer 14

Data

Question 15

Used to store the compiled code of the currently running program.

Answer 15

Text

Question 16

Part of the computer’s memory which is reserved for external libraries of code and shared memory.

Answer 16

Free Space

Question 17

This memory is used by non-static, local variables that are explicitly declared in a program. It is efficiently managed by the CPU allowing very fast access to variable data.

Answer 17

Stack

Question 18

Used for dynamically allocated memory and is uninitialized at first.

Answer 18

Heap

Question 19

This type of Linux device is expected to utilize the system calls such as read() and write() and transfers data one block at a time.

Answer 19

Block device

Question 20

This windows _______ routine is used to register the rest of the driver with the operating system.

Answer 20

Initialization

Question 21

When an interrupt occurs, the kernel traps the current executing process/thread and changes its state to _______?

Answer 21

Wait

Question 22

The ______ is used to track info stored in cache.

Answer 22

Transaction look-aside buffer TLB

Question 23

(True or False) traps only deal with exceptions.

Answer 23

False

Question 24

The ____ schedules between threads using switching.

Answer 24

Dispatcher

Question 25

_____ is the amount of time the process takes to react to user request.

Answer 25

Response time

Question 26

_________ memory management is characterized by only allowing a single process to exist in RAM at a time.

Answer 26

Single user contiguous

Question 27

Used to initiate a data transfer to or from a device.

Answer 27

Start I/O Routine

Question 28

Used to send a driver notification whenever a new device is detected. These drivers support PnP.

Answer 28

Add-device routine

Question 29

These are the main functions provided by a device driver. When called on to perform an I/O operation, the OS initiates this routine.

Answer 29

Dispatch Routine

Question 30

Primarily used in controlling ISR’s. For instance, once the ISR is completed, the DPC is used in ending the interrupt and returning to normal scheduling.

Answer 30

Deferred Procedure Routine

Question 31

When a device interrupts, the kernel schedules the interrupt and transfers control here.

Answer 31

Interrupt Service Routine

Question 32

Called when the LKM is loaded. It is used to register the rest of the driver’s routines with the OS.

Answer 32

Initialization Routine

Question 33

List examples of non-preemptive scheduling algorithms.

Answer 33

First come-first served, shortest job first, priority.

Question 34

A(n) _____ scheduling algorithm allows a process to run for a set amount of time called a quantum.

Answer 34

Preemptive

Question 35

A ____ condition may occur due to a process depending on the timely output sequence of another process.

Answer 35

Race

Question 36

On a multi-processing system, the simultaneous scheduling of multiple processes is known as ______?

Answer 36

Concurrency

Question 37

_____ is a concept used by virtual memory to divide each process into small chunks.

Answer 37

Paging

Question 38

(True or False) The upper 2 GB of memory on a 32 bit OS is reserved for user space process memory requirements,

Answer 38

True

Question 39

(True or False) A process is a small segment of code that is spawned and used by a thread at a much lower cost than creating and managing an entirely new thread.

Answer 39

False

Question 40

_______ are used to identify the page frame addresses of the desired info.

Answer 40

Page table entries PTE

Question 41

Called when the LKM is loaded. It is used to register the rest of the driver’s routines with the OS.

Answer 41

initialization Routine

Question 42

These routines equate to the windows dispatch routines and can be subcatergorized as Open, Release, Read, Write, Llseek, and loCtl dispatches.

Answer 42

File Operations Routine

Question 43

Devices are identified using numbers 0-255

Answer 43

Device Naming Routines

Question 44

_____ is defined by the number of processes terminated in a set amount of time.

Answer 44

Throughput

Question 45

(True or False) An application will not become a process until it is executed.

Answer 45

True

Question 46

A _______ is an instance of a OS executing on a virtual system.

Answer 46

Virtual machine