Operating systems concept MCQ Test 30

By | October 3, 2017
Welcome!!! Click on any option for correct answer

UGC-NET/GATE Multiple Choice Questions for Operating System.

Question 1
Assembler is
A
a program that automate the translation of assembly language into machine language.
B
a program that accepts a program written in a high level language and produces an object program.
C
is a program that appears to execute a source program as if it were machine language.
D
None of the above
Question 2
DMA is used for :
  1. High speed devices(disks and communications network)
  2. Low speed devices
  3. Saving CPU cycles
  4. Utilizing CPU cycles
A
I and II
B
II and III
C
II, III and IV
D
I and III
Question 3
Consider six files : F1, F2, F3, F4, F5, F6 with corresponding sizes 100, 200, 70, 40, 250 and 50 respectively, the files are to be stored on a sequential device in such a way that as to optimize access time. In what order should the files be stored?
A
F6, F5, F4, F3, F2, F1
B
F1 F2, F3, F4, F5, F6
C
F5, F2, F1, F3, F6 , F4
D
F4, F6, F3, F1 F2, F5
Question 4
Thread pools limit the number of threads that exist at any one point, hence :
A
not letting the system resources like CPU time and memory exhaust
B
helping a limited number of processes at a time
C
not serving all requests and ignoring many
D
none of the above
Question 5
A public key encryption system
A
allows only the correct sender to decode the data
B
allows only the correct receiver to decode the data
C
does not encode the data before transmitting it
D
None of the above
Question 6
The level that treats different types of traffics in different ways, giving certain traffic streams higher priority than other streams and with best efforts, but no guarantees are made :
A
Best effort service
B
Soft QoS
C
Worst effort service
D
Hard QoS
Question 7
What problem is solved by Dijkstra's banker's algorithm?
A
deadlock recovery
B
deadlock avoidance
C
cache coherence
D
None of the above The Banker's algorithm is a resource allocation \& deadlock avoidance algorithm developed by Edsger Dijkstra that tests for safety by simulating the allocation of pre-determined maximum possible amounts of all resources, and then makes a "safe-state" check to test for possible deadlock conditions for all other pending activities, before deciding whether allocation should be allowed to continue.
Question 8
How can fence and relocation be used together ?
A
To each program address, the contents of fence register are added
B
To contents of fence register is subtracted from actual address of program
C
Both A and B
D
none of the above
Question 9
What are characteristics of Cambridge CAP system as compared to Hydra system ?
  1. It is simpler than hydra system
  2. It is more powerful than hydra system.
  3. It is less powerful than hydra system.
  4. It is not as secure as Hydra system.
A
I and II
B
II and III
C
II, III and IV
D
I and III
Please report wrong answer in comment box
There are 9 questions to complete.

Leave a Reply

Your email address will not be published. Required fields are marked *