NEW
Font size
WorksheetsDistributed Computing Assignment-1
Total questions: 25
Worksheet time: 8mins
A distributed system is best described as:
A single computer performing multiple tasks
A collection of independent computers appearing as a single system to users
A system with only one central server
A system without networking
Which of these is an example of a distributed system?
Personal laptop
ATM network of a bank
Calculator
Standalone mobile app
Which component is essential in every distributed system?
Centralized memory
Network for inter-process communication
Single processor
Local file system only
Which of the following is a key motivation for distributed systems?
Faster single-core performance
Resource sharing, scalability, and fault tolerance
Reducing the number of computers in an organization
Simplifying single-threaded applications
Which component is optional in a distributed system?
Processors
Communication software
Shared memory
Network
In message-passing systems, processes communicate using
Shared variables
Messages sent over a network
Only local memory
File-based synchronization
Shared memory systems are preferred when:
Nodes are geographically distant
High-speed local communication is needed
Fault tolerance is the main concern
Processes do not synchronize
Which of the following is a limitation of shared memory in distributed systems?
A. Complexity in maintaining consistency
B. Simple message delivery
C. Independent process execution
D. Scalability across networks
Common primitives in distributed communication include:
Send and Receive
Fork and Join
Compile and Execute
Read and Write on local memory only
A blocking send primitive means:
Sender continues immediately
Sender waits until the message is received
Receiver discards the message
Message is lost
In synchronous execution:
Sender waits for acknowledgment
Sender proceeds immediately
Messages are unordered
Execution is random
An advantage of asynchronous execution is:
Immediate message delivery
Better resource utilization
Simpler programming
Eliminates need for synchronization
Which is NOT a typical design issue in distributed systems?
Fault tolerance
Security
Centralized processing
Synchronization
Ensuring all nodes have the same view of data is called:
Scalability
Consistency
Redundancy
Scheduling
Handling partial failures in distributed systems is an example of:
Synchronization
Fault tolerance
Process scheduling
Memory management
The global state of a distributed system refers to:
State of a single process
Combined state of all processes and communication channels
Memory of the operating system only
Network topology
A distributed program is composed of:
One process on a single node
Multiple processes running on different nodes
Only shared memory operations
Only message queues
Which model is used to represent distributed executions?
Single-threaded execution model
Event-based model capturing order of events
CPU scheduling model
File system model
In FIFO ordering, messages are delivered:
In the order they were sent by each sender
To all recipients simultaneously
In random order
Alphabetically
Total order delivery ensures:
All messages are delivered to all recipients in the same order
Only local processes receive messages
Messages are never lost
Execution is synchronous
Causal ordering ensures:
Execution is single-threaded
Messages arrive instantaneously
Delivery is unordered
Messages respect cause-effect relationships
Which problem is specifically addressed by capturing the global state of a distributed system?
Memory management
Debugging and checkpointing
CPU scheduling
Network routing
Which of the following is true for Non-FIFO ordering?
Messages may be delivered out of order
Messages are guaranteed to arrive in order
Messages cannot be lost
Messages arrive simultaneously at all receivers
In Causal ordering, delivery must respect:
Alphabetical order of message IDs
The cause-effect relationship among messages
Only the order of timestamps
Random scheduling
Example: Process P1 sends m1, then based on m1, P2 sends m2. In causal order, receivers must deliver:
m2 before m1
m1 before m2
Both together
In any order
