Answer:
(Assuming Java)
public ArrayList diff(ArrayList list1, ArrayList list2) {
ArrayList<Integer> union = new ArrayList<>();
for (int element : list1) {
union.add(element);
}
for (int element : list2){
if (!union.contains(element)) {
union.add(element);
}
}
return union;
}
Explanation:
Create an ArrayList that has the union of list1 and list2.
First for loop copies all elements into the union array list.
Second for loop adds all elements that are not yet in the union arraylist to the union arraylist.
(Keep in mind that I assume that you mean a mathematical union, so no duplicates. If this is not what you mean, remove the if statement in the second for loop)
Answer:
what the heck? what kind of question is that
Answer:
B) Release candidate
Explanation:
The release candidate is the last stage or final stage of software testing by vendors before it can be officially released to be sold commercially. The release candidate is usually carried out by a very large community of customers.
Some vendors may have to bring out just more than one release candidate if problems are discovered in the first RC.
Release candidate generally feature complete and supposedly bug free, and ready for use by the community.
The sequence is: SYN; SYN,ACK; ACK.
See also picture.
