Busy. Please wait.
Log in with Clever
or
show password
Forgot Password?
Don't have an account?  Sign up 
Sign up using Clever
or
Username is available taken
show password

Your email address is only used to allow you to reset your password. See our Privacy Policy and Terms of Service.

Already a StudyStack user? Log In

Reset Password
Enter the associated with your account, and we'll email you a link to reset your password.

OS Test 2 Test

Enter the letter for the matching Answer
incorrect
1.
What is the numeric priority of a Windows XP thread in the HIGH_PRIORITY_CLASS with ABOVE_NORMAL relative priority?
incorrect
2.
Which of the following statements is NOT true?
incorrect
3.
The wait-for graph scheme is not applicable to a resource allocation system with multiple instances of each resource type.
incorrect
4.
Suppose a program is operating with execution-time binding and the physical address generated is 300. The relocation register is set to 100. What is the corresponding logical address?
incorrect
5.
Which of the following statements is true?
incorrect
6.
____________ occurs when a higher-priority process needs to access a data structure that is currently being accessed by a lower-priority process.
incorrect
7.
Optimal page replacement ____.
incorrect
8.
An address generated by the CPU is also referred to as a physical address.
incorrect
9.
What is the problem if all philosophers simultaneously pick up their left fork?
incorrect
10.
A race condition ____.
incorrect
11.
What is the name of the classic deadlock avoidance algorithm?
incorrect
12.
In general, virtual memory decreases the degree of multiprogramming in a system.
incorrect
13.
To be sharable through shared pages, code must be _____.
incorrect
14.
How many writers may concurrently share the database with the readers-writers problem?
incorrect
15.
If the current value of counter = 5, what are its possible values if the producer consumer processes run concurrently?
incorrect
16.
What is the numeric priority of a Windows XP thread in the NORMAL_PRIORITY_CLASS with HIGHEST relative priority?
incorrect
17.
What are the Pthreads operations for locking and unlocking a mutex lock?
incorrect
18.
In a system resource-allocation graph, ____.
incorrect
19.
Which of the following statements are false with regards to the Linux CFS scheduler?
incorrect
20.
_____ is the method of binding instructions and data to memory performed by most general-purpose operating systems.
A.
An unsafe state may lead to a deadlocked state.
B.
Banker's Algorithm
C.
True
D.
Execution time binding
E.
200
F.
10
G.
Reentrant. I.e. code is non-self modifying: it never changes during execution.
H.
one
I.
Priority Inversion
J.
pthread_mutex_lock(), pthread_mutex_unlock()
K.
Spinlocks can be used to prevent busy waiting in the implementation of semaphore.
L.
14
M.
There is a single, system-wide value of vruntime.
N.
False. An address generated by the CPU is a logical or virtual address, an address in memory is a physical address
O.
is used mostly for comparison with other page-replacement schemes
P.
a directed edge from a process to a resource is called a request edge
Q.
Deadlock - each philosopher is waiting infinitely for the next.
R.
4, 5 or 6
S.
False
T.
results when several threads try to access and modify the same data concurrently
Type the Answer that corresponds to the displayed Question.
incorrect
21.
Suppose that there are 12 resources available to three processes. Which of the following correctly characterizes this state? Process Maximum Needs Currently Owned P0 10 4 P1 3 2 P2 7 4
incorrect
22.
Ordering resources and requiring the resources to be acquired in order prevents the circular wait from occurring and therefore prevents deadlock from occurring.
incorrect
23.
_____ is not a technique for handling critical sections in operating systems.
incorrect
24.
One necessary condition for deadlock is ______, which states that there is a chain of waiting processes whereby P0 is waiting for a resource held by P1, P1 is waiting for a resource held by P2, and Pn is waiting for a resource held by P0.
incorrect
25.
Solaris, Windows XP, and Linux assign higher-priority threads/tasks longer time quantums and lower-priority tasks shorter time quantums.
incorrect
26.
Fragmentation does not occur in a paging system.
incorrect
27.
A schedule in which each transaction is executed atomically is called a(n) ____.
incorrect
28.
Absolute code can be generated for ____.
incorrect
29.
What is the term for describing the situation where shared data may be manipulated concurrently and the outcome of the execution depends upon the order of access?
incorrect
30.
What is the name for the state of the system if resources can be allocated to all processes in some order and deadlock can still be avoided?

edit
Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.

  Normal Size     Small Size show me how
Created by: bcannoles
Popular Computers sets