Fault Tolerance Review Question Preview (ID: 56167)
AP CSP Fault Tolerance.
TEACHERS: click here for quick copy question ID numbers.
Which term describes running multiple processes at the same time?
a) Sequential
b) Parallel
c)
d)
How much time does parallel save? 2 Processors, 3 Processes: A (10 seconds), B (20 seconds), C (30 seconds)
a) 0 seconds
b) 20 seconds
c) 10 seconds
d) 30 seconds
2 Processors, 4 Processes: P (30 seconds), Q (10 seconds), R (20 seconds), and S (15 seconds)
a) Running processes P and Q on one processor and processes R and S on the other processor
b) Running processes P and R on one processor and processes Q and S on the other processor
c) Running processes P and S on one processor and processes Q and R on the other processor
d) Running process P on one processor and processes Q, R, and S on the other processor
Which process is typically more efficient?
a) Parallel because multiple steps are able to happen at the same time.
b) Sequential because the tasks are broken into smaller, more efficient pieces
c) Parallel because it cuts the execution time in half
d) Sequential because it is the only processor able to process bits
What is the minimum time to process? 2 Processors, 3 Processes: Q (3 seconds), W (7 seconds), and E (3 seconds)
a) 4
b) 7
c) 3
d) 6
2 processors, 2 Processes: P (30 seconds) and Q (45 seconds). What is the difference in sequential vs. ideal parallel processing time?
a) 15 seconds
b) 30 seconds
c) 45 seconds
d) 75 seconds
2 Processors, 3 Processes: X (60 seconds), Y (30 seconds), and Z (50 seconds). What is the minimum time to run in parallel?
a) 60 seconds
b) 70 seconds
c) 80 seconds
d) 90 seconds
Which of the following best describes a challenge involved in using a parallel computing solution?
a) A parallel computing solution may not be appropriate for an algorithm in which each step requires the output from the precedi
b) A parallel computing solution may not be appropriate for an algorithm in which the same formula is applied to many numeric da
c) A parallel computing solution may not be appropriate for an algorithm that can be easily broken down into small independent t
d) A parallel computing solution may not be appropriate for an algorithm that searches for occurrences of a key word in a large
2 Processors, 4 Processes: W (20 seconds), X (30 seconds), Y (45 seconds), and Z (50 seconds)
a) Processes W and X should be assigned to one processor, and processes Y and Z should be assigned to the other processor.
b) Processes W and Y should be assigned to one processor, and processes X and Z should be assigned to the other processor.
c) Processes W and Z should be assigned to one processor, and processes X and Y should be assigned to the other processor.
d) Process Z should be assigned to one processor, and processes W, X, and Y should be assigned to the other processor.
Which of the following best describes the ability of parallel computing solutions to improve efficiency?
a) Any problem that can be solved sequentially can be solved using a parallel solution in approximately half the time.
b) Any solution can be broken down into smaller and smaller parallel portions, making the improvement in efficiency theoreticall
c) The efficiency of parallel computing solutions is rarely improved over the efficiency of sequential computing solutions.
d) The efficiency of a solution that can be broken down into parallel portions is still limited by a sequential portion.
Play Games with the Questions above at ReviewGameZone.com
To play games using the questions from above, visit ReviewGameZone.com and enter game ID number: 56167 in the upper right hand corner or click here.
To play games using the questions from above, visit ReviewGameZone.com and enter game ID number: 56167 in the upper right hand corner or click here.
TEACHERS / EDUCATORS
Log In | Sign Up / Register
Log In | Sign Up / Register