READ Free Dumps For Oracle- 1z0-851
Question ID 3653 | Given a pre-generics implementation of a method: |
Option A | A. Remove line 14. |
Option B | B. Replace line 14 with "int i = iter.next();". |
Option C | C. Replace line 13 with "for (int i : intList) {". |
Option D | D. Replace line 13 with "for (Iterator iter : intList) {". |
Option E | E. Replace the method declaration with "sum(List<int> intList)". |
Option F | F. Replace the method declaration with "sum(List<Integer> intList)". |
Correct Answer | A,C,F |
Question ID 3654 | A programmer has an algorithm that requires a java.util.List that provides an efficient implementation of add(0, object), but does NOT need to support quick random access. What supports these requirements? |
Option A | A. java.util.Queue |
Option B | B. java.util.ArrayList |
Option C | C. java.util.LinearList |
Option D | D. java.util.LinkedList |
Correct Answer | D |