Question 451 : In ______ System any communication between the processors takes place through the shared memory.
- Tightly Coupled system
- Loosely Coupled System
- Middleware System
- Scientific System
Question 452 : What is close group in group communication?
- Only members can send messages to the group as a whole
- processes that are not members (clients) can send message to the group.
- the idea of groups is to support replicated servers
- processes that are not members (clients) but close to the group can send message to the group.
Question 453 : An external time source that is often used as a reference for synchronizing computer clocks with real time is the __________
- Universal Centralized Time
- Unique Coordinated Time
- Unique Centralized Time
- Universal Coordinated Time
Question 454 : It Places replicas one by one each time exhaustively evaluating all possible locations.
- Greedy Approach for replica Management.
- Hotspot for replica Management.
- Sequential Replica Management
- Parallel Replica Management
Question 455 : The Lamport’s mutual exclusion algorithm requires _______ messages per Critical Section invocation
- (N - 1)
- 3(N - 1)
- 2(N - 1)
- 5(N - 1)
Question 456 : Which of the following is not a distributed computing model?
- Processor-pool model
- Workstation server model
- Failure model
- peer-to-peer
Question 457 : In distributed systems, election algorithms assumes that ____________
- a unique priority number is associated with each active process in system
- there is no priority number associated with any process
- priority of the processes is not required
- process work without number
Question 458 : IDLs describe an interface in a ----------- way
- language-dependent
- language-independent
- language oriented
- language specified
Question 459 : Logical extension of computation migration is ___________
- process migration
- system migration
- thread migration
- data migration
Question 460 : The ring election algorithm works by:
- Having all nodes in a ring of processors send a message to a coordinator who will elect the leader.
- Sending a token around a set of nodes. Whoever has the token is the coordinator.
- Sending a message around all available nodes and choosing the first one on the resultant list.
- Building a list of all live nodes and choosing the largest numbered node in the list.
Question 461 : A distributed system is defined as a collection of autonomous computers linked by a network with software designed to produce an integrated computing facility.
- True
- False
Question 462 : Hide that a resource may be moved to another location while in use
- Relocation transparency
- migration transparency
- location transparency
- Replication transparency
Question 463 : Google is a _______based corporation
- Japan
- US
- Rasia
- UK
Question 464 : In distributed systems, election algorithms assumes that _____
- a unique priority number is associated with each active process in system
- there is no priority number associated with any process
- priority of the processes is not required
- none of the mentioned
Question 465 : which Layer is not part of Grid Computing
- Fabric Layer
- Data link Layer
- Collective Layer
- Resource Layer
Question 466 : Method invocations between objects in the same process are
- Static method invocations
- Dynamic method invocations
- Local method invocations
- Temporal method invocations
Question 467 : A group server is responsible for_______ & ________ groups
- clean and deduct
- program and make funtional
- create and destroy
- advance and fail
Question 468 : An additional time that is used to deliver the service of a system or multiple executions of an operation is ______.
- Information redundancy
- Time redundancy
- Physical redundancy
- Data Redundancy
Question 469 : The calls, whose caller has expired due to node crash, is known as _____.
- orphan
- dead
- alive
- request
Question 470 : Electronic Health Care Systems are examples of _________ Systems.
- Distributed Computing
- Distributed Information
- Distributed pervasive
- Distributed Database
Question 471 : In which algorithm, One process is elected as the coordinator.
- Distributed mutual exclusion algorithm
- Centralized mutual exclusion algorithm
- Token ring algorithm
- None of the mentioned
Question 472 : A process can be ___________
- single threaded
- tripalthreaded
- single threaded and multithreaded
- doublethreaded
Question 473 : Which Data consistency model states "Writes done by a single process are seen by all other processes in the order in which they were issued but writes form different processes may be seen in a different order by different processes"
- Weak consistency
- Sequential consistency
- FIFO consistency
- Strict consistency
Question 474 : Which is not the ways mounting of the file system?
- Boot mounting
- Auto mounting
- Explicit mounting
- Copy mounting
Question 475 : The example of persistent communication is
- Network communication
- file transfer
- sending messages
Question 476 : 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 477 : The sender-initiated policy is preferable at _______________ system loads. However, the receiver-initiated policy is preferable at _______________ system loads.
- Light to moderate, moderate
- Light to moderate, high
- Light to high, moderate
- Light to moderate, light
Question 478 : In tokens, the primary function of the sequence number is _____
- to decide the priority
- to decide the sequence of processes
- to distinguish between low priority and high priority requests
- to distinguish between old and current requests
Question 479 : In all reliable multicast group communication ______
- n' response expected from the receiver
- response from any of the receiver required
- response from 'm'(1
Question 480 : Replication should be used when which of the following exist?
- When transmission speeds and capacity in a network prohibit frequent refreshing of large tables.
- When using many nodes with different operating systems and DBMSs and database designs.
- The application's data can be somewhat out-of-date.
- When using some nodes with selected operating system.
Question 481 : Storing a separate copy of the database at multiple locations is which of the following?
- Data Replication
- Horizontal Partitioning
- Vertical Partitioning
- Horizontal and Vertical Partitioning
Question 482 : The dynamic replication algorithm takes into account
- to reduce load on server
- files on server can be migrated anywhere
- schedule process migration
- resource sharing
Question 483 : Scaling transparency hides
- System expansion
- System collaboration
- System failure
- System security
Question 484 : Which set of events is concurrent (all events are concurrent with each other)?
- (3, 1, 5, 7), (3, 2, 6, 7), (2, 1, 6, 8)
- (2, 1, 3, 4), (2, 2, 3, 3), (3, 3, 2, 5)
- (1, 2, 3, 4), (2, 3, 4, 5), (3, 4, 5, 6)
- (1, 5, 6, 7), (1, 4, 5, 7), (1, 3, 2, 2)
Question 485 : The ______________ is always a controller in the client-server Scenario.
- Client
- Slave
- Server
- User
Question 486 : If a system goes down for one millisecond every hour, then how much availability it has?
- 99.09 percent
- 99.9999 percent
- 00.99 percent
- 99.3 percent
Question 487 : For which file transfer model, cache management is harder due to the variable-length data for different access requests.
- File-level transfer model
- Block-level transfer model
- Byte-level transfer model
- Record-level transfer model
Question 488 : Processes on the remote systems are identified by _________________
- host ID
- host name and identifier
- identifier
- process ID
Question 489 : __________ refers to degree of tolerance against component failure and errors
- Performance
- Availability
- Integrity
- Reliability
Question 490 : Which of the following disadvantages follows the single coordinator approach?
- Bottleneck
- Slow response
- Deadlock
- One request per second
Question 491 : The link between two processes P and Q to send and receive me
- communication link
- message-passing link
- synchronization link
- share data
Question 492 : The type of communication where a message that has been submitted for transmission is stored by the communication system as long as it takes to deliver it to the receiver
- Transient communication
- Persistent communication
- Synchronous communication
- Asynchronous communication
Question 493 : How can we avoid deadlock
- Resource Allocation must be done at once
- there must be a fixed number of resources to allocate
- all deadlock process must be aborted
- inversion technique can be used
Question 494 : stream oriented communication is suitable for applications like
- All the mentioned
- audio
- video
- movie
Question 495 : 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 496 : In RPC system, which of the following failure may not occur
- The client cannot locate server
- The client crashes after sending a request
- The server crashs after receiving a request
- The request message from the client to the server is obtained
Question 497 : Which of the service is not offered by middleware ?
- Persistance service
- Translation service
- Querying service
- Concurrency service
Question 498 : In context of HDFS file system, Point out the wrong statement.
- Replication Factor can be configured at a cluster level (Default is set to 3) and also at a file level
- Block Report from each DataNode contains a list of all the blocks that are stored on that DataNode
- User data is stored on the local file system of DataNodes
- DataNode is aware of the files to which the blocks stored on it belong to
Question 499 : This is not the mechanism of recovery in distributed system.
- Rollback Recovery
- Checkpoint
- Message Logging
- Multicasting
Question 500 : In __________ critical section requests are executed in the increasing order of timestamps i.e a request with smaller timestamp will be given permission to execute critical section first than a request with larger timestamp.
- Cristian’s algorithm
- Berkeley algorithm
- Lamport algorithm
- Election algorithm