Canvas Course Content Consider the following code. class A…
Canvas Course Content Consider the following code. class Apple { // rep-inv: name != null private String name; public Apple (String name) { if (name == null) throw new NPE(…); this.name = name; } @Override public boolean equals (Object o) { if (!(o instanceof Apple)) { return false; } Apple a = (Apple) o; return name.equals(a.name); } @Override public int hashCode() { // … } @Override public String toString() { return name; }} class AppleTracker extends Apple { private static Set inventory = new HashSet (); public AppleTracker (String name) { super(name); inventory.add(name);} public static Set getInventory() { return Collections.unmodifiableSet(inventory);}} // client codeApple a = new Apple(“Winesap”);AppleTracker at1 = new AppleTracker(“Winesap”);AppleTracker at2 = new AppleTracker(“Fuji”); Is the following true/false: The equals() method in the AppleTracker class is inherited from the Apple class.
Read Details6. A project requires the completion of eight activities. Th…
6. A project requires the completion of eight activities. The immediate predecessors (predecessors), normal activity time in weeks (normal time), maximum crashing time in weeks (max crash time), and per week crashing cost (crash cost) are shown in the table below. Activity 1 2 3 4 5 6 7 8 predecessors none none none 1,2 1,2,3 3 5,6 4,7 normal time 6 8 7 9 7 7 4 6 max crash time 3 2 3 4 1 2 2 3 crash cost $650 $550 $700 $465 $500 $385 $720 $810 Using the “normal time” values, find and report the early start times, early finish times, late start times, late finish times, and slack for each activity. Identify the critical path and project completion time.
Read Details5. A consulting project requires the completion of eight act…
5. A consulting project requires the completion of eight activities. The means and variances of the activity times for those activities (in weeks) are shown in the table below. Activity A B C D E F G H Mean 10 6 8 11 9 9 11 10 Variance 5 2 3 5 4 3 6 5 Consider the three paths of the network: (1) F-C-B, (2) A-H-E and (3) D-G. Compute the probability of the project taking less than 27 weeks for each path, as well as the overall probability of the project taking less than 27 weeks when all paths are considered.
Read Details