Answer:
Means no matter how many processors you use, speed up never increase from 10 times.
Explanation:
If a problem of size W has a serial component Ws,then performance using parallelism:
Using Amdahl's Law:
Tp = (W - Ws )/ N + Ws
Here, Ws = .1,
W - Ws = .9
Performance Tp = (.9 / N) + .1
---------------------------------------------------------
Speed Up = 1 / ( (.9 / N) + .1)
If N -> infinity, Speed Up <= 10
Means no matter how many processors you use, speed up never increase from 10 times.
Answer:
C
Explanation:
what types of loop will be used.
The loop terminates when "xxxxx" is read in. If the word is land, the string followed by "land" get outputted. The same with air, and water.
Explanation:
int land = 0;
int air = 0;
int water = 0;
String word = "";
while(!(word.equals("xxxxx"))) {
word = stdin.next();
if(word.equals("land")) {
land++;
}else if(word.equals("air")) {
air++;
}else if(word.equals("water")) {
water++;
}
}
System.out.println("land:" + land);
System.out.println("air:" + air);
System.out.println("water:" + water);
Answer:
There are multiple critical paths
Explanation:
The critical path method (CPM), or critical path analysis (CPA), is an algorithm for scheduling a set of project activities. It is commonly used in conjunction with the program evaluation and review technique (PERT). A critical path is determined by identifying the longest stretch of dependent activities and measuring the time required to complete them from start to finish.
The essential technique for using CPM is to construct a model of the project that includes the following:
- A list of all activities required to complete the project (typically categorized within a work breakdown structure),
- The time (duration) that each activity will take to complete,
- The dependencies between the activities and,
- Logical end points such as milestones or deliverable items.
Using these values, CPM calculates the longest path of planned activities to logical end points or to the end of the project, and the earliest and latest that each activity can start and finish without making the project longer. This process determines which activities are "critical" (i.e., on the longest path) and which have "total float" (i.e., can be delayed without making the project longer).
considering the above function of the cpm analysis because you have multiple path, there is tendency that more than path through the project network will have zero slack values.