Q#1: A distributed system is:
(A) A collection of independent computers that appears as a single system
(B) A single computer with multiple cores
(C) A cluster of CPUs without networking
(D) Only cloud servers
Answer: (A) A collection of independent computers that appears as a single system
Q#2: Main goals of a distributed system include:
(A) Transparency, scalability, reliability
(B) Disk formatting
(C) Memory encryption
(D) Thread prioritization
Answer: (A) Transparency, scalability, reliability
Q#3: Transparency in distributed systems means:
(A) Hiding the complexity of the system from users
(B) Displaying system logs
(C) Faster CPU
(D) Memory paging
Answer: (A) Hiding the complexity of the system from users
Q#4: Types of transparency include:
(A) Access, location, replication, concurrency, failure
(B) Disk, memory, CPU, network
(C) Thread, process, kernel
(D) Encryption only
Answer: (A) Access, location, replication, concurrency, failure
Q#5: Resource sharing in distributed systems refers to:
(A) Sharing CPU, memory, files, printers, and databases among multiple machines
(B) Only memory allocation
(C) Disk backup
(D) File compression
Answer: (A) Sharing CPU, memory, files, printers, and databases among multiple machines
Q#6: Distributed systems are classified into:
(A) Client-server, peer-to-peer, cluster-based
(B) Single-core, multi-core
(C) Threads and processes
(D) CPU-only and memory-only systems
Answer: (A) Client-server, peer-to-peer, cluster-based
Q#7: Client-server architecture means:
(A) Clients request services and servers provide services
(B) All nodes equal
(C) Only memory is shared
(D) CPU scheduling only
Answer: (A) Clients request services and servers provide services
Q#8: Peer-to-peer architecture is characterized by:
(A) All nodes are equal and can act as client and server
(B) Central server provides services
(C) Disk-only communication
(D) Thread scheduling only
Answer: (A) All nodes are equal and can act as client and server
Q#9: Examples of distributed systems include:
(A) Cloud computing, distributed databases, grid computing
(B) Single-core CPU
(C) Local file system
(D) Standalone desktop
Answer: (A) Cloud computing, distributed databases, grid computing
Q#10: Middleware in distributed systems provides:
(A) Common services and abstractions to hide heterogeneity
(B) Disk formatting
(C) CPU scheduling only
(D) Memory paging only
Answer: (A) Common services and abstractions to hide heterogeneity
Q#11: Message passing is a communication method in distributed systems where:
(A) Processes communicate by sending messages
(B) Processes communicate by sharing memory
(C) Disk is copied
(D) CPU is allocated
Answer: (A) Processes communicate by sending messages
Q#12: Remote Procedure Call (RPC) allows:
(A) Executing a procedure on a remote machine as if local
(B) Only CPU sharing
(C) Disk formatting
(D) Memory encryption
Answer: (A) Executing a procedure on a remote machine as if local
Q#13: Distributed shared memory (DSM) provides:
(A) Shared memory abstraction over physically distributed memory
(B) CPU-only access
(C) Disk-only sharing
(D) Only network bandwidth
Answer: (A) Shared memory abstraction over physically distributed memory
Q#14: Consistency models define:
(A) Rules for the order of memory updates across processes
(B) CPU scheduling
(C) Disk allocation
(D) Thread prioritization
Answer: (A) Rules for the order of memory updates across processes
Q#15: Event ordering in distributed systems is handled using:
(A) Logical clocks (Lamport clocks)
(B) CPU counters
(C) Disk timestamps
(D) File locks
Answer: (A) Logical clocks (Lamport clocks)
Q#16: Concurrency control ensures:
(A) Correct execution of multiple processes accessing shared resources
(B) Faster CPU
(C) Disk formatting
(D) Memory allocation only
Answer: (A) Correct execution of multiple processes accessing shared resources
Q#17: Mutual exclusion is used in distributed systems to:
(A) Allow only one process to access a critical section at a time
(B) CPU sharing
(C) Disk backup
(D) Memory allocation
Answer: (A) Allow only one process to access a critical section at a time
Q#18: Deadlock occurs when:
(A) Processes wait indefinitely for resources held by each other
(B) CPU crashes
(C) Disk fails
(D) Memory is fragmented
Answer: (A) Processes wait indefinitely for resources held by each other
Q#19: Distributed deadlock detection requires:
(A) Communication among nodes to detect cycles
(B) Disk formatting
(C) Memory paging
(D) CPU scheduling
Answer: (A) Communication among nodes to detect cycles
Q#20: Fault tolerance ensures:
(A) System continues operation despite failures
(B) Faster CPU only
(C) Disk backup only
(D) Memory allocation only
Answer: (A) System continues operation despite failures
Q#21: Replication improves:
(A) Reliability and availability of data
(B) CPU speed only
(C) Disk formatting
(D) Thread scheduling only
Answer: (A) Reliability and availability of data
Q#22: Primary-backup replication means:
(A) One primary node handles requests, backups take over if primary fails
(B) CPU allocation
(C) Disk backup only
(D) Memory sharing only
Answer: (A) One primary node handles requests, backups take over if primary fails
Q#23: Consensus in distributed systems is:
(A) Agreement among multiple processes on a single value
(B) Disk formatting
(C) CPU scheduling
(D) Memory allocation
Answer: (A) Agreement among multiple processes on a single value
Q#24: Byzantine failures refer to:
(A) Arbitrary or malicious faults by nodes
(B) CPU crashes only
(C) Disk failure only
(D) Thread deadlock only
Answer: (A) Arbitrary or malicious faults by nodes
Q#25: Distributed transactions require:
(A) ACID properties across multiple nodes
(B) Only disk replication
(C) Only CPU sharing
(D) Memory paging only
Answer: (A) ACID properties across multiple nodes
Q#26: Two-phase commit (2PC) is used for:
(A) Ensuring atomicity in distributed transactions
(B) Disk formatting
(C) CPU allocation
(D) Thread scheduling
Answer: (A) Ensuring atomicity in distributed transactions
Q#27: Three-phase commit (3PC) improves over 2PC by:
(A) Avoiding blocking in case of coordinator failure
(B) Faster CPU
(C) Disk backup
(D) Memory allocation
Answer: (A) Avoiding blocking in case of coordinator failure
Q#28: Load balancing in distributed systems:
(A) Distributes work evenly across nodes
(B) Increases CPU speed only
(C) Formats disk
(D) Allocates memory only
Answer: (A) Distributes work evenly across nodes
Q#29: Clock synchronization in distributed systems ensures:
(A) Coordinated timing among nodes
(B) CPU scheduling only
(C) Disk formatting
(D) Memory paging only
Answer: (A) Coordinated timing among nodes
Q#30: Network partitioning can lead to:
(A) Split-brain problem
(B) Faster CPU
(C) Disk backup only
(D) Memory allocation only
Answer: (A) Split-brain problem
Q#31: CAP theorem states:
(A) A distributed system can provide at most two of Consistency, Availability, Partition tolerance
(B) Only CPU and memory can be shared
(C) Disk formatting only
(D) Thread prioritization only
Answer: (A) A distributed system can provide at most two of Consistency, Availability, Partition tolerance
Q#32: Event-driven systems in distributed systems are:
(A) Systems where actions are triggered by events
(B) CPU-only systems
(C) Disk-only systems
(D) Memory-only systems
Answer: (A) Systems where actions are triggered by events
Q#33: Message ordering guarantees:
(A) Messages are delivered in the order they were sent
(B) CPU speed
(C) Disk backup
(D) Memory paging
Answer: (A) Messages are delivered in the order they were sent
Q#34: Middleware examples include:
(A) CORBA, RMI, DCOM
(B) Linux kernel
(C) VMware ESXi
(D) Hyper-V
Answer: (A) CORBA, RMI, DCOM
Q#35: Distributed file systems provide:
(A) Transparent access to files across multiple machines
(B) CPU allocation
(C) Disk formatting
(D) Memory paging
Answer: (A) Transparent access to files across multiple machines
Q#36: NFS (Network File System) is an example of:
(A) Distributed file system
(B) Local disk system
(C) CPU scheduling tool
(D) Memory allocator
Answer: (A) Distributed file system
Q#37: Google File System (GFS) is designed for:
(A) Large-scale data processing
(B) Small desktops
(C) CPU benchmarking
(D) Thread scheduling
Answer: (A) Large-scale data processing
Q#38: Load shedding in distributed systems means:
(A) Dropping some requests during overload to maintain performance
(B) Disk formatting
(C) Memory paging
(D) CPU overclocking
Answer: (A) Dropping some requests during overload to maintain performance
Q#39: Consistency protocols include:
(A) Primary-backup, quorum-based, eventual consistency
(B) CPU-only allocation
(C) Disk-only replication
(D) Thread scheduling
Answer: (A) Primary-backup, quorum-based, eventual consistency
Q#40: Eventual consistency allows:
(A) Data replicas to converge over time
(B) Instant CPU speed
(C) Disk backup only
(D) Memory allocation only
Answer: (A) Data replicas to converge over time
Q#41: Distributed caching improves:
(A) Performance by storing frequently accessed data closer to clients
(B) CPU scheduling
(C) Disk formatting
(D) Memory paging
Answer: (A) Performance by storing frequently accessed data closer to clients
Q#42: Leader election in distributed systems is used to:
(A) Choose a coordinator among nodes
(B) Format disk
(C) Allocate memory only
(D) CPU-only task
Answer: (A) Choose a coordinator among nodes
Q#43: Chord, Pastry, CAN, and Tapestry are examples of:
(A) Distributed hash tables (DHTs)
(B) CPU schedulers
(C) Disk partitioning tools
(D) Memory managers
Answer: (A) Distributed hash tables (DHTs)
Q#44: Time-to-live (TTL) in distributed systems is used to:
(A) Limit the lifetime of messages
(B) CPU overclocking
(C) Disk backup
(D) Memory allocation
Answer: (A) Limit the lifetime of messages
Q#45: Vector clocks are used to:
(A) Track causality among events
(B) CPU scheduling
(C) Disk backup
(D) Memory allocation
Answer: (A) Track causality among events
Q#46: Distributed load testing is performed to:
(A) Measure performance under heavy distributed workloads
(B) Format disks
(C) CPU-only task
(D) Memory-only task
Answer: (A) Measure performance under heavy distributed workloads
Q#47: Fault detection in distributed systems is done via:
(A) Heartbeat messages
(B) Disk formatting
(C) CPU scheduling only
(D) Memory allocation only
Answer: (A) Heartbeat messages
Q#48: Checkpointing in distributed systems helps in:
(A) Recovery from failures
(B) CPU speedup only
(C) Disk formatting
(D) Memory paging only
Answer: (A) Recovery from failures
Q#49: MapReduce is a model for:
(A) Distributed data processing
(B) CPU scheduling
(C) Disk formatting
(D) Memory paging
Answer: (A) Distributed data processing
Q#50: Key advantage of distributed systems is:
(A) Scalability, reliability, and resource sharing
(B) Only CPU speed
(C) Disk formatting
(D) Memory paging
Answer: (A) Scalability, reliability, and resource sharing