Brainscape's Knowledge GenomeTM

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


See full index

CS 332-102 > Final Exam Quiz Review > Flashcards

Final Exam Quiz Review Flashcards

1
Q

_____ assigns a processor to the first process in the ready queue

A

Dispatching

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

An operating system must be designed such that…

A

Context switches are transparent to processes

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

What operation is particularly useful for detecting security threats and debugging software?

A

Suspend

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

What does a process control block do?

A

Store the address of the next instruction to be processed by a different process.

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

For a single processor system, there will never be more than ____ running process(es)

A

One

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

When a process is created by a unix fork() call, what is not inherited by the child process?

A

The process ID

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

What kind of state transition is not possible?

A

Blocked to running

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

A process switch might occur when the system encounters an interrupt condition, such as that generated by…

A

Supervisor call, memory fault, and trap

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

When a process is in the ____ state it is in secondary memory but is available for execution as soon as it is loaded into main memory

A

Ready/Suspend

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

The concept of process in an operating system embodies two primary characteristics, one of which is:

A

Resource ownership

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

LWP is placed between…

A

User and kernel threads

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

The basic thread operation related to the change in thread state that occurs when thread needs to wait for an event is referred to as:

A

Block operation

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

In a linux system, if the process has been terminated but, for some reason, still must have its task structure in the process table is in the ____ state.

A

Zombie

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

To overcome the disadvantages of ULT, a technique is used to convert a blocking system call into a non-blocking system call:

A

Jacketing

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

In a solaris system, a user-level thread that enters the active state is assigned to a:

A

Light-weight process (LWP)

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

What is the relationship between processes and threads in terms of time?

A

It takes far less time to create a new thread in an existing process than it does to create a new process.

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

Pure user-level thread implementations are usually ____ thread mappings

A

many-to-one

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

The threading model supported by the linux operating system is:

A

one-to-one

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

Which type of process interaction might result in the problem “data coherence”?

A

Cooperation by sharing

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

The initial value of the semaphore that allows only one of the many processes to enter their critical sections is..

A

1

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

A ____ is a data type that is used to block a process or thread until a particular condition is true.

A

Condition variable

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

An instruction that executes atomically executes as a ____ unit.

A

Single/uninterruptible

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

A _____ refers to where a process is accessing/updating shared data

A

Critical section

24
Q

In message passing, when does the condition “rendezvous” arise?

A

Blocking send, blocking receive

25
Q

Probably the most useful combination, _____ allows a process to send one or more messages to a variety of destinations as quickly as possible.

A

Nonblocking send, blocking receive.

26
Q

The _____ is a programming language that construct that provides equivalent functionality to that of semaphores and is easier to control.

A

Monitor

27
Q

____ is when the sequence of instruction is guaranteed to execute as a group or not execute at all. No other process can see an intermediate step or interrupt the operation.

A

Atomic operation

28
Q

(T/F) Deadlock can be defined as the periodic blocking of a set of processes that either compete for system resources or communicate with each other.

A

False

29
Q

(T/F) Both banker’s algorithm and process initiation denial belong to deadlock avoidance

A

True

30
Q

(T/F) Although deadlock can potentially exist without it, the condition known as Circular Wait is required for deadlock to actually take place

A

True

31
Q

(T/F) In the Resource Allocation Denial approach to Deadlock Avoidance, a safe state is defined as one in which all potential process sequences do not result in deadlock.

A

False

32
Q

(T/F) A reusable resource is one that can safely be used by only one process at a time and is not depleted by that use

A

True

33
Q

One necessary condition for deadlock is ____, which states that at least one resource must be held in a non-sharable mode.

A

Mutual exclusion

34
Q

The approach of adopting a policy that eliminates one of the four conditions leading to a deadlock state is defined as …

A

Deadlock prevention

35
Q

The dining philosopher’s problem is a standard test case for evaluating approaches of implementing…

A

Synchronization

36
Q

What is a weakness of banker’s algorithm?

A

Requiring that processes state their maximum needs in advance

37
Q

When is a system in an unsafe state?

A

The OS cannot guarantee that all processes can complete their work in a finite time

38
Q

____ is the number of processes per time unit that are completed.

A

Throughput

39
Q

In RR scheduling, the time quantum should be ____ the context-switch time.

A

Large with respect to

40
Q

An IO bound process spends ____ its time seeping IO operations than it does doing computational work.

A

More of

41
Q

In the case of the ____ policy, the scheduler always chooses the process that has the shortest expected remaining processing time.

A

SRT/Shortest remaining time

42
Q

A risk with ____ is the possibility of starvation for longer processes as long as there is a steady supply of shorter processes

A

SPN/Shortest process next?

43
Q

One difficulty with the shortest process next scheduling technique is:

A

Starvation of long processes, lack of preemption, and knowing/estimating remaining processing times

44
Q

Long term scheduling is performed…

A

Typically on submitted jobs

45
Q

(T/F) FCFS is a simple scheduling technique that tends to favor IO bound processes over processor bound processes

A

False

46
Q

(T/F) In HRRN scheduling, long jobs are favored because they yield a larger ratio from a smaller denominator in the equation

A

False

47
Q

(T/F) One problem with a pure priority scheduling scheme is is that lower priority processes may suffer deadlock

A

False

48
Q

The category of parallelism in multiprocessors in which there is no explicit synchronization among processes is…

A

Independent parallelism

49
Q

Scheduling on a multiprocessor involves which of the following design issues:

A

Dispatching, assignment, and multiprogramming

50
Q

A disadvantage of the Load Sharing multiprocessor scheduling and assignment approach is:

A

The central queue can be a bottleneck due to mutual exclusion

51
Q

A task that, unless it meets its deadline may cause undesirable damage or a fatal error to the system, is called a:

A

Hard real-time task

52
Q

____ is concerned with how long an operating system delays before acknowledging an interrupt

A

Determinism

53
Q

The ____ approach is a set of related threads scheduled to run on a set of processors at the same time, on a one-to-one basis.

A

Gang scheduling

54
Q

With the ____ approach the number of threads in a process can be altered during the course of execution.

A

Dynamic scheduling

55
Q

In a SMP system, each processor maintains a local cache and must alert all other processors that a change to cache update has taken place. This is referred to as the:

A

Cache coherency problem

CS 332-102 (11 decks)

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