IndiaBIX

Computer Science - Operating Systems Concepts

Exercise : Operating Systems Concepts - Section 3
11.
Scheduling is
allowing jobs to use the processor
unrelated to performance consideration
not required in uniprocessor systems
the same regard-less of the purpose of the system
None of the above
Answer: Option
Explanation:
No answer description is available. Let's discuss.
12.
What scheduling algorithm allows processes that are logical runnable to be temporarily suspended?
preemptive scheduling
non-preemptive scheduling
FIFO
FCFS
None of the above
Answer: Option
Explanation:
No answer description is available. Let's discuss.
13.
In an absolute loading scheme, which loader function is accomplished by loader
Reallocation
Allocation
Linking
Loading
None of the above
Answer: Option
Explanation:
No answer description is available. Let's discuss.
14.
The computational technique used to compute the disk storage address of individual records is called:
bubble memory
key fielding
dynamic reallocation
hashing
None of the above
Answer: Option
Explanation:
No answer description is available. Let's discuss.
15.
For how many processes which are sharing common data, the Dekker's algorithm implements mutual exclusion?
1
2
3
4
None of the above
Answer: Option
Explanation:

Dekker's algorithm is the first known correct solution to the mutual exclusion problem in concurrent programming. The solution is attributed to Dutch mathematician Th. J. Dekker by Edsger W. Dijkstra in his manuscript on cooperating sequential processes. It allows two threads to share a single-use resource without conflict, using only shared memory for communication.

It avoids the strict alternation of a naive turn-taking algorithm, and was one of the first mutual exclusion algorithms to be invented.

Source: http://en.wikipedia.org/wiki/Dekker's_algorithm

Quick links
Quantitative Aptitude
Verbal (English)
Reasoning
Programming
Interview
Placement Papers