Which algorithm is used for leader election in distributed systems?Dijkstra’s AlgorithmBully AlgorithmPrim’s AlgorithmRSA AlgorithmB) Bully AlgorithmThe Bully algorithm is a common method for electing a coordinator node.
CAP theorem states that in distributed systems, only two of the following can be guaranteed:Consistency, Availability, Partition ToleranceCapacity, Accuracy, Partition ToleranceConsistency, Accuracy, PerformanceNone of the aboveA) Consistency, Availability, Partition ToleranceCAP theorem highlights the trade-off between these three properties.
Which of the following is a message-passing library used in distributed systems?MPISQLJSONCSSA) MPIMessage Passing Interface (MPI) is used for communication in distributed systems.
Which protocol is often used for clock synchronization in distributed systems?HTTPNTPTCPFTPB) NTPNetwork Time Protocol (NTP) synchronizes clocks across systems.
What does replication in distributed systems provide?More storageFault tolerance and availabilityReduced memory useLower costsB) Fault tolerance and availabilityReplication ensures data is available even if nodes fail.
Which is NOT a distributed system characteristic?TransparencyFault toleranceScalabilityCentralized controlD) Centralized controlDistributed systems avoid centralization to increase resilience.
CAP theorem states that only 2 can be achieved:Consistency, Accuracy, PerformanceCapacity, Accuracy, Partition ToleranceCache, API, ProtocolsNoneD) NoneNo distributed system can guarantee all three simultaneously.
Which algorithm is used for distributed mutual exclusion?Ricart-AgrawalaPrim’sKruskal’sBellman-FordA) Ricart-AgrawalaEnsures only one process at a time accesses a shared resource.
Which is a distributed file system?NTFSHDFSFAT32EXT4B) HDFSHDFS is designed for distributed data storage.
In distributed systems, replication increases:Latency) ReliabilityInconsistencyOverheads onlyB) ReliabilityReplication keeps copies of data to improve fault tolerance.
Which protocol is used for mutual exclusion in distributed systems?Lamport’s algorithmDijkstra’s algorithmBellman-FordALOHAA) Lamport’s algorithmLamport’s algorithm ensures proper ordering in distributed mutual exclusion.
A system where all nodes have equal responsibilities is called:Master-slaveClient-serverPeer-to-peerHierarchicalC) Peer-to-peerIn P2P, all nodes are equal without central control.
Which is a challenge in distributed systems?TransparencyReliabilityScalabilityAll of theseD) All of theseDistributed systems face challenges like transparency, scalability, and reliability.
Google File System (GFS) is an example of:Distributed databaseDistributed file systemCentralized file systemBlockchainB) Distributed file systemGFS provides scalable file storage across distributed servers.
Which algorithm helps in ordering events in distributed systems?PaxosLamport logical clocksRSADESB) Lamport logical clocksLogical clocks help maintain event order in distributed environments.
n distributed systems, transparency refers to:Hiding complexity from usersFull visibility of all nodesCentralized controlEncryption onlyA) Hiding complexity from usersDistribution should appear as a single system to users.
A distributed system with no central control is:Peer-to-peerClient-serverSingle nodeClusteredA) Peer-to-peerP2P systems distribute resources equally among peers.
Which algorithm is used for distributed mutual exclusion?Ricart–Agrawala AlgorithmBellman-Ford AlgorithmKruskal’s AlgorithmDijkstra’s AlgorithmA) Ricart–Agrawala AlgorithmIt coordinates critical section access without central control.
Middleware in distributed systems provides:Abstraction between apps and OS/networkMemory allocationCPU schedulingFile compressionA) Abstraction between apps and OS/networkMiddleware simplifies communication and resource sharing.
In distributed systems, clock synchronization is solved by:Lamport’s algorithmDijkstra’s algorithmRSA encryptionBFS traversalA) Lamport’s algorithmProvides logical ordering of events.
A distributed file system provides:Centralized storage onlyShared access to files across networkBackup to cloudEncryption of local drivesB) Shared access to files across networkDFS allows remote access to files as if local.
Which failure model means nodes may behave arbitrarily?Crash failureOmission failureByzantine failureTiming failureC) Byzantine failureArbitrary/malicious node behavior is Byzantine.
Gossip protocols are mainly used for:Secure email exchangeDistributed system communication and state sharingFile compressionCompiling programsB) Distributed system communication and state sharingGossip spreads updates probabilistically across nodes.
The main goal of a distributed system is:CentralizationTransparency and resource sharingPower reductionLocal computation onlyB) Transparency and resource sharingDistributed systems hide complexity while allowing shared access.
In distributed systems, “replication” improves:Security onlyAvailability and fault toleranceNetwork latencyCPU performanceB) Availability and fault toleranceData copies ensure reliability if one node fails.
A “heartbeat” message in distributed systems is used forTime synchronizationDetecting node failuresEncryptionSchedulingB) Detecting node failuresHeartbeats confirm active node status.
Middleware provides:Hardware managementCommunication abstraction between distributed componentsData deletionUI designB) Communication abstraction between distributed componentsMiddleware helps applications interact seamlessly across systems.
The main challenge in distributed systems is:CentralizationSynchronizationSingle-point failureFile I/OB) SynchronizationKeeping clocks and states consistent is key.
CAP theorem states a system can have at most two of:Cost, Accuracy, Performanceonsistency, Availability, Partition ToleranceCaching, Authentication, PrivacyControl, Adaptability, PortabilityB) Consistency, Availability, Partition ToleranceYou can’t guarantee all three simultaneously.
A “replica” in distributed systems means:Duplicate node for fault toleranceData backupVirtuaCoordination protocolsl machineSessionA) Duplicate node for fault toleranceReplicas improve reliability.
Leader election is needed in:Load balancingFault detectionCoordination protocolsMonitoringC) Coordination protocolsOne node coordinates actions of others.
A message queue provides:Direct accessAsynchronous communicationFile sharingStatic linkingB) Asynchronous communicationIt decouples sender and receiver timing.
A “replicated log” is used to:Speed up queries Maintain consistency across nodesBalance loadsEncrypt dataB) Maintain consistency across nodesLogs help synchronize data updates in replicas.
Leader election algorithms like Raft or Paxos help in:Synchronization of transactionsSelecting a coordinator node Partition handlingData compressionB) Selecting a coordinator nodeThey ensure one node leads updates to maintain order.
Gossip protocols are used in distributed systems for:Password managementFault detection and membershipDNS resolutionBackup schedulingB) Fault detection and membershipGossip helps spread information efficiently among nodes.
What ensures consistency among nodes in distributed systems?SynchronizationReplicationConsensus AlgorithmsShardingC) Consensus AlgorithmsConsensus protocols like Raft or Paxos ensure agreement among nodes.
hat is the CAP theorem about?Security trade-offsData storage speedCentralized controlNoneD)NoneCAP theorem explains the trade-off between these three (Consistency, Availability, Partition tolerance)in distributed databases.
Which is an example of a distributed file system?FAT32NFSHDFSext4C) HDFSHDFS distributes file storage and access across multiple nodes.
Which approach improves fault tolerance in distributed systems?Single node caching ReplicationCompressionFragmentationB) ReplicationReplicating data or processes ensures reliability during node failures.
What is middleware used for?Physical networkingSecurity scanningCoordination between distributed componentsEncryption onlyC) Coordination between distributed componentsMiddleware enables communication and resource sharing between distributed apps.
Middleware enables:Hardware upgradesCommunication among distributed appsSystem security File accessB) Communication among distributed appsMiddleware acts as glue between distributed components.
Fault tolerance ensures:Fast computationOperation despite failuresLow latencyPower savingB) Operation despite failuresSystems continue functioning after partial faults.
Clock synchronization is essential for:GUIEvent orderingCachingEncryptionB) Event orderingEnsures distributed events maintain consistent order.
RPC stands for:Remote Procedure Call Remote Program ConnectionRequest Protocol Chain Resource Process ControlA) Remote Procedure CallRPC allows one system to execute code on another.
What is the main goal of fault tolerance?Improve latencyKeep system operational despite failuresReduce scalabilitySimplify codeB) Keep system operational despite failuresFault tolerance ensures reliability even when components fail.
Load balancing distributes:Power supply Workload among serversMemory onlyDatabase copiesB) Workload among serversLoad balancing optimizes resource usage and performance.
What is a “heartbeat” in distributed systems?System startup commandSignal to monitor node healthDatabase triggerSecurity protocolB) Signal to monitor node healthHeartbeats detect node failures through periodic signals.
Which algorithm is commonly used for leader election?Dijkstra’sBully algorithmPrim’sBellman-FordB) Bully algorithmThe Bully algorithm elects a leader based on node priority.
Which algorithm is used for distributed mutual exclusion?Dijkstra’s AlgorithmRicart–Agrawala AlgorithmRound RobinLRUB) Ricart–Agrawala AlgorithmIt ensures only one node accesses a shared resource at a time.
What is “fault tolerance”?Recovery from partial system failures Avoiding replicationReducing redundancyDebugging errorsA) Recovery from partial system failuresFault tolerance allows system operation even if some nodes fail.
Which term describes when all nodes in a system have the same data view?ParallelismSynchronizationConsistencyFault toleranceC) ConsistencyConsistency ensures every node accesses identical, up-to-date data after operations.
What mechanism detects failed nodes in distributed systems?Heartbeat LoggingClusteringShardingA) HeartbeatHeartbeats are regular signals exchanged to check node liveness.
In distributed databases, replication lag means:Data updates delayed on replicasSlow networkMissing dataIncorrect metadataA) Data updates delayed on replicasReplication lag occurs when secondary nodes take time to reflect the latest changes.
Which approach ensures availability during partition tolerance according to CAP theorem?Strong consistency Eventual consistency LinearizabilityStrict serializabilityB) Eventual consistencyEventual consistency sacrifices immediate accuracy for high availability under partition tolerance.
What does RPC stand for?Remote Processing CallRemote Procedure Call Random Program ControlRedundant Process ClusterB) Remote Procedure CallRPC enables a program to execute procedures on remote machines as if they were local.
What is the main goal of a distributed system?Centralized controlResource sharing and transparencyFaster single-user accessData isolationB) Resource sharing and transparencyDistributed systems aim to make multiple computers appear as one unified system.
Which algorithm is used for distributed mutual exclusion?Ricart–AgrawalaKruskal’sPrim’sBellman-FordA) Ricart–AgrawalaIt ensures that only one process enters the critical section at a time.
In distributed systems, “fault tolerance” means:Preventing all failuresRecovering automatically after a faultIncreasing latencyStopping operationsB) Recovering automatically after a faultThe system continues functioning correctly even if parts fail.
Which term describes message delivery without duplication or loss?Reliable communicationRedundant routingBuffered messagingToken passingA) Reliable communicationEnsures each message reaches its destination exactly once.
Which type of clock is used to order events in distributed systems?System clockLamport clockDigital clockCPU timerB) Lamport clockLogical clocks assign timestamps for event ordering across nodes.
A process that coordinates other processes is called a:WorkerSchedulerCoordinatorClientC) CoordinatorCoordinators manage synchronization and communication in distributed systems.
What is fault tolerance?Error detectionSystem continuity during failuresHardware replacement Restart after crashB) System continuity during failuresFault-tolerant systems keep operating despite node or component failures.
A distributed system that uses time ordering of events is said to have:Logical clocksSequence counters Atomic timersEpoch nodesA) Logical clocksLamport’s logical clocks order events without physical time synchronization.
Middleware is used for:Hardware controlCommunication managementError loggingFile formattingB) Communication managementMiddleware simplifies communication and data exchange between distributed applications.
The main challenge in distributed computing is:Local computationNetwork latency and consistencyFile I/OSingle-user schedulingB) Network latency and consistencyKeeping data consistent across multiple nodes while handling delays is difficult.
What is the role of middleware in distributed systems?Enhance GUIProvide communication and coordination Handle graphics Manage BIOSB) Provide communication and coordinationMiddleware connects distributed components and manages communication seamlessly.
A common synchronization problem in distributed systems is:DeadlockTightly coupled processingClock skewToken passingC) Clock skewSynchronizing clocks across nodes ensures event ordering and consistency.