← Back to 17. Distributed Systems

📝 Computation speedup in distributed system

📖 From Operating System • 17. Distributed Systems • 8 questions available

Practice MCQs for Computation speedup in distributed system. Test your knowledge with carefully crafted questions across easy, medium, and hard difficulty levels.

🔄 Last updated: 2026-07-27

2
Easy Questions
4
Medium Questions
2
Hard Questions

📝 Sample Questions

Q1. What is the term used to describe the reduction in execution time when a task is divided among multiple processors in a distributed system?

🔹 A. Computation speedup
🔹 B. Load balancing
🔹 C. Fault tolerance
🔹 D. Latency hiding

💡 Difficulty: easy | ✅ Correct: C

Q2. Why does adding more nodes to a distributed system not always result in proportional computation speedup?

🔹 A. Because processors become faster
🔹 B. Because memory increases
🔹 C. Because of better security
🔹 D. Because of communication overhead

💡 Difficulty: medium | ✅ Correct: D

Q3. Given total time \(T_{\text{total}} = (1-p)T + \frac{pT}{N} + \alpha\log(N)\) with \(T=1200\) s, \(p=0.9\), and \(\alpha=5\) s, which number of nodes minimizes execution time?

🔹 A. 50 nodes
🔹 B. 100 nodes
🔹 C. 216 nodes
🔹 D. 500 nodes

💡 Difficulty: hard | ✅ Correct: C

⬆️ View all questions in the quiz below

🔗 Related Topics

📝 Advantages of Distributed Systems📝 Resource sharing in distributed system📝 Reliability in distributed system📝 Communication in distributed system📝 Network operating systems
🚀 Start Quiz 📝 Practice Mode