Go on. Explore!

lvl 0 • 0 xp

lvl 1

Home Market Decks Interests

OS Exam 1 Sad Review

memorize.ai (lvl 286)

(0)

40 cards

()

Section 1

Preview this deck

TF an interrupt can be triggered by hardware or by software instructions on the CPU

Front

1 / 40

iOS Dev

0.0

0 reviews

5			0
4			0
3			0
2			0
1			0

Active users

All-time users

Favorites

Last updated

6 years ago

Date created

Mar 1, 2020

Cards (40)

Section 1

(40 cards)

TF an interrupt can be triggered by hardware or by software instructions on the CPU

Front

True

Back

A _ uses an existing thread - rather than creating a new one - to complete a task

Front

thread pool

Back

command to change your current working directory

Front

cd

Back

a _ can be used to prevent a user program from never returning control to the OS timer

Front

timer

Back

Explain the difference between deferred cancellation of a thread and asynchronous cancellation of a thread. If both are possible in a given system, why might deferred cancellation be preferred?

Front

Asynchronous = the thread in question is terminated immediately. Deferred = the thread in question is informed that it should terminate itself in an orderly manner. Deferred cancellation makes sure that the thread's resources can be reclaimed by the system since it relinquishes them properly.

Back

The _ refers to the number of processes in memory

Front

degree of multiprogramming

Back

allows the user to concatenate files and print on the standard output

Front

cat

Back

name and describe different states that a process can be at in any given time

Front

waiting: waiting for event running: process is executed based on its instructions ready: waiting for CPU terminated: process is stopped/terminated or finished executing

Back

What effects does the time quantum have on the performance of a round-robin scheduling algorithm? Is it possible to get unfavorable results by making the time quantum "too short" or "too long"? Explain.

Front

If the time quantum is very long, RR scheduling becomes equal to FCFS, with all of its disadvantages. If the time quantum is short compared to the typical CPU burst time, we get "processor sharing".

Back

TF System programs provide a convenient environment for program development and execution

Front

True

Back

Which of the following statements is true?

Front

Shared memory is typically faster than message passing

Back

TF In RR scheduling the time quantum should be large with respect to the context-switch time

Front

true

Back

a _ saves the state of the currently running process and restores the state of the next process

Front

context switch

Back

displays a calendar for a given month or year

Front

cal

Back

_ is/are note a technique for passing parameters from an application in the system call

Front

cache memory

Back

TF The ready queue is a FIFO data structure that contains the set of all processes residing in main memory, ready and waiting to execute

Front

True

Back

What system call in UNIX replaces the process's memory space with a new program?

Front

exec()

Back

Bootstrap program

Front

A program stored in ROM that loads and initializes the operating system on a computer.

Back

The _ occurs in first-come-first-serve scheduling when a process with a long CPU burst occupies the CPU

Front

dispatch latency

Back

Windows XP supports both message passing and shared memory to enable interprocess communication

Front

True

Back

The major difficulty in designing a layered operating system approach is _

Front

appropriately defining various layers

Back

TF In the many-to-many multithreading model aa single user thread is mapped to multiple kernel threads

Front

false

Back

Which of the following would lead you to believe that a given system is an asymmetric multiprocessing type system?

Front

All of the above

Back

a process control block _

Front

includes information on the process's state

Back

A significant problem with priority scheduling algorithms is

Front

starvation

Back

TF A context-switch happens instantly in the operating system with no overhead

Front

False

Back

The _ of a process contains temporary date such as a function parameters, return addresses, and local variables

Front

stack

Back

shows which users are currently logged on to the system

Front

who

Back

A _ is an example of a systems program

Front

command interpreter

Back

TF In modern OS user processes generally run in kernal mode so that they can directly control the hardware

Front

False

Back

_ operating systems are designed to primarily maximize resource utilization

Front

mainframe

Back

TF Linux does not distinguish between processes and threads

Front

True

Back

The _ scheduling algorithm is designed especially for time-sharing systems

Front

RR

Back

a clustered system _

Front

gathers together multiple CPUs to accomplish computational work

Back

_ is the number of processes that are completed per time unit

Front

CPU utilization

Back

The _ multithreading model maps multiple user-level threads to a single kernel

Front

many-to-one

Back

Explain what starvation means in terms of CPU scheduling. What type(s) of scheduling algorithms can cause starvation? Name and describe a technique that can be used to prevent starvation.

Front

Starvation is a situation in which a given process is ready to run but, due to some aspect of the scheduling algorithm, does not get it's turn to run, but waits indefinitely. Any priority scheduling algorithm can cause starvation. Aging is a technique to combat starvation by increasing a process's priority over time so that it will eventually be scheduled to run

Back

TF The multilevel feedback-queue is the most general, yet most complex scheduling algorithm we discussed

Front

True

Back

_ is not considered a challenge when designing applications for multicore systems

Front

ensuring there is a sufficient number of cores

Back

displays the current system date and time information

Front

date

Back