True or false: Several activities can be concurrent even when they are interleaved on only one processor.
Parallel and Distributed Computing Online Quiz Questions
Use this free practice quiz with 20 questions to review Parallel and Distributed Computing, test your knowledge, and prepare for your next test or exam.
A word-counting system assigns a different file partition to each worker, with every worker performing the same counting operation. Which decomposition strategy is this?
- A
Task decomposition
- B
Data decomposition
- C
Pipeline decomposition
- D
Consensus
In the word-counting MapReduce example, workers first produce intermediate pairs such as (word, 1). Before the values for each word can be added, the system must .
A client receives no response before its timeout expires. What is the most accurate conclusion?
- A
It proves that the remote process has crashed.
- B
It indicates that progress is taking too long but does not usually prove remote failure.
- C
It proves that the network has permanently lost the message.
- D
It guarantees that retrying will be safe.
True or false: A logical clock is intended to measure the actual elapsed time between distributed events.
- A
True
- B
False
Select all statements that accurately describe coordination or synchronization mechanisms.
- A
Locks or mutexes can restrict a critical section to one participant at a time.
- B
Queues require every producer and consumer to stop at the same point.
- C
Barriers require participants to reach a point before any proceed.
- D
Leases guarantee that all replicas have identical state at every instant.
A computation takes 120 seconds with one worker and 30 seconds with multiple workers. What is its speedup, calculated as sequential time divided by parallel time? Enter the exact numeric value.
A replicated system guarantees that two leaders never commit conflicting values. This guarantee is an example of .
A team keeps the total data set fixed and measures how execution time changes as it adds workers. Which scaling experiment is being performed?
- A
Strong scaling
- B
Weak scaling
- C
Data decomposition
- D
Tail-latency scaling
Select all examples of partial failure in a distributed system.
- A
One machine crashes while other machines continue operating.
- B
All components stop simultaneously as one indivisible unit.
- C
A network partition prevents groups of processes from communicating.
- D
A faster processor completes every task without any component becoming unavailable.
Design a high-level architecture for a distributed image-processing service that must continue making progress when individual workers fail or become slow. Explain how the design should divide work, regulate traffic, communicate results, detect and recover from failures, preserve metadata and outputs, prevent conflicting task ownership, and measure performance.
What is the name of the causal ordering relation used to describe whether one distributed event could have influenced another?
Which set of conditions matches the assumptions of the FLP impossibility result described in the material?
- A
Synchronous communication with known bounded delays and no failures
- B
A shared-memory system in which every process observes one global clock
- C
A completely asynchronous message-passing system with reliable delivery, unbounded delays, and the possibility of one crash failure
- D
A Byzantine system in which every message is guaranteed to arrive immediately
A single-core server switches among several network requests so that all of them make progress during the same period. Which concept does this scenario primarily illustrate?
- A
It demonstrates parallelism because one processor is executing several activities simultaneously.
- B
It demonstrates concurrency because one processor interleaves work on several activities.
- C
It demonstrates neither concurrency nor parallelism because the activities share a processor.
- D
It demonstrates distributed computing because several requests are being handled.
In a distributed word-count computation using the MapReduce structure, what should happen after workers produce intermediate pairs such as (word, 1)?
- A
Each worker directly writes the final global count without communication.
- B
Workers sort documents by file size and discard duplicate documents.
- C
Intermediate pairs are grouped by word and their associated values are added.
- D
A coordinator sends the same complete document collection to every worker.
A distributed client times out while waiting for a reply. What conclusion is justified solely by that timeout?
- A
It cannot by itself prove that the remote process has failed.
- B
It proves that the remote process has crashed.
- C
It proves that the network permanently lost the request.
- D
It proves that the remote process completed the request successfully.
What is the primary purpose of a logical clock in a distributed system?
- A
They measure the exact elapsed time between events on different machines.
- B
They synchronize all machines to one universally visible wall clock.
- C
They determine the physical distance between communicating processes.
- D
They capture causal ordering without measuring elapsed real time.
True or false: A system can preserve safety by refusing to act during uncertainty, even though that choice may reduce availability.
- A
True
- B
False
A computation takes 120 seconds with one worker and 30 seconds with multiple workers. Using the speedup definition S(p) = T(1) / T(p), what is the speedup?
What failure type describes a situation in which groups of processes cannot communicate with one another while some processes may continue running?
Related study packs and tools
1. Computing, Culture, and Society
A progressive guide to how computing reshapes culture, economic life, public institutions, and individual opportunities, with frameworks for evaluating digital equity, bias, cybersecurity, encryption, and collective participation.
01. Introduction to Programming and Algorithmic Problem Solving
A medium-difficulty assessment of programming fundamentals, algorithmic problem solving, control flow, data structures, testing, debugging, complexity, and decidability. Questions progress from foundational understanding to applied reasoning.
6. Cybersecurity and Digital Safety
A practical guide to recognizing cybersecurity threats, protecting accounts and devices, and responding safely when information or systems may be compromised.
7. Encryption, Privacy, and Trust
A guided introduction to how encryption, authentication, hashing, secure protocols, and key management establish confidentiality, integrity, privacy, and trust while creating practical and legal trade-offs.
AP Computer Science A: Integrated Java Problem Solving
A practical review of the integrated Java skills, debugging habits, algorithm reasoning, and free-response strategies needed for AP Computer Science A.
Java ArrayList and Collections: Operations, Traversals, and Algorithms
Learn how to create, modify, traverse, and analyze Java lists with ArrayList, wrapper types, standard algorithms, and the Collections utility class for AP Computer Science A.
Java Boolean Logic and Selection
Build a clear understanding of Java Boolean expressions, logical operators, selection statements, nested branching, equivalent logic, and systematic code tracing for AP Computer Science A.
Java Foundations and Program Design
A practical introduction to Java program structure, data types, operators, input and output, problem-solving strategy, testing, and debugging for AP Computer Science A.
Java Inheritance and Polymorphism
A practical guide to Java inheritance, constructor chaining, method overriding, polymorphism, access control, and object behavior for tracing and writing AP Computer Science A programs.
Java Objects, Classes, and the String API
A focused guide to Java classes, object references, constructors, methods, strings, wrapper classes, and API usage for AP Computer Science A.
Java Primitive Types and Expression Evaluation
A focused guide to Java primitive types, expression evaluation, numeric conversion, floating-point behavior, integer overflow, and common methods in the Math class for AP Computer Science A.
Java Primitive Types and Expressions
A focused review of Java primitive types, expression evaluation, numeric conversion, arithmetic behavior, Math methods, randomness, and tracing techniques for AP Computer Science A.