COMPUTER SCIENCE AND ENGINEERING
ALGORITHMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
True
|
|
|
False
|
|
|
Either A or B
|
|
|
None of the above
|
Detailed explanation-1: -Adding extra people makes it more complicated. Sometimes extra people doesn’t really speed things up. If you’re working with lots of people then if one person is slower the whole group is slowed down.
Detailed explanation-2: -The speedup of a parallel algorithm will eventually reach some limit because the speedup is never equal to the number of processors and eventually the parallel algorithm will not increase in time and the speedup will limit out. any algorithm whose efficacy grows at a constant amount.
Detailed explanation-3: -Distributed computing allows an application running on one computer to access processing power, memory, or storage on another. Although distributed computing may improve the performance of a stand-alone application, this is rarely the basis for distributing an application.
Detailed explanation-4: -In sequential composition, different program components execute in sequence on all processors. In parallel composition, different program components execute concurrently on different processors. In concurrent composition, different program components execute concurrently on the same processors.