Question 241 :
What is UTC ?
- Universal Centralized Time
- Unique Coordinated Time
- Universal Coordinated Time
- Unique Centralized Time
Question 242 :
__________is the problem that occurs when high priority processes keep executing and low priority processes get blocked for indefinite time
- Deadlock
- Starvation
- Fairness
- monotonic
Question 243 :
In Suzuki-Kasami's mutual exclusion algorithm, synchronization delay is ______. (T is time unit)
- 0 or T
- 1 or 2T
- 3T
- 4T
Question 244 :
The local operating system on the server machine passes the incoming packets to the _________
- server stub
- client stub
- client operating system
- Binding agent
Question 245 :
In GFS, Chunk replicas are created for three reasons: ___________________
- chunk creation, re-replication, and rebalancing
- chunk deletion, re-replication, and rebalancing
- chunk creation, re-replication, and resharing
- chunk creation, chunk deletion, and rebalancing
Question 246 :
Distributed system have significant characteristics of
- 2 types
- 3 types
- 4 types
- 5 types
Question 247 :
Basis for communication in middleware based operating system is________.
- Files
- Model specific
- Messages
- Shared memory
Question 248 :
In case of good process migration mechanism, _______________ means failure of any node other than the one on which the process is running should not affect the execution of process.
- Robustness
- Efficiency
- Transparent
- Interference
Question 249 :
____are used for signaling among processes and can be readily used to enforce a mutual exclusion discipline.
- Semaphores
- Messages
- Monitors
- Addressing
Question 250 :
In distributed file system, a file is uniquely identified by _________________
- host name
- local name
- the combination of host name and local name
- Priority number
Question 251 :
The method and time to access data and replica is defined as___________.
- Concurrency
- Consistency
- Availability
- Isolation
Question 252 :
Storing file in________ makes it permanently available
- Secondary Memory
- RAM
- Register
- DRAM
Question 253 :
Lamport algorithm requires ____messages per Critical Section invocation and the synchronization delay in the algorithm is ___
- 3(N-1), T
- 3(N-1), 2T
- 3(N), T-1
- 3(N), 2(T-1)
Question 254 :
Which layer is the layer closest to the transmission medium ?
- Physical
- Data link
- Network
- Transport
Question 255 :
A shared-memory system is said to support the __________ model if the value returned by a read operation on a memory address is always the same as the value written by the most recent write operation to that address.
- causal consistency
- strict consistency
- sequential consistency
- FIFO consistency
Question 256 :
What is a Iterative server
- Its handles request and give response to client
- Server does not handle request
- its uses concurrent server
- Its not handles request and give response to client
Question 257 :
Distributed syatem consists of set of resour
- cPrinter
- Processor
- CD
- Processes
Question 258 :
A typical _________ program creates some remote objects, makes references to these objects accessible, and waits for clients to invoke methods on these objects.
- Server
- Client
- Thread
- Concurrent
Question 259 :
A sequentially consistent memory provides __________ semantics because all the processes sharing a memory location always see exactly the same contents stored in it.
- n-copy
- double copy
- one-copy/single-copy
- Three copy
Question 260 :
When high priority task is indirectly preempted by medium priority the scenario is called
- priority inversion
- priority removal
- priority exchange
- priority modification
Question 261 :
Deterministic and probabilistic algorithms are the types of _____________.
- Static Load balancing algorithm
- Dynamic Load balancing algorithm
- Distributed
- Centralized
Question 262 :
In weak consistency____-
- one operation on a synchronization variable is allowed to be performed until all previous writes have been completed everywhere.
- Two operations on a synchronization variable is allowed to be performed until all previous writes have been completed everywhere.
- All operations on a synchronization variable is allowed to be performed until all previous writes have been completed everywhere.
- No operation on a synchronization variable is allowed to be performed until all previous writes have been completed everywhere.
Question 263 :
When high priority task is indirectly preempted by medium priority the scenario is called
- priority inversion
- priority removal
- priority exchange
- priority modification
Question 264 :
A 'glue' between client and server parts of application.
- Middleware
- Firmware
- Package
- System Software
Question 265 :
The variable that assures local copies are consistent with remote ones is________.
- Release
- Acquire
- Read
- Write
Question 266 :
What is the advantage of a vector clock over Lamport's logical clock?
- Catch causality
- avoid deadlock
- avoid linear relationship
- set nonlinear relationship
Question 267 :
Logical extension of computation migration is
- process migration
- system migration
- thread migration
- data migration
Question 268 :
______ determines to which node a selected process needs to be transferred.
- Storage policy
- Selection policy
- Transfer policy
- Location policy
Question 269 :
UTC stands for
- Unique Cordinated Time
- Unique Time Coordination
- Universal Total Coordination
- Universal Coordinated Time
Question 270 :
Uni processor computing is known as
- Centralized Computing
- Parallel Computing
- Distributed Computing
- Grid Computing