Answer:
Java program is explained below
Explanation:
import java.util.HashSet;
import java.util.Map;
import java.util.TreeMap;
public class TruckRace1 {
public static HashSet<String> getPIDs (Map<String,String>nameToPID ){
HashSet<String> pidSet = new HashSet<>();
for(String ids: nameToPID.values()){
pidSet.add(ids);
}
return pidSet;
}
public static void main(String[] args) {
Map<String,String> pids = new TreeMap<>();
pids.put("John","123");
pids.put("Jason","124");
pids.put("Peter","125");
pids.put("Alice","126");
pids.put("Peny","129");
HashSet<String> ids = getPIDs(pids);
for(String id:ids){
System.out.println(id);
}
}
}
Answer:
The correct answer to the following question will be "Θ(n2)
". The further explanation is given below.
Explanation:
If we're to show all the objects that exist from either the first as well as the second vector, though not all of them, so we'll have to cycle around the first vector, so we'll have to match all the objects with the second one.
So,
This one takes:
= 
And then the same manner compared again first with the second one, this takes.
=
Therefore the total complexity,
= Θ(n2)
Bob Kahn and Vint Cerf were both pioneers of the Internet, and Tim Berners-Lee was known for inventing the WWW.
I believe the answer is <u>Using sound effects between slides.</u>
Using sound effects between slides can cause for a distraction, and if you are in college, your professor may not score your presentation as well as if it were made without sound effects. Hope this helps!
